Submission #231874

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
231874	2020-05-15T07:45:54 Z	anubhavdhar	Poi (IOI09_poi)	C++14	100 / 100	901 ms	12164 KB

poi

#include<bits/stdc++.h>

#define ll long long int
#define pb push_back
#define mp make_pair
#define FOR(i,n) for(i=0;i<(n);++i)
#define FORe(i,n) for(i=1;i<=(n);++i)
#define FORr(i,a,b) for(i=(a);i<(b);++i)
#define FORrev(i,n) for(i=(n);i>=0;--i)
#define ii pair<ll,ll>
#define vi vector<ll>
#define vii vector<ii>
#define ff first 
#define ss second
#define cd complex<double>
#define vcd vector<cd>
#define ldd long double
#define dbgLine cout<<"Line : "<<__LINE__<<'\n'
#define all(x) (x).begin(),(x).end()

using namespace std;

const short int __PRECISION = 10;

const ll MOD = 1e9+7;
const ll INF = 1e17 + 1101;
const ll LOGN = 17;
const ll MAXN = 2e5+5;
const ll ROOTN = 320;

const ldd PI = acos(-1);
const ldd EPS = 1e-7;

int main()
{
	/*
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	*/

	int N, T, P, i, j;
	cin>>N>>T>>P;

	bool A[N][T];
	FOR(i,N)
		FOR(j,T)
			cin>>A[i][j];

	int score[T];
	pair<int,pair<int, int>> Final[N];

	FOR(j,T)
	{
		score[j] = 0;
		FOR(i, N)
			if(A[i][j] == 0)
				++score[j];
	}
	FOR(i,N)
	{
		int tmpScore = 0, tmpSolved = 0;
		FOR(j,T)
			if(A[i][j])
				++tmpSolved, tmpScore += score[j];
		Final[i] = mp(-tmpScore, mp(-tmpSolved, i));
	}
	// FOR(i, T)
	// 	cout<<score[i]<<' ';
	// cout<<endl;
	sort(Final, Final + N);
	// FOR(i, N)
	// 	cout<<Final[i].ss.ss<<' '<<Final[i].ff<<'\n';
	FOR(i,N)
		if(Final[i].ss.ss == P-1)
			cout<<-Final[i].ff<<' '<<i+1, exit(0);

	return 0;
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 ms	256 KB	Output is correct
2	Correct	5 ms	256 KB	Output is correct
3	Correct	4 ms	384 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	5 ms	384 KB	Output is correct
6	Correct	5 ms	384 KB	Output is correct
7	Correct	6 ms	384 KB	Output is correct
8	Correct	6 ms	384 KB	Output is correct
9	Correct	8 ms	384 KB	Output is correct
10	Correct	11 ms	384 KB	Output is correct
11	Correct	31 ms	640 KB	Output is correct
12	Correct	50 ms	872 KB	Output is correct
13	Correct	136 ms	2040 KB	Output is correct
14	Correct	204 ms	2808 KB	Output is correct
15	Correct	347 ms	4764 KB	Output is correct
16	Correct	365 ms	5112 KB	Output is correct
17	Correct	548 ms	7416 KB	Output is correct
18	Correct	622 ms	8440 KB	Output is correct
19	Correct	805 ms	11000 KB	Output is correct
20	Correct	901 ms	12164 KB	Output is correct