# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
893080 |
2023-12-26T13:27:37 Z |
Macker |
Poi (IOI09_poi) |
C++17 |
|
181 ms |
8904 KB |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define all(v) v.begin(), v.end()
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx2")
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, p, o; cin >> n >> p >> o; o--;
vector<vector<bool>> c(n, vector<bool>(p)); vector<int> t(p);
vector<tuple<int, int, int>> res(n);
for (int i = 0; i < n; i++) {
get<2>(res[i]) = i;
for (int j = 0; j < p; j++) {
int a; cin >> a;
if(a == 0){
t[j]++;
}
else{
get<1>(res[i])--;
}
c[i][j] = a;
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < p; j++) {
get<0>(res[i]) -= c[i][j] * t[j];
}
}
sort(all(res));
for (int i = 0; i < n; i++) {
if(get<2>(res[i]) == o){
cout << -get<0>(res[i]) << " " << i + 1 << "\n";
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
2 ms |
348 KB |
Output is correct |
10 |
Correct |
2 ms |
344 KB |
Output is correct |
11 |
Correct |
6 ms |
604 KB |
Output is correct |
12 |
Correct |
10 ms |
884 KB |
Output is correct |
13 |
Correct |
27 ms |
1620 KB |
Output is correct |
14 |
Correct |
39 ms |
2140 KB |
Output is correct |
15 |
Correct |
68 ms |
3508 KB |
Output is correct |
16 |
Correct |
76 ms |
3912 KB |
Output is correct |
17 |
Correct |
108 ms |
5420 KB |
Output is correct |
18 |
Correct |
128 ms |
5972 KB |
Output is correct |
19 |
Correct |
162 ms |
8048 KB |
Output is correct |
20 |
Correct |
181 ms |
8904 KB |
Output is correct |