oj.uz

Submission #419371

# Submission time Handle Problem Language Result Execution time Memory
419371 2021-06-07T04:01:07 Z cpp219 Carnival Tickets (IOI20_tickets) C++14
100 / 100
 904 ms 78408 KB 
#pragma GCC optimization "O2"
#pragma GCC optimization "unroll-loop"
#pragma GCC target ("avx2")
#include "tickets.h"
#include <bits/stdc++.h>
#define ll int
#define ld long double
#define fs first
#define sc second
using namespace std;
const ll N = 1500 + 9;
const ll inf = 1e9 + 7;
typedef pair<ll,ll> LL;
long long kq;
ll n,m,k,big[N],sm[N],C[N];
vector<vector<ll>> ans;
priority_queue<LL,vector<LL>,greater<LL>> pq;

void out(){
    for (ll i = 0;i < n;i++){
        for (ll j = 0;j < m;j++) cout<<ans[i][j]<<" ";
        cout<<"\n";
    }
    exit(0);
}

long long find_maximum(ll k, vector<vector<ll>> a){
    n = a.size(); m = a[0].size();
    vector<LL> B;
    ans.resize(n);
    for (ll i = 0;i < ans.size();i++){
        ans[i].resize(m);
        for (ll j = 0;j < ans[i].size();j++) ans[i][j] = -1;
        for (ll j = m - k;j < ans[i].size();j++){
            kq += a[i][j];
            B.push_back({a[i][j] + a[i][j - (m - k)],i});
        }

    }
    ll cnt = n*k/2;
    sort(B.begin(),B.end());
    for (ll i = 0;i < cnt;i++) kq -= B[i].fs,C[B[i].sc]++;
    ll l = 0;
    for (ll i = 0;i < n;i++){
        ll lim = C[i];
        for (ll j = 0;j < lim;j++) ans[i][j] = l++%k;
        ll r = l,j = m - 1,rm = k - C[i];
        while(rm--) ans[i][j] = r++%k,j--;
    }
    //out();
    allocate_tickets(ans);
    return kq;
}

Compilation message

tickets.cpp:1: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    1 | #pragma GCC optimization "O2"
      | 
tickets.cpp:2: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    2 | #pragma GCC optimization "unroll-loop"
      | 
tickets.cpp: In function 'long long int find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:31:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |     for (ll i = 0;i < ans.size();i++){
      |                   ~~^~~~~~~~~~~~
tickets.cpp:33:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |         for (ll j = 0;j < ans[i].size();j++) ans[i][j] = -1;
      |                       ~~^~~~~~~~~~~~~~~
tickets.cpp:34:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   34 |         for (ll j = m - k;j < ans[i].size();j++){
      |                           ~~^~~~~~~~~~~~~~~

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 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 2 ms 460 KB Output is correct
5 Correct 26 ms 3216 KB Output is correct
6 Correct 619 ms 56188 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 2 ms 440 KB Output is correct
5 Correct 24 ms 2652 KB Output is correct
6 Correct 602 ms 57704 KB Output is correct
7 Correct 633 ms 60756 KB Output is correct
8 Correct 4 ms 588 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 7 ms 852 KB Output is correct
13 Correct 22 ms 2320 KB Output is correct
14 Correct 27 ms 2404 KB Output is correct
15 Correct 612 ms 63004 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 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 3 ms 532 KB Output is correct
5 Correct 35 ms 3616 KB Output is correct
6 Correct 6 ms 844 KB Output is correct
7 Correct 7 ms 1076 KB Output is correct
8 Correct 904 ms 67016 KB Output is correct
9 Correct 842 ms 78408 KB Output is correct
10 Correct 833 ms 77860 KB Output is correct
11 Correct 898 ms 66872 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 2 ms 460 KB Output is correct
3 Correct 2 ms 440 KB Output is correct
4 Correct 3 ms 436 KB Output is correct
5 Correct 3 ms 460 KB Output is correct
6 Correct 3 ms 460 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 3 ms 440 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 4 ms 460 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 2 ms 460 KB Output is correct
3 Correct 2 ms 440 KB Output is correct
4 Correct 3 ms 436 KB Output is correct
5 Correct 3 ms 460 KB Output is correct
6 Correct 3 ms 460 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 332 KB Output is correct
9 Correct 3 ms 440 KB Output is correct
10 Correct 3 ms 460 KB Output is correct
11 Correct 3 ms 460 KB Output is correct
12 Correct 4 ms 460 KB Output is correct
13 Correct 26 ms 3120 KB Output is correct
14 Correct 33 ms 3244 KB Output is correct
15 Correct 31 ms 3284 KB Output is correct
16 Correct 34 ms 3580 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 3 ms 460 KB Output is correct
19 Correct 2 ms 332 KB Output is correct
20 Correct 29 ms 2756 KB Output is correct
21 Correct 33 ms 3300 KB Output is correct
22 Correct 33 ms 2996 KB Output is correct
23 Correct 32 ms 3572 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 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 2 ms 460 KB Output is correct
11 Correct 26 ms 3216 KB Output is correct
12 Correct 619 ms 56188 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 2 ms 440 KB Output is correct
17 Correct 24 ms 2652 KB Output is correct
18 Correct 602 ms 57704 KB Output is correct
19 Correct 633 ms 60756 KB Output is correct
20 Correct 4 ms 588 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 7 ms 852 KB Output is correct
25 Correct 22 ms 2320 KB Output is correct
26 Correct 27 ms 2404 KB Output is correct
27 Correct 612 ms 63004 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 3 ms 532 KB Output is correct
32 Correct 35 ms 3616 KB Output is correct
33 Correct 6 ms 844 KB Output is correct
34 Correct 7 ms 1076 KB Output is correct
35 Correct 904 ms 67016 KB Output is correct
36 Correct 842 ms 78408 KB Output is correct
37 Correct 833 ms 77860 KB Output is correct
38 Correct 898 ms 66872 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 2 ms 460 KB Output is correct
41 Correct 2 ms 440 KB Output is correct
42 Correct 3 ms 436 KB Output is correct
43 Correct 3 ms 460 KB Output is correct
44 Correct 3 ms 460 KB Output is correct
45 Correct 1 ms 332 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 3 ms 440 KB Output is correct
48 Correct 3 ms 460 KB Output is correct
49 Correct 3 ms 460 KB Output is correct
50 Correct 4 ms 460 KB Output is correct
51 Correct 26 ms 3120 KB Output is correct
52 Correct 33 ms 3244 KB Output is correct
53 Correct 31 ms 3284 KB Output is correct
54 Correct 34 ms 3580 KB Output is correct
55 Correct 1 ms 332 KB Output is correct
56 Correct 3 ms 460 KB Output is correct
57 Correct 2 ms 332 KB Output is correct
58 Correct 29 ms 2756 KB Output is correct
59 Correct 33 ms 3300 KB Output is correct
60 Correct 33 ms 2996 KB Output is correct
61 Correct 32 ms 3572 KB Output is correct
62 Correct 69 ms 8428 KB Output is correct
63 Correct 70 ms 8388 KB Output is correct
64 Correct 98 ms 9604 KB Output is correct
65 Correct 325 ms 31528 KB Output is correct
66 Correct 399 ms 35364 KB Output is correct
67 Correct 7 ms 1100 KB Output is correct
68 Correct 6 ms 844 KB Output is correct
69 Correct 655 ms 56172 KB Output is correct
70 Correct 785 ms 58236 KB Output is correct
71 Correct 898 ms 67052 KB Output is correct
72 Correct 796 ms 66920 KB Output is correct
73 Correct 853 ms 63600 KB Output is correct
74 Correct 715 ms 60040 KB Output is correct
75 Correct 801 ms 56780 KB Output is correct