oj.uz

답안 #204571

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
204571 2020-02-26T10:35:45 Z awlintqaa 벽 (IOI14_wall) C++14
8 / 100
 3000 ms 8568 KB 
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 200
#define mid (l+r)/2
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
typedef long long ll;
typedef short int si;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const ll mod=1e9+7;
const ll inf= 4e18;
const ld pai=acos(-1);
#include "wall.h"
int n,q;
void buildWall(int N, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
        n=N,q=k;
        for(int i=0;i<n;i++)finalHeight[i]=0;
        for(int i=0;i<q;i++){
                int t=op[i];
                int l=left[i];
                int r=right[i];
                int h=height[i];
                for(int j=l;j<=r;j++){
                        if(t==1){
                                finalHeight[j]=max(finalHeight[j],h);
                        }
                        if(t==2){
                                finalHeight[j]=min(finalHeight[j],h);
                        }
                }
        }
        return;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 6 ms 376 KB Output is correct
3 Correct 6 ms 376 KB Output is correct
4 Correct 22 ms 504 KB Output is correct
5 Correct 22 ms 504 KB Output is correct
6 Correct 22 ms 504 KB Output is correct

Subtask #2
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 180 ms 8184 KB Output is correct
3 Correct 1192 ms 3832 KB Output is correct
4 Execution timed out 3062 ms 8568 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 7 ms 376 KB Output is correct
3 Correct 6 ms 376 KB Output is correct
4 Correct 22 ms 504 KB Output is correct
5 Correct 24 ms 504 KB Output is correct
6 Correct 27 ms 504 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 175 ms 8184 KB Output is correct
9 Correct 1189 ms 3704 KB Output is correct
10 Execution timed out 3075 ms 8568 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #4
0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 6 ms 376 KB Output is correct
3 Correct 6 ms 376 KB Output is correct
4 Correct 23 ms 504 KB Output is correct
5 Correct 25 ms 504 KB Output is correct
6 Correct 23 ms 508 KB Output is correct
7 Correct 5 ms 256 KB Output is correct
8 Correct 179 ms 8184 KB Output is correct
9 Correct 1197 ms 3708 KB Output is correct
10 Execution timed out 3008 ms 8568 KB Time limit exceeded
11 Halted 0 ms 0 KB -