oj.uz

Submission #902025

# Submission time Handle Problem Language Result Execution time Memory
902025 2024-01-10T05:30:38 Z Isam Izbori (COCI22_izbori) C++17
25 / 110
 3000 ms 1112 KB 
#include<bits/stdc++.h>
using namespace std;

int N, A[200005];

signed main(){
	ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cin >> N;
	for(register int i = 1; i <= N; ++i) cin >> A[i];
	int cur_dom(0), ans(0);
	for(int i = 1; i <= N; ++i){
		map<int, int> mp;
		for(register int j = i; j <= N; ++j){
			mp[A[j]]++;
			if(mp[A[j]] > mp[cur_dom]) cur_dom = A[j];
			ans += (mp[cur_dom] > ((j - i + 1) / 2));
		}
	}
	cout << ans << '\n';
	return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:9:19: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
    9 |  for(register int i = 1; i <= N; ++i) cin >> A[i];
      |                   ^
Main.cpp:13:20: warning: ISO C++17 does not allow 'register' storage class specifier [-Wregister]
   13 |   for(register int j = i; j <= N; ++j){
      |                    ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 468 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 70 ms 512 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 65 ms 472 KB Output is correct
10 Correct 67 ms 488 KB Output is correct
11 Correct 70 ms 344 KB Output is correct
12 Correct 64 ms 476 KB Output is correct
13 Correct 59 ms 348 KB Output is correct
14 Correct 64 ms 472 KB Output is correct
15 Correct 60 ms 348 KB Output is correct
16 Correct 66 ms 348 KB Output is correct
17 Correct 11 ms 348 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3029 ms 1112 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 468 KB Output is correct
7 Correct 70 ms 512 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 65 ms 472 KB Output is correct
10 Correct 67 ms 488 KB Output is correct
11 Correct 70 ms 344 KB Output is correct
12 Correct 64 ms 476 KB Output is correct
13 Correct 59 ms 348 KB Output is correct
14 Correct 64 ms 472 KB Output is correct
15 Correct 60 ms 348 KB Output is correct
16 Correct 66 ms 348 KB Output is correct
17 Correct 11 ms 348 KB Output is correct
18 Execution timed out 3029 ms 1112 KB Time limit exceeded
19 Halted 0 ms 0 KB -