Submission #778897

# Submission time Handle Problem Language Result Execution time Memory
778897 2023-07-11T01:35:38 Z bachhoangxuan Two Dishes (JOI19_dishes) C++17
100 / 100
3401 ms 301700 KB
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<pii,int>
#define mpp make_pair
#define fi first
#define se second
const int inf=1e18;
const int mod=1e9+7;
const int maxn=200005;
const int bl=650;
const int maxs=655;
const int maxm=200005;
const int maxq=500005;
const int maxl=20;
const int maxa=250000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=101;

void solve(){
    int n,m;cin >> n >> m;
    vector<int> a(n+1,0),b(m+1,0),s(n+1),t(m+1),p(n+1),q(m+1);
    for(int i=1;i<=n;i++) cin >> a[i] >> s[i] >> p[i],a[i]+=a[i-1];
    for(int i=1;i<=m;i++) cin >> b[i] >> t[i] >> q[i],b[i]+=b[i-1];
    vector<vector<pii>> add(n+1);
    int ans=0;
    for(int i=1;i<=n;i++){
        int l=0,r=m,res=m+1;
        while(r>=l){
            int mid=(l+r)>>1;
            if(a[i]+b[mid]<=s[i]) l=mid+1;
            else res=mid,r=mid-1;
        }
        //cout << res << '\n';
        if(res==0) continue;
        ans+=p[i];
        if(res!=m+1) add[i].push_back({res,-p[i]});
    }
    for(int i=1;i<=m;i++){
        int l=0,r=n,res=n+1;
        while(r>=l){
            int mid=(l+r)>>1;
            if(b[i]+a[mid]<=t[i]) l=mid+1;
            else res=mid,r=mid-1;
        }
        //cout << res << '\n';
        if(res==0) continue;
        if(res!=n+1) add[res].push_back({i,q[i]});
        else ans+=q[i];
    }
    set<pii> ss,Min;
    for(int i=1;i<=n;i++){
        for(auto [x,val]:add[i]){
            auto it=ss.lower_bound({x,-inf});
            if(it!=ss.end() && it->fi==x){
                pii np=*it;
                int sum=val+np.se;
                ss.erase(it);Min.erase({np.se,np.fi});
                ss.insert({x,sum});Min.insert({sum,x});
            }
            else ss.insert({x,val}),Min.insert({val,x});
        }
        while(!Min.empty() && Min.begin()->fi<0){
            pii np=*Min.begin();Min.erase(Min.begin());
            swap(np.fi,np.se);
            auto it=ss.lower_bound(np);it=ss.erase(it);
            if(it!=ss.end()){
                np.fi=it->fi,np.se+=it->se;
                Min.erase({it->se,it->fi});ss.erase(it);
                ss.insert(np);Min.insert({np.se,np.fi});
            }
        }
    }
    for(auto [x,val]:ss) ans+=val;
    cout << ans << '\n';
}
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}
# Verdict Execution time Memory Grader output
1 Correct 332 ms 46456 KB Output is correct
2 Correct 173 ms 37452 KB Output is correct
3 Correct 116 ms 27776 KB Output is correct
4 Correct 238 ms 49040 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 199 ms 35288 KB Output is correct
7 Correct 52 ms 11796 KB Output is correct
8 Correct 56 ms 16680 KB Output is correct
9 Correct 119 ms 28748 KB Output is correct
10 Correct 198 ms 31216 KB Output is correct
11 Correct 88 ms 22136 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 328 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 324 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 328 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 324 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 2 ms 596 KB Output is correct
18 Correct 2 ms 724 KB Output is correct
19 Correct 4 ms 596 KB Output is correct
20 Correct 2 ms 596 KB Output is correct
21 Correct 3 ms 724 KB Output is correct
22 Correct 3 ms 588 KB Output is correct
23 Correct 3 ms 596 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 328 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 324 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 2 ms 596 KB Output is correct
18 Correct 2 ms 724 KB Output is correct
19 Correct 4 ms 596 KB Output is correct
20 Correct 2 ms 596 KB Output is correct
21 Correct 3 ms 724 KB Output is correct
22 Correct 3 ms 588 KB Output is correct
23 Correct 3 ms 596 KB Output is correct
24 Correct 120 ms 31216 KB Output is correct
25 Correct 191 ms 53132 KB Output is correct
26 Correct 140 ms 31480 KB Output is correct
27 Correct 214 ms 56308 KB Output is correct
28 Correct 175 ms 28228 KB Output is correct
29 Correct 99 ms 25720 KB Output is correct
30 Correct 442 ms 36628 KB Output is correct
31 Correct 90 ms 24328 KB Output is correct
32 Correct 59 ms 18072 KB Output is correct
33 Correct 251 ms 30344 KB Output is correct
34 Correct 329 ms 44072 KB Output is correct
35 Correct 426 ms 30332 KB Output is correct
36 Correct 414 ms 30028 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 328 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 324 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 2 ms 596 KB Output is correct
18 Correct 2 ms 724 KB Output is correct
19 Correct 4 ms 596 KB Output is correct
20 Correct 2 ms 596 KB Output is correct
21 Correct 3 ms 724 KB Output is correct
22 Correct 3 ms 588 KB Output is correct
23 Correct 3 ms 596 KB Output is correct
24 Correct 120 ms 31216 KB Output is correct
25 Correct 191 ms 53132 KB Output is correct
26 Correct 140 ms 31480 KB Output is correct
27 Correct 214 ms 56308 KB Output is correct
28 Correct 175 ms 28228 KB Output is correct
29 Correct 99 ms 25720 KB Output is correct
30 Correct 442 ms 36628 KB Output is correct
31 Correct 90 ms 24328 KB Output is correct
32 Correct 59 ms 18072 KB Output is correct
33 Correct 251 ms 30344 KB Output is correct
34 Correct 329 ms 44072 KB Output is correct
35 Correct 426 ms 30332 KB Output is correct
36 Correct 414 ms 30028 KB Output is correct
37 Correct 139 ms 34296 KB Output is correct
38 Correct 323 ms 59380 KB Output is correct
39 Correct 428 ms 59884 KB Output is correct
40 Correct 178 ms 34928 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 472 ms 39756 KB Output is correct
43 Correct 274 ms 33204 KB Output is correct
44 Correct 365 ms 46764 KB Output is correct
45 Correct 438 ms 33408 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 328 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 324 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 2 ms 596 KB Output is correct
18 Correct 2 ms 724 KB Output is correct
19 Correct 4 ms 596 KB Output is correct
20 Correct 2 ms 596 KB Output is correct
21 Correct 3 ms 724 KB Output is correct
22 Correct 3 ms 588 KB Output is correct
23 Correct 3 ms 596 KB Output is correct
24 Correct 120 ms 31216 KB Output is correct
25 Correct 191 ms 53132 KB Output is correct
26 Correct 140 ms 31480 KB Output is correct
27 Correct 214 ms 56308 KB Output is correct
28 Correct 175 ms 28228 KB Output is correct
29 Correct 99 ms 25720 KB Output is correct
30 Correct 442 ms 36628 KB Output is correct
31 Correct 90 ms 24328 KB Output is correct
32 Correct 59 ms 18072 KB Output is correct
33 Correct 251 ms 30344 KB Output is correct
34 Correct 329 ms 44072 KB Output is correct
35 Correct 426 ms 30332 KB Output is correct
36 Correct 414 ms 30028 KB Output is correct
37 Correct 139 ms 34296 KB Output is correct
38 Correct 323 ms 59380 KB Output is correct
39 Correct 428 ms 59884 KB Output is correct
40 Correct 178 ms 34928 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 472 ms 39756 KB Output is correct
43 Correct 274 ms 33204 KB Output is correct
44 Correct 365 ms 46764 KB Output is correct
45 Correct 438 ms 33408 KB Output is correct
46 Correct 728 ms 172008 KB Output is correct
47 Correct 2337 ms 297316 KB Output is correct
48 Correct 2742 ms 299348 KB Output is correct
49 Correct 881 ms 174184 KB Output is correct
50 Correct 3127 ms 198928 KB Output is correct
51 Correct 1518 ms 161724 KB Output is correct
52 Correct 3051 ms 224880 KB Output is correct
53 Correct 3051 ms 165412 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 332 ms 46456 KB Output is correct
2 Correct 173 ms 37452 KB Output is correct
3 Correct 116 ms 27776 KB Output is correct
4 Correct 238 ms 49040 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 199 ms 35288 KB Output is correct
7 Correct 52 ms 11796 KB Output is correct
8 Correct 56 ms 16680 KB Output is correct
9 Correct 119 ms 28748 KB Output is correct
10 Correct 198 ms 31216 KB Output is correct
11 Correct 88 ms 22136 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 328 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 324 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 2 ms 596 KB Output is correct
29 Correct 2 ms 724 KB Output is correct
30 Correct 4 ms 596 KB Output is correct
31 Correct 2 ms 596 KB Output is correct
32 Correct 3 ms 724 KB Output is correct
33 Correct 3 ms 588 KB Output is correct
34 Correct 3 ms 596 KB Output is correct
35 Correct 120 ms 31216 KB Output is correct
36 Correct 191 ms 53132 KB Output is correct
37 Correct 140 ms 31480 KB Output is correct
38 Correct 214 ms 56308 KB Output is correct
39 Correct 175 ms 28228 KB Output is correct
40 Correct 99 ms 25720 KB Output is correct
41 Correct 442 ms 36628 KB Output is correct
42 Correct 90 ms 24328 KB Output is correct
43 Correct 59 ms 18072 KB Output is correct
44 Correct 251 ms 30344 KB Output is correct
45 Correct 329 ms 44072 KB Output is correct
46 Correct 426 ms 30332 KB Output is correct
47 Correct 414 ms 30028 KB Output is correct
48 Correct 139 ms 34296 KB Output is correct
49 Correct 323 ms 59380 KB Output is correct
50 Correct 428 ms 59884 KB Output is correct
51 Correct 178 ms 34928 KB Output is correct
52 Correct 0 ms 212 KB Output is correct
53 Correct 472 ms 39756 KB Output is correct
54 Correct 274 ms 33204 KB Output is correct
55 Correct 365 ms 46764 KB Output is correct
56 Correct 438 ms 33408 KB Output is correct
57 Correct 309 ms 59848 KB Output is correct
58 Correct 141 ms 34800 KB Output is correct
59 Correct 179 ms 35824 KB Output is correct
60 Correct 461 ms 60788 KB Output is correct
61 Correct 593 ms 61684 KB Output is correct
62 Correct 1 ms 212 KB Output is correct
63 Correct 471 ms 39812 KB Output is correct
64 Correct 256 ms 33340 KB Output is correct
65 Correct 371 ms 38260 KB Output is correct
66 Correct 467 ms 33172 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 332 ms 46456 KB Output is correct
2 Correct 173 ms 37452 KB Output is correct
3 Correct 116 ms 27776 KB Output is correct
4 Correct 238 ms 49040 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 199 ms 35288 KB Output is correct
7 Correct 52 ms 11796 KB Output is correct
8 Correct 56 ms 16680 KB Output is correct
9 Correct 119 ms 28748 KB Output is correct
10 Correct 198 ms 31216 KB Output is correct
11 Correct 88 ms 22136 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 328 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 324 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 2 ms 596 KB Output is correct
29 Correct 2 ms 724 KB Output is correct
30 Correct 4 ms 596 KB Output is correct
31 Correct 2 ms 596 KB Output is correct
32 Correct 3 ms 724 KB Output is correct
33 Correct 3 ms 588 KB Output is correct
34 Correct 3 ms 596 KB Output is correct
35 Correct 120 ms 31216 KB Output is correct
36 Correct 191 ms 53132 KB Output is correct
37 Correct 140 ms 31480 KB Output is correct
38 Correct 214 ms 56308 KB Output is correct
39 Correct 175 ms 28228 KB Output is correct
40 Correct 99 ms 25720 KB Output is correct
41 Correct 442 ms 36628 KB Output is correct
42 Correct 90 ms 24328 KB Output is correct
43 Correct 59 ms 18072 KB Output is correct
44 Correct 251 ms 30344 KB Output is correct
45 Correct 329 ms 44072 KB Output is correct
46 Correct 426 ms 30332 KB Output is correct
47 Correct 414 ms 30028 KB Output is correct
48 Correct 139 ms 34296 KB Output is correct
49 Correct 323 ms 59380 KB Output is correct
50 Correct 428 ms 59884 KB Output is correct
51 Correct 178 ms 34928 KB Output is correct
52 Correct 0 ms 212 KB Output is correct
53 Correct 472 ms 39756 KB Output is correct
54 Correct 274 ms 33204 KB Output is correct
55 Correct 365 ms 46764 KB Output is correct
56 Correct 438 ms 33408 KB Output is correct
57 Correct 728 ms 172008 KB Output is correct
58 Correct 2337 ms 297316 KB Output is correct
59 Correct 2742 ms 299348 KB Output is correct
60 Correct 881 ms 174184 KB Output is correct
61 Correct 3127 ms 198928 KB Output is correct
62 Correct 1518 ms 161724 KB Output is correct
63 Correct 3051 ms 224880 KB Output is correct
64 Correct 3051 ms 165412 KB Output is correct
65 Correct 309 ms 59848 KB Output is correct
66 Correct 141 ms 34800 KB Output is correct
67 Correct 179 ms 35824 KB Output is correct
68 Correct 461 ms 60788 KB Output is correct
69 Correct 593 ms 61684 KB Output is correct
70 Correct 1 ms 212 KB Output is correct
71 Correct 471 ms 39812 KB Output is correct
72 Correct 256 ms 33340 KB Output is correct
73 Correct 371 ms 38260 KB Output is correct
74 Correct 467 ms 33172 KB Output is correct
75 Correct 2372 ms 298824 KB Output is correct
76 Correct 722 ms 173928 KB Output is correct
77 Correct 892 ms 176788 KB Output is correct
78 Correct 3093 ms 301700 KB Output is correct
79 Correct 3401 ms 199560 KB Output is correct
80 Correct 1536 ms 163452 KB Output is correct
81 Correct 2364 ms 185664 KB Output is correct
82 Correct 3259 ms 166668 KB Output is correct
83 Correct 2991 ms 183512 KB Output is correct