# |
제출 시각 |
아이디 |
문제 |
언어 |
결과 |
실행 시간 |
메모리 |
882276 |
2023-12-02T21:41:10 Z |
andro |
벽 (IOI14_wall) |
C++14 |
|
3000 ms |
18272 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]<<" ";
}*/
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
2 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
13 ms |
636 KB |
Output is correct |
5 |
Correct |
16 ms |
632 KB |
Output is correct |
6 |
Correct |
14 ms |
604 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
104 ms |
14052 KB |
Output is correct |
3 |
Correct |
909 ms |
7672 KB |
Output is correct |
4 |
Execution timed out |
3039 ms |
18208 KB |
Time limit exceeded |
5 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
600 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
2 ms |
500 KB |
Output is correct |
4 |
Correct |
13 ms |
604 KB |
Output is correct |
5 |
Correct |
14 ms |
636 KB |
Output is correct |
6 |
Correct |
14 ms |
604 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
106 ms |
13884 KB |
Output is correct |
9 |
Correct |
940 ms |
7524 KB |
Output is correct |
10 |
Execution timed out |
3004 ms |
18272 KB |
Time limit exceeded |
11 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
2 ms |
348 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 |
604 KB |
Output is correct |
6 |
Correct |
14 ms |
636 KB |
Output is correct |
7 |
Correct |
0 ms |
596 KB |
Output is correct |
8 |
Correct |
105 ms |
13904 KB |
Output is correct |
9 |
Correct |
921 ms |
7532 KB |
Output is correct |
10 |
Execution timed out |
3054 ms |
18116 KB |
Time limit exceeded |
11 |
Halted |
0 ms |
0 KB |
- |