답안 #472854

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
472854	2021-09-14T12:07:21 Z	SaraMostafa	Hokej (COCI17_hokej)	C++14	0 / 120	639 ms	40192 KB

hokej

#include <bits/stdc++.h>
#include<unordered_map>
using namespace std;
#define ll long long
#define endl "\n"
#define Sara ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
const long long mod=998244353;
const double PI=acos(-1);
struct sub
{
    ll t,a,b;
    sub(ll ti,ll ai,ll bi)
    {
        t=ti;
        a=ai;
        b=bi;
    }
};
int main()
{
    //freopen("input.in","r",stdin);
    Sara

    ll m,n;
    cin>>m>>n;
    vector<pair<ll,ll>>v(n);
    map<pair<ll,ll>,ll>mp;
    for(int i=0; i<n; i++)
    {
        cin>>v[i].first>>v[i].second;
        mp[ {v[i].first,v[i].second}]=i+1;
    }
    sort(v.rbegin(),v.rend());
    vector<sub>b;
    vector<ll>f(6);
    vector<pair<ll,ll>>c(6);
    for(int i=0; i<6; i++)
    {
        f[i]=mp[{v[i].first,v[i].second}];
        c[i]= {v[i].first,v[i].second};
    }
          ll id=6;
          ll cnt=0,sum=0;
    for(int i=1; i<=m; i++)
    {
        bool valid=1;
        sum=0;
        for(int j=0; j<6; j++)
        {
            if(c[j].second-i<0)
            {
                valid=0;
                for(int k=id; k<n; k++)
                {
                    b.push_back({i,mp[c[j]],mp[v[k]]});
                    v[k].second+=c[j].second;
                  c[j]=v[k];

                  id++;
                  valid=1;
                  break;
                }
            }
            sum+=c[j].first;
        }
        if(valid){
               // cout<<"sum"<<sum<<endl;
            cnt+=sum;
        }
        else break;
    }
    cout<<cnt<<endl;
    for(int i=0;i<6;i++) cout<<f[i]<<' ';
    cout<<endl;
    cout<<b.size()<<endl;
    for(int i=0;i<b.size();i++){
        cout<<b[i].t<<' '<<b[i].a<<' '<<b[i].b<<endl;
    }
    return 0;
}

Compilation message

hokej.cpp: In function 'int main()':
hokej.cpp:76:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<sub>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   76 |     for(int i=0;i<b.size();i++){
      |                 ~^~~~~~~~~

Subtask #1

0 / 120.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	204 KB	Output isn't correct
2	Incorrect	3 ms	460 KB	Output isn't correct
3	Incorrect	14 ms	944 KB	Output isn't correct
4	Incorrect	1 ms	332 KB	Integer 0 violates the range [1, 500]
5	Incorrect	9 ms	1228 KB	Integer 0 violates the range [1, 10000]
6	Incorrect	3 ms	660 KB	Integer 0 violates the range [1, 3000]
7	Incorrect	5 ms	972 KB	Integer 0 violates the range [1, 9000]
8	Incorrect	95 ms	7664 KB	Output isn't correct
9	Incorrect	615 ms	40004 KB	Integer 0 violates the range [1, 500000]
10	Incorrect	639 ms	40192 KB	Output isn't correct