Submission #66528905


Source Code Expand

#include <bits/stdc++.h>
#define _F(x,y,z) for(int x=y;x<=z;x++)
#define F_(x,z,y) for(int x=z;x>=y;x--)
#define TF(x,y,z) for(int x=head[y],z;x;x=nex[x])
#define GF(x,y,z) for(int x:z[y])

using namespace std;

typedef long long ll;
typedef double dou;
typedef const int ci;
typedef pair<int,int> pii;

ci maxn=2e6+10;

int n,l,a[maxn],cnt[maxn];
ll ans=0;
void work()
{
	scanf("%d%d",&n,&l);
	a[1]=1;
	cnt[1]++;
	_F(i,2,n)
	{
		scanf("%d",&a[i]);
		a[i]=(a[i-1]+a[i]-1)%l+1;
		cnt[a[i]]++;
	}
	if(l%3)
	{
		puts("0");
		return ;
	}
	_F(i,1,l/3)
	{
		ans+=1ll*cnt[i]*cnt[(i+l/3-1)%l+1]*cnt[(i+2*l/3-1)%l+1];
//		printf("%d %d %d\n",cnt[i],cnt[(i+l/3-1)%l+1],cnt[(i+2*l/3-1)%l+1]);
	}
	cout<<ans<<endl;
}
int main()
{
//	int t;
//	scanf("%d",&t);
//	while(t--)
		work();
	return 0;
}

Submission Info

Submission Time
Task C - Equilateral Triangle
User adolphshi
Language C++ 20 (gcc 12.2)
Score 300
Code Size 830 Byte
Status AC
Exec Time 30 ms
Memory 6212 KiB

Compile Error

Main.cpp: In function ‘void work()’:
Main.cpp:20:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   20 |         scanf("%d%d",&n,&l);
      |         ~~~~~^~~~~~~~~~~~~~
Main.cpp:25:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   25 |                 scanf("%d",&a[i]);
      |                 ~~~~~^~~~~~~~~~~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 37
Set Name Test Cases
Sample 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt
All 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 01_test_00.txt, 01_test_01.txt, 01_test_02.txt, 01_test_03.txt, 01_test_04.txt, 01_test_05.txt, 01_test_06.txt, 01_test_07.txt, 01_test_08.txt, 01_test_09.txt, 01_test_10.txt, 01_test_11.txt, 01_test_12.txt, 01_test_13.txt, 01_test_14.txt, 01_test_15.txt, 01_test_16.txt, 01_test_17.txt, 01_test_18.txt, 01_test_19.txt, 01_test_20.txt, 01_test_21.txt, 01_test_22.txt, 01_test_23.txt, 01_test_24.txt, 01_test_25.txt, 01_test_26.txt, 01_test_27.txt, 01_test_28.txt, 01_test_29.txt, 01_test_30.txt, 01_test_31.txt, 01_test_32.txt, 01_test_33.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 1 ms 3740 KiB
00_sample_01.txt AC 1 ms 3740 KiB
00_sample_02.txt AC 1 ms 3708 KiB
01_test_00.txt AC 1 ms 3704 KiB
01_test_01.txt AC 1 ms 3832 KiB
01_test_02.txt AC 8 ms 4192 KiB
01_test_03.txt AC 20 ms 4772 KiB
01_test_04.txt AC 1 ms 3748 KiB
01_test_05.txt AC 2 ms 3840 KiB
01_test_06.txt AC 19 ms 4732 KiB
01_test_07.txt AC 23 ms 4908 KiB
01_test_08.txt AC 1 ms 4088 KiB
01_test_09.txt AC 2 ms 4268 KiB
01_test_10.txt AC 23 ms 5236 KiB
01_test_11.txt AC 29 ms 5512 KiB
01_test_12.txt AC 1 ms 3856 KiB
01_test_13.txt AC 2 ms 4924 KiB
01_test_14.txt AC 15 ms 5240 KiB
01_test_15.txt AC 30 ms 6040 KiB
01_test_16.txt AC 1 ms 3892 KiB
01_test_17.txt AC 2 ms 4152 KiB
01_test_18.txt AC 15 ms 4800 KiB
01_test_19.txt AC 30 ms 5868 KiB
01_test_20.txt AC 30 ms 6040 KiB
01_test_21.txt AC 30 ms 5948 KiB
01_test_22.txt AC 29 ms 6012 KiB
01_test_23.txt AC 30 ms 6212 KiB
01_test_24.txt AC 30 ms 5912 KiB
01_test_25.txt AC 30 ms 5964 KiB
01_test_26.txt AC 30 ms 5984 KiB
01_test_27.txt AC 29 ms 6020 KiB
01_test_28.txt AC 30 ms 5976 KiB
01_test_29.txt AC 30 ms 6112 KiB
01_test_30.txt AC 17 ms 4916 KiB
01_test_31.txt AC 15 ms 4888 KiB
01_test_32.txt AC 15 ms 4864 KiB
01_test_33.txt AC 1 ms 3784 KiB