AtCoder Grand Contest 018

Submission #1449483

Source codeソースコード

#include <iostream>
#include <sstream>
#include <fstream>

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <cstring>

#include <algorithm>
#include <numeric>
#include <functional>
#include <string>
#include <vector>
#include <deque>
#include <stack>
#include <queue>
#include <list>
#include <map>
// #include <unordered_map>
#include <set>
#include <utility>
#include <bitset>
#include <limits>
#include <climits>
using namespace std;

#ifdef DEBUG
#define NDEBUG
#include "cout11.h"
#endif
#undef NDEBUG
#include <cassert>

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))

vector<int> a, b, c;
ll solve(int x, int y, int z) {
    int n = x+y+z;
    ll base = 0;
    rep(i,n) base += (ll)a[i];

    priority_queue<ii> pq1, pq2;
    rep(i,n) {
        pq1.push(ii(b[i]-a[i], i));
    }
    rep(i,n) {
        pq2.push(ii(c[i]-a[i], i));
    }
    vector<int> visitcnt(n, 0);
    rep(i,y) {
        ii f = pq1.top(); pq1.pop();
        base += (ll)f.first;
        visitcnt[f.second]++;
    }
    rep(i,z) {
        ii f = pq2.top(); pq2.pop();
        base += (ll)f.first;
        visitcnt[f.second]++;
    }
    while (true) {
        int dbl = 0;
        rep(i, n) {
            assert(0 <= visitcnt[i] && visitcnt[i] <= 2);
            if (visitcnt[i] == 2) {
                ++dbl;
                int db = b[i] - a[i], dc = c[i] - a[i];
                auto nb = pq1.top(), nc = pq2.top();
                if (nb.first - db > nc.first - dc) {
                    pq1.pop();
                    visitcnt[nb.second]++;
                    base += nb.first - db;
                } else {
                    pq2.pop();
                    visitcnt[nc.second]++;
                    base += nc.first - dc;
                }
                visitcnt[i]--;
            }
        }
        if (dbl == 0) break;
    }
    return base;
}

int main() {
    int x,y,z; cin>>x>>y>>z;
    int n=x+y+z;
    a.resize(n);
    b.resize(n);
    c.resize(n);
    rep(i,n){
        cin>>a[i]>>b[i]>>c[i];
    }
    ll ans = solve(x,y,z);
    cout << ans << endl;
    return 0;
}

Submission

Task問題 C - Coins
User nameユーザ名 naoya_t
Created time投稿日時
Language言語 C++14 (GCC 5.4.1)
Status状態 WA
Score得点 0
Source lengthソースコード長 3029 Byte
File nameファイル名
Exec time実行時間 ms
Memory usageメモリ使用量 -

Test case

Set

Set name Score得点 / Max score Cases
Sample - sample_01.txt,sample_02.txt,sample_03.txt
All 0 / 800 sample_01.txt,sample_02.txt,sample_03.txt,sample_01.txt,sample_02.txt,sample_03.txt,subtask_1_01.txt,subtask_1_02.txt,subtask_1_03.txt,subtask_1_04.txt,subtask_1_05.txt,subtask_1_06.txt,subtask_1_07.txt,subtask_1_08.txt,subtask_1_09.txt,subtask_1_10.txt,subtask_1_11.txt,subtask_1_12.txt,subtask_1_13.txt,subtask_1_14.txt,subtask_1_15.txt,subtask_1_16.txt,subtask_1_17.txt,subtask_1_18.txt,subtask_1_19.txt,subtask_1_20.txt,subtask_1_21.txt,subtask_1_22.txt,subtask_1_23.txt,subtask_1_24.txt,subtask_1_25.txt,subtask_1_26.txt,subtask_1_27.txt,subtask_1_28.txt,subtask_1_29.txt

Test case

Case name Status状態 Exec time実行時間 Memory usageメモリ使用量
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
subtask_1_01.txt AC 1 ms 256 KB
subtask_1_02.txt WA
subtask_1_03.txt AC 42 ms 1276 KB
subtask_1_04.txt WA
subtask_1_05.txt WA
subtask_1_06.txt WA
subtask_1_07.txt AC 25 ms 1020 KB
subtask_1_08.txt WA
subtask_1_09.txt AC 22 ms 1020 KB
subtask_1_10.txt AC 82 ms 3188 KB
subtask_1_11.txt WA
subtask_1_12.txt AC 134 ms 3700 KB
subtask_1_13.txt WA
subtask_1_14.txt WA
subtask_1_15.txt WA
subtask_1_16.txt AC 849 ms 3700 KB
subtask_1_17.txt WA
subtask_1_18.txt WA
subtask_1_19.txt AC 116 ms 3700 KB
subtask_1_20.txt WA
subtask_1_21.txt AC 133 ms 3700 KB
subtask_1_22.txt WA
subtask_1_23.txt AC 128 ms 3700 KB
subtask_1_24.txt WA
subtask_1_25.txt AC 115 ms 3700 KB
subtask_1_26.txt WA
subtask_1_27.txt WA
subtask_1_28.txt WA
subtask_1_29.txt AC 1 ms 256 KB