# |
제출 시각 |
아이디 |
문제 |
언어 |
결과 |
실행 시간 |
메모리 |
609864 |
2022-07-28T02:20:44 Z |
ozed |
Poi (IOI09_poi) |
C++14 |
|
617 ms |
23876 KB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
struct competition{
int score;
int solved;
int id;
};
bool compare(competition &t1,competition &t2){
if(t1.score > t2.score){return true;}
else if(t1.score<t2.score){return false;}
else if(t1.solved >t2.solved){return true;}
else if(t1.solved <t2.solved){return false;}
else return t1.id <t2.id;
}
int main(){
int n,t,p;
cin>>n>>t>>p;
vector<competition>v(n);
vector<vi>v1(n);
vi score(t);
for(int i=0;i<n;i++){
v1[i]=vi(t);
v[i].id=i+1;
for(int j=0;j<t;j++){
cin>>v1[i][j];
v[i].solved+=v1[i][j];
if(v1[i][j] == 0){
score[j]++;
}
}
}
for(int i=0;i<n;i++){
for(int j=0;j<t;j++){
if(v1[i][j]==1){
v[i].score+=score[j];
}
}
}
sort(v.begin(),v.end(),&compare);
for(int i=0;i<n;i++){
if(v[i].id==p){
cout<<v[i].score<<" "<<i+1<<endl;
}
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 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 |
2 ms |
212 KB |
Output is correct |
8 |
Correct |
1 ms |
340 KB |
Output is correct |
9 |
Correct |
3 ms |
340 KB |
Output is correct |
10 |
Correct |
5 ms |
440 KB |
Output is correct |
11 |
Correct |
18 ms |
936 KB |
Output is correct |
12 |
Correct |
29 ms |
1464 KB |
Output is correct |
13 |
Correct |
90 ms |
3780 KB |
Output is correct |
14 |
Correct |
141 ms |
5316 KB |
Output is correct |
15 |
Correct |
262 ms |
9108 KB |
Output is correct |
16 |
Correct |
234 ms |
9784 KB |
Output is correct |
17 |
Correct |
352 ms |
14412 KB |
Output is correct |
18 |
Correct |
391 ms |
16336 KB |
Output is correct |
19 |
Correct |
523 ms |
21512 KB |
Output is correct |
20 |
Correct |
617 ms |
23876 KB |
Output is correct |