oj.uz

Submission #317937

# Submission time Handle Problem Language Result Execution time Memory
317937 2020-10-30T22:57:23 Z nickmet2004 Carnival Tickets (IOI20_tickets) C++14
27 / 100
 750 ms 51448 KB 
#include<bits/stdc++.h>
#include "tickets.h"
using namespace std;
int cnt[1505];
int n , m ,k;
vector<vector<int>>a;

long long find_maximum(int k , vector<vector<int>> a){
    int n = a.size() , m = a[0].size();
    /// nk/2 maximums - nk/2 minimums
    priority_queue<pair<int , int>> pq;
    long long ans = 0;
    for(int i = 0; i < n; ++i){
        for(int j = 0; j < k; ++j) ans += a[i][m - j - 1] ,pq.emplace(-a[i][j] - a[i][m - k + j] , i);
    }
    for(int i = 0; i < n * k / 2; ++i){
        auto x = pq.top(); pq.pop();
        cnt[x.second]++;
        ans += x.first;
    }
    vector<vector<int>> r(n , vector<int>(m , -1));
    for(int i = 0; i < n; ++i){
        int x = 0;
        for(int j = 0; j < cnt[i]; ++j) r[i][j] = x++;
        x %= k;
        for(int j = m - k + cnt[i]; j < m; ++j)r[i][j] = x++;
    }
    allocate_tickets(r);
    return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 416 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 768 KB Output is correct

Subtask #2
16.0 / 16.0

# 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 3 ms 512 KB Output is correct
5 Correct 31 ms 2424 KB Output is correct
6 Correct 750 ms 51448 KB Output is correct

Subtask #3
0 / 14.0

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

Subtask #4
0 / 14.0

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

Subtask #5
0 / 12.0

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

Subtask #6
0 / 23.0

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

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 1 ms 416 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 2 ms 768 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 3 ms 512 KB Output is correct
11 Correct 31 ms 2424 KB Output is correct
12 Correct 750 ms 51448 KB Output is correct
13 Incorrect 1 ms 256 KB Contestant returned 2 but the tickets gives a total value of 6
14 Halted 0 ms 0 KB -