oj.uz

Submission #556176

# Submission time Handle Problem Language Result Execution time Memory
556176 2022-05-02T14:42:44 Z n0sk1ll Art Exhibition (JOI18_art) C++14
50 / 100
 1000 ms 11188 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

#define FAST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cerr.tie(0)
#define mp make_pair
#define xx first
#define yy second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define all(x) (x).begin(),(x).end()
#define erase_uni(x) x.erase(unique(all(x)),x.end())
#define inv(n) power((n), mod - 2)
#define ff(i,a,b) for (int (i) = (a); (i) < (b); (i)++)
#define fff(i,a,b) for (int (i) = (a); (i) <= b; (i)++)
#define bff(i,a,b) for (int (i) = (b)-1; (i) >= (a); (i)--)
#define bfff(i,a,b) for (int (i) = (b); (i) >= (a); (i)--)
#define sum_overflow(a,b) __builtin_add_overflow_p ((a), (b), (__typeof__ ((a) + (b))) 0)
#define mul_overflow(a,b) __builtin_mul_overflow_p ((a), (b), (__typeof__ ((a) + (b))) 0)

using namespace std;
long double typedef ld;
unsigned int typedef ui;
long long int typedef li;
pair<int,int> typedef pii;
pair<li,li> typedef pli;
pair<ld,ld> typedef pld;
vector<vector<int>> typedef graph;
unsigned long long int typedef ull;
//const int mod = 998244353;
const int mod = 1000000007;

/*using namespace __gnu_pbds;
template <class T> using oset = tree<T, null_type,less<T>, rb_tree_tag,tree_order_statistics_node_update>;
template <class T> using omset = tree<T, null_type,less_equal<T>, rb_tree_tag,tree_order_statistics_node_update>;*/







//Note to self: Check for overflow

pli sta[500005];

int main()
{
    FAST;

    int n; cin>>n;
    ff(i,0,n) cin>>sta[i].xx>>sta[i].yy;

    li ans=0;
    sort(sta,sta+n);
    ff(i,0,n)
    {
        li lol=0;
        ff(j,i,n)
        {
            lol+=sta[j].yy;
            ans=max(ans,lol-(sta[j].xx-sta[i].xx));
        }
    }

    cout<<ans<<"\n";
}

//Note to self: Check for overflow

Compilation message

art.cpp: In function 'int main()':
art.cpp:16:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   16 | #define ff(i,a,b) for (int (i) = (a); (i) < (b); (i)++)
      |                            ^
art.cpp:54:5: note: in expansion of macro 'ff'
   54 |     ff(i,0,n) cin>>sta[i].xx>>sta[i].yy;
      |     ^~
art.cpp:16:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   16 | #define ff(i,a,b) for (int (i) = (a); (i) < (b); (i)++)
      |                            ^
art.cpp:58:5: note: in expansion of macro 'ff'
   58 |     ff(i,0,n)
      |     ^~
art.cpp:16:28: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   16 | #define ff(i,a,b) for (int (i) = (a); (i) < (b); (i)++)
      |                            ^
art.cpp:61:9: note: in expansion of macro 'ff'
   61 |         ff(j,i,n)
      |         ^~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 16 ms 536 KB Output is correct
28 Correct 15 ms 468 KB Output is correct
29 Correct 15 ms 468 KB Output is correct
30 Correct 15 ms 468 KB Output is correct
31 Correct 16 ms 512 KB Output is correct
32 Correct 16 ms 444 KB Output is correct
33 Correct 15 ms 468 KB Output is correct
34 Correct 17 ms 468 KB Output is correct
35 Correct 17 ms 528 KB Output is correct
36 Correct 18 ms 516 KB Output is correct
37 Correct 17 ms 468 KB Output is correct
38 Correct 15 ms 468 KB Output is correct
39 Correct 16 ms 596 KB Output is correct
40 Correct 16 ms 520 KB Output is correct
41 Correct 15 ms 468 KB Output is correct
42 Correct 15 ms 468 KB Output is correct
43 Correct 15 ms 648 KB Output is correct
44 Correct 15 ms 468 KB Output is correct
45 Correct 15 ms 532 KB Output is correct
46 Correct 15 ms 468 KB Output is correct
47 Correct 15 ms 532 KB Output is correct
48 Correct 16 ms 532 KB Output is correct
49 Correct 16 ms 468 KB Output is correct
50 Correct 20 ms 476 KB Output is correct
51 Correct 21 ms 472 KB Output is correct

Subtask #4
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 16 ms 536 KB Output is correct
28 Correct 15 ms 468 KB Output is correct
29 Correct 15 ms 468 KB Output is correct
30 Correct 15 ms 468 KB Output is correct
31 Correct 16 ms 512 KB Output is correct
32 Correct 16 ms 444 KB Output is correct
33 Correct 15 ms 468 KB Output is correct
34 Correct 17 ms 468 KB Output is correct
35 Correct 17 ms 528 KB Output is correct
36 Correct 18 ms 516 KB Output is correct
37 Correct 17 ms 468 KB Output is correct
38 Correct 15 ms 468 KB Output is correct
39 Correct 16 ms 596 KB Output is correct
40 Correct 16 ms 520 KB Output is correct
41 Correct 15 ms 468 KB Output is correct
42 Correct 15 ms 468 KB Output is correct
43 Correct 15 ms 648 KB Output is correct
44 Correct 15 ms 468 KB Output is correct
45 Correct 15 ms 532 KB Output is correct
46 Correct 15 ms 468 KB Output is correct
47 Correct 15 ms 532 KB Output is correct
48 Correct 16 ms 532 KB Output is correct
49 Correct 16 ms 468 KB Output is correct
50 Correct 20 ms 476 KB Output is correct
51 Correct 21 ms 472 KB Output is correct
52 Execution timed out 1049 ms 11188 KB Time limit exceeded
53 Halted 0 ms 0 KB -