| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 54052 |
2018-07-02T09:20:08 Z |
김세빈(#1455) |
Pyramid Base (IOI08_pyramid_base) |
C++11 |
|
5000 ms |
25452 KB |
#include <bits/stdc++.h>
using namespace std;
struct obstacle{
int x, y1, y2, c;
obstacle() {}
obstacle(int x_, int y1_, int y2_, int c_) { x = x_, y1 = y1_, y2 = y2_, c = c_; }
bool operator < (obstacle& c) { return x < c.x; }
};
int T[2202020], L[2202020];
obstacle K1[404040], K2[404040];
int n, m, c, k, sz;
void add(int p, int s, int e, int l, int r, int v)
{
if(r < s || e < l) return;
if(l <= s && e <= r){
L[p] += v;
return;
}
L[p<<1] += L[p], L[p<<1|1] += L[p];
L[p] = 0;
add(p<<1, s, s+e>>1, l, r, v);
add(p<<1|1, (s+e>>1)+1, e, l, r, v);
T[p] = min(T[p<<1] + L[p<<1], T[p<<1|1] + L[p<<1|1]);
}
bool check(int t)
{
int i, j, p, l, r;
bool f = false;
if(K1[0].x-t+1 > 1) return 1;
for(i=j=0;i<k;i++){
for(;j<k && K2[j].x < K1[i].x-t+1;j++){
add(1, 1, m-t+1, K2[j].y1-t+1, K2[j].y2, -1);
l = K2[j].x+1;
r = min(K1[i].x-t, K2[j+1].x);
if(1 <= r && l <= r && l <= n-t+1) f |= (T[1] + L[1] == 0);
}
add(1, 1, m-t+1, K1[i].y1-t+1, K1[i].y2, 1);
l = K1[i].x-t+1;
r = min(K1[i+1].x-t, K2[j].x);
if(1 <= r && l <= r && l <= n-t+1) f |= (T[1] + L[1] == 0);
}
for(;j<k;j++){
add(1, 1, m-t+1, K2[j].y1-t+1, K2[j].y2, -1);
l = K2[j].x+1;
r = K2[j+1].x;
if(1 <= r && l <= r && l <= n-t+1) f |= (T[1] + L[1] == 0);
}
return f;
}
int main()
{
// freopen("input.txt", "r", stdin);
int i, s, e;
int x1, x2, y1, y2, z;
scanf("%d%d%d%d", &n, &m, &c, &k);
for(sz=1;sz<=m;sz<<=1);
for(i=0;i<k;i++){
scanf("%d%d%d%d%d", &x1, &y1, &x2, &y2, &z);
K1[i] = obstacle(x1, y1, y2, z);
K2[i] = obstacle(x2, y1, y2, -z);
}
sort(K1, K1+k);
sort(K2, K2+k);
K1[k] = K2[k] = obstacle(1e9, 0, 0, 0);
for(s=1,e=min(n,m); s<=e;){
if(check(s+e>>1)) s = (s+e>>1) + 1;
else e = (s+e>>1) - 1;
}
printf("%d\n", s-1);
return 0;
}
Compilation message
pyramid_base.cpp: In function 'void add(int, int, int, int, int, int)':
pyramid_base.cpp:27:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
add(p<<1, s, s+e>>1, l, r, v);
~^~
pyramid_base.cpp:28:16: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
add(p<<1|1, (s+e>>1)+1, e, l, r, v);
~^~
pyramid_base.cpp: In function 'bool check(int)':
pyramid_base.cpp:35:12: warning: unused variable 'p' [-Wunused-variable]
int i, j, p, l, r;
^
pyramid_base.cpp: In function 'int main()':
pyramid_base.cpp:92:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
if(check(s+e>>1)) s = (s+e>>1) + 1;
~^~
pyramid_base.cpp:92:27: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
if(check(s+e>>1)) s = (s+e>>1) + 1;
~^~
pyramid_base.cpp:93:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
else e = (s+e>>1) - 1;
~^~
pyramid_base.cpp:76:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d%d", &n, &m, &c, &k);
~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
pyramid_base.cpp:81:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d%d%d", &x1, &y1, &x2, &y2, &z);
~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
436 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
616 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
17 ms |
2024 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
13 ms |
5044 KB |
Output is correct |
| 2 |
Correct |
45 ms |
12952 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
42 ms |
13036 KB |
Output is correct |
| 2 |
Correct |
15 ms |
13036 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
50 ms |
13036 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
260 ms |
13036 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
699 ms |
13676 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
959 ms |
13728 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1253 ms |
13932 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
5090 ms |
19240 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
5101 ms |
22264 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
5099 ms |
25452 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
