oj.uz

Submission #730142

# Submission time Handle Problem Language Result Execution time Memory
730142 2023-04-25T10:26:59 Z lucri Poi (IOI09_poi) C++17
100 / 100
 575 ms 11984 KB 
#include <bits/stdc++.h>
using namespace std;
bool a[2010][2010];
int n,t,p,sc[2010];
struct results{int code,solved,score;}v[2010];
bool comp(results a,results b)
{
    if(a.score!=b.score) return a.score>b.score;
    if(a.solved!=b.solved) return a.solved>b.solved;
    return a.code<b.code;
}
int main()
{
    cin>>n>>t>>p;
    for(int i=1;i<=t;++i)
        sc[i]=n;
    for(int i=1;i<=n;++i)
    {
        v[i].code=i;
        for(int j=1;j<=t;++j)
        {
            cin>>a[i][j];
            v[i].solved+=a[i][j];
            sc[j]-=a[i][j];
        }
    }
    for(int i=1;i<=n;++i)
    {
        for(int j=1;j<=t;++j)
        {
            if(a[i][j])
                v[i].score+=sc[j];
        }
    }
    cout<<v[p].score<<' ';
    sort(v+1,v+n+1,comp);
    for(int i=1;i<=n;++i)
        if(v[i].code==p)
            cout<<i;
    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 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 448 KB Output is correct
8 Correct 1 ms 468 KB Output is correct
9 Correct 3 ms 448 KB Output is correct
10 Correct 5 ms 724 KB Output is correct
11 Correct 18 ms 1100 KB Output is correct
12 Correct 31 ms 1612 KB Output is correct
13 Correct 91 ms 2812 KB Output is correct
14 Correct 129 ms 3936 KB Output is correct
15 Correct 230 ms 5572 KB Output is correct
16 Correct 245 ms 6052 KB Output is correct
17 Correct 418 ms 7972 KB Output is correct
18 Correct 422 ms 8920 KB Output is correct
19 Correct 512 ms 11300 KB Output is correct
20 Correct 575 ms 11984 KB Output is correct