Submission #346485

# Submission time Handle Problem Language Result Execution time Memory
346485 2021-01-10T00:48:34 Z MilosMilutinovic Poi (IOI09_poi) C++14
100 / 100
299 ms 23916 KB
/**
 *  author: milos
 *  created: 10.01.2021 01:42:54
**/
#include <bits/stdc++.h>

using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, t, id;
  cin >> n >> t >> id;
  --id;
  vector<vector<int>> a(n, vector<int>(t));
  vector<int> cnt(t, 0);
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < t; j++) {
      cin >> a[i][j];  
      cnt[j] += a[i][j];
    }
  }         
  vector<int> p(t);
  for (int i = 0; i < t; i++) {
    p[i] = n - cnt[i];
  }           
  vector<tuple<int, int, int>> b;
  for (int i = 0; i < n; i++) {
    int sum = 0;
    for (int j = 0; j < t; j++) {
      if (a[i][j] == 1) {
        sum += p[j];
      }
    }                       
    b.emplace_back(sum, accumulate(a[i].begin(), a[i].end(), 0), n - i);
  }
  sort(b.rbegin(), b.rend());
  for (int i = 0; i < (int) b.size(); i++) {
    if (get<2>(b[i]) == n - id) {
      cout << get<0>(b[i]) << " " << i + 1 << '\n';
    }
  }
  return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 2 ms 492 KB Output is correct
10 Correct 3 ms 492 KB Output is correct
11 Correct 10 ms 1004 KB Output is correct
12 Correct 16 ms 1516 KB Output is correct
13 Correct 45 ms 3948 KB Output is correct
14 Correct 67 ms 5356 KB Output is correct
15 Correct 118 ms 9196 KB Output is correct
16 Correct 122 ms 10108 KB Output is correct
17 Correct 184 ms 14588 KB Output is correct
18 Correct 206 ms 16492 KB Output is correct
19 Correct 268 ms 21612 KB Output is correct
20 Correct 299 ms 23916 KB Output is correct