| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 220661 |
2020-04-08T11:18:19 Z |
_7_7_ |
Sweeping (JOI20_sweeping) |
C++14 |
|
18000 ms |
1261556 KB |
#include <bits/stdc++.h>
//#define int long long
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")
#define file(s) freopen(s".in","r",stdin); freopen(s".out","w",stdout);
#define all(x) x.begin(), x.end()
#define sz(s) (int)s.size()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define s second
#define f first
using namespace std;
typedef pair < long long, long long > pll;
typedef pair < int, int > pii;
typedef unsigned long long ull;
typedef vector < pii > vpii;
typedef vector < int > vi;
typedef long double ldb;
typedef long long ll;
typedef double db;
const int dx[] = {1, -1, 0, 0}, dy[] = {0, 0, 1, -1}, block = 333;
const pii base = mp(1171, 3307), Mod = mp(1e9 + 7, 1e9 + 9);
const int inf = 1e9, maxn = 5e5 + 148, mod = 1e9 + 7, N = 1e6 + 111;
const db eps = 1e-12, pi = 3.14159265359;
const ll INF = 1e18;
int n, m, q, x[N + maxn], y[N + maxn], z[N + maxn], tp[N], a[N], b[N];
vi vals;
bool CHECK () {
for (int i = 1; i <= q; ++i)
if (tp[i] == 3)
return 0;
return 1;
}
struct ST {
int tl, tr, mx;
ST *l, *r;
ST () {
tl = tr = -1;
l = r = NULL;
mx = -inf;
}
ST (int a, int b) {
tl = a, tr = b;
l = r = NULL;
mx = -inf;
}
void update (int pos, int x) {
mx = max(mx, x);
if (tl == tr)
return;
int tm = (tl + tr) / 2;
if (pos <= tm) {
if (!l)
l = new ST(tl, tm);
l->update(pos, x);
} else {
if (!r)
r = new ST(tm + 1, tr);
r->update(pos, x);
}
}
int get (int lf, int rg) {
if (lf > rg || tl > rg || lf > tr)
return -inf;
if (lf <= tl && tr <= rg)
return mx;
return max(!l ? -inf : l->get(lf, rg), !r ? -inf : r->get(lf, rg));
}
};
struct BIT {
ST *T[maxn];
void upd (int x, int y, int z) {
x = maxn - 1 - x;
while (x < maxn) {
if (!T[x])
T[x] = new ST(0, sz(vals) - 1);
T[x]->update(y, z);
x |= x + 1;
}
}
int Get (int x, int y) {
int res = 0;
x = maxn - 1 - x;
while (x >= 0) {
if (T[x])
res = max(res, T[x]->get(y, sz(vals) - 1));
x = (x & (x + 1)) - 1;
}
return res;
}
} B;
int getPos (int x) {
return (lower_bound(all(vals), x) - vals.begin());
}
main () {
scanf("%d%d%d", &n, &m, &q);
for (int i = 1; i <= m; ++i)
scanf("%d%d", &x[i], &y[i]);
for (int i = 1; i <= q; ++i) {
scanf("%d%d", &tp[i], &a[i]);
if (tp[i] == 4)
scanf("%d", &b[i]);
}
if (m <= 2000 && q <= 5000) {
for (int i = 1; i <= q; ++i) {
if (tp[i] == 1)
printf("%d %d\n", x[a[i]], y[a[i]]);
else if (tp[i] == 3) {
for (int j = 1; j <= m; ++j)
if (x[j] <= a[i])
y[j] = max(y[j], n - a[i]);
} else if (tp[i] == 2) {
for (int j = 1; j <= m; ++j)
if (y[j] <= a[i])
x[j] = max(x[j], n - a[i]);
} else {
x[++m] = a[i];
y[m] = b[i];
}
}
return 0;
}
if (CHECK()) {
for (int i = 1; i <= m; ++i)
vals.pb(y[i]);
for (int i = 1; i <= q; ++i)
if (tp[i] == 2)
vals.pb(a[i]);
else if (tp[i] == 4)
vals.pb(b[i]);
sort(all(vals));
vals.resize(unique(all(vals)) - vals.begin());
for (int i = 1; i <= q; ++i) {
if (tp[i] == 1)
printf("%d %d\n", max(x[a[i]], B.Get(z[a[i]], getPos(y[a[i]]))), y[a[i]]);
else if (tp[i] == 2)
B.upd(i, getPos(a[i]), n - a[i]);
else {
x[++m] = a[i];
y[m] = b[i];
z[m] = i;
}
}
return 0;
}
}
Compilation message
sweeping.cpp: In member function 'void ST::update(int, int)':
sweeping.cpp:73:7: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
if (!l)
^~
sweeping.cpp:75:4: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
l->update(pos, x);
^
sweeping.cpp: At global scope:
sweeping.cpp:122:7: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
main () {
^
sweeping.cpp: In function 'int main()':
sweeping.cpp:123:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d", &n, &m, &q);
~~~~~^~~~~~~~~~~~~~~~~~~~~~
sweeping.cpp:125:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d", &x[i], &y[i]);
~~~~~^~~~~~~~~~~~~~~~~~~~~~
sweeping.cpp:127:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d", &tp[i], &a[i]);
~~~~~^~~~~~~~~~~~~~~~~~~~~~~
sweeping.cpp:129:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d", &b[i]);
~~~~~^~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
14 ms |
640 KB |
Output is correct |
| 2 |
Correct |
9 ms |
512 KB |
Output is correct |
| 3 |
Correct |
7 ms |
512 KB |
Output is correct |
| 4 |
Correct |
15 ms |
640 KB |
Output is correct |
| 5 |
Correct |
29 ms |
512 KB |
Output is correct |
| 6 |
Correct |
10 ms |
512 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
18115 ms |
1261556 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
423 ms |
12168 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
423 ms |
12168 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
14 ms |
640 KB |
Output is correct |
| 2 |
Correct |
9 ms |
512 KB |
Output is correct |
| 3 |
Correct |
7 ms |
512 KB |
Output is correct |
| 4 |
Correct |
15 ms |
640 KB |
Output is correct |
| 5 |
Correct |
29 ms |
512 KB |
Output is correct |
| 6 |
Correct |
10 ms |
512 KB |
Output is correct |
| 7 |
Execution timed out |
18115 ms |
1261556 KB |
Time limit exceeded |
| 8 |
Halted |
0 ms |
0 KB |
- |
