oj.uz

Submission #300603

# Submission time Handle Problem Language Result Execution time Memory
300603 2020-09-17T10:18:59 Z muhammad_hokimiyon Carnival Tickets (IOI20_tickets) C++14
16 / 100
 772 ms 52716 KB 
#include "tickets.h"
#include <vector>
#include <bits/stdc++.h>

#define fi first
#define se second
#define ll long long

using namespace std;

long long find_maximum(int k, vector<vector<int>> X) {
	int n = X.size();
	int m = X[0].size();
	ll res1 = 0;
	vector < int > ls( m , m - 1 ) , st( m , 0 );
    vector < vector < int > > ans( n , vector < int > (m , -1) );
    for( int it = 0; it < k; it++ ){
        vector < pair < ll , int > > res;
        ll cnt = 0;
        for( int i = 0; i < n; i++ ){
            res.push_back({ -X[i][st[i]] - X[i][ls[i]] , i });
            cnt += X[i][ls[i]];
        }
        sort( res.rbegin() , res.rend() );
        for( int i = 0; i < n / 2; i++ ){
            ans[res[i].se][st[res[i].se]++] = it;
            cnt += res[i].fi;
        }
        for( int i = n / 2; i < n; i++ ){
            ans[res[i].se][ls[res[i].se]--] = it;
        }
        res1 += cnt;
    }
    allocate_tickets( ans );
    return res1;
}

Subtask #1
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Runtime error 1 ms 384 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 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 30 ms 2424 KB Output is correct
6 Correct 772 ms 51396 KB Output is correct

Subtask #3
0 / 14.0

# 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 1 ms 256 KB Output is correct
4 Correct 3 ms 512 KB Output is correct
5 Correct 24 ms 2432 KB Output is correct
6 Correct 645 ms 52552 KB Output is correct
7 Correct 676 ms 52716 KB Output is correct
8 Correct 4 ms 512 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Incorrect 1 ms 256 KB Contestant returned 43 while correct return value is 45.
11 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 288 KB Contestant returned 11 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 256 KB Contestant returned 11 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 256 KB Contestant returned 11 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 256 KB Output is correct
2 Runtime error 1 ms 384 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -