답안 #152548

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
152548	2019-09-08T11:29:26 Z	PedroBigMan	Hokej (COCI17_hokej)	C++14	84 / 120	324 ms	65540 KB

hokej

#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define REP(i,a,b) for(ll i=a; i<b; i++)
#define pb push_back
#define mp make_pair
#define pl pair<ll,ll>
#define ff first
#define ss second
#define INF ((ll) pow(2,63) -1)
ll insig;
#define In(vecBRO, LENBRO) REP(IBRO,0,LENBRO) {cin>>insig; vecBRO.pb(insig);}
void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll M,N; cin>>M>>N; vector<pl> p; vector<pair<pl,ll> > pc; ll cur1,cur2;
    REP(i,0,N) {cin>>cur1>>cur2; p.pb(mp(cur1,cur2)); pc.pb(mp(mp(cur1,cur2),i));}
    sort(p.begin(),p.end()); sort(pc.begin(),pc.end());
    reverse(p.begin(),p.end()); reverse(pc.begin(),pc.end());
    vector<ll> per; REP(i,0,N) {per.pb(0);}
    REP(i,0,N) {per[i]=pc[i].ss;}
    vector<vector<ll> > m; vector<ll> xxxx; REP(i,0,M) {xxxx.pb(0);} REP(i,0,6) {m.pb(xxxx);}
    ll msta; ll curc,curr; curr=0; curc=0; bool endi=false;
    REP(i,0,INF)
    {
        msta=p[i].ss;
        while(msta>0)
        {
            if(curc<M) {m[curr][curc]=i; curc++;}
            else {curr++; if(curr==6) {endi=true; break;} curc=0; m[curr][curc]=i; curc++;}
            msta--;
        }
        if(endi) {break;}
    }
    vector<vector<ll> > at; xxxx.clear(); REP(i,0,6) {xxxx.pb(0);} REP(i,0,M) {at.pb(xxxx);}
    ll ans=0;
    REP(i,0,M) {REP(j,0,6) {at[i][j]=m[j][i]; ans+=p[m[j][i]].ff;}}
    vector<ll> tr; tr.pb(0); tr.pb(0); tr.pb(0); vector<vector<ll> > sub; vector<bool> in1,in2; 
    REP(i,0,6) {in1.pb(true);in2.pb(true);}
    REP(i,0,M-1)
    {
        REP(j,0,6) {in1[j]=false; in2[j]=false;}
        REP(j,0,6) 
        {
            REP(z,0,6) 
            {
                if(at[i][j]==at[i+1][z]) {in1[j]=true; in2[z]=true;}
            }
        }
        REP(j,0,6)
        {
            REP(z,0,6)
            {
                if(!in1[j] && !in2[z]) {tr[0]=i+1; tr[1]=at[i][j]; tr[2]=at[i+1][z]; sub.pb(tr); in1[j]=true; in2[z]=true;}
            }
        }
    }
    cout<<ans<<endl;
    REP(i,0,6)
    {
        cout<<per[at[0][i]]+1<<" ";
    }
    cout<<endl;
    cout<<sub.size()<<endl;
    REP(i,0,sub.size())
    {
        cout<<sub[i][0]<<" "<<per[sub[i][1]]+1<<" "<<per[sub[i][2]]+1<<endl;
    }
    return 0;
}

Compilation message

hokej.cpp: In function 'void Out(std::vector<long long int>)':
hokej.cpp:10:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define REP(i,a,b) for(ll i=a; i<b; i++)
hokej.cpp:19:29:
 void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}
                             ~~~~~~~~~~~~
hokej.cpp:19:25: note: in expansion of macro 'REP'
 void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}
                         ^~~
hokej.cpp: In function 'int main()':
hokej.cpp:10:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define REP(i,a,b) for(ll i=a; i<b; i++)
hokej.cpp:74:9:
     REP(i,0,sub.size())
         ~~~~~~~~~~~~~~           
hokej.cpp:74:5: note: in expansion of macro 'REP'
     REP(i,0,sub.size())
     ^~~

Subtask #1

84.0 / 120.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	6 ms	1020 KB	Output is correct
3	Runtime error	110 ms	65536 KB	Execution killed with signal 9 (could be triggered by violating memory limits)
4	Correct	3 ms	632 KB	Output is correct
5	Correct	78 ms	29312 KB	Output is correct
6	Correct	7 ms	632 KB	Output is correct
7	Correct	7 ms	1116 KB	Output is correct
8	Correct	87 ms	12796 KB	Output is correct
9	Runtime error	324 ms	65540 KB	Execution killed with signal 9 (could be triggered by violating memory limits)
10	Runtime error	319 ms	65536 KB	Execution killed with signal 9 (could be triggered by violating memory limits)