Submission #69553508


Source Code Expand

#include <bits/stdc++.h>
//#include <windows.h>
//taskkill /f /im Untitled1.exe
#define ED cerr<<endl;
#define TS cerr<<"I AK IOI"<<endl;
#define cr(x) cerr<<x<<endl;
#define cr2(x,y) cerr<<x<<" "<<y<<endl;
#define cr3(x,y,z) cerr<<x<<" "<<y<<" "<<z<<endl;
#define cr4(x,y,z,w) cerr<<x<<" "<<y<<" "<<z<<" "<<w<<endl;
#define pr(a,l,r) for(int i=l;i<=r;++i) cerr<<a[i]<<' ';ED
#define popcnt __builtin_popcount
#define all(s) s.begin(),s.end()
#define bstring basic_string
//#define add(x,y) (x+=y)%=mod
#define pii pair<int,int>
#define epb emplace_back
#define pb push_back
#define ins insert
#define fi first
#define se second
#define ll long long
#define ull unsigned long long
using namespace std;
const int N=1e6+5,INF=2e9,mod=998244353;
int n,m,k;
int a[N],cnt[N];

int main() {
	scanf("%d",&n);
	for(int i=1;i<=n;++i) {
		scanf("%d",&a[i]);
	}
	ll ans=1;++cnt[a[n]];
	for(int i=n-1;i>=1;--i) {
		if(a[i]!=a[i+1]) {
			ans+=n-i-cnt[a[i]];
		}
		++cnt[a[i]];
	}
	printf("%lld\n",ans);
	return 0;
}


Submission Info

Submission Time
Task A - Range Replace
User Include_S_Z_C_
Language C++ 17 (gcc 12.2)
Score 400
Code Size 1049 Byte
Status AC
Exec Time 91 ms
Memory 11676 KiB

Compile Error

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

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 400 / 400
Status
AC × 2
AC × 35
Set Name Test Cases
Sample 00_sample_00.txt, 00_sample_01.txt
All 00_sample_00.txt, 00_sample_01.txt, 01_random_00.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, 02_max_00.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, 03_min_00.txt, 03_min_01.txt, 03_min_02.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 1 ms 3624 KiB
00_sample_01.txt AC 1 ms 3736 KiB
01_random_00.txt AC 35 ms 6992 KiB
01_random_01.txt AC 48 ms 8128 KiB
01_random_02.txt AC 46 ms 7808 KiB
01_random_03.txt AC 65 ms 9488 KiB
01_random_04.txt AC 71 ms 9936 KiB
01_random_05.txt AC 31 ms 6428 KiB
01_random_06.txt AC 36 ms 6868 KiB
01_random_07.txt AC 17 ms 5104 KiB
01_random_08.txt AC 12 ms 4764 KiB
01_random_09.txt AC 5 ms 4168 KiB
01_random_10.txt AC 78 ms 10548 KiB
01_random_11.txt AC 35 ms 6964 KiB
01_random_12.txt AC 8 ms 4356 KiB
01_random_13.txt AC 86 ms 11308 KiB
01_random_14.txt AC 9 ms 4504 KiB
02_max_00.txt AC 65 ms 11552 KiB
02_max_01.txt AC 47 ms 7660 KiB
02_max_02.txt AC 46 ms 7484 KiB
02_max_03.txt AC 70 ms 7656 KiB
02_max_04.txt AC 71 ms 7792 KiB
02_max_05.txt AC 70 ms 7684 KiB
02_max_06.txt AC 89 ms 11548 KiB
02_max_07.txt AC 89 ms 11540 KiB
02_max_08.txt AC 89 ms 11376 KiB
02_max_09.txt AC 91 ms 11608 KiB
02_max_10.txt AC 89 ms 11548 KiB
02_max_11.txt AC 89 ms 11676 KiB
02_max_12.txt AC 89 ms 11424 KiB
02_max_13.txt AC 89 ms 11536 KiB
02_max_14.txt AC 89 ms 11492 KiB
03_min_00.txt AC 1 ms 3736 KiB
03_min_01.txt AC 1 ms 3688 KiB
03_min_02.txt AC 1 ms 3672 KiB