Submission #1369017

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second

template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> P;

const ll INF = 1ll<<30;
const ll MOD = 1000000007;
const double EPS  = 1e-10;

int N, L, T;
int X[112345], W[112345];
int ans[112345];

int endP(int idx) {
	if (W[idx] == 1) return ((ll)X[idx] + T) % L;
	else return ( ( (ll)X[idx] - T ) % L + L) % L;
}

int main() {
	cin >> N >> L >> T;
	REP(i, N) scanf("%d %d", X + i, W + i);
	
	vector<int> e(N); // T秒後の各位置
	REP(i, N) e[i] = endP(i);
	sort(ALL(e));
	
	ll idx = 0;
	FOR(i, 1, N) {
		ll t = 1e11;
		
		if (W[0] == 1 && W[i] == 2) t = X[i] - X[0];
		if (W[0] == 2 && W[i] == 1) t = X[0] + L - X[i];
		
		if (2 * T >= t) idx += (2 * T - t) / L + 1;
		idx %= N;
	}
	
	if (W[0] == 2) idx = (-idx + N) % N;
	
	int st = lower_bound(ALL(e), endP(0)) - e.begin();
	
	if (st + 1 < N && e[st] == e[st + 1] && W[0] == 1) st++;
	
	REP(i, N) ans[(idx + i) % N] = e[(i + st) % N];
	REP(i, N) printf("%d\n", ans[i]);
	
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:34:40: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  REP(i, N) scanf("%d %d", X + i, W + i);
                                        ^

Judge Result