답안 #373374

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
373374	2021-03-04T10:41:08 Z	Atill83	Hokej (COCI17_hokej)	C++14	120 / 120	595 ms	39928 KB

hokej

#include <bits/stdc++.h>
#define ff first
#define ss second
#define endl '\n'
using namespace std;
const long long INF = (long long) 1e18;
const int mod = (int) 1e9+7;
const int MAXN = (int) 5e5+5;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
ll n, m;
pll p[MAXN];
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);

    #ifdef Local
        freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/int.txt","r",stdin);
        freopen("C:/Users/Admin/Desktop/Yazilim/C/IO/out.txt","w",stdout);
    #endif

    cin>>m>>n;

    multiset<pair<pii, int>> vc;

    for(int i = 0; i < n; i++){
        cin>>p[i].ff>>p[i].ss;
        vc.insert({p[i], i});
    }



    vector<int> start(6, -1);
    vector<pair<int, pii>> islem;
    ll ans = 0;
    for(int i = 0; i < 6; i++){
        if(start[i] != -1)
            continue;
        //cerr<<i<<endl;
        int rem = m, pre = -1;

        while(rem > 0){    
            
            pair<pii, int> u = *prev(vc.end());
            vc.erase(prev(vc.end()));
            int time = m - rem;

            u.ff.ss %= mod;
            if(u.ff.ss == m){
                int idx = i + 1;
                while(idx < 6 && start[idx] != -1)
                    idx++;
                //cerr<<u.ss<<" "<<idx<<endl;
                if(idx != 6){
                    start[idx] = u.ss;
                    ans += 1LL * m * u.ff.ff;
                    continue;
                }
            }

            int df = min(rem, u.ff.ss);
            rem -= df;
            u.ff.ss -= df;
            ans += 1LL * u.ff.ff * df;
            if(u.ff.ss == 0){
                if(pre == -1)
                    start[i] = u.ss;
                else
                    islem.push_back({time, {pre, u.ss}});
            }else{
                islem.push_back({time, {pre, u.ss}});
                u.ff.ss += mod;
                vc.insert(u);
            }
            pre = u.ss;
        }
    }

    cout<<ans<<endl;

    for(int i = 0; i < 6; i++)
        cout<<start[i] + 1<<" ";
    cout<<endl;

    cout<<islem.size()<<endl;
    sort(islem.begin(), islem.end());
    for(auto u: islem)
        cout<<u.ff<<" "<<u.ss.ff + 1<<" "<<u.ss.ss + 1<<endl;

    #ifdef Local
        cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
    #endif
}

Subtask #1

120.0 / 120.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	3 ms	748 KB	Output is correct
3	Correct	13 ms	2284 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	6 ms	1132 KB	Output is correct
6	Correct	2 ms	620 KB	Output is correct
7	Correct	5 ms	1004 KB	Output is correct
8	Correct	86 ms	8500 KB	Output is correct
9	Correct	595 ms	39916 KB	Output is correct
10	Correct	576 ms	39928 KB	Output is correct