oj.uz

Submission #863304

# Submission time Handle Problem Language Result Execution time Memory
863304 2023-10-20T02:43:38 Z HuyQuang_re_Zero Poi (IOI09_poi) C++14
70 / 100
 169 ms 23912 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,id; } a[N];
int n,m,p,c[N][N],i,j,point[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]);
    for(i=1;i<=n;i++)
    {
        int sum=0;
        for(j=1;j<=m;j++) sum+=point[j]*c[i][j];
        a[i]={ sum,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;
             return a.id<b.id;
         });
    for(i=1;i<=n;i++)
        if(a[i].id==p) cout<<i<<" ";
}

Subtask #1
70.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Incorrect 0 ms 348 KB Output isn't correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Incorrect 1 ms 2396 KB Output isn't correct
8 Incorrect 1 ms 2396 KB Output isn't correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 2 ms 2652 KB Output is correct
11 Correct 9 ms 4696 KB Output is correct
12 Correct 10 ms 4956 KB Output is correct
13 Incorrect 26 ms 7772 KB Output isn't correct
14 Correct 38 ms 10344 KB Output is correct
15 Incorrect 66 ms 13652 KB Output isn't correct
16 Correct 90 ms 13904 KB Output is correct
17 Correct 105 ms 17488 KB Output is correct
18 Correct 120 ms 20084 KB Output is correct
19 Correct 157 ms 23120 KB Output is correct
20 Correct 169 ms 23912 KB Output is correct