Submission #597506

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
597506	2022-07-16T07:43:02 Z	kabika	Poi (IOI09_poi)	C++14	100 / 100	220 ms	16388 KB

poi

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

bool comp(tuple<int,int,int> p, tuple<int,int,int> q)
{
    if(get<0>(p) != get<0>(q))
        return get<0>(p) > get<0>(q);
    
    if(get<1>(p) != get<1>(q))
        return get<1>(p) > get<1>(q);
    
    if(get<2>(p) != get<2>(q))
        return get<2>(p) < get<2>(q);
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int n, t, p;
    cin >> n >> t >> p;
    --p;
    vector<vector<int>> slv(n,vector<int>(t,0));
    vector<int> mrk(t);
    for(int i = 0; i < n; ++i)
    {
        for(int j = 0; j < t; ++j)
        {
            cin >> slv[i][j];
            if(!slv[i][j])
                ++mrk[j];
        }
    }
    
    vector<tuple<int,int,int>> rnk(n,make_tuple(0,0,0));
    int i = 0;
    for(tuple<int,int,int> &tp : rnk)
    {
        get<2>(tp) = i;
        for(int j = 0; j < t; ++j)
        {
            if(slv[i][j])
            {
                get<0>(tp) += mrk[j];
                get<1>(tp) += 1;
            }
        }
        ++i;
    }
    sort(rnk.begin(),rnk.end(),comp);
    /*for(auto &tp : rnk)
    {
        cout << get<0>(tp) << " "
             << get<1>(tp) << " "
             << get<2>(tp) << '\n';
    }*/
    for(int i = 0; i < n; ++i)
    {
        if(get<2>(rnk[i]) == p)
        {
            cout << get<0>(rnk[i]) << " " << i+1 << '\n';
            break;
        }
    }
    return 0;
}

Compilation message

poi.cpp: In function 'bool comp(std::tuple<int, int, int>, std::tuple<int, int, int>)':
poi.cpp:15:1: warning: control reaches end of non-void function [-Wreturn-type]
   15 | }
      | ^

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	3 ms	468 KB	Output is correct
11	Correct	7 ms	980 KB	Output is correct
12	Correct	14 ms	1508 KB	Output is correct
13	Correct	43 ms	2992 KB	Output is correct
14	Correct	49 ms	4028 KB	Output is correct
15	Correct	83 ms	6500 KB	Output is correct
16	Correct	91 ms	6988 KB	Output is correct
17	Correct	135 ms	10268 KB	Output is correct
18	Correct	181 ms	11348 KB	Output is correct
19	Correct	197 ms	14884 KB	Output is correct
20	Correct	220 ms	16388 KB	Output is correct