oj.uz

답안 #254161

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
254161 2020-07-29T12:31:35 Z PedroBigMan 벽 (IOI14_wall) C++14
8 / 100
 3000 ms 9080 KB 
#include "wall.h"
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <deque>
#include <list>
#include <iomanip>
#include <stdlib.h>
#include <time.h>
#include <cstring>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define REP(i,a,b) for(ll i=(ll) a; i<(ll) b; i++)
#define pb push_back
#define mp make_pair
#define pl pair<ll,ll>
#define ff first
#define ss second
#define whole(x) x.begin(),x.end()
#define DEBUG(i) cout<<"Pedro Is The Master "<<i<<endl
#define INF 500000000LL
#define EPS 0.00000001
#define pi 3.14159

void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[])
{
    REP(i,0,n) {finalHeight[i]=0;}
    REP(i,0,k)
    {
        REP(j,left[i],right[i]+1) 
        {
            if(op[i]==1) {finalHeight[j]=max(finalHeight[j],height[i]);}
            else {finalHeight[j]=min(finalHeight[j],height[i]);}
        }
    }
    return;
}

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 23 ms 512 KB Output is correct
5 Correct 25 ms 512 KB Output is correct
6 Correct 23 ms 512 KB Output is correct

Subtask #2
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 174 ms 8696 KB Output is correct
3 Correct 1608 ms 4204 KB Output is correct
4 Execution timed out 3089 ms 9080 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 2 ms 512 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 25 ms 640 KB Output is correct
5 Correct 24 ms 512 KB Output is correct
6 Correct 24 ms 512 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 167 ms 8696 KB Output is correct
9 Correct 1599 ms 4216 KB Output is correct
10 Execution timed out 3099 ms 9080 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #4
0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 23 ms 640 KB Output is correct
5 Correct 23 ms 512 KB Output is correct
6 Correct 23 ms 512 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 167 ms 8696 KB Output is correct
9 Correct 1595 ms 4216 KB Output is correct
10 Execution timed out 3095 ms 9080 KB Time limit exceeded
11 Halted 0 ms 0 KB -