Submission #597487

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
597487	2022-07-16T06:39:43 Z	hail	Poi (IOI09_poi)	C++17	100 / 100	221 ms	23912 KB

poi

#include <bits/stdc++.h>

using namespace std;

using ll=long long;

bool sor_tup(tuple<int, int, int> a, tuple<int, int, int> b)
{
    if(get<0>(a)>get<0>(b))
    {
        return true;
    }
    else if(get<0>(a)<get<0>(b))
    {
        return false;
    }
    else
    {
        if(get<1>(a)>get<1>(b)) return true;
        else if(get<1>(a)<get<1>(b)) return false;
        else
        {
            if(get<2>(a)<get<2>(b)) return true;
            else return false;
        }
    }

    return false;
}


int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);

    int n, t, p;
    cin>>n>>t>>p;

    vector<int> t_p(t+1);
    vector<vector<int>> k_solves(n+1, vector<int>(t+1, 0));

    vector<tuple<int, int, int>> final_r(n);

    for(int i=1; i<=n; i++)
    {
        get<2>(final_r[i-1])=i;
        for(int j=1; j<=t; j++)
        {
            cin>>k_solves[i][j];
            if(not k_solves[i][j]) t_p[j]++;
            else get<1>(final_r[i-1])++;
        }
    }

    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=t; j++)
        {
            if(k_solves[i][j]) get<0>(final_r[i-1])+=t_p[j];
        }
    }

    sort(final_r.begin(), final_r.end(), sor_tup);

    for(int i=1; i<=n; i++)
    {
        if(get<2>(final_r[i-1])==p)
        {
            cout<<get<0>(final_r[i-1])<<" "<<i<<"\n";
        }
    }

}

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	316 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	324 KB	Output is correct
5	Correct	0 ms	324 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	2 ms	468 KB	Output is correct
11	Correct	8 ms	980 KB	Output is correct
12	Correct	14 ms	1500 KB	Output is correct
13	Correct	34 ms	3816 KB	Output is correct
14	Correct	63 ms	5364 KB	Output is correct
15	Correct	99 ms	9188 KB	Output is correct
16	Correct	92 ms	9952 KB	Output is correct
17	Correct	137 ms	14400 KB	Output is correct
18	Correct	154 ms	16292 KB	Output is correct
19	Correct	201 ms	21556 KB	Output is correct
20	Correct	221 ms	23912 KB	Output is correct