Submission #798110

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
798110	2023-07-30T11:19:46 Z	YassirSalama	Poi (IOI09_poi)	C++14	100 / 100	176 ms	35556 KB

poi

#include <iostream>
#include <vector>
#include <algorithm>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <iomanip>
#include <cmath>
#include <limits>
#include <map>
#include <utility>
#include <cctype>
#include <string>
#include <cstring>
#include <stack>
#include <queue>
#include <functional>
#include <iterator>
using namespace std;
#define OVL(x,s) for(auto y:x) cout<<y<<s; cout<<"\n";
#define endl "\n"
#define pb push_back
#define F first
#define S second
#define ll long long
#define mod 1000000007
#define all(v) v.begin(),v.end()
#define int long long
void dbg_out() { cout << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cout << ' ' << H; dbg_out(T...); }
#define dbg(...) cout << "[ " << #__VA_ARGS__<< "] :", dbg_out(__VA_ARGS__);


struct st{
	int id;
	int score;
	int ntasks;
	bool operator < (const st& other) const{
		if(score==other.score) {
			if(ntasks==other.ntasks) 
				return id<other.id;
			return ntasks>other.ntasks;
		}
		return score>other.score;
	}
};
signed main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int n,t,p;
cin>>n>>t>>p;
int arr[t];
// memset(arr,n,sizeof(arr));
for(int i=0;i<t;i++) arr[i]=n;
vector<vector<int>> v(n,vector<int>(t,0));
for(int i=0;i<n;i++){
	for(int j=0;j<t;j++){
		cin>>v[i][j];
		arr[j]-=v[i][j];
	}
}
vector<st> vv;
for(int i=0;i<n;i++){
	int sc=0;
	int nt=0;
	for(int j=0;j<t;j++){
		sc+=v[i][j]*arr[j];
		nt+=v[i][j];
	}
	// cout<<i+1<<" "<<sc<<" "<<nt<<endl;
	vv.push_back({.id=i+1,.score=sc,.ntasks=nt});
}
sort(all(vv));
for(int i=0;i<n;i++){
	// dbg(vv[i].id,vv[i].score,vv[i].ntasks);
	if(vv[i].id==p){
		cout<<vv[i].score<<" "<<i+1<<endl;
		return 0;
	}
}
}

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	324 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 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	1 ms	340 KB	Output is correct
10	Correct	2 ms	468 KB	Output is correct
11	Correct	6 ms	1272 KB	Output is correct
12	Correct	9 ms	2260 KB	Output is correct
13	Correct	25 ms	4948 KB	Output is correct
14	Correct	38 ms	8600 KB	Output is correct
15	Correct	65 ms	12116 KB	Output is correct
16	Correct	73 ms	16220 KB	Output is correct
17	Correct	103 ms	19184 KB	Output is correct
18	Correct	118 ms	26956 KB	Output is correct
19	Correct	163 ms	35556 KB	Output is correct
20	Correct	176 ms	31784 KB	Output is correct