oj.uz

Submission #142773

# Submission time Handle Problem Language Result Execution time Memory
142773 2019-08-10T21:28:36 Z eggag32 Wall (IOI14_wall) C++17
8 / 100
 3000 ms 18296 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include "wall.h"
//#include "grader.cpp"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y) debug(x) debug(y);
#define repn(i, a, b) for(int i = (int)(a); i < (int)(b); i++)
#define rep(i, a) for(int i = 0; i < (int)(a); i++)
#define all(v) v.begin(), v.end() 
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define endl '\n'

template<class T> T gcd(T a, T b){ return ((b == 0) ? a : gcd(b, a % b)); }

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

/*
Things to look out for:
	- Integer overflows
	- Array bounds
	- Special cases
Be careful!
*/

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 252 KB Output is correct
2 Correct 4 ms 504 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 8 ms 632 KB Output is correct
5 Correct 8 ms 632 KB Output is correct
6 Correct 8 ms 632 KB Output is correct

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 492 KB Output is correct
2 Correct 176 ms 13916 KB Output is correct
3 Correct 351 ms 7544 KB Output is correct
4 Execution timed out 3046 ms 18168 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 4 ms 504 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 8 ms 632 KB Output is correct
5 Correct 8 ms 632 KB Output is correct
6 Correct 8 ms 632 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 175 ms 13936 KB Output is correct
9 Correct 351 ms 7636 KB Output is correct
10 Execution timed out 3031 ms 18252 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #4
0 / 39.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 4 ms 496 KB Output is correct
3 Correct 3 ms 424 KB Output is correct
4 Correct 9 ms 632 KB Output is correct
5 Correct 9 ms 632 KB Output is correct
6 Correct 9 ms 632 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 182 ms 14112 KB Output is correct
9 Correct 354 ms 7612 KB Output is correct
10 Execution timed out 3029 ms 18296 KB Time limit exceeded
11 Halted 0 ms 0 KB -