Submission #63776541


Source Code Expand

#include <cstdio>
#include <string>
#include <vector>
#include <algorithm>
#include <memory.h>
#include <cmath>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <ctime>
#include <iostream>
#include <functional>
#include <complex>
#include <stdlib.h>
#include <random>
#include <iostream>
#include <unordered_map>
#include <unordered_set>
#pragma comment(linker, "/STACK:836777216")

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<pii, int> p3i;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef vector<p3i> v3i;
typedef vector<vii> vvii;
typedef vector<p3i> vp3i;
typedef long double ld;
typedef vector<ld> vld;

#define pb push_back
#define mp make_pair
#define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
#define REPD(i, n) for (int (i) = (n) - 1; (i) >= 0; (i)--)
#define FOR(i, a, b) for (int (i) = (a); (i) < (b); (i)++)
#define FORD(i,a, b) for (int (i) = (a); (i) >= (b); (i)--)
#define sz(v) (int)(v).size()
#define all(v) (v).begin(), (v).end()
#define rv(v) reverse(all(v))
#define CL(v, val) memset((v), (val), sizeof((v)))
#define SORT(a) sort(all(a))
#define un(v) SORT(v), (v).resize(unique(all(v)) - (v).begin())
#define eps 1.0e-9
#define X first
#define Y second
#define bit(n) (1 << (n))
#define bit64(n) (ll(1) << (n))
#define sqr(x) ((x) * (x))
#define N 300005

int a[N];
int b[N], c[N];

bool used[N];

int main(void) {
	int n;
	scanf("%d", &n);
	REP(i, n) {
		scanf("%d", &a[i]);
	}

	CL(used, 0);

	int cnt = 0;
	REP(i, n) {
		if (used[a[i]] == 0) {
			cnt++;
			used[a[i]] = 1;
		}
		b[i] = cnt;
	}

	CL(used, 0);
	cnt = 0;
	REPD(i, n) {
		if (used[a[i]] == 0) {
			cnt++;
			used[a[i]] = 1;
		}
		c[i] = cnt;
	}

	int ans = 0;
	REP(i, n - 1) {
		ans = max(ans, b[i] + c[i + 1]);
	}

	printf("%d\n", ans);

}

Submission Info

Submission Time
Task C - Variety Split Easy
User spiker
Language C++ 20 (gcc 12.2)
Score 350
Code Size 1935 Byte
Status AC
Exec Time 30 ms
Memory 7724 KiB

Compile Error

Main.cpp:20: warning: ignoring ‘#pragma comment ’ [-Wunknown-pragmas]
   20 | #pragma comment(linker, "/STACK:836777216")
      | 
Main.cpp: In function ‘int main()’:
Main.cpp:38:28: warning: unnecessary parentheses in declaration of ‘i’ [-Wparentheses]
   38 | #define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
      |                            ^~~
Main.cpp:64:9: note: in expansion of macro ‘REP’
   64 |         REP(i, n) {
      |         ^~~
Main.cpp:38:28: note: remove parentheses
   38 | #define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
      |                            ^~~
Main.cpp:64:9: note: in expansion of macro ‘REP’
   64 |         REP(i, n) {
      |         ^~~
Main.cpp:38:28: warning: unnecessary parentheses in declaration of ‘i’ [-Wparentheses]
   38 | #define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
      |                            ^~~
Main.cpp:71:9: note: in expansion of macro ‘REP’
   71 |         REP(i, n) {
      |         ^~~
Main.cpp:38:28: note: remove parentheses
   38 | #define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
      |                            ^~~
Main.cpp:71:9: note: in expansion of macro ‘REP’
   71 |         REP(i, n) {
      |         ^~~
Main.cpp:39:29: warning: unnecessary parentheses in declaration of ‘i’ [-Wparentheses]
   39 | #define REPD(i, n) for (int (i) = (n) - 1; (i) >= 0; (i)--)
      |                             ^~~
Main.cpp:81:9: note: in expansion of macro ‘REPD’
   81 |         REPD(i, n) {
      |         ^~~~
Main.cpp:39:29: note: remove parentheses
   39 | #define REPD(i, n) for (int (i) = (n) - 1; (i) >= 0; (i)--)
      |                             ^~~
Main.cpp:81:9: note: in expansion of macro ‘REPD’
   81 |         REPD(i, n) {
      |         ^~~~
Main.cpp:38:28: warning: unnecessary parentheses in declaration of ‘i’ [-Wparentheses]
   38 | #define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
      |                            ^~~
Main.cpp:90:9: note: in expansion of macro ‘REP’
   90 |         REP(i, n - 1) {
      |         ^~~
Main.cpp:38:28: note: remove parentheses
   38 | #define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
      |                            ^~~
Main.cpp:90:9: note: in expansion of macro ‘REP’
   90 |         REP(i, n - 1) {
      |         ^~~
Main.cpp:63:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   63 |         scanf("%d", &n);
      |         ~~~~~^~~~~~~~~~
Main.cpp:65:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   65 |                 scanf("%d", &a[i]);
      |                 ~~~~~^~~~~~~~~~~~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 350 / 350
Status
AC × 2
AC × 38
Set Name Test Cases
Sample 00_sample_00.txt, 00_sample_01.txt
All 00_sample_00.txt, 00_sample_01.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, 01_test_34.txt, 01_test_35.txt
Case Name Status Exec Time Memory
00_sample_00.txt AC 1 ms 4100 KiB
00_sample_01.txt AC 1 ms 4192 KiB
01_test_00.txt AC 1 ms 4080 KiB
01_test_01.txt AC 1 ms 3892 KiB
01_test_02.txt AC 1 ms 4148 KiB
01_test_03.txt AC 1 ms 4200 KiB
01_test_04.txt AC 1 ms 4224 KiB
01_test_05.txt AC 8 ms 4952 KiB
01_test_06.txt AC 29 ms 7652 KiB
01_test_07.txt AC 11 ms 5272 KiB
01_test_08.txt AC 29 ms 7608 KiB
01_test_09.txt AC 26 ms 7068 KiB
01_test_10.txt AC 29 ms 7700 KiB
01_test_11.txt AC 8 ms 5152 KiB
01_test_12.txt AC 29 ms 7464 KiB
01_test_13.txt AC 5 ms 4552 KiB
01_test_14.txt AC 29 ms 7496 KiB
01_test_15.txt AC 28 ms 7652 KiB
01_test_16.txt AC 29 ms 7608 KiB
01_test_17.txt AC 29 ms 7704 KiB
01_test_18.txt AC 30 ms 7656 KiB
01_test_19.txt AC 30 ms 7492 KiB
01_test_20.txt AC 16 ms 7472 KiB
01_test_21.txt AC 22 ms 7608 KiB
01_test_22.txt AC 20 ms 7656 KiB
01_test_23.txt AC 20 ms 7528 KiB
01_test_24.txt AC 20 ms 7468 KiB
01_test_25.txt AC 21 ms 7652 KiB
01_test_26.txt AC 27 ms 7580 KiB
01_test_27.txt AC 1 ms 4020 KiB
01_test_28.txt AC 1 ms 3920 KiB
01_test_29.txt AC 23 ms 7612 KiB
01_test_30.txt AC 20 ms 7468 KiB
01_test_31.txt AC 19 ms 7496 KiB
01_test_32.txt AC 21 ms 7496 KiB
01_test_33.txt AC 20 ms 7588 KiB
01_test_34.txt AC 20 ms 7608 KiB
01_test_35.txt AC 21 ms 7724 KiB