Submission #1358755
Source Code Expand
#include<iostream> #include<vector> #include<algorithm> #include<cstring> #include<cstdio> #include<cmath> #include<cstdlib> #include<ctime> #include<queue> #include<set> using namespace std; typedef long long LL; const int N=2e5; int gi() { int w=0;bool q=1;char c=getchar(); while ((c<'0'||c>'9') && c!='-') c=getchar(); if (c=='-') q=0,c=getchar(); while (c>='0'&&c <= '9') w=w*10+c-'0',c=getchar(); return q? w:-w; } int x[N]; //移动后相对位置还是不变的,同时,去掉编号后,两个相遇的蚂蚁同时转向等价于同时不转向 //所以可以求出T时间之后的情况 //因为这是一个环,所以要考虑开始点的变化,顺时针经过环则开始点+1,逆时针经过环则开始点-1 int main() { int n=gi(),L=gi(),T=gi(),i,all=0,uni=T/L,p=T%L; for (i=0;i<n;i++) { x[i]=gi(); if (gi()==1) { all+=uni+(p>=L-x[i]); (x[i]+=p)%=L; } else { all-=uni+(p>x[i]); x[i]=(x[i]-p+L)%L; } } all=(all%n+n)%n; sort(x,x+n); for (i=all;i<n;i++) printf("%d\n",x[i]); for (i=0;i<all;i++) printf("%d\n",x[i]); return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Ants on a Circle |
User | laofu |
Language | C++14 (GCC 5.4.1) |
Score | 700 |
Code Size | 1124 Byte |
Status | AC |
Exec Time | 25 ms |
Memory | 1536 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 700 / 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 | 16 ms | 1024 KB |
subtask_1_02.txt | AC | 12 ms | 768 KB |
subtask_1_03.txt | AC | 24 ms | 1536 KB |
subtask_1_04.txt | AC | 25 ms | 1536 KB |
subtask_1_05.txt | AC | 4 ms | 384 KB |
subtask_1_06.txt | AC | 6 ms | 512 KB |
subtask_1_07.txt | AC | 21 ms | 1280 KB |
subtask_1_08.txt | AC | 21 ms | 1280 KB |
subtask_1_09.txt | AC | 14 ms | 896 KB |
subtask_1_10.txt | AC | 13 ms | 768 KB |
subtask_1_11.txt | AC | 4 ms | 384 KB |
subtask_1_12.txt | AC | 20 ms | 1408 KB |
subtask_1_13.txt | AC | 15 ms | 1152 KB |
subtask_1_14.txt | AC | 13 ms | 1024 KB |
subtask_1_15.txt | AC | 1 ms | 256 KB |
subtask_1_16.txt | AC | 1 ms | 256 KB |