oj.uz

Submission #427030

# Submission time Handle Problem Language Result Execution time Memory
427030 2021-06-14T11:55:19 Z zoooma13 Carnival Tickets (IOI20_tickets) C++14
25 / 100
 1126 ms 111352 KB 
#include "bits/stdc++.h"
#include "tickets.h"
using namespace std;

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

pair <int64_t ,vector <vector <int>>> construct(vector <int> pref){
    assert(pref.size() == n && accumulate(pref.begin() ,pref.end() ,0) == n*k/2);

    vector <array <int ,3>> fh ,sh;
    for(int i = 0; i < n; i++){
        for(int j = 0; j < pref[i]; j++)
            fh.push_back({x[i][j] ,i ,j});
        for(int j = m-1; j >= m - (k-pref[i]); j--)
            sh.push_back({x[i][j] ,i ,j});
    }

    sort(fh.begin() ,fh.end() ,[](auto&i ,auto&j){ return i[1] < j[1]; });
    sort(sh.begin() ,sh.end() ,[](auto&i ,auto&j){ return i[1] < j[1]; });

    int64_t tot = 0;
	vector<vector<int>> answer(n ,vector<int>(m ,-1));
    vector<bitset<1501>> taken(n);
    for(auto&bs : taken) bs.set();
    int round_number = 0;
    for(auto&c : fh){
        tot -= c[0];
        answer[c[1]][c[2]] = round_number;
        taken[c[1]][round_number] = false;
        round_number = (round_number+1 == k? 0 : round_number+1);
    }
    vector <int> pos(n ,-1);
    for(auto&c : sh){
        tot += c[0];
        pos[c[1]] = taken[c[1]]._Find_next(pos[c[1]]);
        answer[c[1]][c[2]] = pos[c[1]];
    }
    return {tot ,answer};
}

long long find_maximum(int _k, vector<vector<int>> _x) {
    x = _x;
    n = x.size();
    m = x[0].size();
    k = _k;

    vector <array <int ,2>> all; //{val ,color ,index}
    for(int i = 0; i < n; i++)
    for(int j = 0; j < m; j++)
        all.push_back({x[i][j] ,i});
    sort(all.begin() ,all.end());

    int coll = 0;
    vector <int> pref(n ,0);
    for(auto&c : all){
        if(pref[c[1]] < k)
            pref[c[1]]++ ,coll++;
        if(2*coll == n*k)
            break;
    }

	auto ans = construct(pref);
	allocate_tickets(ans.second);
    return ans.first;
}

Compilation message

In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from tickets.cpp:1:
tickets.cpp: In function 'std::pair<long int, std::vector<std::vector<int> > > construct(std::vector<int>)':
tickets.cpp:9:24: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
    9 |     assert(pref.size() == n && accumulate(pref.begin() ,pref.end() ,0) == n*k/2);
      |            ~~~~~~~~~~~~^~~~

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 972 KB Output is correct

Subtask #2
0 / 16.0

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

Subtask #3
0 / 14.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 Incorrect 1 ms 292 KB Contestant returned 23 while correct return value is 25.
4 Halted 0 ms 0 KB -

Subtask #4
14.0 / 14.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 4 ms 588 KB Output is correct
5 Correct 48 ms 4092 KB Output is correct
6 Correct 7 ms 844 KB Output is correct
7 Correct 8 ms 1368 KB Output is correct
8 Correct 1053 ms 110192 KB Output is correct
9 Correct 999 ms 111352 KB Output is correct
10 Correct 1045 ms 95216 KB Output is correct
11 Correct 1126 ms 102096 KB Output is correct

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 3 ms 528 KB Contestant returned 39141745836 while correct return value is 39376297182.
3 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 3 ms 528 KB Contestant returned 39141745836 while correct return value is 39376297182.
3 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 972 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Incorrect 1 ms 204 KB Contestant returned 2307346107 while correct return value is 2727881086.
9 Halted 0 ms 0 KB -