Submission #866287

# Submission time Handle Problem Language Result Execution time Memory
866287 2023-10-25T18:24:21 Z lomta Poi (IOI09_poi) C++17
100 / 100
477 ms 31852 KB
#include <bits/stdc++.h>
using namespace std;
#define int long long

const int N=2005;
int arr[N][N];

main(){
	
	int n,t,p;cin>>n>>t>>p;
	
	for(int i=0;i<n;i++){
		for(int j=0;j<t;j++){
			cin>>arr[i][j];
		}
	}
	
	vector<int> v(t,0);
	for(int i=0;i<n;i++){
		for(int j=0;j<t;j++){
			if(arr[i][j]==0){
				v[j]++;
			}
		}
	}
	
	vector<int> points(n,0);
	vector<int> number(n,0);
	for(int i=0;i<n;i++){
		for(int j=0;j<t;j++){
			points[i]+=arr[i][j]*v[j];
			if(arr[i][j]==1){
				number[i]++;
			}
		}
	}
	int ans=0;
	p--;
	
	for(int i=0;i<n;i++){
		if(points[i]>points[p]){
			ans++;
			continue;
		}
		if(points[i]==points[p]){
			if(number[i]>number[p]){
				ans++;
			}
			else 
				if(number[i]==number[p]){
					if(i<p){
						ans++;
					}		
				}
			
		}
	}
	
	//cout<<"here"<<endl;
	cout<<points[p]<<" "<<ans+1<<endl;
	
	
}

Compilation message

poi.cpp:8:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
    8 | main(){
      | ^~~~
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 2 ms 2396 KB Output is correct
9 Correct 2 ms 2396 KB Output is correct
10 Correct 4 ms 4444 KB Output is correct
11 Correct 16 ms 6488 KB Output is correct
12 Correct 25 ms 8536 KB Output is correct
13 Correct 75 ms 12624 KB Output is correct
14 Correct 104 ms 16928 KB Output is correct
15 Correct 177 ms 21084 KB Output is correct
16 Correct 194 ms 21064 KB Output is correct
17 Correct 301 ms 25440 KB Output is correct
18 Correct 323 ms 27224 KB Output is correct
19 Correct 440 ms 31624 KB Output is correct
20 Correct 477 ms 31852 KB Output is correct