oj.uz

Submission #433367

# Submission time Handle Problem Language Result Execution time Memory
433367 2021-06-19T16:18:45 Z OttoTheDino Carnival Tickets (IOI20_tickets) C++17
11 / 100
 2 ms 716 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;

#define rep(i,s,e)                  for (int i = s; i <= e; ++i)
#define rrep(i,s,e)                 for (int i = s; i >= e; --i)
#define pb                          push_back
#define pf                          push_front
#define fi                          first
#define se                          second
#define all(a)                      a.begin(), a.end()
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<char> vc;
typedef vector<ll> vll;


ll find_maximum(int k, vector<vi> x) {
	int n = x.size();
	int m = x[0].size();
    ll ans = 0;
    vector<vector<int>> answer(n, vector<int>(m, -1));

    rep (i,0,m-1) {
        vi one_set;
        if (i<k) {
            rep (j,0,n-1) {
                one_set.pb(x[j][i]);
                answer[j][i] = i;
            }
            sort(all(one_set));
            rep (j,0,n-1) ans += abs(one_set[j]-one_set[n/2]);
        }
        else rep (j,0,n-1) answer[j][i] = -1;
    }

	allocate_tickets(answer);

	return ans;
}

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
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Contestant returned 292273026 while correct return value is 860858182.
2 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Contestant returned 2 while correct return value is 6.
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Contestant returned 5 while correct return value is 13.
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Contestant returned 5 while correct return value is 13.
2 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Contestant returned 5 while correct return value is 13.
2 Halted 0 ms 0 KB -

Subtask #7
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 Incorrect 0 ms 204 KB Contestant returned 292273026 while correct return value is 860858182.
8 Halted 0 ms 0 KB -