Submission #413186

# Submission time Handle Problem Language Result Execution time Memory
413186 2021-05-28T10:55:43 Z Karliver Art Exhibition (JOI18_art) C++14
100 / 100
231 ms 24896 KB
	
 #include <bits/stdc++.h>
 
 #define FIXED_FLOAT(x)  std::fixed <<std::setprecision(20) << (x)
 #define all(v) (v).begin(), (v).end()
 using namespace  std;
 #define forn(i,n) for (int i = 0; i < (n); ++i)
 #define rforn(i, n) for(int i = (n) - 1;i >= 0;--i)
 using ll = long long;
 int mod = (ll)1e9 + 7;
 #define PI acos(-1)
 typedef pair<int, int> pairs;
 
 const int INF = 1e9 + 1;
 const int N = 2e5 + 100;
 const double eps = 1e-7;
 
 template <class T> using V = vector<T>;  // from yosupo 
 template <class T> using VV = V<V<T>>;  // from yosupo
 
 template <typename XPAX>
 void ckma(XPAX &x, XPAX y) {
     x = (x < y ? y : x);
 }
 template <typename XPAX>
 void ckmi(XPAX &x, XPAX y) {
     x = (x > y ? y : x);
 }
 
 void solve() {
 
 
 	int n;
 	cin >> n;
 	V<pair<ll, ll>> a(n);

 	forn(i, n)cin >> a[i].first >> a[i].second;
 	sort(all(a));
 	V<ll> dp(n, 0);
 	dp[0] = a[0].second;
 	for(int i = 1;i < n;++i) {
 		dp[i] = max(a[i].second, dp[i - 1] - (a[i].first - a[i - 1].first) + a[i].second);
 	}

 	ll ans = 0;
 	forn(i, n)ckma(ans, dp[i]);

 	cout << ans << '\n';
 
 
 }
 void test_case() {
     int t;
     cin >> t;
     forn(p, t) {
 
         //cout << "Case #" << p + 1 << ": ";
         solve();
     }
 }
 int main() {
 
     ios::sync_with_stdio(false);
     cin.tie(nullptr);
     cout.tie(nullptr);
 
     solve();
 
 }
  
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 312 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 312 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 316 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 316 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 312 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 316 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 316 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 3 ms 460 KB Output is correct
28 Correct 3 ms 500 KB Output is correct
29 Correct 3 ms 452 KB Output is correct
30 Correct 3 ms 460 KB Output is correct
31 Correct 3 ms 520 KB Output is correct
32 Correct 3 ms 460 KB Output is correct
33 Correct 3 ms 504 KB Output is correct
34 Correct 4 ms 460 KB Output is correct
35 Correct 3 ms 460 KB Output is correct
36 Correct 3 ms 516 KB Output is correct
37 Correct 4 ms 452 KB Output is correct
38 Correct 3 ms 452 KB Output is correct
39 Correct 3 ms 460 KB Output is correct
40 Correct 3 ms 452 KB Output is correct
41 Correct 3 ms 460 KB Output is correct
42 Correct 4 ms 460 KB Output is correct
43 Correct 3 ms 460 KB Output is correct
44 Correct 3 ms 460 KB Output is correct
45 Correct 3 ms 460 KB Output is correct
46 Correct 3 ms 460 KB Output is correct
47 Correct 3 ms 448 KB Output is correct
48 Correct 3 ms 460 KB Output is correct
49 Correct 3 ms 472 KB Output is correct
50 Correct 3 ms 500 KB Output is correct
51 Correct 3 ms 456 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 312 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 316 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 1 ms 316 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 3 ms 460 KB Output is correct
28 Correct 3 ms 500 KB Output is correct
29 Correct 3 ms 452 KB Output is correct
30 Correct 3 ms 460 KB Output is correct
31 Correct 3 ms 520 KB Output is correct
32 Correct 3 ms 460 KB Output is correct
33 Correct 3 ms 504 KB Output is correct
34 Correct 4 ms 460 KB Output is correct
35 Correct 3 ms 460 KB Output is correct
36 Correct 3 ms 516 KB Output is correct
37 Correct 4 ms 452 KB Output is correct
38 Correct 3 ms 452 KB Output is correct
39 Correct 3 ms 460 KB Output is correct
40 Correct 3 ms 452 KB Output is correct
41 Correct 3 ms 460 KB Output is correct
42 Correct 4 ms 460 KB Output is correct
43 Correct 3 ms 460 KB Output is correct
44 Correct 3 ms 460 KB Output is correct
45 Correct 3 ms 460 KB Output is correct
46 Correct 3 ms 460 KB Output is correct
47 Correct 3 ms 448 KB Output is correct
48 Correct 3 ms 460 KB Output is correct
49 Correct 3 ms 472 KB Output is correct
50 Correct 3 ms 500 KB Output is correct
51 Correct 3 ms 456 KB Output is correct
52 Correct 217 ms 24704 KB Output is correct
53 Correct 213 ms 24644 KB Output is correct
54 Correct 207 ms 24656 KB Output is correct
55 Correct 214 ms 24640 KB Output is correct
56 Correct 217 ms 24792 KB Output is correct
57 Correct 214 ms 24772 KB Output is correct
58 Correct 212 ms 24644 KB Output is correct
59 Correct 210 ms 24896 KB Output is correct
60 Correct 213 ms 24648 KB Output is correct
61 Correct 231 ms 24616 KB Output is correct
62 Correct 229 ms 24664 KB Output is correct
63 Correct 222 ms 24644 KB Output is correct
64 Correct 215 ms 24672 KB Output is correct
65 Correct 208 ms 24660 KB Output is correct
66 Correct 208 ms 24640 KB Output is correct
67 Correct 211 ms 24664 KB Output is correct
68 Correct 210 ms 24644 KB Output is correct