oj.uz

답안 #419395

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
419395 2021-06-07T04:56:07 Z chirathnirodha Poi (IOI09_poi) C++17
60 / 100
 396 ms 5236 KB 
//Coded by Chirath Nirodha
#include<bits/stdc++.h>
using namespace std;
#include<ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define I insert
#define P push
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_tree;
const ll mod=1e9+7;
inline void io(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}
void solve(){
    io();
    int n,t,p;cin>>n>>t>>p;p--;
    bool arr[n][t];
    for(int i=0;i<n;i++)for(int j=0;j<t;j++)cin>>arr[i][j];
    ll points[t];
    for(int j=0;j<t;j++){
        points[j]=0;
        for(int i=0;i<n;i++)if(!arr[i][j])points[j]++;
    }
    vector<pair<ll,pair<int,int> > > rank; 
    for(int i=0;i<n;i++){
        ll x=0,y=0;
        for(int j=0;j<t;j++)if(arr[i][j]){x+=points[j];y++;}
        rank.PB(MP(x,MP(y,i)));
    }
    sort(rank.begin(),rank.end());
    if(rank[n-1].S.S==p){cout<<rank[n-1].F<<" "<<1<<endl;return;}
    int cur=1;
    for(int i=n-2;i>=0;i--){
        if(rank[i].F!=rank[i+1].F || rank[i].S.F!=rank[i+1].S.F)cur=n-i;
        if(rank[i].S.S==p){cout<<rank[i].F<<" "<<cur<<endl;return;}
    }
}
int main(){
    io();
    solve();
}

Subtask #1
60.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Incorrect 0 ms 312 KB Output isn't correct
5 Correct 1 ms 312 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Incorrect 1 ms 332 KB Output isn't correct
8 Correct 1 ms 204 KB Output is correct
9 Incorrect 3 ms 332 KB Output isn't correct
10 Correct 4 ms 332 KB Output is correct
11 Correct 13 ms 588 KB Output is correct
12 Incorrect 23 ms 872 KB Output isn't correct
13 Incorrect 60 ms 1884 KB Output isn't correct
14 Correct 88 ms 2140 KB Output is correct
15 Incorrect 158 ms 2780 KB Output isn't correct
16 Correct 164 ms 2856 KB Output is correct
17 Incorrect 238 ms 3656 KB Output isn't correct
18 Correct 265 ms 3924 KB Output is correct
19 Correct 362 ms 4932 KB Output is correct
20 Correct 396 ms 5236 KB Output is correct