oj.uz

Submission #415470

# Submission time Handle Problem Language Result Execution time Memory
415470 2021-06-01T06:39:25 Z Theo830 Carnival Tickets (IOI20_tickets) C++17
100 / 100
 1347 ms 131016 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll INF = 1e9+7;
ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ll,ii>
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///Deltix Round, Spring 2021 (open for everyone, rated, Div. 1 + Div. 2)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_int_distribution<ll> distr;
ll rnd(ll a, ll b){return distr(rng)%(b-a+1)+a;}
#include "tickets.h"
/*
long long find_maximum(int k, std::vector<std::vector<int>> d);
void allocate_tickets( std::vector<std::vector<int>> _x);
static int n;
static int m;
static int k;
static std::vector<std::vector<int>> d;
static std::vector<std::vector<int>> x;
static int called = 0;

static void check(bool cond, std::string message) {
    if (!cond) {
        printf("%s\n", message.c_str());
        exit(0);
    }
}


void allocate_tickets( std::vector<std::vector<int>> _d) {
    check(!called, "allocate_tickets called more than once");
    d = _d;
    check((int)d.size() == n, "allocate_tickets called with parameter of wrong size");
    for (int i = 0; i < n; i++) {
        check((int)d[i].size() == m, "allocate_tickets called with parameter of wrong size");
    }
    called = 1;
}

int main() {
    assert(scanf("%d %d %d", &n, &m, &k) == 3);
    x.resize(n);
    for (int i = 0; i < n; i++) {
        x[i].resize(m);
        for (int j=0; j < m; j++) {
            assert(scanf("%d", &x[i][j]) == 1);
        }
    }
    fclose(stdin);

    long long answer = find_maximum(k, x);
    check(called, "failure to call allocate_tickets");
    printf("%lld\n", answer);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (j) printf(" ");
            printf("%d", d[i][j]);
        }
        printf("\n");
    }
    fclose(stdout);
    return 0;
}
*/
ll find_maximum(int k, vector<vector<int>> x) {
	ll n = x.size();
	ll m = x[0].size();
	vector<vector<int> > answer;
	f(i,0,n){
        vector<int>ex;
        ex.assign(m,-1);
        answer.pb(ex);
	}
	ll ans = 0;
	ll op = 0;
	priority_queue<iii>pq;
	bool ev[n][m];
	memset(ev,0,sizeof ev);
	f(i,0,n){
	    f(j,0,k){
            ans -= x[i][j];
	    }
	    for(ll j = k-1;j >= 0;j--){
            pq.push(iii(x[i][j] + x[i][j + m-k],ii(i,j)));
	    }
	}
	while(pq.size() != (n * k) / 2){
        iii f = pq.top();
        ll i = f.S.F;
        ll j = f.S.S;
        ans += f.F;
        ev[i][j + m-k] = 1;
        pq.pop();
	}
	priority_queue<ii>PQ;
	ll meg[k] = {0};
	f(i,0,k){
        PQ.push(ii(0,i));
	}
	f(i,0,n){
	    bool ek[k] = {0};
        ll pos = m-1;
        while(pos >= 0 && ev[i][pos]){
            ll p = PQ.top().S;
            PQ.pop();
            answer[i][pos] = p;
            ev[i][pos] = 0;
            meg[p]++;
            PQ.push({-meg[p],p});
            ek[p] = 1;
            pos--;
        }
        ll eto = 0;
        while(eto < k && ek[eto]){
            eto++;
        }
        f(j,0,k){
            if(eto == k){
                break;
            }
            answer[i][j] = eto;
            ek[eto] = 1;
            while(eto < k && ek[eto]){
                eto++;
            }
        }
	}
	allocate_tickets(answer);
	return ans;
}

Compilation message

tickets.cpp: In function 'll find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:104:18: warning: comparison of integer expressions of different signedness: 'std::priority_queue<std::pair<long long int, std::pair<long long int, long long int> > >::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
  104 |  while(pq.size() != (n * k) / 2){
      |        ~~~~~~~~~~^~~~~~~~~~~~~~
tickets.cpp:92:5: warning: unused variable 'op' [-Wunused-variable]
   92 |  ll op = 0;
      |     ^~

Subtask #1
11.0 / 11.0

# 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 332 KB Output is correct
6 Correct 2 ms 716 KB Output is correct

Subtask #2
16.0 / 16.0

# 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 3 ms 460 KB Output is correct
5 Correct 28 ms 2436 KB Output is correct
6 Correct 611 ms 53612 KB Output is correct

Subtask #3
14.0 / 14.0

# 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 4 ms 460 KB Output is correct
5 Correct 31 ms 3188 KB Output is correct
6 Correct 742 ms 78448 KB Output is correct
7 Correct 774 ms 82048 KB Output is correct
8 Correct 5 ms 908 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 8 ms 1144 KB Output is correct
13 Correct 27 ms 3196 KB Output is correct
14 Correct 29 ms 3392 KB Output is correct
15 Correct 846 ms 93376 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 292 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 4 ms 716 KB Output is correct
5 Correct 41 ms 5504 KB Output is correct
6 Correct 8 ms 1144 KB Output is correct
7 Correct 8 ms 1296 KB Output is correct
8 Correct 1347 ms 128128 KB Output is correct
9 Correct 1156 ms 126360 KB Output is correct
10 Correct 1191 ms 126288 KB Output is correct
11 Correct 1279 ms 128076 KB Output is correct

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 3 ms 460 KB Output is correct
3 Correct 3 ms 460 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 3 ms 588 KB Output is correct
6 Correct 4 ms 716 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 3 ms 576 KB Output is correct
10 Correct 3 ms 588 KB Output is correct
11 Correct 4 ms 652 KB Output is correct
12 Correct 4 ms 716 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 3 ms 460 KB Output is correct
3 Correct 3 ms 460 KB Output is correct
4 Correct 3 ms 460 KB Output is correct
5 Correct 3 ms 588 KB Output is correct
6 Correct 4 ms 716 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 3 ms 576 KB Output is correct
10 Correct 3 ms 588 KB Output is correct
11 Correct 4 ms 652 KB Output is correct
12 Correct 4 ms 716 KB Output is correct
13 Correct 28 ms 3268 KB Output is correct
14 Correct 27 ms 3396 KB Output is correct
15 Correct 33 ms 4028 KB Output is correct
16 Correct 43 ms 5436 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 3 ms 588 KB Output is correct
19 Correct 2 ms 460 KB Output is correct
20 Correct 34 ms 3828 KB Output is correct
21 Correct 35 ms 4232 KB Output is correct
22 Correct 37 ms 4900 KB Output is correct
23 Correct 39 ms 5480 KB Output is correct

Subtask #7
10.0 / 10.0

# 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 332 KB Output is correct
6 Correct 2 ms 716 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 3 ms 460 KB Output is correct
11 Correct 28 ms 2436 KB Output is correct
12 Correct 611 ms 53612 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 4 ms 460 KB Output is correct
17 Correct 31 ms 3188 KB Output is correct
18 Correct 742 ms 78448 KB Output is correct
19 Correct 774 ms 82048 KB Output is correct
20 Correct 5 ms 908 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 8 ms 1144 KB Output is correct
25 Correct 27 ms 3196 KB Output is correct
26 Correct 29 ms 3392 KB Output is correct
27 Correct 846 ms 93376 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 292 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 4 ms 716 KB Output is correct
32 Correct 41 ms 5504 KB Output is correct
33 Correct 8 ms 1144 KB Output is correct
34 Correct 8 ms 1296 KB Output is correct
35 Correct 1347 ms 128128 KB Output is correct
36 Correct 1156 ms 126360 KB Output is correct
37 Correct 1191 ms 126288 KB Output is correct
38 Correct 1279 ms 128076 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 3 ms 460 KB Output is correct
41 Correct 3 ms 460 KB Output is correct
42 Correct 3 ms 460 KB Output is correct
43 Correct 3 ms 588 KB Output is correct
44 Correct 4 ms 716 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 2 ms 332 KB Output is correct
47 Correct 3 ms 576 KB Output is correct
48 Correct 3 ms 588 KB Output is correct
49 Correct 4 ms 652 KB Output is correct
50 Correct 4 ms 716 KB Output is correct
51 Correct 28 ms 3268 KB Output is correct
52 Correct 27 ms 3396 KB Output is correct
53 Correct 33 ms 4028 KB Output is correct
54 Correct 43 ms 5436 KB Output is correct
55 Correct 2 ms 332 KB Output is correct
56 Correct 3 ms 588 KB Output is correct
57 Correct 2 ms 460 KB Output is correct
58 Correct 34 ms 3828 KB Output is correct
59 Correct 35 ms 4232 KB Output is correct
60 Correct 37 ms 4900 KB Output is correct
61 Correct 39 ms 5480 KB Output is correct
62 Correct 69 ms 8608 KB Output is correct
63 Correct 74 ms 8584 KB Output is correct
64 Correct 128 ms 13784 KB Output is correct
65 Correct 383 ms 37140 KB Output is correct
66 Correct 508 ms 48816 KB Output is correct
67 Correct 9 ms 1296 KB Output is correct
68 Correct 7 ms 1104 KB Output is correct
69 Correct 605 ms 53968 KB Output is correct
70 Correct 894 ms 87336 KB Output is correct
71 Correct 1328 ms 128916 KB Output is correct
72 Correct 1119 ms 131016 KB Output is correct
73 Correct 1164 ms 94412 KB Output is correct
74 Correct 829 ms 77652 KB Output is correct
75 Correct 913 ms 81884 KB Output is correct