Submission #1814403
Source Code Expand
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef vector<ll> vi; typedef vector<vector<ll>> vvi; typedef pair<ll,ll> pii; typedef vector<pii> vpii; #define REP(i,n) FOR(i,0,n) #define FOR(i,a,b) for(ll i=a;i<b;i++) #define PB push_back #define LB lower_bound #define UB upper_bound #define PQ priority_queue #define UM unordered_map #define US unordered_set #define ALL(a) (a).begin(),(a).end() const ll INF = (1ll << 60); int main() { ll N,L,T; cin>>N>>L>>T; vi X(N),W(N); REP(i,N) cin>>X[i]>>W[i]; vi v2(N); REP(i,N) { if(W[i]==1) { v2[i]=(X[i]+T)%L; }else { v2[i]=(X[i]+T*L-T)%L; } } pii p; if(W[0]==1) { ll collisions=0; FOR(i,1,N) if(W[i]==2) { collisions+=(2*T-X[i])/L+1; } p={collisions%N,v2[0]}; } if(W[0]==2) { ll collisions=0; FOR(i,1,N) if(W[i]==1) { collisions+=(2*T+X[i]-L)/L+1; } p={(N*collisions-collisions)%N,v2[0]}; } sort(ALL(v2)); vi ans(N); REP(i,N) { if(v2[i]==p.second) { if(v2[(i+1)%N]==v2[i]) { if(W[0]==2) { REP(j,N) ans[(p.first+j)%N]=v2[(i+j)%N]; }else{ REP(j,N) ans[(p.first+j)%N]=v2[(i+1+j)%N]; } }else{ REP(j,N) ans[(p.first+j)%N]=v2[(i+j)%N]; } for(ll i:ans) cout<<i<<endl; return 0; } } }
Submission Info
Submission Time | |
---|---|
Task | C - Ants on a Circle |
User | kkty |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1408 Byte |
Status | WA |
Exec Time | 232 ms |
Memory | 4352 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 700 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt |
All | sample_01.txt, sample_02.txt, sample_01.txt, sample_02.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
subtask_1_01.txt | AC | 135 ms | 2688 KB |
subtask_1_02.txt | AC | 107 ms | 2176 KB |
subtask_1_03.txt | WA | 221 ms | 4352 KB |
subtask_1_04.txt | AC | 232 ms | 4352 KB |
subtask_1_05.txt | WA | 34 ms | 896 KB |
subtask_1_06.txt | WA | 50 ms | 1152 KB |
subtask_1_07.txt | AC | 209 ms | 3968 KB |
subtask_1_08.txt | AC | 208 ms | 3968 KB |
subtask_1_09.txt | AC | 138 ms | 2688 KB |
subtask_1_10.txt | AC | 119 ms | 2304 KB |
subtask_1_11.txt | AC | 30 ms | 768 KB |
subtask_1_12.txt | AC | 195 ms | 3840 KB |
subtask_1_13.txt | WA | 142 ms | 2944 KB |
subtask_1_14.txt | WA | 132 ms | 2688 KB |
subtask_1_15.txt | AC | 1 ms | 256 KB |
subtask_1_16.txt | AC | 1 ms | 256 KB |