oj.uz

Submission #593198

# Submission time Handle Problem Language Result Execution time Memory
593198 2022-07-10T14:53:36 Z Bench0310 Poi (IOI09_poi) C++17
100 / 100
 218 ms 23848 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int n,t,p;
    cin >> n >> t >> p;
    vector<int> solves(t+1,0);
    vector v(n+1,vector(t+1,int(0)));
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=t;j++)
        {
            cin >> v[i][j];
            solves[j]+=v[i][j];
        }
    }
    vector<array<int,3>> e(n);
    vector<int> cnt(n+1,0);
    vector<int> sum(n+1,0);
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=t;j++)
        {
            cnt[i]+=v[i][j];
            sum[i]+=v[i][j]*(n-solves[j]);
        }
        e[i-1]={-sum[i],-cnt[i],i};
    }
    sort(e.begin(),e.end());
    for(int i=0;i<n;i++)
    {
        if(e[i][2]==p) cout << -e[i][0] << " " << i+1 << "\n";
    }
    return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 328 KB Output is correct
9 Correct 2 ms 336 KB Output is correct
10 Correct 2 ms 460 KB Output is correct
11 Correct 7 ms 980 KB Output is correct
12 Correct 12 ms 1520 KB Output is correct
13 Correct 34 ms 3780 KB Output is correct
14 Correct 47 ms 5336 KB Output is correct
15 Correct 86 ms 9168 KB Output is correct
16 Correct 88 ms 9908 KB Output is correct
17 Correct 131 ms 14380 KB Output is correct
18 Correct 145 ms 16332 KB Output is correct
19 Correct 205 ms 21560 KB Output is correct
20 Correct 218 ms 23848 KB Output is correct