Submission #930381

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
930381	2024-02-19T13:56:08 Z	vjudge1	Poi (IOI09_poi)	C++17	100 / 100	250 ms	23888 KB

poi

#include<cstdio>
#include<algorithm>
#define UP(i,a,b) for(i=a;i<=(b);++i)
#define DN(i,a,b) for(i=a;i>=(b);--i)

using std::sort;

const int N=2e3+5;
int a[N][N],score[N],n,t,p;
struct node{
	int sc,cnt,i;
	node():sc(0),cnt(0){}
}b[N];

bool operator<(node a,node b){
	if(a.sc!=b.sc){
		return a.sc>b.sc;
	}else if(a.cnt!=b.cnt){
		return a.cnt>b.cnt;
	}else{
		return a.i<b.i;
	}
}
int main(){
	int i,j;
	scanf("%d%d%d",&n,&t,&p);
	UP(i,1,n){
		UP(j,1,t){
			scanf("%d",&a[i][j]);
			score[j]+=!a[i][j];
			b[i].cnt+=a[i][j];
		}
		b[i].i=i;
	}
	UP(i,1,n){
		UP(j,1,t){
			b[i].sc+=a[i][j]*score[j];
		}
	}
	sort(b+1,b+n+1);
	UP(i,1,n){
		if(b[i].i==p){
			printf("%d %d\n",b[i].sc,i);
			break;
		}
	}
	return 0;
}

Compilation message

poi.cpp: In function 'int main()':
poi.cpp:26:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |  scanf("%d%d%d",&n,&t,&p);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~
poi.cpp:29:9: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 |    scanf("%d",&a[i][j]);
      |    ~~~~~^~~~~~~~~~~~~~~

Subtask #1

100.0 / 100.0

#	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	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	452 KB	Output is correct
6	Correct	1 ms	604 KB	Output is correct
7	Correct	1 ms	604 KB	Output is correct
8	Correct	1 ms	600 KB	Output is correct
9	Correct	1 ms	860 KB	Output is correct
10	Correct	3 ms	3164 KB	Output is correct
11	Correct	8 ms	3420 KB	Output is correct
12	Correct	14 ms	5704 KB	Output is correct
13	Correct	39 ms	8796 KB	Output is correct
14	Correct	56 ms	11348 KB	Output is correct
15	Correct	96 ms	14732 KB	Output is correct
16	Correct	114 ms	15244 KB	Output is correct
17	Correct	152 ms	18516 KB	Output is correct
18	Correct	171 ms	18952 KB	Output is correct
19	Correct	227 ms	23164 KB	Output is correct
20	Correct	250 ms	23888 KB	Output is correct