#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#define int long long
using namespace std;
struct Seg{
int n;
vector<int> tr, lazy;
Seg(int m){
n = m + 4;
tr.resize(n * 4 + 4);
lazy.resize(n * 4 + 4);
}
void push(int x, int s, int e, int ps, int pe, int val){
if(pe < s || ps > e || ps > pe) return;
if(ps <= s && pe >= e){
tr[x] += val;
lazy[x] += val;
return;
}
if(lazy[x]){
tr[x * 2] += lazy[x], lazy[x * 2] += lazy[x];
tr[x * 2 + 1] += lazy[x], lazy[x * 2 + 1] += lazy[x];
lazy[x] = 0;
}
int m = s + e >> 1;
push(x * 2, s, m, ps, pe, val);
push(x * 2 + 1, m + 1, e, ps, pe, val);
tr[x] = max(tr[x * 2], tr[x * 2 + 1]);
}
};
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int L, n;
cin >> L >> n;
int test = 0;
if(test){
L = 200000;
n = 100000;
}
Seg tr(L + 4);
vector<array<int, 4>> a(n);
int alladd = 0;
for(int i = 0; i < n; ++i){
cin >> a[i][0] >> a[i][1] >> a[i][2];
--a[i][0], --a[i][1];
if(test){
a[i][2] = 1;
a[i][0] = rand() % 3000;
a[i][1] = rand() % 3000;
}
alladd += a[i][2] / 2;
a[i][2] %= 2;
if(a[i][0] > a[i][1]) swap(a[i][0], a[i][1]);
tr.push(1, 0, L - 1, a[i][0], a[i][1] - 1, a[i][2]);
}
auto flip = [&](int id)->void{
if(a[id][3] == 1){
tr.push(1, 0, L - 1, a[id][1], L - 1, -a[id][2]);
tr.push(1, 0, L - 1, 0, a[id][0] - 1, -a[id][2]);
tr.push(1, 0, L - 1, a[id][0], a[id][1] - 1, a[id][2]);
}
else{
tr.push(1, 0, L - 1, a[id][1], L - 1, a[id][2]);
tr.push(1, 0, L - 1, 0, a[id][0] - 1, a[id][2]);
tr.push(1, 0, L - 1, a[id][0], a[id][1] - 1, -a[id][2]);
}
a[id][3] ^= 1;
};
int ans = (int)1e9;
// assert(n <= 300);
auto doit = [&]{
for(int i = 0; i < 1; ++i){
for(int j = i - 1; j < n; ++j){
// cout << j << ' ' << ans << endl;
if(j >= 0) flip(j);
if(n < 300 || j % 5000 == 0){
int nans = tr.tr[1];
while(true){
int now = nans;
for(int i = 0; i < n; ++i){
flip(i);
int prv = now;
now = min(now, tr.tr[1]);
if(now == prv) flip(i);
}
if(now == nans) break;
nans = now;
}
ans = min(ans, nans);
}
}
}
};
// sort(a.begin(), a.end(), [&](array<int, 4>&x, array<int, 4>&y){return make_pair(x[1], x[0]) < make_pair(y[1], y[0]);});
// doit();
// sort(a.begin(), a.end(), [&](array<int, 4>&x, array<int, 4>&y){return make_pair(x[1], x[0] + x[1]) < make_pair(y[1], y[0] + y[1]);});
// doit();
// sort(a.begin(), a.end(), [&](array<int, 4>&x, array<int, 4>&y){return make_pair(x[1], x[0] - x[1]) < make_pair(y[1], y[0] - y[1]);});
// doit();
// sort(a.begin(), a.end(), [&](array<int, 4>&x, array<int, 4>&y){return make_pair(x[0], x[1]) < make_pair(y[0], y[1]);});
// doit();
// sort(a.begin(), a.end(), [&](array<int, 4>&x, array<int, 4>&y){return make_pair(x[0], x[0] + x[1]) < make_pair(y[0], y[0] + y[1]);});
// doit();
// sort(a.begin(), a.end(), [&](array<int, 4>&x, array<int, 4>&y){return make_pair(x[0], x[0] - x[1]) < make_pair(y[0], y[0] - y[1]);});
// doit();
sort(a.begin(), a.end(), [&](array<int, 4>&x, array<int, 4>&y){return x[0] + x[1] < y[0] + y[1];});
doit();
// sort(a.begin(), a.end(), [&](array<int, 4>&x, array<int, 4>&y){return x[0] < y[0];});
// doit();
// sort(a.begin(), a.end(), [&](array<int, 4>&x, array<int, 4>&y){return x[0] - x[1] < y[0] - y[1];});
// doit();
// sort(a.begin(), a.end(), [&](array<int, 4>&x, array<int, 4>&y){return x[1] < y[1];});
// doit();
cout << ans + alladd << '\n';
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
320 KB |
Output is correct |
6 |
Correct |
1 ms |
316 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
316 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
316 KB |
Output is correct |
11 |
Correct |
1 ms |
324 KB |
Output is correct |
12 |
Correct |
1 ms |
212 KB |
Output is correct |
13 |
Correct |
1 ms |
212 KB |
Output is correct |
14 |
Correct |
1 ms |
212 KB |
Output is correct |
15 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
320 KB |
Output is correct |
6 |
Correct |
1 ms |
316 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
316 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
316 KB |
Output is correct |
11 |
Correct |
1 ms |
324 KB |
Output is correct |
12 |
Correct |
1 ms |
212 KB |
Output is correct |
13 |
Correct |
1 ms |
212 KB |
Output is correct |
14 |
Correct |
1 ms |
212 KB |
Output is correct |
15 |
Correct |
1 ms |
212 KB |
Output is correct |
16 |
Correct |
1 ms |
324 KB |
Output is correct |
17 |
Correct |
1 ms |
340 KB |
Output is correct |
18 |
Correct |
1 ms |
340 KB |
Output is correct |
19 |
Correct |
1 ms |
340 KB |
Output is correct |
20 |
Correct |
1 ms |
340 KB |
Output is correct |
21 |
Correct |
1 ms |
340 KB |
Output is correct |
22 |
Correct |
1 ms |
340 KB |
Output is correct |
23 |
Correct |
1 ms |
340 KB |
Output is correct |
24 |
Correct |
1 ms |
320 KB |
Output is correct |
25 |
Correct |
1 ms |
340 KB |
Output is correct |
26 |
Correct |
76 ms |
340 KB |
Output is correct |
27 |
Correct |
79 ms |
384 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
320 KB |
Output is correct |
6 |
Correct |
1 ms |
316 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
316 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
316 KB |
Output is correct |
11 |
Correct |
1 ms |
324 KB |
Output is correct |
12 |
Correct |
1 ms |
212 KB |
Output is correct |
13 |
Correct |
1 ms |
212 KB |
Output is correct |
14 |
Correct |
1 ms |
212 KB |
Output is correct |
15 |
Correct |
1 ms |
212 KB |
Output is correct |
16 |
Correct |
1 ms |
324 KB |
Output is correct |
17 |
Correct |
1 ms |
340 KB |
Output is correct |
18 |
Correct |
1 ms |
340 KB |
Output is correct |
19 |
Correct |
1 ms |
340 KB |
Output is correct |
20 |
Correct |
1 ms |
340 KB |
Output is correct |
21 |
Correct |
1 ms |
340 KB |
Output is correct |
22 |
Correct |
1 ms |
340 KB |
Output is correct |
23 |
Correct |
1 ms |
340 KB |
Output is correct |
24 |
Correct |
1 ms |
320 KB |
Output is correct |
25 |
Correct |
1 ms |
340 KB |
Output is correct |
26 |
Correct |
76 ms |
340 KB |
Output is correct |
27 |
Correct |
79 ms |
384 KB |
Output is correct |
28 |
Correct |
10 ms |
596 KB |
Output is correct |
29 |
Correct |
10 ms |
596 KB |
Output is correct |
30 |
Correct |
9 ms |
640 KB |
Output is correct |
31 |
Correct |
7 ms |
596 KB |
Output is correct |
32 |
Correct |
10 ms |
596 KB |
Output is correct |
33 |
Correct |
8 ms |
596 KB |
Output is correct |
34 |
Correct |
7 ms |
596 KB |
Output is correct |
35 |
Correct |
7 ms |
596 KB |
Output is correct |
36 |
Correct |
8 ms |
640 KB |
Output is correct |
37 |
Correct |
7 ms |
596 KB |
Output is correct |
38 |
Correct |
7 ms |
588 KB |
Output is correct |
39 |
Correct |
10 ms |
596 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
320 KB |
Output is correct |
6 |
Correct |
1 ms |
316 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
316 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
316 KB |
Output is correct |
11 |
Correct |
1 ms |
324 KB |
Output is correct |
12 |
Correct |
1 ms |
212 KB |
Output is correct |
13 |
Correct |
1 ms |
212 KB |
Output is correct |
14 |
Correct |
1 ms |
212 KB |
Output is correct |
15 |
Correct |
1 ms |
212 KB |
Output is correct |
16 |
Correct |
1 ms |
324 KB |
Output is correct |
17 |
Correct |
1 ms |
340 KB |
Output is correct |
18 |
Correct |
1 ms |
340 KB |
Output is correct |
19 |
Correct |
1 ms |
340 KB |
Output is correct |
20 |
Correct |
1 ms |
340 KB |
Output is correct |
21 |
Correct |
1 ms |
340 KB |
Output is correct |
22 |
Correct |
1 ms |
340 KB |
Output is correct |
23 |
Correct |
1 ms |
340 KB |
Output is correct |
24 |
Correct |
1 ms |
320 KB |
Output is correct |
25 |
Correct |
1 ms |
340 KB |
Output is correct |
26 |
Correct |
76 ms |
340 KB |
Output is correct |
27 |
Correct |
79 ms |
384 KB |
Output is correct |
28 |
Correct |
10 ms |
596 KB |
Output is correct |
29 |
Correct |
10 ms |
596 KB |
Output is correct |
30 |
Correct |
9 ms |
640 KB |
Output is correct |
31 |
Correct |
7 ms |
596 KB |
Output is correct |
32 |
Correct |
10 ms |
596 KB |
Output is correct |
33 |
Correct |
8 ms |
596 KB |
Output is correct |
34 |
Correct |
7 ms |
596 KB |
Output is correct |
35 |
Correct |
7 ms |
596 KB |
Output is correct |
36 |
Correct |
8 ms |
640 KB |
Output is correct |
37 |
Correct |
7 ms |
596 KB |
Output is correct |
38 |
Correct |
7 ms |
588 KB |
Output is correct |
39 |
Correct |
10 ms |
596 KB |
Output is correct |
40 |
Execution timed out |
6033 ms |
16744 KB |
Time limit exceeded |
41 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
320 KB |
Output is correct |
6 |
Correct |
1 ms |
316 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
316 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
316 KB |
Output is correct |
11 |
Correct |
1 ms |
324 KB |
Output is correct |
12 |
Correct |
1 ms |
212 KB |
Output is correct |
13 |
Correct |
1 ms |
212 KB |
Output is correct |
14 |
Correct |
1 ms |
212 KB |
Output is correct |
15 |
Correct |
1 ms |
212 KB |
Output is correct |
16 |
Correct |
1 ms |
324 KB |
Output is correct |
17 |
Correct |
1 ms |
340 KB |
Output is correct |
18 |
Correct |
1 ms |
340 KB |
Output is correct |
19 |
Correct |
1 ms |
340 KB |
Output is correct |
20 |
Correct |
1 ms |
340 KB |
Output is correct |
21 |
Correct |
1 ms |
340 KB |
Output is correct |
22 |
Correct |
1 ms |
340 KB |
Output is correct |
23 |
Correct |
1 ms |
340 KB |
Output is correct |
24 |
Correct |
1 ms |
320 KB |
Output is correct |
25 |
Correct |
1 ms |
340 KB |
Output is correct |
26 |
Correct |
76 ms |
340 KB |
Output is correct |
27 |
Correct |
79 ms |
384 KB |
Output is correct |
28 |
Correct |
10 ms |
596 KB |
Output is correct |
29 |
Correct |
10 ms |
596 KB |
Output is correct |
30 |
Correct |
9 ms |
640 KB |
Output is correct |
31 |
Correct |
7 ms |
596 KB |
Output is correct |
32 |
Correct |
10 ms |
596 KB |
Output is correct |
33 |
Correct |
8 ms |
596 KB |
Output is correct |
34 |
Correct |
7 ms |
596 KB |
Output is correct |
35 |
Correct |
7 ms |
596 KB |
Output is correct |
36 |
Correct |
8 ms |
640 KB |
Output is correct |
37 |
Correct |
7 ms |
596 KB |
Output is correct |
38 |
Correct |
7 ms |
588 KB |
Output is correct |
39 |
Correct |
10 ms |
596 KB |
Output is correct |
40 |
Execution timed out |
6033 ms |
16744 KB |
Time limit exceeded |
41 |
Halted |
0 ms |
0 KB |
- |