Submission #252020

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
252020	2020-07-23T18:01:34 Z	ScarletS	Poi (IOI09_poi)	C++17	55 / 100	293 ms	4856 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

55.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	384 KB	Output isn't correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Incorrect	0 ms	384 KB	Output isn't correct
5	Incorrect	1 ms	384 KB	Output isn't correct
6	Correct	1 ms	384 KB	Output is correct
7	Incorrect	1 ms	512 KB	Output isn't correct
8	Correct	1 ms	512 KB	Output is correct
9	Incorrect	2 ms	512 KB	Output isn't correct
10	Correct	3 ms	768 KB	Output is correct
11	Correct	9 ms	1152 KB	Output is correct
12	Incorrect	16 ms	1664 KB	Output isn't correct
13	Incorrect	43 ms	2288 KB	Output isn't correct
14	Incorrect	63 ms	2808 KB	Output isn't correct
15	Correct	113 ms	3256 KB	Output is correct
16	Correct	111 ms	3448 KB	Output is correct
17	Correct	178 ms	3816 KB	Output is correct
18	Correct	188 ms	4216 KB	Output is correct
19	Incorrect	258 ms	4728 KB	Output isn't correct
20	Correct	293 ms	4856 KB	Output is correct