oj.uz

Submission #440839

# Submission time Handle Problem Language Result Execution time Memory
440839 2021-07-03T10:42:28 Z MrDeboo Exam (eJOI20_exam) C++17
12 / 100
 27 ms 1876 KB 
#include <bits/stdc++.h>
#define int long long
#define mod 1000000007
#define endl '\n'
using namespace std;
bool m[5000];
signed main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int n;
    cin>>n;
    bool bol=true;
    pair<int,int>pr[n];
    for(int i=0;i<n;i++){
        cin>>pr[i].first;
    }
    for(int i=0;i<n;i++){
        cin>>pr[i].second;
        if(i>0&&pr[i].second!=pr[i-1].second)bol=false;
    }
    if(bol){
        int ans=0,z=0,b=pr[0].second;
        bool bl=false;
        for(int i=0;i<n;i++){
            if(pr[i].first==b){
                bl=true;
            }
            if(pr[i].first<=b&&i!=n-1){
                z++;
            }
            else if(bl){
                ans+=z+(pr[i].first<=b?1:0);
                z=0;
                bl=false;
            }
            else{
                z=0;
            }
        }
        cout<<ans;
    }
    else{
        for(int i=n-1;i>=0;i--){
            int a=0,b=0,z=n;
            for(int w=i;w>=0;w--){
                if(m[w])b++;
                if(pr[w].second==pr[i].first)a++;
                if(a>b)z=w;
            }
            for(int w=i;w>=z;w--){
                if(pr[w].second==pr[i].first)m[w]=true;
                else m[w]=false;
            }
        }
        int ans=0;
        for(int i=0;i<n;i++){
            if(m[i])ans++;
        }
        cout<<ans;
    }
}
//5 1 1 1 6 5
//5 5 6 5 6

Subtask #1
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Incorrect 0 ms 204 KB Output isn't correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 5 ms 588 KB Output is correct
3 Correct 18 ms 1612 KB Output is correct
4 Correct 15 ms 1876 KB Output is correct
5 Correct 27 ms 1868 KB Output is correct
6 Correct 15 ms 1872 KB Output is correct
7 Correct 17 ms 1876 KB Output is correct
8 Correct 26 ms 1876 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 1 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 16 ms 384 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Incorrect 0 ms 204 KB Output isn't correct

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Incorrect 0 ms 204 KB Output isn't correct