Submission #799623

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
799623	2023-07-31T16:47:39 Z	I_Love_EliskaM_	Poi (IOI09_poi)	C++14	100 / 100	187 ms	40232 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	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	1 ms	328 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	2 ms	724 KB	Output is correct
11	Correct	6 ms	1672 KB	Output is correct
12	Correct	10 ms	2644 KB	Output is correct
13	Correct	28 ms	7080 KB	Output is correct
14	Correct	39 ms	10024 KB	Output is correct
15	Correct	81 ms	19756 KB	Output is correct
16	Correct	77 ms	21512 KB	Output is correct
17	Correct	115 ms	29140 KB	Output is correct
18	Correct	125 ms	32960 KB	Output is correct
19	Correct	164 ms	39452 KB	Output is correct
20	Correct	187 ms	40232 KB	Output is correct