oj.uz

Submission #893321

# Submission time Handle Problem Language Result Execution time Memory
893321 2023-12-27T01:53:06 Z vjudge1 Izbori (COCI22_izbori) C++17
25 / 110
 3000 ms 860 KB 
#include <iostream>
#include <fstream>
#include <iomanip>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <ctime>
#include <algorithm>
#include <sstream>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <cstdlib>
#include <cstdio>
#include <iterator>
#include <functional>
#include <unordered_set>
#include <unordered_map>
#include <stdio.h>
#include <bitset>
#include <cstdint>
#include <cassert>
#include <functional>
#include <complex>
#include <climits>
#include <random>
using namespace std;
   
#define ll long long
#define pb push_back
#define ull unsigned long long
#define F first
#define S second
#define all(v) v.begin(), v.end()

int n;
int a[200005];

void sub3(){

}

void sub12(){
    ll ans = 0;
    for(int l = 1; l <= n; l++){
        ans += 1;
        bool f = 1;
        int sz = 1, d = a[l];
        map<int, int> cnt;
        ++cnt[d];
        for(int r = l + 1; r <= n; r++){
            ++cnt[a[r]];
            if(a[r] == d) sz++;
            else if(cnt[a[r]] > sz) sz = cnt[a[r]], d = a[r];
            if(sz > (r - l + 1) / 2) f = 1;
            else f = 0;
            ans += f;
            //cout << l << " " << r << " " << f << '\n';
        }
    }
    cout << ans;
}

void solve(){
    cin >> n;
    bool s3 = 1;
    for(int i = 1; i <= n; i++){
        cin >> a[i];
        s3 &= (a[i] <= 2);
    }
    sub12();
    /*
    if(s3) sub3();
    else sub12();
    */
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL), cout.tie(NULL);
    int xach = 1; 
    //cin >> xach;
    while(xach--) solve();
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 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 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 57 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 41 ms 348 KB Output is correct
10 Correct 41 ms 344 KB Output is correct
11 Correct 40 ms 348 KB Output is correct
12 Correct 40 ms 348 KB Output is correct
13 Correct 41 ms 344 KB Output is correct
14 Correct 41 ms 348 KB Output is correct
15 Correct 40 ms 472 KB Output is correct
16 Correct 40 ms 348 KB Output is correct
17 Correct 6 ms 348 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3061 ms 860 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 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 57 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 41 ms 348 KB Output is correct
10 Correct 41 ms 344 KB Output is correct
11 Correct 40 ms 348 KB Output is correct
12 Correct 40 ms 348 KB Output is correct
13 Correct 41 ms 344 KB Output is correct
14 Correct 41 ms 348 KB Output is correct
15 Correct 40 ms 472 KB Output is correct
16 Correct 40 ms 348 KB Output is correct
17 Correct 6 ms 348 KB Output is correct
18 Execution timed out 3061 ms 860 KB Time limit exceeded
19 Halted 0 ms 0 KB -