oj.uz

Submission #887870

# Submission time Handle Problem Language Result Execution time Memory
887870 2023-12-15T11:11:29 Z JakobZorz Poi (IOI09_poi) C++17
100 / 100
 190 ms 23912 KB 
#include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<algorithm>
#include<limits.h>
#include<math.h>
#include<map>
#include<set>
#include<unordered_map>
#include<unordered_set>
#include<iomanip>
#include<cstring>
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using namespace std;
//const int MOD=1e9+7;
//typedef pair<ll,ll>Point;
//typedef pair<ll,ll>Line;
//#define x first
//#define y second

int n,t,p;
int mat[2000][2000];
int tp[2000];

struct Person{
    int id,points,num_solved;
};

bool cmp(Person&a,Person&b){
    if(a.points!=b.points)
        return a.points>b.points;
    
    if(a.num_solved!=b.num_solved)
        return a.num_solved>b.num_solved;
    
    return a.id<b.id;
}

void solve(){
    cin>>n>>t>>p;
    p--;
    for(int i=0;i<n;i++){
        for(int j=0;j<t;j++){
            cin>>mat[i][j];
            if(mat[i][j]==0)
                tp[j]++;
        }
    }
    
    vector<Person>people(n);
    for(int i=0;i<n;i++){
        people[i].id=i;
        people[i].points=0;
        people[i].num_solved=0;
    }
    
    for(int i=0;i<n;i++){
        for(int j=0;j<t;j++){
            if(mat[i][j]==1){
                people[i].num_solved++;
                people[i].points+=tp[j];
            }
        }
    }
    
    cout<<people[p].points<<" ";
    sort(people.begin(),people.end(),cmp);
    for(int i=0;i<n;i++){
        if(people[i].id==p){
            cout<<i+1<<"\n";
        }
    }
}

int main(){
    ios::sync_with_stdio(false);cout.tie(NULL);cin.tie(NULL);
    //freopen("bank.in","r",stdin);freopen("bank.out","w",stdout);
    int t=1;//cin>>t;
    while(t--)solve();
    return 0;
}

/*
 
5 3 2
0 0 1
1 1 0
1 0 0
1 1 0
1 1 0
 
 
 */

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 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 2652 KB Output is correct
11 Correct 7 ms 4700 KB Output is correct
12 Correct 10 ms 4956 KB Output is correct
13 Correct 29 ms 7760 KB Output is correct
14 Correct 41 ms 10484 KB Output is correct
15 Correct 70 ms 13656 KB Output is correct
16 Correct 76 ms 14048 KB Output is correct
17 Correct 112 ms 17488 KB Output is correct
18 Correct 127 ms 20308 KB Output is correct
19 Correct 174 ms 23044 KB Output is correct
20 Correct 190 ms 23912 KB Output is correct