oj.uz

답안 #834193

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
834193 2023-08-22T11:44:03 Z andrey27_sm 카니발 티켓 (IOI20_tickets) C++17
25 / 100
 841 ms 174708 KB 
#include "tickets.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
bool is_max[1501][1501];
set<int> a[1501];
int cnt[1501];
long long find_maximum(int k, vector<vector<int>> d) {
    int n = d.size();
    int m = d[0].size();
    int cnt0 = 0;
    for (int i = 0; i < n; ++i){
        int c0 = 0;
        int c1 = 0;
        for (int j = 0; j < m; ++j){
            c0+=1-d[i][j];
            c1+=d[i][j];
        }
        c0 = min(c0,k);
        c1 = min(c1,k);
        cnt0+=c0-c1;
    }
  	
    if(cnt0 > 0 or n*k > 10){
        vector<vector<int>> ans(d.size(),vector<int>(d[0].size(),-1));
        ll sum = 0;
        vector<pair<int,pair<int,int>>> vals;
        for (int i = 0; i < n; ++i)
        {
            for (int j = 0; j < m; ++j)
            {
                vals.push_back({d[i][j],{i,j}});
                a[i].insert(j);
            }
        }
        sort(vals.begin(),vals.end());
        reverse(vals.begin(),vals.end());
        int last_max = 0;
        int J = 0;
        for (int i = 0; i < n*k/2+J; ++i)
        {
            if(cnt[vals[i].second.first] == k){
                J++;
                continue;
            }
            cnt[vals[i].second.first]++;
            //cout << "TAKE " << vals[i].second.first << " " << vals[i].second.second << "\n";
            is_max[vals[i].second.first][vals[i].second.second] = 1;
        }
        for (int i = 0; i < n; ++i)
        {
            for (int j = 0; j < m; ++j)
            {
                if(is_max[i][j]){
                    sum+=d[i][j];
                    a[i].erase(last_max);
                    ans[i][j] = last_max++;
                    last_max%=k;
                }
            }
        }
        for (int i = 0; i < n; ++i)
        {
            for (int j = 0; j+cnt[i] < k; ++j)
            {
                sum-=d[i][j];
                ans[i][j] = *a[i].begin();
                a[i].erase(a[i].begin());
            }
        }
        allocate_tickets(ans);
        return sum;
    }
    vector<vector<int>> ans(d.size(),vector<int>(d[0].size(),-1));
    ll sum = 0;
    vector<pair<int,pair<int,int>>> vals;
    for (int i = 0; i < n; ++i)
    {
        for (int j = 0; j < m; ++j)
        {
            vals.push_back({d[i][j],{i,j}});
            a[i].insert(j);
        }
    }
    sort(vals.begin(),vals.end());
    int last_max = 0;
    int J = 0;
    for (int i = 0; i < n*k/2+J; ++i)
    {
        if(cnt[vals[i].second.first] == k){
            J++;
            continue;
        }
        cnt[vals[i].second.first]++;
        is_max[vals[i].second.first][vals[i].second.second] = 1;
    }
    for (int i = 0; i < n; ++i)
    {
        for (int j = 0; j < m; ++j)
        {
            if(is_max[i][j]){
                sum+=d[i][j];
                a[i].erase(last_max);
                ans[i][j] = last_max++;
                last_max%=k;
            }
        }
    }
    for (int i = 0; i < n; ++i)
    {
        for (int j = 0; j+cnt[i] < k; ++j)
        {
            sum-=d[i][m-1-j];
            ans[i][m-1-j] = *a[i].begin();
            a[i].erase(a[i].begin());
        }
    }
    allocate_tickets(ans);
    return -sum;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 2 ms 2516 KB Output is correct

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Incorrect 0 ms 340 KB Contestant returned 2307346107 while correct return value is 2727881086.
3 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 340 KB Contestant returned 4 while correct return value is 6.
2 Halted 0 ms 0 KB -

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 2 ms 900 KB Output is correct
5 Correct 31 ms 7176 KB Output is correct
6 Correct 6 ms 1364 KB Output is correct
7 Correct 6 ms 3668 KB Output is correct
8 Correct 832 ms 174708 KB Output is correct
9 Correct 767 ms 172868 KB Output is correct
10 Correct 780 ms 172872 KB Output is correct
11 Correct 841 ms 174596 KB Output is correct

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Incorrect 2 ms 980 KB Contestant returned 39312626459 while correct return value is 39376297182.
3 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Incorrect 2 ms 980 KB Contestant returned 39312626459 while correct return value is 39376297182.
3 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 2 ms 2516 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Incorrect 0 ms 340 KB Contestant returned 2307346107 while correct return value is 2727881086.
9 Halted 0 ms 0 KB -