oj.uz

Submission #533480

# Submission time Handle Problem Language Result Execution time Memory
533480 2022-03-06T06:57:08 Z Slavita Izbori (COCI22_izbori) C++14
25 / 110
 3000 ms 1088 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define ve vector<int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define pi pair<int,int>
#define all(v) v.begin(),v.end()
#define si(v) (int)v.size()
#define en '\n'
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ordered_muiltiset tree<int, null_type,less_equal<>, rb_tree_tag,tree_order_statistics_node_update>
//#define int long long
using namespace std;
//using namespace __gnu_pbds;
typedef long long ll;
typedef unsigned long long ull;

const int N = 2e5 + 228;
const int big = 1e9 + 228;
const ll llbig = 1e18 + 228;
//ordered_set os; // os.order_of_key(4), (*os.find_by_order(5))
int n, m, ans, a[N];
map<int, int> mem;

//#undef int
int main(){
    //#define int long long
    iostream::sync_with_stdio(false); cin.tie(0); ios_base::sync_with_stdio(false); cout.tie(0);
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    cin >> n;
    for (int i = 1; i <= n; i++){
        cin >> a[i];
    }

    for (int i = 1; i <= n; i++){
        int cur = a[i], an = 0;
        mem.clear();
        for (int j = i; j <= n; j++){
            mem[a[j]]++;
            if (mem[a[j]] > mem[cur]) cur = a[j];
            if (mem[cur] > (j - i + 1) / 2) an++;
        }
        ans += an;
    }
    cout << ans;
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 2 ms 204 KB Output is correct
4 Correct 2 ms 204 KB Output is correct
5 Correct 2 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 2 ms 204 KB Output is correct
4 Correct 2 ms 204 KB Output is correct
5 Correct 2 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 89 ms 368 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 79 ms 328 KB Output is correct
10 Correct 75 ms 340 KB Output is correct
11 Correct 85 ms 340 KB Output is correct
12 Correct 72 ms 332 KB Output is correct
13 Correct 72 ms 336 KB Output is correct
14 Correct 78 ms 336 KB Output is correct
15 Correct 74 ms 332 KB Output is correct
16 Correct 76 ms 332 KB Output is correct
17 Correct 13 ms 352 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3011 ms 1088 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 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 2 ms 204 KB Output is correct
4 Correct 2 ms 204 KB Output is correct
5 Correct 2 ms 204 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 89 ms 368 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 79 ms 328 KB Output is correct
10 Correct 75 ms 340 KB Output is correct
11 Correct 85 ms 340 KB Output is correct
12 Correct 72 ms 332 KB Output is correct
13 Correct 72 ms 336 KB Output is correct
14 Correct 78 ms 336 KB Output is correct
15 Correct 74 ms 332 KB Output is correct
16 Correct 76 ms 332 KB Output is correct
17 Correct 13 ms 352 KB Output is correct
18 Execution timed out 3011 ms 1088 KB Time limit exceeded
19 Halted 0 ms 0 KB -