Submission #384967

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
384967	2021-04-02T18:42:42 Z	knightron0	Poi (IOI09_poi)	C++14	100 / 100	301 ms	39844 KB

poi

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

#define pb push_back
#define fr first
#define sc second
#define clr(a, x) memset(a, x, sizeof(a))
#define dbg(x) cout<<"("<<#x<<"): "<<x<<endl;
#define printvector(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout<<*it<<" "; cout<<endl;
#define all(v) v.begin(), v.end()
#define lcm(a, b) (a * b)/__gcd(a, b)
#define int long long int
#define printvecpairs(vec) for(auto it: vec) cout<<it.fr<<' '<<it.sc<<endl;
#define endl '\n'
#define float long double

const int MOD = 1e9 + 7;
const int INF = 2e15;
const int MAXN = 1e5 + 5;

bool compare(pair<int, pair<int, int>> p1, pair<int, pair<int, int>> p2){
	if(p1.fr == p2.fr){
		if(p1.sc.fr == p2.sc.fr){
			return p1.sc.sc < p2.sc.sc;
		} else {
			return p1.sc.fr > p2.sc.fr;
		}
	} else {
		return p1.fr > p2.fr;
	}
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    #ifdef LOCAL
    freopen("input.txt", "r", stdin);
    #endif
	int n, m, p;
	cin>>n>>m>>p;
	vector<vector<int>> a;
	int score[m+3];
	clr(score, 0);
	for(int i = 0;i<n;i++){
		vector<int> tmp;
		for(int j= 0;j<m;j++){
			int x; cin>>x;
			tmp.pb(x);
			score[j] += (x==0);
		}
		a.pb(tmp);
	}
	vector<pair<int, pair<int, int>>> scores;
	for(int i= 0;i<n;i++){
		pair<int, pair<int, int>> pii;
		pii.sc.sc = i+1;
		pii.sc.fr = pii.fr = 0;
		for(int j= 0;j<m;j++){
			pii.fr += (a[i][j]*score[j]);
			pii.sc.fr += a[i][j];
		}
		scores.pb(pii);
	}
	sort(all(scores), compare);
	for(int i = 0;i<(int)scores.size();i++){
		if(scores[i].sc.sc == p){
			cout<<scores[i].fr<<' '<<i+1<<endl;
			return 0;
		}
	}
    return 0;
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	364 KB	Output is correct
2	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	364 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	2 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	2 ms	364 KB	Output is correct
9	Correct	2 ms	492 KB	Output is correct
10	Correct	5 ms	620 KB	Output is correct
11	Correct	10 ms	1516 KB	Output is correct
12	Correct	16 ms	2284 KB	Output is correct
13	Correct	46 ms	6380 KB	Output is correct
14	Correct	66 ms	8812 KB	Output is correct
15	Correct	114 ms	15212 KB	Output is correct
16	Correct	125 ms	16364 KB	Output is correct
17	Correct	181 ms	24044 KB	Output is correct
18	Correct	205 ms	27116 KB	Output is correct
19	Correct	266 ms	35692 KB	Output is correct
20	Correct	301 ms	39844 KB	Output is correct