Submission #758903

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
758903	2023-06-15T13:42:24 Z	akarinkof	Poi (IOI09_poi)	C++14	100 / 100	477 ms	39628 KB

poi

#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> P1;
typedef pair<pair<ll,ll>,ll> P3;
typedef pair<string,ll> Ps;
typedef pair<pair<ll,ll>,pair<ll,ll> > P4;


#define rep(i,n) for(ll i=0;i<n;++i)
#define rrep(i,n) for(ll i=n-1;i>=0;--i)
#define FOR(i,s,e) for(ll i=s;i<=e;++i)
#define FFOR(i,s,e) for(ll i=s;i>=e;--i)

#define yesno(flg) if(flg){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}
#define ALL(a) (a).begin(),(a).end()
#define mp make_pair
#define pb push_back
#define vl vector<ll>
#define vs vector<string>
#define so(a) sort(a.begin(),a.end())

#define fi first
#define se second
#define print(a) cout<<a<<endl
#define ssize(a) (ll)(a.size())

#define MAX_N 1002
#define i197 1000000007
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }


const ll INF=1000000000000000001;
struct edge
{
	int to, cost;
};

struct pos{
	// 1 変数を入れる;
	ll t;
	ll x,y;
	set<ll> st;

};
int dx[4] = { 1, 0, -1, 0};
int dy[4] = { 0, 1, 0, -1};
int dd[5] = { 0, 1, 0, -1, 0};





int main(){

	ll n,t,p;
	cin>>n>>t>>p;


	ll c[t+5][n+5];
	vl score(t+5,n);
	vl total(n+5),task(n+5);
	FOR(i,1,n){
		rep(j,t){
			cin>>c[j][i];
			score[j]-=c[j][i];
			task[i]+=c[j][i];
		}
	}
	FOR(i,1,n)rep(j,t)total[i]+=score[j]*c[j][i];

	vector<P3> a(n);
	FOR(i,1,n)a[i-1]=mp(mp(total[i],task[i]),n-i);

	sort(a.begin(),a.end(),greater<P3>());

	rep(i,n){
		if(n-a[i].se==p){
			cout<<a[i].fi.fi<<" "<<i+1<<endl;
		}
	}

	return 0;

}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	296 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	1 ms	340 KB	Output is correct
9	Correct	3 ms	340 KB	Output is correct
10	Correct	4 ms	568 KB	Output is correct
11	Correct	14 ms	1508 KB	Output is correct
12	Correct	23 ms	2260 KB	Output is correct
13	Correct	72 ms	6152 KB	Output is correct
14	Correct	96 ms	8664 KB	Output is correct
15	Correct	194 ms	15064 KB	Output is correct
16	Correct	220 ms	16312 KB	Output is correct
17	Correct	327 ms	23936 KB	Output is correct
18	Correct	324 ms	27088 KB	Output is correct
19	Correct	430 ms	35668 KB	Output is correct
20	Correct	477 ms	39628 KB	Output is correct