Submission #575409

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
575409	2022-06-10T10:42:37 Z	Samuraj	Poi (IOI09_poi)	C++14	100 / 100	226 ms	16164 KB

poi

#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 2007;

struct player{
  int score{0};
  int l_tasks{0};
  int id{0};
  vector<int> tasks;
};

vector<player> gracze;
int ile_zrobionych[MAX_N]{};

bool sortowanko(const player& p1,const player& p2){
  if(p1.score > p2.score){
    return true;
  }
  if(p1.score == p2.score){
    if(p1.l_tasks > p2.l_tasks){
      return true;
    }
    if(p1.l_tasks == p2.l_tasks){
      if(p1.id < p2.id){
        return true;
      }
    }
  }
  return false;
}

int main(){

  ios::sync_with_stdio(0);
  cin.tie();

  int n,t,p;
  cin >> n >> t >> p;

  for(int i = 1; i <= n; i++){
    player gracz{};
    gracz.id = i;

    for(int j = 1; j <= t; j++){
      int x;
      cin >> x;
      if(x == 1){
        ile_zrobionych[j]++;
        gracz.tasks.push_back(j);
        gracz.l_tasks++;
      }
    }
    gracze.push_back(gracz);
  }

  for(int i = 0; i < n; i++){
    for(auto j: gracze[i].tasks){
      gracze[i].score += n-ile_zrobionych[j];
    }
  }

  sort(gracze.begin(),gracze.end(),sortowanko);


  /*
  for(int i = 1; i<=t; i++){
    cout << "task: " << i << " ile_zrobionych: " << ile_zrobionych[i] << '\n';
  }

  for(auto i : gracze){
    cout << "id: " << i.id << " score: " << i.score << '\n' ;
  }
  */

  for(int i = 0; i < n; i++){
    if(gracze[i].id == p){
      cout << gracze[i].score << ' ' << i+1;
      break;
    }
  }


}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 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	324 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	2 ms	332 KB	Output is correct
9	Correct	2 ms	340 KB	Output is correct
10	Correct	2 ms	340 KB	Output is correct
11	Correct	7 ms	808 KB	Output is correct
12	Correct	13 ms	1024 KB	Output is correct
13	Correct	48 ms	2636 KB	Output is correct
14	Correct	56 ms	3724 KB	Output is correct
15	Correct	87 ms	6264 KB	Output is correct
16	Correct	97 ms	6796 KB	Output is correct
17	Correct	172 ms	9764 KB	Output is correct
18	Correct	152 ms	10956 KB	Output is correct
19	Correct	201 ms	14468 KB	Output is correct
20	Correct	226 ms	16164 KB	Output is correct