답안 #591801

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
591801	2022-07-08T00:04:08 Z	ozed	Poi (IOI09_poi)	C++14	20 / 100	624 ms	23880 KB

poi

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;

bool compare(tuple<int,int,int> &t1,tuple<int,int,int> &t2){
  if((get<0>(t1)==get<0>(t2))&&(get<1>(t1)==get<1>(t2))){return get<2>(t1)<get<2>(t2);}
  return false;
}

int main(){

int n,t,p;
cin>>n>>t>>p;
vector<vi>v(n);
vi score(t);
vector<tuple<int,int,int>> ranks(n);
for(int i=0;i<n;i++){
  v[i]=vi(t);
    for(int j=0;j<t;j++){
        cin>>v[i][j];
        if(v[i][j]==0){score[j]++;}
    }
}
for(int i=0;i<n;i++){
    get<2>(ranks[i])=i+1;
    for(int j=0;j<t;j++){
        if(v[i][j]==1){
          get<0>(ranks[i])+=score[j];
          get<1>(ranks[i])++;
        }
    }
}
sort(ranks.rbegin(),ranks.rend());
sort(ranks.begin(),ranks.end(),&compare);
for(int i=0;i<n;i++){
   if(get<2>(ranks[i]) == p ){
      cout<<get<0>(ranks[i]) << " " << i+1;
    }
}

return 0;
}

Subtask #1

20.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Incorrect	1 ms	212 KB	Output isn't correct
6	Incorrect	1 ms	212 KB	Output isn't correct
7	Incorrect	1 ms	340 KB	Output isn't correct
8	Incorrect	1 ms	340 KB	Output isn't correct
9	Incorrect	3 ms	340 KB	Output isn't correct
10	Incorrect	5 ms	468 KB	Output isn't correct
11	Incorrect	18 ms	912 KB	Output isn't correct
12	Incorrect	29 ms	1480 KB	Output isn't correct
13	Incorrect	91 ms	3764 KB	Output isn't correct
14	Incorrect	130 ms	5312 KB	Output isn't correct
15	Incorrect	206 ms	9108 KB	Output isn't correct
16	Incorrect	230 ms	9764 KB	Output isn't correct
17	Incorrect	327 ms	14468 KB	Output isn't correct
18	Incorrect	414 ms	16348 KB	Output isn't correct
19	Incorrect	508 ms	21404 KB	Output isn't correct
20	Incorrect	624 ms	23880 KB	Output isn't correct