Submission #33630071


Source Code Expand

#include<cstdio>
#define ll long long
using namespace std;
const int N=2e4+10;
ll M,x;
int p[N],len,s,n,w[N];
void work()
{
	for(int i=1;i<=n+2;i++)
		for(int j=i+1;j<=n+2;j++)
			if((x-p[i]-p[j])%n==0)
			{
				x-=p[i]+p[j];
				w[i]=w[j]=1;
				return;
			}
}
int main()
{
	scanf("%d%lld",&n,&M);
	if(n==1){printf("%lld",M);return 0;}
	p[1]=1,len=s=1;
	while(s<n+2)
	{
		for(int i=1;i<=s;i++) p[i+s]=p[i]+len*2-1;
		len=len*3-1,s*=2;
	}
	for(int i=1;i<=n+2;i++) x+=p[i];
	x=x-M;
	work();
	x/=n;
	for(int i=1;i<=n+2;i++)
		if(!w[i]) printf("%lld ",p[i]-x);
}

Submission Info

Submission Time
Task D - Non Arithmetic Progression Set
User LHF
Language C++ (GCC 9.2.1)
Score 700
Code Size 592 Byte
Status AC
Exec Time 9 ms
Memory 1808 KiB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:20:7: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   20 |  scanf("%d%lld",&n,&M);
      |  ~~~~~^~~~~~~~~~~~~~~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 700 / 700
Status
AC × 2
AC × 32
Set Name Test Cases
Sample 00_sample_01.txt, 00_sample_02.txt
All 00_sample_01.txt, 00_sample_02.txt, 01_random_01.txt, 01_random_02.txt, 01_random_03.txt, 01_random_04.txt, 01_random_05.txt, 01_random_06.txt, 01_random_07.txt, 01_random_08.txt, 01_random_09.txt, 01_random_10.txt, 01_random_11.txt, 01_random_12.txt, 01_random_13.txt, 01_random_14.txt, 01_random_15.txt, 02_max_01.txt, 02_max_02.txt, 02_max_03.txt, 02_max_04.txt, 02_max_05.txt, 02_max_06.txt, 02_max_07.txt, 02_max_08.txt, 02_max_09.txt, 02_max_10.txt, 02_max_11.txt, 02_max_12.txt, 02_max_13.txt, 02_max_14.txt, 02_max_15.txt
Case Name Status Exec Time Memory
00_sample_01.txt AC 7 ms 1704 KiB
00_sample_02.txt AC 2 ms 1636 KiB
01_random_01.txt AC 1 ms 1672 KiB
01_random_02.txt AC 2 ms 1712 KiB
01_random_03.txt AC 9 ms 1800 KiB
01_random_04.txt AC 5 ms 1652 KiB
01_random_05.txt AC 2 ms 1656 KiB
01_random_06.txt AC 5 ms 1716 KiB
01_random_07.txt AC 2 ms 1700 KiB
01_random_08.txt AC 7 ms 1772 KiB
01_random_09.txt AC 8 ms 1696 KiB
01_random_10.txt AC 2 ms 1696 KiB
01_random_11.txt AC 8 ms 1696 KiB
01_random_12.txt AC 6 ms 1772 KiB
01_random_13.txt AC 9 ms 1756 KiB
01_random_14.txt AC 7 ms 1704 KiB
01_random_15.txt AC 4 ms 1688 KiB
02_max_01.txt AC 3 ms 1732 KiB
02_max_02.txt AC 9 ms 1748 KiB
02_max_03.txt AC 9 ms 1704 KiB
02_max_04.txt AC 9 ms 1736 KiB
02_max_05.txt AC 5 ms 1748 KiB
02_max_06.txt AC 9 ms 1752 KiB
02_max_07.txt AC 9 ms 1800 KiB
02_max_08.txt AC 8 ms 1776 KiB
02_max_09.txt AC 8 ms 1704 KiB
02_max_10.txt AC 6 ms 1700 KiB
02_max_11.txt AC 9 ms 1804 KiB
02_max_12.txt AC 9 ms 1728 KiB
02_max_13.txt AC 8 ms 1804 KiB
02_max_14.txt AC 7 ms 1708 KiB
02_max_15.txt AC 6 ms 1808 KiB