Submission #863307

# Submission time Handle Problem Language Result Execution time Memory
863307 2023-10-20T02:50:43 Z HuyQuang_re_Zero Poi (IOI09_poi) C++14
100 / 100
170 ms 16004 KB
#include <bits/stdc++.h>
#define ll long long
#define db long double
#define N 2005
#define II pair <ll,ll>
#define III pair <ll,II>
#define IV pair <vector <int>,vector <int> >
#define fst first
#define snd second
#define BIT(x,i) ((x>>i)&1)
#define pi acos(-1)
#define to_radian(x) (x*pi/180.0)
#define to_degree(x) (x*180.0/pi)
#define rand(l,r) (l+rng()%(r-l+1))
using namespace std;
struct pt { int score,cnt,id; } a[N];
int n,m,p,c[N][N],i,j,point[N],solved[N];
int main()
{
   // freopen("poi.inp","r",stdin);
    //freopen("poi.out","w",stdout);
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    cin>>n>>m>>p;
    for(i=1;i<=n;i++)
        for(j=1;j<=m;j++) cin>>c[i][j],point[j]+=(1-c[i][j]),solved[i]+=c[i][j];
    for(i=1;i<=n;i++)
    {
        int sum=0;
        for(j=1;j<=m;j++) sum+=point[j]*c[i][j];
        a[i]={ sum,solved[i],i };
    }
    cout<<a[p].score<<" ";
    sort(a+1,a+n+1,[&](pt a,pt b)
         {
             if(a.score!=b.score) return a.score>b.score;
             if(a.cnt!=b.cnt) return a.cnt>b.cnt;
             return a.id<b.id;
         });
    for(i=1;i<=n;i++)
        if(a[i].id==p) cout<<i<<" ";
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 2 ms 2396 KB Output is correct
11 Correct 6 ms 4700 KB Output is correct
12 Correct 9 ms 4700 KB Output is correct
13 Correct 26 ms 6736 KB Output is correct
14 Correct 37 ms 8828 KB Output is correct
15 Correct 67 ms 10880 KB Output is correct
16 Correct 71 ms 10888 KB Output is correct
17 Correct 105 ms 12884 KB Output is correct
18 Correct 116 ms 14968 KB Output is correct
19 Correct 155 ms 15980 KB Output is correct
20 Correct 170 ms 16004 KB Output is correct