Submission #753952

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
753952	2023-06-06T11:30:04 Z	TimDee	Poi (IOI09_poi)	C++17	100 / 100	240 ms	40272 KB

poi

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

#define int long long
#define forn(i,n) for(int i=0;i<n;++i)
#define pi pair<int,int>
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(),x.end()
#define vii(a,n) vector<int>a(n);forn(i,n)cin>>a[i];

struct z {
	int s,p,i;
};

bool foo(z a, z b) {
	if (a.s > b.s) return 1;
	if (a.s < b.s) return 0;
	if (a.p > b.p) return 1;
	if (a.p < b.p) return 0;
	return a.i < b.i;
}

void solve() {

	int n,m,p; cin>>n>>m>>p;
	vector<z> a(n);
	vector<int> b(m,n);
	vector<vector<int>> c(n);
	forn(i,n) {
		forn(j,m) {
			int x; cin>>x; b[j]-=x; c[i].pb(x);
		}
	}
	forn(i,n) forn(j,m) a[i].p+=c[i][j], a[i].s+=c[i][j]*b[j];
	forn(i,n) a[i].i=i;
	sort(all(a),foo);
	forn(i,n) if (a[i].i==p-1) {
		cout<<a[i].s<<' '<<i+1<<'\n';
	}

}

int32_t main() {
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	solve();
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	320 KB	Output is correct
2	Correct	1 ms	320 KB	Output is correct
3	Correct	1 ms	324 KB	Output is correct
4	Correct	1 ms	316 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	2 ms	468 KB	Output is correct
10	Correct	3 ms	724 KB	Output is correct
11	Correct	8 ms	1748 KB	Output is correct
12	Correct	13 ms	2644 KB	Output is correct
13	Correct	34 ms	7120 KB	Output is correct
14	Correct	49 ms	9960 KB	Output is correct
15	Correct	91 ms	19756 KB	Output is correct
16	Correct	95 ms	21344 KB	Output is correct
17	Correct	130 ms	29136 KB	Output is correct
18	Correct	150 ms	32972 KB	Output is correct
19	Correct	192 ms	39552 KB	Output is correct
20	Correct	240 ms	40272 KB	Output is correct