oj.uz

Submission #300859

# Submission time Handle Problem Language Result Execution time Memory
300859 2020-09-17T14:30:44 Z milisav Carnival Tickets (IOI20_tickets) C++14
100 / 100
 2004 ms 84132 KB 
#include "tickets.h"
#include<bits/stdc++.h>
#pragma GCC optimize("O3")
#define maxn 2000
using namespace std;
priority_queue<pair<int,int>> pq;
vector<int> fr[maxn];
vector<int> bk[maxn];
int tt[maxn];
//vector<vector<int>> s;
long long find_maximum(int k,vector<vector<int>> x) {
	int n = x.size();
	int m = x[0].size();
    vector<vector<int>> s;
    for(int i=0;i<n;i++) {
        vector<int> row;
        for(int j=0;j<m;j++) row.push_back(-1);
        s.push_back(row);
    }
	for(int i=0;i<n;i++) for(int j=0;j<k;j++) pq.push({x[i][m-j-1]+x[i][k-1-j],i});
	long long ans=0;
	for(int i=0;i<n;i++) for(int j=0;j<k;j++) ans-=x[i][j];
	for(int i=0;i<n*k/2;i++) {
        ans+=pq.top().first;
        tt[pq.top().second]++;
        pq.pop();
	}
    for(int i=0;i<n;i++) {
        for(int j=0;j<k-tt[i];j++) fr[i].push_back(k-tt[i]-1-j);
        for(int j=0;j<tt[i];j++) bk[i].push_back(m-tt[i]+j);
    }
    //return ans;
    for(int d=0;d<k;d++) {
        long long l=0;
        long long r=1e9;
        while(l<=r) {
            long long t=(l+r)/2;
            int p=0,q=0;
            int dir=0;
            for(int i=0;i<n;i++) {
                //cout<<fr[i].size()<<" "<<bk[i].size()<<endl;
                if(fr[i].empty() && x[i][bk[i].back()]<t) {
                    dir=-1;
                    break;
                }
                if(bk[i].empty() && x[i][fr[i].back()]>t) {
                    dir=1;
                    break;
                }
                if(!fr[i].empty() && x[i][fr[i].back()]<=t) p++;
                if(!bk[i].empty() && x[i][bk[i].back()]>=t) q++;
            }
            if(dir!=0) {
                if(dir==-1) r=t-1;
                else l=t+1;
                continue;
            }
            //cout<<p<<" "<<q<<" "<<l<<" "<<r<<" "<<t<<endl;
            //assert(p>=n/2 || q>=n/2);
            if(p>=n/2 && q>=n/2) {
                p=0;
                q=0;
                for(int i=0;i<n;i++) {
                    if((!fr[i].empty() && x[i][fr[i].back()]<=t) && !(!bk[i].empty() && x[i][bk[i].back()]>=t)) {
                        s[i][fr[i].back()]=d;
                        p++;
                    }
                    if(!(!fr[i].empty() && x[i][fr[i].back()]<=t) && (!bk[i].empty() && x[i][bk[i].back()]>=t)) {
                        s[i][bk[i].back()]=d;
                        q++;
                    }
                }
                for(int i=0;i<n;i++) {
                    if((!fr[i].empty() && x[i][fr[i].back()]<=t) && (!bk[i].empty() && x[i][bk[i].back()]>=t)) {
                        if(p<n/2) {
                            s[i][fr[i].back()]=d;
                            fr[i].pop_back();
                            p++;
                        }
                        else {
                            s[i][bk[i].back()]=d;
                            bk[i].pop_back();
                            q++;
                        }
                    }
                    else {
                        if((!fr[i].empty() && x[i][fr[i].back()]<=t) && !(!bk[i].empty() && x[i][bk[i].back()]>=t)) fr[i].pop_back();
                        if(!(!fr[i].empty() && x[i][fr[i].back()]<=t) && (!bk[i].empty() && x[i][bk[i].back()]>=t)) bk[i].pop_back();
                    }
                }
                break;
            }
            if(p<n/2) l=t+1;
            if(q<n/2) r=t-1;
        }
    }
	allocate_tickets(s);
	return ans;
}

/*int main() {
    int n,m,k;
    vector<vector<int>> x;
    scanf("%d %d %d", &n, &m, &k);
    x.resize(n);
    for (int i = 0; i < n; i++) {
        x[i].resize(m);
        for (int j=0; j < m; j++) {
            scanf("%d", &x[i][j]);
        }
    }

    long long answer = find_maximum(k, x);
    printf("%lld\n", answer);
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            if (j) printf(" ");
            printf("%d", s[i][j]);
        }
        printf("\n");
    }
    return 0;
}*/

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 2 ms 896 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 4 ms 512 KB Output is correct
5 Correct 33 ms 2552 KB Output is correct
6 Correct 948 ms 51580 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 3 ms 640 KB Output is correct
5 Correct 36 ms 3184 KB Output is correct
6 Correct 1306 ms 67484 KB Output is correct
7 Correct 1881 ms 73616 KB Output is correct
8 Correct 5 ms 768 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 8 ms 1204 KB Output is correct
13 Correct 28 ms 2928 KB Output is correct
14 Correct 28 ms 3064 KB Output is correct
15 Correct 968 ms 77756 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 4 ms 640 KB Output is correct
5 Correct 44 ms 3952 KB Output is correct
6 Correct 7 ms 1024 KB Output is correct
7 Correct 9 ms 1280 KB Output is correct
8 Correct 1642 ms 84116 KB Output is correct
9 Correct 1412 ms 79332 KB Output is correct
10 Correct 1530 ms 78500 KB Output is correct
11 Correct 1567 ms 84132 KB Output is correct

Subtask #5
12.0 / 12.0

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

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 4 ms 512 KB Output is correct
4 Correct 3 ms 640 KB Output is correct
5 Correct 4 ms 640 KB Output is correct
6 Correct 3 ms 640 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 3 ms 640 KB Output is correct
10 Correct 3 ms 640 KB Output is correct
11 Correct 4 ms 640 KB Output is correct
12 Correct 4 ms 640 KB Output is correct
13 Correct 32 ms 2504 KB Output is correct
14 Correct 34 ms 2552 KB Output is correct
15 Correct 38 ms 3184 KB Output is correct
16 Correct 46 ms 3948 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 3 ms 640 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 37 ms 3312 KB Output is correct
21 Correct 38 ms 3228 KB Output is correct
22 Correct 41 ms 3692 KB Output is correct
23 Correct 54 ms 3564 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 2 ms 896 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 4 ms 512 KB Output is correct
11 Correct 33 ms 2552 KB Output is correct
12 Correct 948 ms 51580 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 3 ms 640 KB Output is correct
17 Correct 36 ms 3184 KB Output is correct
18 Correct 1306 ms 67484 KB Output is correct
19 Correct 1881 ms 73616 KB Output is correct
20 Correct 5 ms 768 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 8 ms 1204 KB Output is correct
25 Correct 28 ms 2928 KB Output is correct
26 Correct 28 ms 3064 KB Output is correct
27 Correct 968 ms 77756 KB Output is correct
28 Correct 1 ms 384 KB Output is correct
29 Correct 1 ms 384 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 4 ms 640 KB Output is correct
32 Correct 44 ms 3952 KB Output is correct
33 Correct 7 ms 1024 KB Output is correct
34 Correct 9 ms 1280 KB Output is correct
35 Correct 1642 ms 84116 KB Output is correct
36 Correct 1412 ms 79332 KB Output is correct
37 Correct 1530 ms 78500 KB Output is correct
38 Correct 1567 ms 84132 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 3 ms 512 KB Output is correct
41 Correct 4 ms 512 KB Output is correct
42 Correct 3 ms 640 KB Output is correct
43 Correct 4 ms 640 KB Output is correct
44 Correct 3 ms 640 KB Output is correct
45 Correct 1 ms 384 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 3 ms 640 KB Output is correct
48 Correct 3 ms 640 KB Output is correct
49 Correct 4 ms 640 KB Output is correct
50 Correct 4 ms 640 KB Output is correct
51 Correct 32 ms 2504 KB Output is correct
52 Correct 34 ms 2552 KB Output is correct
53 Correct 38 ms 3184 KB Output is correct
54 Correct 46 ms 3948 KB Output is correct
55 Correct 1 ms 512 KB Output is correct
56 Correct 3 ms 640 KB Output is correct
57 Correct 2 ms 512 KB Output is correct
58 Correct 37 ms 3312 KB Output is correct
59 Correct 38 ms 3228 KB Output is correct
60 Correct 41 ms 3692 KB Output is correct
61 Correct 54 ms 3564 KB Output is correct
62 Correct 87 ms 6136 KB Output is correct
63 Correct 88 ms 6264 KB Output is correct
64 Correct 166 ms 9584 KB Output is correct
65 Correct 465 ms 30120 KB Output is correct
66 Correct 593 ms 36700 KB Output is correct
67 Correct 9 ms 1280 KB Output is correct
68 Correct 9 ms 1024 KB Output is correct
69 Correct 813 ms 51700 KB Output is correct
70 Correct 1035 ms 67332 KB Output is correct
71 Correct 1459 ms 84120 KB Output is correct
72 Correct 2004 ms 80968 KB Output is correct
73 Correct 1532 ms 79852 KB Output is correct
74 Correct 1360 ms 66416 KB Output is correct
75 Correct 1077 ms 65972 KB Output is correct