Submission #303205

# Submission time Handle Problem Language Result Execution time Memory
303205 2020-09-20T01:41:40 Z 12tqian Carnival Tickets (IOI20_tickets) C++14
100 / 100
1501 ms 54776 KB
#ifdef LOCAL
#else
#include "tickets.h"
#endif
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

#ifdef LOCAL
#define dbg(...) debug(#__VA_ARGS__, __VA_ARGS__);
#else
#define dbg(...) 17;
#endif

template<typename T, typename S> ostream& operator << (ostream &os, const pair<T, S> &p) { return os << "(" << p.first << ", " << p.second << ")"; }
template<typename C, typename T = decay<decltype(*begin(declval<C>()))>, typename enable_if<!is_same<C, string>::value>::type* = nullptr>
ostream& operator << (ostream &os, const C &c) { bool f = true; os << "{"; for (const auto &x : c) { if (!f) os << ", "; f = false; os << x; } return os << "}"; }
template<typename T> void debug(string s, T x) { cerr << s << " = " << x << "\n"; }
template<typename T, typename... Args> void debug(string s, T x, Args... args) { cerr << s.substr(0, s.find(',')) << " = " << x << " | "; debug(s.substr(s.find(',') + 2), args...); }
#ifdef LOCAL
void allocate_tickets(vector<vector<int>> s) {
    return;
}
#else
#endif

ll find_maximum(int k, vector<vector<int>> x) {
    const ll INF = 1e15;
    int n = x.size();
    int m = x[0].size();
    vector<vector<int>> res(n, vector<int>(m, -1));
    vector<int> lef(n);
    for (int i = 0; i < n; i++) {
        if (i % 2 == 0) {
            lef[i] = k / 2;
        } else {
            lef[i] = k - k / 2;
        }
    }
    set<array<ll, 2>> shift_left;
    set<array<ll, 2>> shift_right;
    auto calc_right = [&](int id) -> ll {
        // you want to move something to minus
        if (lef[id] == k) {
            // never advantageous
            return INF;
        } else {
            // what you'll get
            int rig = k - lef[id];
            return x[id][lef[id]] + x[id][m - rig];
        }
    };
    auto calc_left = [&](int id) -> ll {
        // you want to move something to plus
        if (lef[id] == 0) {
            return -INF;
        } else {
            int rig = k - lef[id];
            return x[id][lef[id] - 1] + x[id][m - rig - 1];
        }
    };
    auto modify = [&](int id, int change) {
        ll l = calc_left(id);
        ll r = calc_right(id);
        shift_left.erase({l, id});
        shift_right.erase({r, id});
        lef[id] += change;
        l = calc_left(id);
        r = calc_right(id);
        shift_left.insert({l, id});
        shift_right.insert({r, id});
    };
    for (int i = 0; i < n; i++) {
        shift_left.insert({calc_left(i), i});
        shift_right.insert({calc_right(i), i});
    }
    while (*shift_right.begin() < *shift_left.rbegin()) {
        int add = (*shift_right.begin())[1];
        int sub = (*shift_left.rbegin())[1];
        modify(sub, -1);
        modify(add, 1);
    }
    ll ans = 0;
    vector<array<int, 3>> neg;
    vector<array<int, 3>> pos;
    vector<int> neg_filled(k);
    vector<int> pos_filled(k);
    set<pair<int, int>> diff;
    for (int i = 0; i < k; i++) {
        diff.emplace(0, i);
    }
    for (int i = 0; i < n; i++) {
        int l = lef[i];
        int r = k - lef[i];
        vector<pair<int, int>> L;
        vector<pair<int, int>> R;
        auto beg = diff.begin();
        auto fin = prev(diff.end());
        while (R.size() < r) {
            R.push_back(*beg);
            if (R.size() == r) {
                break;
            }
            beg = next(beg);
        }
        while (L.size() < l) {
            L.push_back(*fin);
            if (L.size() == l) {
                break;
            }
            fin = prev(fin);
        }
        auto change = [&](pair<int, int> x, int delta) {
            diff.erase(x);
            x.first += delta;
            diff.insert(x);
        };
        int it = 0;
        for (auto y: L) {
            change(y, -1);
            res[i][it] = y.second;
            ans -= x[i][it];
            it++;
        }
        it = m - 1;
        for (auto y: R) {
            change(y, 1);
            res[i][it] = y.second;
            ans += x[i][it];
            it--;
        }
    }
    allocate_tickets(res);
    return ans;

}
#ifdef LOCAL
int main() {
//    freopen("file.in", "r", stdin);
//    string line; cin >> line;
    int n, m, k; cin >> n >> m >> k;
    vector<vector<int>> s(n, vector<int>(m, 0));
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            cin >> s[i][j];
        }
    }
    cout << find_maximum(k, s) << '\n';;
    return 0;
}
#else
#endif

Compilation message

tickets.cpp: In function 'll find_maximum(int, std::vector<std::vector<int> >)':
tickets.cpp:99:25: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   99 |         while (R.size() < r) {
      |                ~~~~~~~~~^~~
tickets.cpp:101:26: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  101 |             if (R.size() == r) {
      |                 ~~~~~~~~~^~~~
tickets.cpp:106:25: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  106 |         while (L.size() < l) {
      |                ~~~~~~~~~^~~
tickets.cpp:108:26: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  108 |             if (L.size() == l) {
      |                 ~~~~~~~~~^~~~
# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 3 ms 896 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 30 ms 2424 KB Output is correct
6 Correct 745 ms 51576 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 43 ms 2424 KB Output is correct
6 Correct 1039 ms 52752 KB Output is correct
7 Correct 1049 ms 53240 KB Output is correct
8 Correct 5 ms 512 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 11 ms 896 KB Output is correct
13 Correct 37 ms 2168 KB Output is correct
14 Correct 39 ms 2176 KB Output is correct
15 Correct 1222 ms 54004 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 4 ms 512 KB Output is correct
5 Correct 52 ms 2552 KB Output is correct
6 Correct 9 ms 768 KB Output is correct
7 Correct 11 ms 1024 KB Output is correct
8 Correct 1269 ms 54516 KB Output is correct
9 Correct 1356 ms 50900 KB Output is correct
10 Correct 1378 ms 50964 KB Output is correct
11 Correct 1501 ms 54592 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 4 ms 512 KB Output is correct
10 Correct 4 ms 512 KB Output is correct
11 Correct 4 ms 512 KB Output is correct
12 Correct 5 ms 512 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 4 ms 512 KB Output is correct
6 Correct 4 ms 512 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 4 ms 512 KB Output is correct
10 Correct 4 ms 512 KB Output is correct
11 Correct 4 ms 512 KB Output is correct
12 Correct 5 ms 512 KB Output is correct
13 Correct 31 ms 2424 KB Output is correct
14 Correct 32 ms 2432 KB Output is correct
15 Correct 42 ms 2424 KB Output is correct
16 Correct 51 ms 2552 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 4 ms 512 KB Output is correct
19 Correct 2 ms 512 KB Output is correct
20 Correct 44 ms 2424 KB Output is correct
21 Correct 47 ms 2424 KB Output is correct
22 Correct 52 ms 2552 KB Output is correct
23 Correct 55 ms 2424 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 3 ms 896 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 30 ms 2424 KB Output is correct
12 Correct 745 ms 51576 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 3 ms 512 KB Output is correct
17 Correct 43 ms 2424 KB Output is correct
18 Correct 1039 ms 52752 KB Output is correct
19 Correct 1049 ms 53240 KB Output is correct
20 Correct 5 ms 512 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 0 ms 256 KB Output is correct
23 Correct 1 ms 256 KB Output is correct
24 Correct 11 ms 896 KB Output is correct
25 Correct 37 ms 2168 KB Output is correct
26 Correct 39 ms 2176 KB Output is correct
27 Correct 1222 ms 54004 KB Output is correct
28 Correct 1 ms 256 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 1 ms 256 KB Output is correct
31 Correct 4 ms 512 KB Output is correct
32 Correct 52 ms 2552 KB Output is correct
33 Correct 9 ms 768 KB Output is correct
34 Correct 11 ms 1024 KB Output is correct
35 Correct 1269 ms 54516 KB Output is correct
36 Correct 1356 ms 50900 KB Output is correct
37 Correct 1378 ms 50964 KB Output is correct
38 Correct 1501 ms 54592 KB Output is correct
39 Correct 1 ms 256 KB Output is correct
40 Correct 3 ms 512 KB Output is correct
41 Correct 3 ms 512 KB Output is correct
42 Correct 3 ms 512 KB Output is correct
43 Correct 4 ms 512 KB Output is correct
44 Correct 4 ms 512 KB Output is correct
45 Correct 1 ms 384 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 4 ms 512 KB Output is correct
48 Correct 4 ms 512 KB Output is correct
49 Correct 4 ms 512 KB Output is correct
50 Correct 5 ms 512 KB Output is correct
51 Correct 31 ms 2424 KB Output is correct
52 Correct 32 ms 2432 KB Output is correct
53 Correct 42 ms 2424 KB Output is correct
54 Correct 51 ms 2552 KB Output is correct
55 Correct 1 ms 384 KB Output is correct
56 Correct 4 ms 512 KB Output is correct
57 Correct 2 ms 512 KB Output is correct
58 Correct 44 ms 2424 KB Output is correct
59 Correct 47 ms 2424 KB Output is correct
60 Correct 52 ms 2552 KB Output is correct
61 Correct 55 ms 2424 KB Output is correct
62 Correct 84 ms 6136 KB Output is correct
63 Correct 89 ms 6136 KB Output is correct
64 Correct 142 ms 6400 KB Output is correct
65 Correct 461 ms 23672 KB Output is correct
66 Correct 548 ms 24192 KB Output is correct
67 Correct 11 ms 1024 KB Output is correct
68 Correct 9 ms 768 KB Output is correct
69 Correct 745 ms 51704 KB Output is correct
70 Correct 995 ms 52728 KB Output is correct
71 Correct 1237 ms 54776 KB Output is correct
72 Correct 1250 ms 52472 KB Output is correct
73 Correct 1365 ms 52728 KB Output is correct
74 Correct 964 ms 51064 KB Output is correct
75 Correct 1103 ms 51136 KB Output is correct