Submission #387726

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
387726	2021-04-09T06:31:07 Z	gouravkhunger	Poi (IOI09_poi)	C++17	100 / 100	346 ms	12192 KB

poi

#include <bits/stdc++.h>
using namespace std;

#define all(v) v.begin(), v.end()
#define vi vector<int>
#define tiii tuple<int, int, int>
#define vpii vector<pair<int, int>>
#define FOR(i, a, b) for(int i=a;i<=b;i++)
#define PB push_back
#define F first
#define S second
#define FIO ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

int main() {
	FIO;

	int n, t, p, s=0, r = 0;
	cin>>n>>t>>p;
	
	vi scores(t, 0); //scores of the problems
	
	// 0: score
	// 1: number of tasks
	// 2: id
	vector<tuple<int, int, int>> final(n);
	
	
	bool a[n][t]; //solved or !solved
	
	
	FOR(i, 0, n-1){
		FOR(j, 0, t-1){
			cin>>a[i][j];
			if(a[i][j]) scores[j]++;
		}
	}
	
	FOR(i, 0, t-1) scores[i] = abs(scores[i]-n);
	
	FOR(j, 0, t-1){
		if(a[p-1][j]) s+=scores[j];
	}
	
	FOR(i, 0, n-1){
		final[i] = {0, 0, n-(i+1)};
		FOR(j, 0, t-1){
			if(a[i][j]){
				get<1>(final[i])++;
				get<0>(final[i])+=scores[j];
			}
		}
		//cout<<get<0>(final[i])<<" "<<get<1>(final[i])<<" "<<get<2>(final[i])<<"\n";
	}
	
	sort(all(final), greater<tuple<int, int, int>>());
	
	/*cout<<"\n\n";
	
	FOR(i, 0, n-1){
		cout<<get<0>(final[i])<<" "<<get<1>(final[i])<<" "<<get<2>(final[i])<<"\n";
	}*/
	
	FOR(i, 0, n-1){
		if(get<2>(final[i])==(n-p)) r = i+1;
	}
		
	
	cout<<s<<" "<<r;
	

    return 0;
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 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	3 ms	332 KB	Output is correct
11	Correct	11 ms	624 KB	Output is correct
12	Correct	18 ms	844 KB	Output is correct
13	Correct	52 ms	1988 KB	Output is correct
14	Correct	74 ms	2756 KB	Output is correct
15	Correct	130 ms	4704 KB	Output is correct
16	Correct	150 ms	4976 KB	Output is correct
17	Correct	209 ms	7344 KB	Output is correct
18	Correct	241 ms	8216 KB	Output is correct
19	Correct	327 ms	10808 KB	Output is correct
20	Correct	346 ms	12192 KB	Output is correct