Submission #405598

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
405598	2021-05-16T14:58:50 Z	Jasiekstrz	Poi (IOI09_poi)	C++17	100 / 100	331 ms	16580 KB

poi

#include<bits/stdc++.h>
#define fi first
#define se second
using namespace std;
const int N=2e3;
struct W
{
	int s,c,id;
	bool operator<(const W &oth)
	{
		if(s==oth.s && c==oth.c)
			return id<oth.id;
		else if(s==oth.s)
			return c>oth.c;
		return s>oth.s;
	}
};
int sc[N+10];
int tab[N+10][N+10];
W w[N+10];
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	int n,t,p;
	cin>>n>>t>>p;
	for(int i=1;i<=t;i++)
		sc[i]=n;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=t;j++)
		{
			cin>>tab[i][j];
			if(tab[i][j])
				sc[j]--;
		}
	}
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=t;j++)
		{
			w[i].s+=tab[i][j]*sc[j];
			w[i].c+=tab[i][j];
		}
		w[i].id=i;
	}
	sort(w+1,w+n+1);
	for(int i=1;i<=n;i++)
	{
		if(w[i].id==p)
		{
			cout<<w[i].s<<" "<<i<<"\n";
			break;
		}
	}
	return 0;
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	352 KB	Output is correct
2	Correct	1 ms	332 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	460 KB	Output is correct
6	Correct	1 ms	448 KB	Output is correct
7	Correct	2 ms	588 KB	Output is correct
8	Correct	2 ms	588 KB	Output is correct
9	Correct	2 ms	716 KB	Output is correct
10	Correct	3 ms	1228 KB	Output is correct
11	Correct	10 ms	2124 KB	Output is correct
12	Correct	17 ms	3424 KB	Output is correct
13	Correct	47 ms	5952 KB	Output is correct
14	Correct	85 ms	8172 KB	Output is correct
15	Correct	135 ms	10268 KB	Output is correct
16	Correct	127 ms	10996 KB	Output is correct
17	Correct	186 ms	12584 KB	Output is correct
18	Correct	210 ms	14156 KB	Output is correct
19	Correct	274 ms	16580 KB	Output is correct
20	Correct	331 ms	16580 KB	Output is correct