Submission #1119795

#	Time	Username	Problem	Language	Result	Execution time	Memory
1119795		kasdo	Poi (IOI09_poi)	C++14	15 / 100	436 ms	38376 KiB

poi

#include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxn = 2005;
int a[maxn][maxn], scores[maxn];
int n, t, p;
signed main()
{
    cin>>n>>t>>p;

    for(int i=0; i<n; i++)
    {
        for(int j=0; j<t; j++)
        {
            cin>>a[i][j];
            scores[j] += a[i][j];
        }
    }
    
    int ans = 0, cnt = 0;
    set<int> s;
    for(int i=0; i<n; i++)
    {
        int cur = 0;
        for(int j=0; j<t; j++)
        {
            if (a[i][j] == 1) cur += n - scores[j];
        }
        if (i == p - 1) ans = cur;
        s.insert(cur);
    }
    
    for(auto i : s)
    {
        if (i >= ans) cnt++;
    }
    cout<<ans<<" "<<cnt<<endl;
    
    return 0;
}

• Subtask 1: 15 / 100