Submission #1071360

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1071360	2024-08-23T06:53:57 Z	vjudge1	Art Exhibition (JOI18_art)	C++17	50 / 100	1000 ms	24004 KB

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pb push_back
#define sz size
#define mp make_pair
#define ios ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define fre(s) freopen(s".in", "r", stdin);freopen(s".out", "w", stdout);
#define s second
#define f first
#define ii pair<ll,ll>
const ll mod=1e9+7;
const int N=2e5+6;
const ll inf=1e12+5;      
ll n,m,k,d[N],g[N];
int main() 
{
    ios
    cin>>n;
    ii v[n];
    for(int i=0;i<n;++i) 
    {
        cin>>v[i].f>>v[i].s;
    }
    sort(v,v+n);
    vector<ii> a;
    k=0;
    for(int i=0;i<n;++i) 
    {
        if (i>0 && v[i].f==v[i-1].f) 
        {
            k+=v[i].s;
        } 
        else 
        {
            if(i>0) 
            {
                a.pb(mp(v[i-1].f,k));
            }
            k=v[i].s;
        }
    }
    a.pb(mp(v[n-1].f,k));
    vector<ll> sum;
    ll l=0,r;
    for(int i=0;i<a.sz();++i) 
    {
        l+=a[i].s;
        sum.pb(l);
    }
    m=0;
    for (int i=0;i<a.sz();++i) 
    {
        r=0;
        for (int j=i;j<a.sz();++j) 
        {
            if (i-1<0)k=sum[j];
            else k=sum[j]-sum[i-1];
            //cout<<k;
            r=k-(a[j].f-a[i].f);
            m=max(m,r);
        }
    }
    cout<<m;
}

Compilation message

art.cpp: In function 'int main()':
art.cpp:49:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |     for(int i=0;i<a.sz();++i)
      |                 ~^~~~~~~
art.cpp:55:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |     for (int i=0;i<a.sz();++i)
      |                  ~^~~~~~~
art.cpp:58:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |         for (int j=i;j<a.sz();++j)
      |                      ~^~~~~~~

Subtask #1
10.0 / 10.0

#	Verdict	Memory	Grader output
1	Correct	344 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	348 KB	Output is correct
6	Correct	348 KB	Output is correct
7	Correct	348 KB	Output is correct
8	Correct	344 KB	Output is correct
9	Correct	348 KB	Output is correct
10	Correct	348 KB	Output is correct
11	Correct	348 KB	Output is correct

Subtask #2
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	396 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct

Subtask #3
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	396 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	13 ms	604 KB	Output is correct
28	Correct	13 ms	792 KB	Output is correct
29	Correct	13 ms	796 KB	Output is correct
30	Correct	13 ms	604 KB	Output is correct
31	Correct	13 ms	604 KB	Output is correct
32	Correct	13 ms	796 KB	Output is correct
33	Correct	13 ms	604 KB	Output is correct
34	Correct	13 ms	792 KB	Output is correct
35	Correct	13 ms	604 KB	Output is correct
36	Correct	13 ms	792 KB	Output is correct
37	Correct	13 ms	792 KB	Output is correct
38	Correct	13 ms	600 KB	Output is correct
39	Correct	13 ms	604 KB	Output is correct
40	Correct	13 ms	800 KB	Output is correct
41	Correct	13 ms	604 KB	Output is correct
42	Correct	13 ms	604 KB	Output is correct
43	Correct	13 ms	604 KB	Output is correct
44	Correct	13 ms	604 KB	Output is correct
45	Correct	13 ms	796 KB	Output is correct
46	Correct	13 ms	796 KB	Output is correct
47	Correct	13 ms	604 KB	Output is correct
48	Correct	13 ms	604 KB	Output is correct
49	Correct	13 ms	604 KB	Output is correct
50	Correct	13 ms	796 KB	Output is correct
51	Correct	13 ms	796 KB	Output is correct

Subtask #4
0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	1 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	396 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	0 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	13 ms	604 KB	Output is correct
28	Correct	13 ms	792 KB	Output is correct
29	Correct	13 ms	796 KB	Output is correct
30	Correct	13 ms	604 KB	Output is correct
31	Correct	13 ms	604 KB	Output is correct
32	Correct	13 ms	796 KB	Output is correct
33	Correct	13 ms	604 KB	Output is correct
34	Correct	13 ms	792 KB	Output is correct
35	Correct	13 ms	604 KB	Output is correct
36	Correct	13 ms	792 KB	Output is correct
37	Correct	13 ms	792 KB	Output is correct
38	Correct	13 ms	600 KB	Output is correct
39	Correct	13 ms	604 KB	Output is correct
40	Correct	13 ms	800 KB	Output is correct
41	Correct	13 ms	604 KB	Output is correct
42	Correct	13 ms	604 KB	Output is correct
43	Correct	13 ms	604 KB	Output is correct
44	Correct	13 ms	604 KB	Output is correct
45	Correct	13 ms	796 KB	Output is correct
46	Correct	13 ms	796 KB	Output is correct
47	Correct	13 ms	604 KB	Output is correct
48	Correct	13 ms	604 KB	Output is correct
49	Correct	13 ms	604 KB	Output is correct
50	Correct	13 ms	796 KB	Output is correct
51	Correct	13 ms	796 KB	Output is correct
52	Execution timed out	1096 ms	24004 KB	Time limit exceeded
53	Halted	0 ms	0 KB	-

Submission #1071360

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 20.0 / 20.0

Subtask #3 20.0 / 20.0

Subtask #4 0 / 50.0

Subtask #1
10.0 / 10.0

Subtask #2
20.0 / 20.0

Subtask #3
20.0 / 20.0

Subtask #4
0 / 50.0