oj.uz

답안 #511007

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
511007 2022-01-15T04:10:39 Z couplefire Two Dishes (JOI19_dishes) C++17
100 / 100
 2895 ms 222864 KB 
#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
#include<set>
#include<algorithm>
using namespace std;
const int N=2000005;
int n,m;
int a[N];
long long s[N];
int p[N];
int b[N];
long long t[N];
int q[N];
int x[N],y[N];
long long suma[N],sumb[N];
struct Seg
{
    int x,y,v;
}seg[N];
int cnt;
long long val[N];
set<pair<int,long long>>S;
long long f[N];
int main()
{
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)
        scanf("%d%lld%d",&a[i],&s[i],&p[i]);
    for(int i=1;i<=m;i++)
        scanf("%d%lld%d",&b[i],&t[i],&q[i]);
    for(int i=1;i<=n;i++)
        suma[i]=suma[i-1]+a[i];
    for(int i=1;i<=m;i++)
        sumb[i]=sumb[i-1]+b[i];
    for(int i=1;i<=n;i++)
        y[i]=upper_bound(sumb,sumb+m+1,s[i]-suma[i])-sumb-1;
    for(int j=1;j<=m;j++)
        x[j]=upper_bound(suma,suma+n+1,t[j]-sumb[j])-suma-1;
    for(int i=1;i<=n;i++)
        if(i-1>=0&&y[i]+1<=m) seg[++cnt]=(Seg){i-1,y[i]+1,-p[i]};
    for(int j=1;j<=m;j++)
        if(x[j]>=0&&j<=m) seg[++cnt]=(Seg){x[j],j,q[j]};
    sort(seg+1,seg+cnt+1,[=](const Seg &a,const Seg &b){return a.x==b.x?a.y<b.y:a.x<b.x;});
    int j=1;
    for(int i=1;i<=n;i++)
    {
        vector<int>pos;
        long long add=0;
        while(j<=cnt&&seg[j].x==i-1)
        {
            if(seg[j].y==0) add+=seg[j].v;
            else
            {
                auto it=S.find({seg[j].y,val[seg[j].y]});
                if(it!=S.end()) S.erase(it);
                pos.push_back(seg[j].y),val[seg[j].y]+=seg[j].v;
                if(val[seg[j].y]!=0) S.insert({seg[j].y,val[seg[j].y]});
            }
            j++;
        }
        f[i]=f[i-1]+add;
        for(int y:pos)
            while(val[y]<0)
            {
                auto it=S.upper_bound({y,val[y]});
                if(it==S.end())
                {
                    S.erase(S.find({y,val[y]}));
                    val[y]=0;
                    continue;
                }
                int u=it->first;
                S.erase(it);
                if(val[u]<0)
                {
                    val[u]+=val[y];
                    if(val[u]!=0) S.insert({u,val[u]});
                    S.erase({y,val[y]});
                    val[y]=0;
                }
                else
                {
                    long long tmp=val[y];
                    long long d=min(-val[y],val[u]);
                    val[y]+=d,val[u]-=d;
                    if(val[u]!=0) S.insert({u,val[u]});
                    S.erase(S.find({y,tmp}));
                    if(val[y]!=0) S.insert({y,val[y]});
                }
            }
    }
    long long ans=0;
    for(int i=1;i<=n;i++)
        ans+=p[i];
    ans+=f[n];
    while(j<=cnt&&seg[j].x==n)
        ans+=seg[j].v,j++;
    for(auto [y,v]:S)
        ans+=v;
    printf("%lld",ans);
    return 0;
}

Compilation message

dishes.cpp: In function 'int main()':
dishes.cpp:28:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 |     scanf("%d%d",&n,&m);
      |     ~~~~~^~~~~~~~~~~~~~
dishes.cpp:30:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |         scanf("%d%lld%d",&a[i],&s[i],&p[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dishes.cpp:32:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |         scanf("%d%lld%d",&b[i],&t[i],&q[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 313 ms 29740 KB Output is correct
2 Correct 280 ms 18372 KB Output is correct
3 Correct 221 ms 15212 KB Output is correct
4 Correct 364 ms 24980 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 278 ms 17448 KB Output is correct
7 Correct 169 ms 7964 KB Output is correct
8 Correct 83 ms 7308 KB Output is correct
9 Correct 232 ms 15180 KB Output is correct
10 Correct 284 ms 19156 KB Output is correct
11 Correct 141 ms 15240 KB Output is correct

Subtask #2
3.0 / 3.0

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

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 2 ms 460 KB Output is correct
18 Correct 3 ms 588 KB Output is correct
19 Correct 3 ms 588 KB Output is correct
20 Correct 4 ms 556 KB Output is correct
21 Correct 3 ms 588 KB Output is correct
22 Correct 3 ms 588 KB Output is correct
23 Correct 4 ms 588 KB Output is correct

Subtask #4
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 2 ms 460 KB Output is correct
18 Correct 3 ms 588 KB Output is correct
19 Correct 3 ms 588 KB Output is correct
20 Correct 4 ms 556 KB Output is correct
21 Correct 3 ms 588 KB Output is correct
22 Correct 3 ms 588 KB Output is correct
23 Correct 4 ms 588 KB Output is correct
24 Correct 162 ms 16412 KB Output is correct
25 Correct 258 ms 30504 KB Output is correct
26 Correct 256 ms 17988 KB Output is correct
27 Correct 312 ms 30452 KB Output is correct
28 Correct 229 ms 17380 KB Output is correct
29 Correct 254 ms 15180 KB Output is correct
30 Correct 377 ms 19128 KB Output is correct
31 Correct 116 ms 16420 KB Output is correct
32 Correct 82 ms 8552 KB Output is correct
33 Correct 280 ms 17848 KB Output is correct
34 Correct 414 ms 23372 KB Output is correct
35 Correct 391 ms 19196 KB Output is correct
36 Correct 326 ms 19156 KB Output is correct

Subtask #5
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 2 ms 460 KB Output is correct
18 Correct 3 ms 588 KB Output is correct
19 Correct 3 ms 588 KB Output is correct
20 Correct 4 ms 556 KB Output is correct
21 Correct 3 ms 588 KB Output is correct
22 Correct 3 ms 588 KB Output is correct
23 Correct 4 ms 588 KB Output is correct
24 Correct 162 ms 16412 KB Output is correct
25 Correct 258 ms 30504 KB Output is correct
26 Correct 256 ms 17988 KB Output is correct
27 Correct 312 ms 30452 KB Output is correct
28 Correct 229 ms 17380 KB Output is correct
29 Correct 254 ms 15180 KB Output is correct
30 Correct 377 ms 19128 KB Output is correct
31 Correct 116 ms 16420 KB Output is correct
32 Correct 82 ms 8552 KB Output is correct
33 Correct 280 ms 17848 KB Output is correct
34 Correct 414 ms 23372 KB Output is correct
35 Correct 391 ms 19196 KB Output is correct
36 Correct 326 ms 19156 KB Output is correct
37 Correct 191 ms 17952 KB Output is correct
38 Correct 325 ms 30484 KB Output is correct
39 Correct 432 ms 31632 KB Output is correct
40 Correct 266 ms 19140 KB Output is correct
41 Correct 0 ms 332 KB Output is correct
42 Correct 487 ms 19184 KB Output is correct
43 Correct 423 ms 17740 KB Output is correct
44 Correct 373 ms 23368 KB Output is correct
45 Correct 464 ms 19172 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 0 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 0 ms 332 KB Output is correct
16 Correct 0 ms 332 KB Output is correct
17 Correct 2 ms 460 KB Output is correct
18 Correct 3 ms 588 KB Output is correct
19 Correct 3 ms 588 KB Output is correct
20 Correct 4 ms 556 KB Output is correct
21 Correct 3 ms 588 KB Output is correct
22 Correct 3 ms 588 KB Output is correct
23 Correct 4 ms 588 KB Output is correct
24 Correct 162 ms 16412 KB Output is correct
25 Correct 258 ms 30504 KB Output is correct
26 Correct 256 ms 17988 KB Output is correct
27 Correct 312 ms 30452 KB Output is correct
28 Correct 229 ms 17380 KB Output is correct
29 Correct 254 ms 15180 KB Output is correct
30 Correct 377 ms 19128 KB Output is correct
31 Correct 116 ms 16420 KB Output is correct
32 Correct 82 ms 8552 KB Output is correct
33 Correct 280 ms 17848 KB Output is correct
34 Correct 414 ms 23372 KB Output is correct
35 Correct 391 ms 19196 KB Output is correct
36 Correct 326 ms 19156 KB Output is correct
37 Correct 191 ms 17952 KB Output is correct
38 Correct 325 ms 30484 KB Output is correct
39 Correct 432 ms 31632 KB Output is correct
40 Correct 266 ms 19140 KB Output is correct
41 Correct 0 ms 332 KB Output is correct
42 Correct 487 ms 19184 KB Output is correct
43 Correct 423 ms 17740 KB Output is correct
44 Correct 373 ms 23368 KB Output is correct
45 Correct 464 ms 19172 KB Output is correct
46 Correct 1121 ms 88380 KB Output is correct
47 Correct 1697 ms 150956 KB Output is correct
48 Correct 2417 ms 156804 KB Output is correct
49 Correct 1567 ms 94248 KB Output is correct
50 Correct 2770 ms 94392 KB Output is correct
51 Correct 1899 ms 85484 KB Output is correct
52 Correct 2329 ms 110880 KB Output is correct
53 Correct 2621 ms 93940 KB Output is correct

Subtask #7
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 313 ms 29740 KB Output is correct
2 Correct 280 ms 18372 KB Output is correct
3 Correct 221 ms 15212 KB Output is correct
4 Correct 364 ms 24980 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 278 ms 17448 KB Output is correct
7 Correct 169 ms 7964 KB Output is correct
8 Correct 83 ms 7308 KB Output is correct
9 Correct 232 ms 15180 KB Output is correct
10 Correct 284 ms 19156 KB Output is correct
11 Correct 141 ms 15240 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 0 ms 332 KB Output is correct
28 Correct 2 ms 460 KB Output is correct
29 Correct 3 ms 588 KB Output is correct
30 Correct 3 ms 588 KB Output is correct
31 Correct 4 ms 556 KB Output is correct
32 Correct 3 ms 588 KB Output is correct
33 Correct 3 ms 588 KB Output is correct
34 Correct 4 ms 588 KB Output is correct
35 Correct 162 ms 16412 KB Output is correct
36 Correct 258 ms 30504 KB Output is correct
37 Correct 256 ms 17988 KB Output is correct
38 Correct 312 ms 30452 KB Output is correct
39 Correct 229 ms 17380 KB Output is correct
40 Correct 254 ms 15180 KB Output is correct
41 Correct 377 ms 19128 KB Output is correct
42 Correct 116 ms 16420 KB Output is correct
43 Correct 82 ms 8552 KB Output is correct
44 Correct 280 ms 17848 KB Output is correct
45 Correct 414 ms 23372 KB Output is correct
46 Correct 391 ms 19196 KB Output is correct
47 Correct 326 ms 19156 KB Output is correct
48 Correct 191 ms 17952 KB Output is correct
49 Correct 325 ms 30484 KB Output is correct
50 Correct 432 ms 31632 KB Output is correct
51 Correct 266 ms 19140 KB Output is correct
52 Correct 0 ms 332 KB Output is correct
53 Correct 487 ms 19184 KB Output is correct
54 Correct 423 ms 17740 KB Output is correct
55 Correct 373 ms 23368 KB Output is correct
56 Correct 464 ms 19172 KB Output is correct
57 Correct 293 ms 30476 KB Output is correct
58 Correct 234 ms 32124 KB Output is correct
59 Correct 275 ms 31196 KB Output is correct
60 Correct 503 ms 43632 KB Output is correct
61 Correct 257 ms 29832 KB Output is correct
62 Correct 1 ms 332 KB Output is correct
63 Correct 545 ms 33164 KB Output is correct
64 Correct 384 ms 31216 KB Output is correct
65 Correct 389 ms 33056 KB Output is correct
66 Correct 441 ms 26720 KB Output is correct

Subtask #8
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 313 ms 29740 KB Output is correct
2 Correct 280 ms 18372 KB Output is correct
3 Correct 221 ms 15212 KB Output is correct
4 Correct 364 ms 24980 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 278 ms 17448 KB Output is correct
7 Correct 169 ms 7964 KB Output is correct
8 Correct 83 ms 7308 KB Output is correct
9 Correct 232 ms 15180 KB Output is correct
10 Correct 284 ms 19156 KB Output is correct
11 Correct 141 ms 15240 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 0 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 0 ms 332 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 332 KB Output is correct
20 Correct 0 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 0 ms 332 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 0 ms 332 KB Output is correct
28 Correct 2 ms 460 KB Output is correct
29 Correct 3 ms 588 KB Output is correct
30 Correct 3 ms 588 KB Output is correct
31 Correct 4 ms 556 KB Output is correct
32 Correct 3 ms 588 KB Output is correct
33 Correct 3 ms 588 KB Output is correct
34 Correct 4 ms 588 KB Output is correct
35 Correct 162 ms 16412 KB Output is correct
36 Correct 258 ms 30504 KB Output is correct
37 Correct 256 ms 17988 KB Output is correct
38 Correct 312 ms 30452 KB Output is correct
39 Correct 229 ms 17380 KB Output is correct
40 Correct 254 ms 15180 KB Output is correct
41 Correct 377 ms 19128 KB Output is correct
42 Correct 116 ms 16420 KB Output is correct
43 Correct 82 ms 8552 KB Output is correct
44 Correct 280 ms 17848 KB Output is correct
45 Correct 414 ms 23372 KB Output is correct
46 Correct 391 ms 19196 KB Output is correct
47 Correct 326 ms 19156 KB Output is correct
48 Correct 191 ms 17952 KB Output is correct
49 Correct 325 ms 30484 KB Output is correct
50 Correct 432 ms 31632 KB Output is correct
51 Correct 266 ms 19140 KB Output is correct
52 Correct 0 ms 332 KB Output is correct
53 Correct 487 ms 19184 KB Output is correct
54 Correct 423 ms 17740 KB Output is correct
55 Correct 373 ms 23368 KB Output is correct
56 Correct 464 ms 19172 KB Output is correct
57 Correct 1121 ms 88380 KB Output is correct
58 Correct 1697 ms 150956 KB Output is correct
59 Correct 2417 ms 156804 KB Output is correct
60 Correct 1567 ms 94248 KB Output is correct
61 Correct 2770 ms 94392 KB Output is correct
62 Correct 1899 ms 85484 KB Output is correct
63 Correct 2329 ms 110880 KB Output is correct
64 Correct 2621 ms 93940 KB Output is correct
65 Correct 293 ms 30476 KB Output is correct
66 Correct 234 ms 32124 KB Output is correct
67 Correct 275 ms 31196 KB Output is correct
68 Correct 503 ms 43632 KB Output is correct
69 Correct 257 ms 29832 KB Output is correct
70 Correct 1 ms 332 KB Output is correct
71 Correct 545 ms 33164 KB Output is correct
72 Correct 384 ms 31216 KB Output is correct
73 Correct 389 ms 33056 KB Output is correct
74 Correct 441 ms 26720 KB Output is correct
75 Correct 1697 ms 222864 KB Output is correct
76 Correct 1183 ms 160180 KB Output is correct
77 Correct 1372 ms 153044 KB Output is correct
78 Correct 2887 ms 215708 KB Output is correct
79 Correct 2895 ms 165008 KB Output is correct
80 Correct 1829 ms 153132 KB Output is correct
81 Correct 2345 ms 161492 KB Output is correct
82 Correct 2656 ms 132684 KB Output is correct
83 Correct 2595 ms 152308 KB Output is correct