Submission #235950

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
235950	2020-05-30T13:01:47 Z	AmineWeslati	Poi (IOI09_poi)	C++14	100 / 100	277 ms	39672 KB

poi

#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set=tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
//s.order_of_key(), *s.find_by_order()

using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef string str;
typedef long long ll;
#define int ll
typedef double db;
typedef long double ld;

typedef pair<int,int> pi;
#define fi first
#define se second

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;

#define pb push_back
#define eb emplace_back
#define pf push_front

#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)

const int MOD = 1e9+7; //998244353
const ll INF = 1e18;
const int nx[4]={0,0,1,-1}, ny[4]={1,-1,0,0};


int32_t main(){
   boost;
   int N,T,p; cin>>N>>T>>p;
   p--;
   vi vec(T,0);
   int t[N][T];
   for(int i=0; i<N; i++){
      for(int j=0; j<T; j++){
         cin>>t[i][j];
         if(!t[i][j]) vec[j]++;
      }
   }

   vector<pair<pi,int>> v;
   for(int i=0; i<N;i++){
      int s=0,nb=0;
      for(int j=0; j<T; j++){
         if(t[i][j]){nb++;s+=vec[j];}
      }
      v.pb({{s,nb},-i});
   }
   sort(v.rbegin(),v.rend());
   for(int i=0; i<N; i++) if(v[i].se==-p){
      cout << v[i].fi.fi << ' ' << i+1 << endl;
      break;
   }


   return 0;
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	384 KB	Output is correct
2	Correct	4 ms	384 KB	Output is correct
3	Correct	4 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	5 ms	384 KB	Output is correct
8	Correct	5 ms	384 KB	Output is correct
9	Correct	5 ms	512 KB	Output is correct
10	Correct	7 ms	640 KB	Output is correct
11	Correct	12 ms	1536 KB	Output is correct
12	Correct	17 ms	2304 KB	Output is correct
13	Correct	47 ms	6264 KB	Output is correct
14	Correct	61 ms	8696 KB	Output is correct
15	Correct	105 ms	15196 KB	Output is correct
16	Correct	114 ms	16248 KB	Output is correct
17	Correct	164 ms	23928 KB	Output is correct
18	Correct	193 ms	27000 KB	Output is correct
19	Correct	249 ms	35784 KB	Output is correct
20	Correct	277 ms	39672 KB	Output is correct