oj.uz

Submission #971338

# Submission time Handle Problem Language Result Execution time Memory
971338 2024-04-28T11:32:53 Z andro Wall (IOI14_wall) C++14
8 / 100
 3000 ms 18160 KB 
#include <bits/stdc++.h>.

using namespace std;

void buildWall(int n, int k, int op[], int left[], int right[],int height[], int finalHeight[]){
    for(int i = 0; i < n; i++) {
        finalHeight[i] = 0;
    }
    for(int i = 0 ; i < k; i++){
        if(op[i] == 1){
            for(int j = left[i] ; j <= right[i] ; j++) finalHeight[j] = max(finalHeight[j], height[i]);
        }
        else {
            for(int j = left[i] ; j <= right[i] ; j++) finalHeight[j] = min(finalHeight[j], height[i]);
        }
    }
 
}/*
int main(){
    int n,k;
    cin>>n>>k;
    int op[k];
    int l[k];
    int r[k];
    int x[k];
    for(int i=0;i<k;i++)cin>>op[i]>>l[i]>>r[i]>>x[i];
    int ans[n];
    for(int i=0;i<n;i++)ans[i]=0;
    buildWall(n,k,op,l,r,x,ans);
    for(int i=0;i<n;i++)cout<<ans[i]<<" ";
}*/

Compilation message

wall.cpp:1:25: warning: extra tokens at end of #include directive
    1 | #include <bits/stdc++.h>.
      |                         ^

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 1 ms 444 KB Output is correct
4 Correct 17 ms 604 KB Output is correct
5 Correct 14 ms 632 KB Output is correct
6 Correct 16 ms 600 KB Output is correct

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 103 ms 8176 KB Output is correct
3 Correct 935 ms 6480 KB Output is correct
4 Execution timed out 3038 ms 18160 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 14 ms 632 KB Output is correct
5 Correct 14 ms 604 KB Output is correct
6 Correct 14 ms 636 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 108 ms 14064 KB Output is correct
9 Correct 919 ms 7608 KB Output is correct
10 Execution timed out 3061 ms 18068 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #4
0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 2 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 14 ms 604 KB Output is correct
5 Correct 14 ms 632 KB Output is correct
6 Correct 14 ms 600 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 119 ms 14108 KB Output is correct
9 Correct 974 ms 7524 KB Output is correct
10 Execution timed out 3022 ms 18004 KB Time limit exceeded
11 Halted 0 ms 0 KB -