Submission #718790

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
718790	2023-04-04T20:21:54 Z	NintsiChkhaidze	Poi (IOI09_poi)	C++14	100 / 100	223 ms	39500 KB

poi

#include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define f first
#define s second
#define int ll
using namespace std;
 
const int N = 2e3 + 5;

int solved[N],a[N][N];
int score[N],s[N],b[N];

bool cmp(int x,int y){
	if (score[x] != score[y]) return (score[x] > score[y]);
	if (solved[x] != solved[y]) return (solved[x] > solved[y]);
	return (x < y);
}
signed main() {
    ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);
    	
	int n,t,p;
	cin>>n>>t>>p;
	
	for (int i=1;i<=t;i++) s[i] = n;
	
	for (int i = 1; i <= n; i++){
		b[i] = i;
		for (int j = 1; j <= t; j++){
			cin>>a[i][j];
			solved[i] += a[i][j];
			s[j]-=a[i][j];
		}
	}
	
	for (int i = 1; i <= n; i++)
		for (int j=1;j<=t;j++)	
			score[i] += s[j] * a[i][j];
	
	sort(b+1,b+n+1,cmp);
	for (int i=1;i<=n;i++)
		if (b[i] == p) cout<<score[p]<<" "<<i<<endl;
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	324 KB	Output is correct
2	Correct	1 ms	340 KB	Output is correct
3	Correct	1 ms	340 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	1 ms	468 KB	Output is correct
6	Correct	1 ms	452 KB	Output is correct
7	Correct	1 ms	596 KB	Output is correct
8	Correct	1 ms	596 KB	Output is correct
9	Correct	2 ms	852 KB	Output is correct
10	Correct	3 ms	1364 KB	Output is correct
11	Correct	8 ms	2644 KB	Output is correct
12	Correct	14 ms	4220 KB	Output is correct
13	Correct	37 ms	8960 KB	Output is correct
14	Correct	52 ms	12680 KB	Output is correct
15	Correct	89 ms	19732 KB	Output is correct
16	Correct	95 ms	21464 KB	Output is correct
17	Correct	127 ms	28632 KB	Output is correct
18	Correct	153 ms	32284 KB	Output is correct
19	Correct	191 ms	38828 KB	Output is correct
20	Correct	223 ms	39500 KB	Output is correct