Submission #503507

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
503507	2022-01-08T08:34:25 Z	600Mihnea	Poi (IOI09_poi)	C++17	100 / 100	262 ms	23792 KB

poi

#include <bits/stdc++.h>

using namespace std;

const int N = 2000 + 7;
int n;
int t;
int pos;
int yes[N][N];
int nsolved[N];
int score[N];
int total[N];

bool cmp(int i, int j) {
  if (score[i] != score[j]) {
    return score[i] > score[j];
  }
  if (total[i] != total[j]) {
    return total[i] > total[j];
  }
  return i < j;
}

int main() {
  ios::sync_with_stdio(0); cin.tie(0);

///  freopen ("input", "r", stdin);

  cin >> n >> t >> pos;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= t; j++) {
      cin >> yes[i][j];
      total[i] += yes[i][j];
      nsolved[j] += 1 ^ yes[i][j];
    }
  }

  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= t; j++) {
      score[i] += yes[i][j] * nsolved[j];
    }
  }

  int sm = 0;
  for (int i = 1; i <= n; i++) {
    if (i != pos) {
      sm += cmp(i, pos);
    }
  }

  cout << score[pos] << " " << sm + 1 << "\n";
  return 0;
}

Subtask #1

100.0 / 100.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	328 KB	Output is correct
2	Correct	0 ms	324 KB	Output is correct
3	Correct	1 ms	332 KB	Output is correct
4	Correct	1 ms	332 KB	Output is correct
5	Correct	1 ms	448 KB	Output is correct
6	Correct	1 ms	460 KB	Output is correct
7	Correct	1 ms	588 KB	Output is correct
8	Correct	1 ms	588 KB	Output is correct
9	Correct	1 ms	716 KB	Output is correct
10	Correct	3 ms	1228 KB	Output is correct
11	Correct	7 ms	2160 KB	Output is correct
12	Correct	13 ms	3460 KB	Output is correct
13	Correct	37 ms	6720 KB	Output is correct
14	Correct	46 ms	9224 KB	Output is correct
15	Correct	77 ms	12656 KB	Output is correct
16	Correct	97 ms	13688 KB	Output is correct
17	Correct	134 ms	16680 KB	Output is correct
18	Correct	193 ms	18944 KB	Output is correct
19	Correct	221 ms	22968 KB	Output is correct
20	Correct	262 ms	23792 KB	Output is correct