oj.uz

답안 #747133

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
747133 2023-05-23T16:38:40 Z Rafi22 카니발 티켓 (IOI20_tickets) C++14
100 / 100
 737 ms 84084 KB 
#include <bits/stdc++.h>
#include "tickets.h"

using namespace std;

#define endl '\n'
#define st first
#define nd second
#define pb push_back
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define ll long long
ll mod=1000000007;
int inf=1000000007;
ll infl=1000000000000000007;

/*void allocate_tickets(vector<vector<int>>r)
{
    int n=sz(r),m=sz(r[0]);
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<m;j++) cout<<r[i][j]<<" ";
        cout<<endl;
    }
}
*/
ll find_maximum(int k,vector<vector<int>>a)
{
    int n=sz(a),m=sz(a[0]);
    vector<pair<int,int>>V;
    vector<vector<int>>r(n,vector<int>(m,-1));
    ll ans=0;
    for(int i=0;i<n;i++)
    {
        for(int j=m-k;j<m;j++) ans+=(ll)a[i][j];
        for(int j=0;j<k;j++) V.pb({-a[i][j]-a[i][j+m-k],i});
    }
    sort(all(V),greater<pair<int,int>>());
    vector<int>X(n,-1);
    vector<int>Y(n,m-k);
    int ile=n*k/2;
    for(auto [x,i]:V)
    {
        if(X[i]==k-1) continue;
        ans+=(ll)x;
        X[i]++;
        Y[i]++;
        ile--;
        if(ile==0) break;
    }
    for(int j=0;j<k;j++)
    {
        int c1=n/2,c2=n/2;
        for(int i=0;i<n;i++)
        {
            if(X[i]==-1)
            {
                c2--;
                r[i][Y[i]]=j;
                Y[i]++;
            }
            else if(Y[i]==m)
            {
                c1--;
                r[i][X[i]]=j;
                X[i]--;
            }
        }
        for(int i=0;i<n;i++)
        {
            if(X[i]==-1||Y[i]==m) continue;
            if(c1>0)
            {
                c1--;
                r[i][X[i]]=j;
                X[i]--;
            }
            else
            {
                c2--;
                r[i][Y[i]]=j;
                Y[i]++;
            }
        }
    }
    allocate_tickets(r);
    return ans;
}

/*int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cout<<find_maximum(1, {{5, 9,10}, {1, 4,6}, {3, 6,8}, {2, 7,9}});
    return 0;
}*/

Compilation message

tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:42:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   42 |     for(auto [x,i]:V)
      |              ^

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 724 KB Output is correct

Subtask #2
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 19 ms 3148 KB Output is correct
6 Correct 484 ms 73104 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 296 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 18 ms 2636 KB Output is correct
6 Correct 494 ms 57788 KB Output is correct
7 Correct 478 ms 60732 KB Output is correct
8 Correct 3 ms 596 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 5 ms 860 KB Output is correct
13 Correct 17 ms 2348 KB Output is correct
14 Correct 22 ms 2388 KB Output is correct
15 Correct 492 ms 63000 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 300 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 26 ms 3636 KB Output is correct
6 Correct 5 ms 852 KB Output is correct
7 Correct 7 ms 1108 KB Output is correct
8 Correct 696 ms 83952 KB Output is correct
9 Correct 691 ms 78512 KB Output is correct
10 Correct 658 ms 78504 KB Output is correct
11 Correct 737 ms 84084 KB Output is correct

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 436 KB Output is correct
5 Correct 2 ms 444 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 304 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 3 ms 468 KB Output is correct
10 Correct 4 ms 512 KB Output is correct
11 Correct 2 ms 444 KB Output is correct
12 Correct 2 ms 468 KB Output is correct

Subtask #6
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 2 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 436 KB Output is correct
5 Correct 2 ms 444 KB Output is correct
6 Correct 2 ms 468 KB Output is correct
7 Correct 1 ms 304 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 3 ms 468 KB Output is correct
10 Correct 4 ms 512 KB Output is correct
11 Correct 2 ms 444 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 21 ms 3172 KB Output is correct
14 Correct 26 ms 3244 KB Output is correct
15 Correct 25 ms 3268 KB Output is correct
16 Correct 26 ms 3704 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 3 ms 492 KB Output is correct
19 Correct 2 ms 436 KB Output is correct
20 Correct 23 ms 2744 KB Output is correct
21 Correct 25 ms 3308 KB Output is correct
22 Correct 34 ms 2988 KB Output is correct
23 Correct 28 ms 3468 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 19 ms 3148 KB Output is correct
12 Correct 484 ms 73104 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 296 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 18 ms 2636 KB Output is correct
18 Correct 494 ms 57788 KB Output is correct
19 Correct 478 ms 60732 KB Output is correct
20 Correct 3 ms 596 KB Output is correct
21 Correct 1 ms 300 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 5 ms 860 KB Output is correct
25 Correct 17 ms 2348 KB Output is correct
26 Correct 22 ms 2388 KB Output is correct
27 Correct 492 ms 63000 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 1 ms 300 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 26 ms 3636 KB Output is correct
33 Correct 5 ms 852 KB Output is correct
34 Correct 7 ms 1108 KB Output is correct
35 Correct 696 ms 83952 KB Output is correct
36 Correct 691 ms 78512 KB Output is correct
37 Correct 658 ms 78504 KB Output is correct
38 Correct 737 ms 84084 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 2 ms 468 KB Output is correct
41 Correct 2 ms 468 KB Output is correct
42 Correct 2 ms 436 KB Output is correct
43 Correct 2 ms 444 KB Output is correct
44 Correct 2 ms 468 KB Output is correct
45 Correct 1 ms 304 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 3 ms 468 KB Output is correct
48 Correct 4 ms 512 KB Output is correct
49 Correct 2 ms 444 KB Output is correct
50 Correct 2 ms 468 KB Output is correct
51 Correct 21 ms 3172 KB Output is correct
52 Correct 26 ms 3244 KB Output is correct
53 Correct 25 ms 3268 KB Output is correct
54 Correct 26 ms 3704 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 3 ms 492 KB Output is correct
57 Correct 2 ms 436 KB Output is correct
58 Correct 23 ms 2744 KB Output is correct
59 Correct 25 ms 3308 KB Output is correct
60 Correct 34 ms 2988 KB Output is correct
61 Correct 28 ms 3468 KB Output is correct
62 Correct 63 ms 8388 KB Output is correct
63 Correct 54 ms 8452 KB Output is correct
64 Correct 76 ms 9680 KB Output is correct
65 Correct 266 ms 33632 KB Output is correct
66 Correct 296 ms 37468 KB Output is correct
67 Correct 7 ms 988 KB Output is correct
68 Correct 6 ms 852 KB Output is correct
69 Correct 485 ms 73180 KB Output is correct
70 Correct 583 ms 75268 KB Output is correct
71 Correct 684 ms 83988 KB Output is correct
72 Correct 634 ms 67828 KB Output is correct
73 Correct 661 ms 80076 KB Output is correct
74 Correct 530 ms 60796 KB Output is correct
75 Correct 633 ms 73276 KB Output is correct