Submission #252021

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
252021	2020-07-23T18:04:07 Z	ScarletS	Poi (IOI09_poi)	C++17	70 / 100	301 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;
    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<int,int>> v;
    for (int i=0;i<n;++i)
    {
        x=0;
        for (int j=0;j<t;++j)
            x+=a[j]*b[i][j];
        v.push_back({x,-(i+1)});
    }
    sort(v.rbegin(), v.rend());
    for (int i=0;i<n;++i)
        if (v[i].second==-p)
            cout<<v[i].first<<" "<<i+1<<"\n";
    /**
    for (int i=0;i<n;++i)
        cout<<i+1<<": "<<-v[i].second<<" with "<<v[i].first<<" points\n";
    **/
    return 0;
}

Subtask #1

70.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	Incorrect	0 ms	384 KB	Output isn't correct
4	Incorrect	1 ms	384 KB	Output isn't correct
5	Correct	0 ms	256 KB	Output is correct
6	Correct	0 ms	384 KB	Output is correct
7	Incorrect	1 ms	512 KB	Output isn't correct
8	Incorrect	1 ms	512 KB	Output isn't correct
9	Correct	1 ms	512 KB	Output is correct
10	Correct	2 ms	768 KB	Output is correct
11	Correct	9 ms	896 KB	Output is correct
12	Correct	15 ms	1280 KB	Output is correct
13	Incorrect	44 ms	1784 KB	Output isn't correct
14	Correct	73 ms	2360 KB	Output is correct
15	Incorrect	102 ms	2916 KB	Output isn't correct
16	Correct	120 ms	3192 KB	Output is correct
17	Correct	176 ms	3448 KB	Output is correct
18	Correct	196 ms	3832 KB	Output is correct
19	Correct	277 ms	4344 KB	Output is correct
20	Correct	301 ms	4344 KB	Output is correct