Submission #1810768


Source Code Expand

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cstdlib>
#include<ctime>
#include<utility>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
int x[100010];
int w[100010];
int y[100010];
int n,l,t;
int x1[100010];
int x2[100010];
int x3[100010];
int x4[100010];
int t1=0,t2=0,t3=0,t4=0;
void rd(int &s)
{
	int c;
	while((c=getchar())<'0'||c>'9');
	s=c-'0';
	while((c=getchar())>='0'&&c<='9')
		s=s*10+c-'0';
}
int main()
{
#ifdef DEBUG
	freopen("a.in","r",stdin);
	freopen("a.out","w",stdout);
#endif
	scanf("%d%d%d",&n,&l,&t);
	int len=t%l;
	int i;
	int c=0;
	for(i=1;i<=n;i++)
	{
		rd(x[i]);
		rd(w[i]);
		if(w[i]==1)
		{
			c+=(t+x[i])/l;
			y[i]=(x[i]+len)%l;
			if(y[i]>=len)
				x3[++t3]=y[i];
			else
				x1[++t1]=y[i];
		}
		else
		{
			c-=(t-x[i]+l-1)/l;
			y[i]=(x[i]-len+l)%l;
			if(y[i]>=l-len)
				x4[++t4]=y[i];
			else
				x2[++t2]=y[i];
		}
		c%=n;
	}
	c=(c+n)%n;
	for(i=1;i<=t3;i++)
		x1[++t1]=x3[i];
	for(i=1;i<=t4;i++)
		x2[++t2]=x4[i];
	int cnt=0,j=1;
	i=1;
	while(i<=t1||j<=t2)
	{
		if(j>t2||(i<=t1&&x1[i]<=x2[j]))
			y[++cnt]=x1[i++];
		else
			y[++cnt]=x2[j++];
	}
	for(i=c+1;i<=n;i++)
		printf("%d\n",y[i]);
	for(i=1;i<=c;i++)
		printf("%d\n",y[i]);
	return 0;
}

Submission Info

Submission Time
Task C - Ants on a Circle
User yww
Language C++14 (GCC 5.4.1)
Score 700
Code Size 1333 Byte
Status AC
Exec Time 22 ms
Memory 2944 KB

Compile Error

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

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 700 / 700
Status
AC × 2
AC × 20
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 128 KB
sample_02.txt AC 1 ms 128 KB
subtask_1_01.txt AC 13 ms 1792 KB
subtask_1_02.txt AC 10 ms 1408 KB
subtask_1_03.txt AC 22 ms 2944 KB
subtask_1_04.txt AC 22 ms 2816 KB
subtask_1_05.txt AC 3 ms 512 KB
subtask_1_06.txt AC 5 ms 768 KB
subtask_1_07.txt AC 18 ms 2560 KB
subtask_1_08.txt AC 18 ms 2560 KB
subtask_1_09.txt AC 12 ms 1664 KB
subtask_1_10.txt AC 10 ms 1536 KB
subtask_1_11.txt AC 3 ms 512 KB
subtask_1_12.txt AC 18 ms 2560 KB
subtask_1_13.txt AC 14 ms 1920 KB
subtask_1_14.txt AC 13 ms 1792 KB
subtask_1_15.txt AC 1 ms 128 KB
subtask_1_16.txt AC 1 ms 128 KB