답안 #73611 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
73611	2018-08-28T14:19:17 Z	Benq	Arranging Tickets (JOI17_arranging_tickets)	C++14	100 / 100	3073 ms	25344 KB

arranging_tickets

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)

#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 200001;

int N,M, fst, lst;
ll pre[MX], PRE[MX];
vpi tri[MX];

bool test(ll mx, int pos, ll numFlips) {
    FOR(i,1,N+1) PRE[i] = 0;
    ll already = 0;
    priority_queue<array<int,3>> p; // end, begin, num
    FOR(i,1,pos+1) {
        for (auto a: tri[i]) if (a.f > pos) p.push({a.f,i,a.s});
        ll need = pre[i]+numFlips-mx;
        if (i != pos) need = (need+1)/2;
        else need = numFlips;
        need = max(need-already,0LL); already += need; 
        if (already > numFlips) return 0;
        while (need) {
            if (!sz(p)) return 0;
            auto a = p.top(); ll num = min(need,(ll)a[2]);
            a[2] -= num; need -= num; 
            PRE[1] += num; PRE[a[1]] -= 2*num; PRE[a[0]] += 2*num;
            p.pop(); if (a[2]) p.push(a);
        }
    }
    FOR(i,1,N+1) PRE[i] += PRE[i-1];
    FOR(i,1,N+1) if (PRE[i]+pre[i] > mx) return 0;
    return 1;
}

bool ok(ll mid) {
    return test(mid,fst,pre[fst]-mid) || test(mid,fst,pre[fst]-mid+1)
    || test(mid,lst,pre[lst]-mid) || test(mid,lst,pre[lst]-mid+1);
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin >> N >> M;
    F0R(i,M) {
        int A,B,C; cin >> A >> B >> C;
        if (A > B) swap(A,B);
        pre[A] += C, pre[B] -= C;
        tri[A].pb({B,C});
    }
    FOR(i,1,N+1) {
        pre[i] += pre[i-1];
        if (pre[i] > pre[fst]) fst = i;
        if (pre[i] >= pre[lst]) lst = i;
    }
    
    ll lo = 0, hi = pre[fst];
    while (lo < hi) {
        ll mid = (lo+hi)/2;
        if (ok(mid)) hi = mid;
        else lo = mid+1;
    }
    cout << lo;
}

/* Look for:
* the exact constraints (multiple sets are too slow for n=10^6 :( ) 
* special cases (n=1?)
* overflow (ll vs int?)
* array bounds
* if you have no idea just guess the appropriate well-known algo instead of doing nothing :/
*/

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	4984 KB	Output is correct
2	Correct	9 ms	5092 KB	Output is correct
3	Correct	8 ms	5168 KB	Output is correct
4	Correct	7 ms	5216 KB	Output is correct
5	Correct	7 ms	5252 KB	Output is correct
6	Correct	8 ms	5320 KB	Output is correct
7	Correct	8 ms	5320 KB	Output is correct
8	Correct	8 ms	5356 KB	Output is correct
9	Correct	8 ms	5356 KB	Output is correct
10	Correct	7 ms	5356 KB	Output is correct
11	Correct	8 ms	5356 KB	Output is correct
12	Correct	6 ms	5356 KB	Output is correct
13	Correct	8 ms	5356 KB	Output is correct
14	Correct	8 ms	5356 KB	Output is correct
15	Correct	8 ms	5356 KB	Output is correct

Subtask #2
35.0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	4984 KB	Output is correct
2	Correct	9 ms	5092 KB	Output is correct
3	Correct	8 ms	5168 KB	Output is correct
4	Correct	7 ms	5216 KB	Output is correct
5	Correct	7 ms	5252 KB	Output is correct
6	Correct	8 ms	5320 KB	Output is correct
7	Correct	8 ms	5320 KB	Output is correct
8	Correct	8 ms	5356 KB	Output is correct
9	Correct	8 ms	5356 KB	Output is correct
10	Correct	7 ms	5356 KB	Output is correct
11	Correct	8 ms	5356 KB	Output is correct
12	Correct	6 ms	5356 KB	Output is correct
13	Correct	8 ms	5356 KB	Output is correct
14	Correct	8 ms	5356 KB	Output is correct
15	Correct	8 ms	5356 KB	Output is correct
16	Correct	7 ms	5356 KB	Output is correct
17	Correct	9 ms	5356 KB	Output is correct
18	Correct	7 ms	5356 KB	Output is correct
19	Correct	8 ms	5356 KB	Output is correct
20	Correct	8 ms	5356 KB	Output is correct
21	Correct	9 ms	5356 KB	Output is correct
22	Correct	8 ms	5356 KB	Output is correct
23	Correct	9 ms	5356 KB	Output is correct
24	Correct	7 ms	5356 KB	Output is correct
25	Correct	7 ms	5356 KB	Output is correct
26	Correct	9 ms	5356 KB	Output is correct
27	Correct	8 ms	5356 KB	Output is correct

Subtask #3
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	4984 KB	Output is correct
2	Correct	9 ms	5092 KB	Output is correct
3	Correct	8 ms	5168 KB	Output is correct
4	Correct	7 ms	5216 KB	Output is correct
5	Correct	7 ms	5252 KB	Output is correct
6	Correct	8 ms	5320 KB	Output is correct
7	Correct	8 ms	5320 KB	Output is correct
8	Correct	8 ms	5356 KB	Output is correct
9	Correct	8 ms	5356 KB	Output is correct
10	Correct	7 ms	5356 KB	Output is correct
11	Correct	8 ms	5356 KB	Output is correct
12	Correct	6 ms	5356 KB	Output is correct
13	Correct	8 ms	5356 KB	Output is correct
14	Correct	8 ms	5356 KB	Output is correct
15	Correct	8 ms	5356 KB	Output is correct
16	Correct	7 ms	5356 KB	Output is correct
17	Correct	9 ms	5356 KB	Output is correct
18	Correct	7 ms	5356 KB	Output is correct
19	Correct	8 ms	5356 KB	Output is correct
20	Correct	8 ms	5356 KB	Output is correct
21	Correct	9 ms	5356 KB	Output is correct
22	Correct	8 ms	5356 KB	Output is correct
23	Correct	9 ms	5356 KB	Output is correct
24	Correct	7 ms	5356 KB	Output is correct
25	Correct	7 ms	5356 KB	Output is correct
26	Correct	9 ms	5356 KB	Output is correct
27	Correct	8 ms	5356 KB	Output is correct
28	Correct	10 ms	5484 KB	Output is correct
29	Correct	15 ms	5496 KB	Output is correct
30	Correct	11 ms	5496 KB	Output is correct
31	Correct	10 ms	5496 KB	Output is correct
32	Correct	14 ms	5496 KB	Output is correct
33	Correct	11 ms	5496 KB	Output is correct
34	Correct	10 ms	5496 KB	Output is correct
35	Correct	12 ms	5496 KB	Output is correct
36	Correct	12 ms	5496 KB	Output is correct
37	Correct	9 ms	5496 KB	Output is correct
38	Correct	8 ms	5496 KB	Output is correct
39	Correct	9 ms	5496 KB	Output is correct

Subtask #4
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	4984 KB	Output is correct
2	Correct	9 ms	5092 KB	Output is correct
3	Correct	8 ms	5168 KB	Output is correct
4	Correct	7 ms	5216 KB	Output is correct
5	Correct	7 ms	5252 KB	Output is correct
6	Correct	8 ms	5320 KB	Output is correct
7	Correct	8 ms	5320 KB	Output is correct
8	Correct	8 ms	5356 KB	Output is correct
9	Correct	8 ms	5356 KB	Output is correct
10	Correct	7 ms	5356 KB	Output is correct
11	Correct	8 ms	5356 KB	Output is correct
12	Correct	6 ms	5356 KB	Output is correct
13	Correct	8 ms	5356 KB	Output is correct
14	Correct	8 ms	5356 KB	Output is correct
15	Correct	8 ms	5356 KB	Output is correct
16	Correct	7 ms	5356 KB	Output is correct
17	Correct	9 ms	5356 KB	Output is correct
18	Correct	7 ms	5356 KB	Output is correct
19	Correct	8 ms	5356 KB	Output is correct
20	Correct	8 ms	5356 KB	Output is correct
21	Correct	9 ms	5356 KB	Output is correct
22	Correct	8 ms	5356 KB	Output is correct
23	Correct	9 ms	5356 KB	Output is correct
24	Correct	7 ms	5356 KB	Output is correct
25	Correct	7 ms	5356 KB	Output is correct
26	Correct	9 ms	5356 KB	Output is correct
27	Correct	8 ms	5356 KB	Output is correct
28	Correct	10 ms	5484 KB	Output is correct
29	Correct	15 ms	5496 KB	Output is correct
30	Correct	11 ms	5496 KB	Output is correct
31	Correct	10 ms	5496 KB	Output is correct
32	Correct	14 ms	5496 KB	Output is correct
33	Correct	11 ms	5496 KB	Output is correct
34	Correct	10 ms	5496 KB	Output is correct
35	Correct	12 ms	5496 KB	Output is correct
36	Correct	12 ms	5496 KB	Output is correct
37	Correct	9 ms	5496 KB	Output is correct
38	Correct	8 ms	5496 KB	Output is correct
39	Correct	9 ms	5496 KB	Output is correct
40	Correct	421 ms	11936 KB	Output is correct
41	Correct	441 ms	12084 KB	Output is correct
42	Correct	357 ms	12084 KB	Output is correct
43	Correct	610 ms	12084 KB	Output is correct
44	Correct	314 ms	12084 KB	Output is correct
45	Correct	697 ms	12084 KB	Output is correct
46	Correct	403 ms	12084 KB	Output is correct
47	Correct	102 ms	12084 KB	Output is correct
48	Correct	125 ms	12084 KB	Output is correct
49	Correct	96 ms	12084 KB	Output is correct
50	Correct	98 ms	12084 KB	Output is correct
51	Correct	112 ms	12084 KB	Output is correct

Subtask #5
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	8 ms	4984 KB	Output is correct
2	Correct	9 ms	5092 KB	Output is correct
3	Correct	8 ms	5168 KB	Output is correct
4	Correct	7 ms	5216 KB	Output is correct
5	Correct	7 ms	5252 KB	Output is correct
6	Correct	8 ms	5320 KB	Output is correct
7	Correct	8 ms	5320 KB	Output is correct
8	Correct	8 ms	5356 KB	Output is correct
9	Correct	8 ms	5356 KB	Output is correct
10	Correct	7 ms	5356 KB	Output is correct
11	Correct	8 ms	5356 KB	Output is correct
12	Correct	6 ms	5356 KB	Output is correct
13	Correct	8 ms	5356 KB	Output is correct
14	Correct	8 ms	5356 KB	Output is correct
15	Correct	8 ms	5356 KB	Output is correct
16	Correct	7 ms	5356 KB	Output is correct
17	Correct	9 ms	5356 KB	Output is correct
18	Correct	7 ms	5356 KB	Output is correct
19	Correct	8 ms	5356 KB	Output is correct
20	Correct	8 ms	5356 KB	Output is correct
21	Correct	9 ms	5356 KB	Output is correct
22	Correct	8 ms	5356 KB	Output is correct
23	Correct	9 ms	5356 KB	Output is correct
24	Correct	7 ms	5356 KB	Output is correct
25	Correct	7 ms	5356 KB	Output is correct
26	Correct	9 ms	5356 KB	Output is correct
27	Correct	8 ms	5356 KB	Output is correct
28	Correct	10 ms	5484 KB	Output is correct
29	Correct	15 ms	5496 KB	Output is correct
30	Correct	11 ms	5496 KB	Output is correct
31	Correct	10 ms	5496 KB	Output is correct
32	Correct	14 ms	5496 KB	Output is correct
33	Correct	11 ms	5496 KB	Output is correct
34	Correct	10 ms	5496 KB	Output is correct
35	Correct	12 ms	5496 KB	Output is correct
36	Correct	12 ms	5496 KB	Output is correct
37	Correct	9 ms	5496 KB	Output is correct
38	Correct	8 ms	5496 KB	Output is correct
39	Correct	9 ms	5496 KB	Output is correct
40	Correct	421 ms	11936 KB	Output is correct
41	Correct	441 ms	12084 KB	Output is correct
42	Correct	357 ms	12084 KB	Output is correct
43	Correct	610 ms	12084 KB	Output is correct
44	Correct	314 ms	12084 KB	Output is correct
45	Correct	697 ms	12084 KB	Output is correct
46	Correct	403 ms	12084 KB	Output is correct
47	Correct	102 ms	12084 KB	Output is correct
48	Correct	125 ms	12084 KB	Output is correct
49	Correct	96 ms	12084 KB	Output is correct
50	Correct	98 ms	12084 KB	Output is correct
51	Correct	112 ms	12084 KB	Output is correct
52	Correct	1025 ms	12172 KB	Output is correct
53	Correct	1280 ms	14496 KB	Output is correct
54	Correct	2681 ms	16688 KB	Output is correct
55	Correct	934 ms	18824 KB	Output is correct
56	Correct	2073 ms	20988 KB	Output is correct
57	Correct	3073 ms	23128 KB	Output is correct
58	Correct	1273 ms	25124 KB	Output is correct
59	Correct	999 ms	25344 KB	Output is correct

답안 #73611

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 35.0 / 35.0

Subtask #3 20.0 / 20.0

Subtask #4 20.0 / 20.0

Subtask #5 15.0 / 15.0

Subtask #1
10.0 / 10.0

Subtask #2
35.0 / 35.0

Subtask #3
20.0 / 20.0

Subtask #4
20.0 / 20.0

Subtask #5
15.0 / 15.0