oj.uz

Submission #587954

# Submission time Handle Problem Language Result Execution time Memory
587954 2022-07-02T14:57:27 Z Valaki2 Carnival Tickets (IOI20_tickets) C++14
41 / 100
 480 ms 93124 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;

#define k K
#define x X

#define int long long
#define pb push_back
#define mp make_pair
#define fi first
#define se second

int n, m, k;
int ans_val;
vector<vector<int> > x;
vector<vector<int> > ans;

bool cmp(const int &a, const int &b) {
    return x[a][0] + x[a][m - 1] < x[b][0] + x[b][m - 1];
}

void solve_1_2() {
    vector<int> v(n, 0);
    for(int i = 0; i < n; i++) {
        v[i] = i;
    }
    sort(v.begin(), v.end(), cmp);
    for(int i = 0; i < n / 2; i++) {
        ans[v[i]][0] = 0;
        ans_val -= x[v[i]][0];
    }
    for(int i = n / 2; i < n; i++) {
        ans[v[i]][m - 1] = 0;
        ans_val += x[v[i]][m - 1];
    }
}

void re_sort(vector<pair<int, int> > &v) {
    /*for(auto tmp : v) {
        cout << tmp.fi << " ";
    }
    cout << "\n";*/
    vector<pair<int, int> > w;
    int a = 0, b = n / 2;
    while(a < n / 2 || b < n) {
        if(a == n / 2) {
            w.pb(v[b]);
            b++;
        } else if(b == n) {
            w.pb(v[a]);
            a++;
        } else if(v[a].fi < v[b].fi) {
            w.pb(v[a]);
            a++;
        } else {
            w.pb(v[b]);
            b++;
        }
    }
    v = w;
    /*for(auto tmp : v) {
        cout << tmp.fi << " ";
    }
    cout << "\n";*/
}

void solve_3() {
    vector<pair<int, int> > v(n, mp(0, 0));
    for(int i = 0; i < n; i++) {
        v[i].se = i;
        for(int j = 0; j < m; j++) {
            if(x[i][j]) {
                v[i].fi++;
            }
        }
    }
    sort(v.begin(), v.end());
    vector<vector<int> > which_0(n);
    vector<vector<int> > which_1(n);
    /*for(pair<int, int> y : v) {
        cout << y.fi << " ";
    }
    cout << "\n";*/
    for(int idx = 0; idx < k; idx++) {
        int cnt = 0;
        for(int i = 0; i < n / 2; i++) {
            if(v[i].fi + (int) which_0[v[i].se].size() + (int) which_1[v[i].se].size() < m) {
                which_0[v[i].se].pb(idx);
            } else {
                which_1[v[i].se].pb(idx);
                cnt++;
            }
        }
        for(int i = n / 2; i < n; i++) {
            if(v[i].fi) {
                v[i].fi--;
                which_1[v[i].se].pb(idx);
                cnt++;
            } else {
                which_0[v[i].se].pb(idx);
            }
        }
        ans_val += min(cnt, n - cnt);
        re_sort(v);
    }
    for(int i = 0; i < n; i++) {
        //cout << i << ": ";
        for(int j = 0; j < (int) which_0[i].size(); j++) {
            //cout << which_0[i][j] << " ";
            ans[i][j] = which_0[i][j];
        }
        //cout << "- ";
        for(int j = 0; j < (int) which_1[i].size(); j++) {
            //cout << which_1[i][j] << " ";
            ans[i][m - j - 1] = which_1[i][j];
        }
        //cout << "\n";
    }
}

/*
4 8 4
0 0 0 0 0 1 1 1
0 0 0 0 0 0 0 1
0 0 0 1 1 1 1 1
0 0 0 0 0 0 1 1
*/

#undef k
#undef x
int find_maximum(signed k, vector<vector<signed> > x) {
	n = (int) x.size();
	m = (int) x[0].size();
    K = k;
    X.assign(n, vector<int> (m, -2));
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            X[i][j] = x[i][j];
        }
	}
#define k K
#define x X
	ans.assign(n, vector<int> (m, -1));
	if(k == 1) {
        solve_1_2();
	} else {
        solve_3();
	}
	vector<vector<signed> > real_ans(n, vector<signed> (m, -2));
	for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            real_ans[i][j] = ans[i][j];
        }
	}
	allocate_tickets(real_ans);
	return ans_val;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 2 ms 852 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 2 ms 568 KB Output is correct
5 Correct 23 ms 3796 KB Output is correct
6 Correct 457 ms 87220 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 300 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 20 ms 4036 KB Output is correct
6 Correct 465 ms 88320 KB Output is correct
7 Correct 480 ms 88564 KB Output is correct
8 Correct 3 ms 724 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 7 ms 1236 KB Output is correct
13 Correct 15 ms 3448 KB Output is correct
14 Correct 15 ms 3312 KB Output is correct
15 Correct 476 ms 93124 KB Output is correct

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Contestant returned 11 but the tickets gives a total value of 3
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Contestant returned 11 but the tickets gives a total value of 3
2 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Contestant returned 11 but the tickets gives a total value of 3
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 2 ms 852 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 2 ms 568 KB Output is correct
11 Correct 23 ms 3796 KB Output is correct
12 Correct 457 ms 87220 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 300 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 20 ms 4036 KB Output is correct
18 Correct 465 ms 88320 KB Output is correct
19 Correct 480 ms 88564 KB Output is correct
20 Correct 3 ms 724 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 7 ms 1236 KB Output is correct
25 Correct 15 ms 3448 KB Output is correct
26 Correct 15 ms 3312 KB Output is correct
27 Correct 476 ms 93124 KB Output is correct
28 Incorrect 1 ms 212 KB Contestant returned 11 but the tickets gives a total value of 3
29 Halted 0 ms 0 KB -