Submission #671948

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
671948	2022-12-14T10:02:15 Z	sudheerays123	Poi (IOI09_poi)	C++17	100 / 100	224 ms	39672 KB

poi

#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define ll long long int
const ll N = 100+5 , INF = 1e18 , MOD = 1e9+7;

bool comp(tuple<ll,ll,ll> a , tuple<ll,ll,ll> b){

	ll x1,y1,z1,x2,y2,z2;
	tie(x1,y1,z1) = a;
	tie(x2,y2,z2) = b;

	if(x1 != x2) return x1 > x2;
	if(y1 != y2) return y1 > y2;
	return z1 < z2;
}

void solve(){

	ll n,t,p;
	cin >> n >> t >> p;

	vector<vector<ll>> task(n+5,vector<ll>(t+5));
	vector<ll> solved(n+5,0),score(n+5),point(t+5,n);

	for(ll i = 1; i <= n; i++){
		for(ll j = 1; j <= t; j++){
			cin >> task[i][j];
			if(task[i][j]){
				solved[i]++;
				point[j]--;
			}
		}
	}

	for(ll i = 1; i <= n; i++){
		for(ll j = 1; j <= t; j++){
			if(task[i][j]) score[i] += point[j];
		}
	}

	vector<tuple<ll,ll,ll>> rank;
	for(ll i = 1; i <= n; i++) rank.push_back(make_tuple(score[i],solved[i],i));

	sort(rank.begin(),rank.end(),comp);

	for(ll i = 0; i < n; i++){
		if(get<2>(rank[i]) == p){
			cout << get<0>(rank[i]) << " " << i+1;
			return;
		}
	}
	
}

int main(){

	fast;

	ll tc = 1;
	// cin >> tc;
	while(tc--) solve();

	return 0;
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	340 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	0 ms	316 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	324 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	1 ms	468 KB	Output is correct
10	Correct	2 ms	596 KB	Output is correct
11	Correct	7 ms	1548 KB	Output is correct
12	Correct	12 ms	2260 KB	Output is correct
13	Correct	34 ms	6208 KB	Output is correct
14	Correct	47 ms	8744 KB	Output is correct
15	Correct	83 ms	15136 KB	Output is correct
16	Correct	103 ms	16364 KB	Output is correct
17	Correct	131 ms	24012 KB	Output is correct
18	Correct	152 ms	27204 KB	Output is correct
19	Correct	195 ms	35760 KB	Output is correct
20	Correct	224 ms	39672 KB	Output is correct