Submission #419404

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
419404	2021-06-07T05:02:22 Z	chirathnirodha	Poi (IOI09_poi)	C++17	100 / 100	398 ms	4216 KB

poi

//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];memset(points,0,sizeof(points));
    for(int j=0;j<t;j++)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());
    for(int i=0;i<n;i++)if(rank[i].S.S==-p){cout<<rank[i].F<<" "<<n-i<<endl;return;}
}
int main(){
    io();
    solve();
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	2 ms	332 KB	Output is correct
10	Correct	4 ms	332 KB	Output is correct
11	Correct	12 ms	424 KB	Output is correct
12	Correct	21 ms	460 KB	Output is correct
13	Correct	60 ms	884 KB	Output is correct
14	Correct	85 ms	1124 KB	Output is correct
15	Correct	149 ms	1860 KB	Output is correct
16	Correct	161 ms	1888 KB	Output is correct
17	Correct	238 ms	2704 KB	Output is correct
18	Correct	270 ms	3012 KB	Output is correct
19	Correct	361 ms	3816 KB	Output is correct
20	Correct	398 ms	4216 KB	Output is correct