Submission #541952

# Submission time Handle Problem Language Result Execution time Memory
541952 2022-03-24T21:04:31 Z DemonLord154 Poi (IOI09_poi) C++14
70 / 100
597 ms 23796 KB
#include<iostream>
#include<vector>
#include<bits/stdc++.h>
using namespace std;
struct Player{
  int score;
  int id;
  int probSolved;
};
bool comparator(Player player1,Player player2){
  if (player1.score != player2.score){
    return player1.score<player2.score;
  }
  if (player1.probSolved!= player2.probSolved){
    return player1.probSolved < player2.probSolved;
  }
  return player1.id<player2.id;
}
int main(){
  int n,t,p;
  cin>>n>>t>>p;
  vector<Player> players(n);
  int scores[n][t];
  for (int i=0;i<n;i++){
    for (int j=0;j<t;j++){
      cin>>scores[i][j];
    }
  }
  vector<int> eachTestScore(t);
  for (int i=0;i<t;i++){
    int score=0;
    for (int j=0;j<n;j++){
      if (scores[j][i]==0){
        score++;
      }
    }
    eachTestScore[i]=score;
  }
  for (int i=0;i<n;i++){
    int playerScore=0,probsolved=0;
    for (int j=0;j<t;j++){
      if (scores[i][j]==1){
        playerScore+=eachTestScore[j];
        probsolved++;
      }
    }
    players[i].score=playerScore;
    players[i].id=i;
    players[i].probSolved=probsolved;
  }
  sort(players.begin(),players.end(),comparator);
  for (int i=0;i<n;i++){
    if (players[i].id==p-1){
      cout<<players[i].score<<" "<<n-i<<endl;
      break;
    }
  }
}
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Correct 1 ms 296 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Incorrect 1 ms 212 KB Output isn't correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 300 KB Output is correct
7 Correct 1 ms 328 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 3 ms 340 KB Output is correct
10 Correct 5 ms 468 KB Output is correct
11 Correct 18 ms 1000 KB Output is correct
12 Incorrect 31 ms 1448 KB Output isn't correct
13 Incorrect 90 ms 3756 KB Output isn't correct
14 Correct 131 ms 5264 KB Output is correct
15 Incorrect 222 ms 9120 KB Output isn't correct
16 Correct 238 ms 9832 KB Output is correct
17 Correct 344 ms 14284 KB Output is correct
18 Correct 392 ms 16268 KB Output is correct
19 Incorrect 531 ms 21416 KB Output isn't correct
20 Correct 597 ms 23796 KB Output is correct