oj.uz

Submission #833208

# Submission time Handle Problem Language Result Execution time Memory
833208 2023-08-22T03:13:04 Z vjudge1 Exam (eJOI20_exam) C++17
12 / 100
 22 ms 1880 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<long long, long long>
#define pii pair<int,int>
#define fi first
#define se second
const ll MOD=1e9+7;


void solve(){
    int n;
    cin >> n;
    int ans=0;
    ll robot[n];
    ll building[n];
    bool subtask2=true;
    for(int i=0; i<n; i++){
        cin >> robot[i];
    }
    for(int i=0; i<n; i++){
        cin >> building[i];
        if(subtask2 && i>0){
            if(building[i]!=building[i-1]){
                subtask2=false;
            }
        }
    }
    if(subtask2){
        bool visited[n];
        memset(visited,0,sizeof(visited));
        for(int i=0; i<n; i++){
            if(robot[i]==building[i] && !visited[i]){
                visited[i]=true;
                ans++;
                ll idx=i+1;
                while(robot[idx]<=robot[i] && idx<n){
                    visited[idx]=true;
                    ans++;
                    idx++;
                }
                idx=i-1;
                while(robot[idx]<=robot[i] && idx>=0){
                    visited[idx]=true;
                    ans++;
                    idx--;
                }
            }
        }
    }
    cout << ans << endl;
    return;
}

int main(){
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int q=1;
    for(int i=0; i<q; i++){
        solve();
    }
    return 0;
}

Subtask #1
0 / 14.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 4 ms 596 KB Output is correct
3 Correct 11 ms 1724 KB Output is correct
4 Correct 8 ms 1876 KB Output is correct
5 Correct 22 ms 1880 KB Output is correct
6 Correct 9 ms 1880 KB Output is correct
7 Correct 11 ms 1876 KB Output is correct
8 Correct 21 ms 1880 KB Output is correct

Subtask #3
0 / 13.0

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

Subtask #4
0 / 23.0

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

Subtask #5
0 / 16.0

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

Subtask #6
0 / 22.0

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