Submission #252025

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
252025	2020-07-23T18:18:30 Z	ScarletS	Poi (IOI09_poi)	C++17	100 / 100	308 ms	4344 KB

poi

#include <bits/stdc++.h>
#define ll long long
#define sz(x) (int)(x).size()
using namespace std;

bool b[2000][2000];

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n,t,p,x,y;
    cin>>n>>t>>p;
    for (int i=0;i<n;++i)
        for (int j=0;j<t;++j)
            cin>>b[i][j];
    int a[t];
    for (int i=0;i<t;++i)
    {
        a[i]=n;
        for (int j=0;j<n;++j)
            a[i]-=b[j][i];
    }
    vector<pair<pair<int,int>,int>> v;
    for (int i=0;i<n;++i)
    {
        x=0,y=0;
        for (int j=0;j<t;++j)
            if (b[i][j])
            {
                x+=a[j];
                ++y;
            }
        v.push_back({{x,y},-(i+1)});
    }
    sort(v.rbegin(), v.rend());
    for (int i=0;i<n;++i)
        if (v[i].second==-p)
            cout<<v[i].first.first<<" "<<i+1<<"\n";
    return 0;
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Correct	1 ms	512 KB	Output is correct
8	Correct	1 ms	512 KB	Output is correct
9	Correct	2 ms	512 KB	Output is correct
10	Correct	3 ms	768 KB	Output is correct
11	Correct	9 ms	896 KB	Output is correct
12	Correct	16 ms	1280 KB	Output is correct
13	Correct	47 ms	1784 KB	Output is correct
14	Correct	67 ms	2296 KB	Output is correct
15	Correct	130 ms	2696 KB	Output is correct
16	Correct	130 ms	2936 KB	Output is correct
17	Correct	192 ms	3320 KB	Output is correct
18	Correct	227 ms	3704 KB	Output is correct
19	Correct	295 ms	4344 KB	Output is correct
20	Correct	308 ms	4344 KB	Output is correct