Submission #843150

# Submission time Handle Problem Language Result Execution time Memory
843150 2023-09-03T18:10:20 Z Mr_Ph Wall (IOI14_wall) C++14
8 / 100
3000 ms 18484 KB
#include "wall.h"
#include<bits/stdc++.h>
//#include "grader.cpp"
using namespace std;
void buildWall(int n, int k, int x[], int l[], int r[], int h[], int ans[]){
    for(int i=0;i<k;i++)
    {
        if(x[i]==1)
        {
            for(int j=l[i];j<=r[i];j++)
            ans[j]=max(ans[j],h[i]);
        }
        else
        {
            for(int j=l[i];j<=r[i];j++)
            ans[j]=min(ans[j],h[i]);
        }
    }
}

# 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 600 KB Output is correct
5 Correct 14 ms 600 KB Output is correct
6 Correct 20 ms 600 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 102 ms 14060 KB Output is correct
3 Correct 933 ms 7528 KB Output is correct
4 Execution timed out 3040 ms 18484 KB Time limit exceeded
5 Halted 0 ms 0 KB -
# 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 344 KB Output is correct
4 Correct 14 ms 600 KB Output is correct
5 Correct 14 ms 600 KB Output is correct
6 Correct 14 ms 856 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 104 ms 13904 KB Output is correct
9 Correct 910 ms 7532 KB Output is correct
10 Execution timed out 3016 ms 18060 KB Time limit exceeded
11 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 13 ms 604 KB Output is correct
5 Correct 15 ms 856 KB Output is correct
6 Correct 14 ms 600 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 105 ms 14064 KB Output is correct
9 Correct 911 ms 7528 KB Output is correct
10 Execution timed out 3020 ms 18152 KB Time limit exceeded
11 Halted 0 ms 0 KB -