Submission #952466

# Submission time Handle Problem Language Result Execution time Memory
952466 2024-03-24T03:24:57 Z SN0WM4N Cake 3 (JOI19_cake3) C++14
24 / 100
4000 ms 8044 KB
    #include <bits/stdc++.h>
    #include <ext/pb_ds/assoc_container.hpp>
    #include <ext/pb_ds/tree_policy.hpp>
    #define bpc __builtin_popcount
    #define mp make_pair
    #define ull unsigned long long
    #define ld double
    #define ll long long
    #define F first
    #define S second
     
    using namespace __gnu_pbds;
    using namespace std;
     
    typedef tree<long long, null_type, less_equal<long long>,
        rb_tree_tag, tree_order_statistics_node_update> Tree;
     
    const ll INF = 9223372036854775807LL;
    const ll inf = 2147483647;
    const ll MOD = 1e9 + 7;
    const ld PI = acos(-1);
    const ll NROOT = 320;
     
    //void FileIO(string in, string out) {	
    //#ifndef LOCAL
    //	freopen(in, "r", stdin);
    //	freopen(out, "w", stdout);
    //#endif
    //}
     
    ll binpow(ll a, ll b) {
    	ll res = 1;
    	for (; b; b /= 2, a *= a, a %= MOD)
    		if (b & 1) res *= a, res %= MOD;
    	return res;
    }
     
    bool dataOverflow(ll a, ll b) {return (log10(a) + log10(b) >= 18);}
    ll gcd(ll a, ll b) {return b ? gcd(b, a % b) : a;}
    ll lcm(ll a, ll b) {return a * b / gcd(a, b);}
    ll invmod(ll a) {return binpow(a, MOD - 2);}
    ll ceil(ll a, ll b) {return (a + b - 1) / b;}
     
    void print(priority_queue<ll, vector<ll>, greater<ll>> q) {	
    	int cnt = 0;
    	while (!q.empty()) {
    		if (cnt > 0)
    			cerr << " ";
    		cerr << q.top();
    		q.pop();	
    		cnt ++;
    	}
    }
     
    bool cmp(pair<ll, ll> a, pair<ll, ll> b) {
    	if (a.S == b.S) 
    		return a.F < b.F;
    	return a.S < b.S;
    }
     
    void comp(bool stat) {
    	if (!stat) {
          	while (true) {
              	cerr << "Another Loop\n";
            }
    		exit(0);
    	}
    }
     
    int32_t main() {
    	ios_base::sync_with_stdio(0);
    	cin.tie(0); cout.tie(0); 
     
    	int n, m;
    	cin >> n >> m; m -= 2;
    	vector<pair<ll, ll>> v(n + 1);
     
    	for (int i = 1; i <= n; i ++) 
    		cin >> v[i].F >> v[i].S;
     
    	sort(v.begin(), v.end(), cmp);
     
    	ll ans = -1e18;
    	for (int i = 1; i <= n; i ++) {
    		ll act = v[i].F;
    		priority_queue<ll, vector<ll>, greater<ll>> q;
     
    		for (int j = i + 1; j <= n; j ++) {
    			if ((int)q.size() == m) {
    				ll tmp = act + v[j].F;
    				tmp -= (v[j].S  + v[j].S - v[i].S - v[i].S);
    				ans = max(ans, tmp);
     
    				q.push(v[j].F);
    				act += v[j].F;
    				if (q.empty()) {
                      while(true) {
                        cerr << "Another Loop\n";
                      }
    				}
    				act -= q.top();
    				q.pop();	
    			} else {	
    				q.push(v[j].F);
    				act += v[j].F;
    			}
    		}
    	}
     
    	cout << ans << "\n";
     
    	return 0;
    }
     
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 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 1 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 1 ms 344 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 420 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 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 1 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 1 ms 344 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 420 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 63 ms 348 KB Output is correct
39 Correct 61 ms 532 KB Output is correct
40 Correct 43 ms 348 KB Output is correct
41 Correct 44 ms 348 KB Output is correct
42 Correct 33 ms 512 KB Output is correct
43 Correct 35 ms 348 KB Output is correct
44 Correct 54 ms 348 KB Output is correct
45 Correct 59 ms 344 KB Output is correct
46 Correct 67 ms 360 KB Output is correct
47 Correct 61 ms 344 KB Output is correct
48 Correct 55 ms 600 KB Output is correct
49 Correct 53 ms 480 KB Output is correct
50 Correct 53 ms 344 KB Output is correct
51 Correct 50 ms 344 KB Output is correct
52 Correct 45 ms 344 KB Output is correct
53 Correct 49 ms 348 KB Output is correct
54 Correct 40 ms 348 KB Output is correct
55 Correct 33 ms 348 KB Output is correct
56 Correct 32 ms 348 KB Output is correct
57 Correct 33 ms 348 KB Output is correct
58 Correct 33 ms 348 KB Output is correct
59 Correct 16 ms 348 KB Output is correct
60 Correct 19 ms 516 KB Output is correct
61 Correct 15 ms 344 KB Output is correct
62 Correct 12 ms 348 KB Output is correct
63 Correct 16 ms 348 KB Output is correct
64 Correct 13 ms 348 KB Output is correct
65 Correct 55 ms 348 KB Output is correct
66 Correct 49 ms 348 KB Output is correct
67 Correct 59 ms 592 KB Output is correct
68 Correct 48 ms 344 KB Output is correct
69 Correct 41 ms 348 KB Output is correct
70 Correct 42 ms 348 KB Output is correct
71 Correct 59 ms 488 KB Output is correct
72 Correct 41 ms 344 KB Output is correct
73 Correct 33 ms 348 KB Output is correct
74 Correct 29 ms 552 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 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 1 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 1 ms 344 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 420 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 63 ms 348 KB Output is correct
39 Correct 61 ms 532 KB Output is correct
40 Correct 43 ms 348 KB Output is correct
41 Correct 44 ms 348 KB Output is correct
42 Correct 33 ms 512 KB Output is correct
43 Correct 35 ms 348 KB Output is correct
44 Correct 54 ms 348 KB Output is correct
45 Correct 59 ms 344 KB Output is correct
46 Correct 67 ms 360 KB Output is correct
47 Correct 61 ms 344 KB Output is correct
48 Correct 55 ms 600 KB Output is correct
49 Correct 53 ms 480 KB Output is correct
50 Correct 53 ms 344 KB Output is correct
51 Correct 50 ms 344 KB Output is correct
52 Correct 45 ms 344 KB Output is correct
53 Correct 49 ms 348 KB Output is correct
54 Correct 40 ms 348 KB Output is correct
55 Correct 33 ms 348 KB Output is correct
56 Correct 32 ms 348 KB Output is correct
57 Correct 33 ms 348 KB Output is correct
58 Correct 33 ms 348 KB Output is correct
59 Correct 16 ms 348 KB Output is correct
60 Correct 19 ms 516 KB Output is correct
61 Correct 15 ms 344 KB Output is correct
62 Correct 12 ms 348 KB Output is correct
63 Correct 16 ms 348 KB Output is correct
64 Correct 13 ms 348 KB Output is correct
65 Correct 55 ms 348 KB Output is correct
66 Correct 49 ms 348 KB Output is correct
67 Correct 59 ms 592 KB Output is correct
68 Correct 48 ms 344 KB Output is correct
69 Correct 41 ms 348 KB Output is correct
70 Correct 42 ms 348 KB Output is correct
71 Correct 59 ms 488 KB Output is correct
72 Correct 41 ms 344 KB Output is correct
73 Correct 33 ms 348 KB Output is correct
74 Correct 29 ms 552 KB Output is correct
75 Execution timed out 4043 ms 8044 KB Time limit exceeded
76 Halted 0 ms 0 KB -