oj.uz

답안 #489297

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
489297 2021-11-22T06:14:50 Z i_am_noob Arranging Tickets (JOI17_arranging_tickets) C++17
100 / 100
 3269 ms 18364 KB 
#pragma GCC target("avx2")
#include<bits/stdc++.h>
//#include<x86intrin.h>
//#include<immintrin.h>
//#pragma GCC optimize("unroll-loops")
using namespace std;

#define ll long long
#define int ll
#define ull unsigned long long
#define ld long double
#define rep(a) rep1(i,a)
#define rep1(i,a) rep2(i,0,a)
#define rep2(i,b,a) for(int i=(b); i<((int)(a)); i++)
#define rep3(i,b,a) for(int i=(b); i>=((int)(a)); i--)
#define all(a) a.begin(),a.end()
#define pii pair<int,int>
#define pb push_back
//#define inf 1010000000
#define inf 4000000000000000000
#define eps 1e-9
#define sz(a) ((int)a.size())
#define pow2(x) (1ll<<(x))
//#define ceiling(a,b) (((a)+(b)-1)/(b))
#ifdef i_am_noob
#define bug(...) cerr << "#" << __LINE__ << ' ' << #__VA_ARGS__ << "- ", _do(__VA_ARGS__)
template<typename T> void _do(T && x) {cerr << x << endl;}
template<typename T, typename ...S> void _do(T && x, S&&...y) {cerr << x << ", "; _do(y...);}
#else
#define bug(...) 826
#endif

inline char readchar(){
    const int maxn=1000000;
    static char buf[maxn],*p=buf,*q=buf;
    if(p==q&&(q=(p=buf)+fread(buf,1,maxn,stdin))==buf) return EOF;
    else return *p++;
}
inline int readint(){
    int c=readchar(),x=0,neg=0;
    while((c<'0'||c>'9')&&c!='-'&&c!=EOF) c=readchar();
    if(c=='-') neg=1,c=readchar();
    while(c>='0'&&c<='9') x=(x<<3)+(x<<1)+(c^'0'),c=readchar();
    return neg?-x:x;
}

const int Mod=1000000007,Mod2=998244353;
const int MOD=Mod;
const int maxn=200005;
//i_am_noob
//#define v8si __attribute__ (( vector_size(32) )) signed
int n,m,res,cnt[maxn];
vector<pii> vec[maxn];

int solve(int x){
    vector<int> tar(n),pre(n);
    rep(n) tar[i]=max(0ll,(cnt[i]-x+1)/2);
    multiset<pii> st;
    priority_queue<pii> pq;
    int res=0,cur=0;
    rep(n){
        for(auto [j,k]: vec[i]) pq.push({j,k});
        //while(sz(st)&&((*st.begin()).first)<=i) st.erase(st.begin());
        cur+=pre[i];
        while(cur<tar[i]){
            auto [x,y]=pq.top();
            int k=min(y,tar[i]-cur);
            pre[i]+=k,pre[x]-=k;
            cur+=k;
            res+=k;
            pq.pop();
            if(y-k) pq.push({x,y-k});
        }
    }
    bug(res);
    return res;
}

void orzck(){
    cin >> n >> m;
    rep(m){
        int a,b,c;
        cin >> a >> b >> c;
        a--,b--;
        if(a>b) swap(a,b);
        cnt[a]+=c,cnt[b]-=c;
        vec[a].pb({b,c});
    }
    rep(n-1) cnt[i+1]+=cnt[i];
    res=inf;
    rep1(_,2){
        int l=1,r=(m+49)*1e9;
        while(l<r){
            int mid=l+r>>1;
            if(solve(2*mid-2+_)-solve(2*mid+_)<=2) r=mid;
            else l=mid+1;
        }
        res=min(res,solve(2*l-2+_)+(2*l-2+_));
    }
    cout << res << endl;
}

signed main(){
    ios_base::sync_with_stdio(0),cin.tie(0);
    #ifdef i_am_noob
    freopen("input1.txt","r",stdin);
    freopen("output1.txt","w",stdout);
    freopen("output2.txt","w",stderr);
    #endif
    cout << fixed << setprecision(15);
    orzck();
    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 3 ms 4904 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 4928 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct

Subtask #2
35.0 / 35.0

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

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 3 ms 4904 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 4928 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 4 ms 4940 KB Output is correct
17 Correct 6 ms 4940 KB Output is correct
18 Correct 5 ms 4940 KB Output is correct
19 Correct 4 ms 4940 KB Output is correct
20 Correct 5 ms 4940 KB Output is correct
21 Correct 4 ms 5048 KB Output is correct
22 Correct 4 ms 4940 KB Output is correct
23 Correct 4 ms 4940 KB Output is correct
24 Correct 4 ms 4940 KB Output is correct
25 Correct 4 ms 4940 KB Output is correct
26 Correct 5 ms 4940 KB Output is correct
27 Correct 4 ms 4940 KB Output is correct
28 Correct 25 ms 5284 KB Output is correct
29 Correct 22 ms 5284 KB Output is correct
30 Correct 22 ms 5280 KB Output is correct
31 Correct 22 ms 5264 KB Output is correct
32 Correct 21 ms 5196 KB Output is correct
33 Correct 22 ms 5196 KB Output is correct
34 Correct 22 ms 5196 KB Output is correct
35 Correct 22 ms 5260 KB Output is correct
36 Correct 22 ms 5284 KB Output is correct
37 Correct 22 ms 5196 KB Output is correct
38 Correct 15 ms 5196 KB Output is correct
39 Correct 16 ms 5288 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 3 ms 4904 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 4928 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 4 ms 4940 KB Output is correct
17 Correct 6 ms 4940 KB Output is correct
18 Correct 5 ms 4940 KB Output is correct
19 Correct 4 ms 4940 KB Output is correct
20 Correct 5 ms 4940 KB Output is correct
21 Correct 4 ms 5048 KB Output is correct
22 Correct 4 ms 4940 KB Output is correct
23 Correct 4 ms 4940 KB Output is correct
24 Correct 4 ms 4940 KB Output is correct
25 Correct 4 ms 4940 KB Output is correct
26 Correct 5 ms 4940 KB Output is correct
27 Correct 4 ms 4940 KB Output is correct
28 Correct 25 ms 5284 KB Output is correct
29 Correct 22 ms 5284 KB Output is correct
30 Correct 22 ms 5280 KB Output is correct
31 Correct 22 ms 5264 KB Output is correct
32 Correct 21 ms 5196 KB Output is correct
33 Correct 22 ms 5196 KB Output is correct
34 Correct 22 ms 5196 KB Output is correct
35 Correct 22 ms 5260 KB Output is correct
36 Correct 22 ms 5284 KB Output is correct
37 Correct 22 ms 5196 KB Output is correct
38 Correct 15 ms 5196 KB Output is correct
39 Correct 16 ms 5288 KB Output is correct
40 Correct 1676 ms 16080 KB Output is correct
41 Correct 1737 ms 17692 KB Output is correct
42 Correct 1584 ms 17408 KB Output is correct
43 Correct 1668 ms 17548 KB Output is correct
44 Correct 1687 ms 17656 KB Output is correct
45 Correct 1606 ms 17408 KB Output is correct
46 Correct 1564 ms 17184 KB Output is correct
47 Correct 1607 ms 17256 KB Output is correct
48 Correct 1484 ms 17000 KB Output is correct
49 Correct 1285 ms 15272 KB Output is correct
50 Correct 1134 ms 15516 KB Output is correct
51 Correct 1235 ms 15268 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 3 ms 4904 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 4928 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 4 ms 4940 KB Output is correct
17 Correct 6 ms 4940 KB Output is correct
18 Correct 5 ms 4940 KB Output is correct
19 Correct 4 ms 4940 KB Output is correct
20 Correct 5 ms 4940 KB Output is correct
21 Correct 4 ms 5048 KB Output is correct
22 Correct 4 ms 4940 KB Output is correct
23 Correct 4 ms 4940 KB Output is correct
24 Correct 4 ms 4940 KB Output is correct
25 Correct 4 ms 4940 KB Output is correct
26 Correct 5 ms 4940 KB Output is correct
27 Correct 4 ms 4940 KB Output is correct
28 Correct 25 ms 5284 KB Output is correct
29 Correct 22 ms 5284 KB Output is correct
30 Correct 22 ms 5280 KB Output is correct
31 Correct 22 ms 5264 KB Output is correct
32 Correct 21 ms 5196 KB Output is correct
33 Correct 22 ms 5196 KB Output is correct
34 Correct 22 ms 5196 KB Output is correct
35 Correct 22 ms 5260 KB Output is correct
36 Correct 22 ms 5284 KB Output is correct
37 Correct 22 ms 5196 KB Output is correct
38 Correct 15 ms 5196 KB Output is correct
39 Correct 16 ms 5288 KB Output is correct
40 Correct 1676 ms 16080 KB Output is correct
41 Correct 1737 ms 17692 KB Output is correct
42 Correct 1584 ms 17408 KB Output is correct
43 Correct 1668 ms 17548 KB Output is correct
44 Correct 1687 ms 17656 KB Output is correct
45 Correct 1606 ms 17408 KB Output is correct
46 Correct 1564 ms 17184 KB Output is correct
47 Correct 1607 ms 17256 KB Output is correct
48 Correct 1484 ms 17000 KB Output is correct
49 Correct 1285 ms 15272 KB Output is correct
50 Correct 1134 ms 15516 KB Output is correct
51 Correct 1235 ms 15268 KB Output is correct
52 Correct 3269 ms 18364 KB Output is correct
53 Correct 2901 ms 18148 KB Output is correct
54 Correct 3026 ms 18268 KB Output is correct
55 Correct 3020 ms 18312 KB Output is correct
56 Correct 2772 ms 18112 KB Output is correct
57 Correct 2889 ms 17728 KB Output is correct
58 Correct 3066 ms 18212 KB Output is correct
59 Correct 1495 ms 15800 KB Output is correct