Submission #1691872

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
 
typedef long long LL;
typedef pair<int, int> pii;
 
#define fst first
#define snd second
#define pb push_back
#define REP(i, a, b)  for(int i = (a), i##end = (b); i < i##end; ++i)
#define DREP(i, a, b) for(int i=(a-1), i##end = (b); i >=i##end; --i)
 
template <typename T> bool chkmax(T& a, T b) { return a < b ? a = b, 1 : 0; }
template <typename T> bool chkmin(T& a, T b) { return a > b ? a = b, 1 : 0; }
 
const int N = 100000;
const int oo = 0x3f3f3f3f;
 
template<typename T> T read() {
    T n(0), f(1);
    char ch = getchar();
    for(;!isdigit(ch); ch = getchar()) if(ch == '-') f = -1;
    for(; isdigit(ch); ch = getchar()) n = n * 10 + ch - 48; 
    return n * f;
}

int id_f;
int n, l, t;
struct Ants { int pos, dir; } a[N + 5];
struct Node { int pos, dir, id; } Ans[N + 5];

bool operator < (const Node& a, const Node& b) {
    return a.pos < b.pos ? true :
           a.pos == b.pos && a.dir < b.dir ? true :
           a.pos == b.pos && a.dir == b.dir && a.id < b.id;
}

int main() {
#ifdef Wearry
    freopen("data.txt", "r", stdin);
    freopen("ans.txt", "w", stdout);
#endif 

    scanf("%d%d%d", &n, &l, &t);
    for(int i = 0; i < n; ++i) {
        scanf("%d%d", &a[i].pos, &a[i].dir);
        int nxt_pos = a[i].pos + ((a[i].dir == 1) ? 1 : -1) * t;

        if(i && a[i].dir != a[0].dir) {
            if(a[i].dir == 2) {
                int dis = (a[i].pos - a[0].pos);
                if((t << 1) >= dis) id_f = (id_f + ((t << 1) - dis) / l + 1) % n;
            }else {
                int dis = (a[0].pos - a[i].pos + l);
                if((t << 1) >= dis) id_f = (id_f - ((t << 1) - dis) / l - 1) % n;
            }
        }
        Ans[i] = (Node) { (nxt_pos % l + l) % l, 2 - a[i].dir, i };
    }
    id_f = (id_f + n) % n;

    int d = 0;
    sort(Ans, Ans + n);
    for(int i = 0; i < n; ++i) if(Ans[i].id == 0) {
        d = (i - id_f + n) % n;
        break;
    }

    rotate(Ans, Ans + d, Ans + n);
    for(int i = 0; i < n; ++i) printf("%d\n", Ans[i].pos);

    return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:44:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d", &n, &l, &t);
                                ^
./Main.cpp:46:44: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &a[i].pos, &a[i].dir);
                                            ^

Judge Result