| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 956616 |
2024-04-02T08:33:25 Z |
DeltaStruct |
Poi (IOI09_poi) |
C++17 |
|
485 ms |
31808 KB |
#include <bits/stdc++.h>
using namespace std;
int main(){
#define int long long
int n,m,q; cin >> n >> m >> q; vector A(n,vector<int>(m)); vector<int> B(m,n);
for (int i(0);i < n;++i) for (int k(0);k < m;++k) (cin>>A[i][k]),B[k]-=A[i][k];
vector<int> C(n); iota(C.rbegin(),C.rend(),0); for (int i(0);i < n;++i) for (int k(0);k < m;++k) C[i] += A[i][k]*B[k]*n;
sort(C.begin(),C.end(),greater<int>()); int r(n-q); for (int k(0);k < m;++k) r += A[q-1][k]*B[k]*n;
assert(binary_search(C.begin(),C.end(),r,greater<int>()));
cout << r/n << ' ' << upper_bound(C.begin(),C.end(),r,greater<int>())-C.begin() << endl;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
348 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 4 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 5 |
Correct |
0 ms |
348 KB |
Output is correct |
| 6 |
Correct |
1 ms |
600 KB |
Output is correct |
| 7 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
| 8 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
| 9 |
Correct |
2 ms |
560 KB |
Output is correct |
| 10 |
Correct |
5 ms |
760 KB |
Output is correct |
| 11 |
Correct |
14 ms |
1368 KB |
Output is correct |
| 12 |
Correct |
22 ms |
1880 KB |
Output is correct |
| 13 |
Incorrect |
66 ms |
5208 KB |
Output isn't correct |
| 14 |
Correct |
93 ms |
7128 KB |
Output is correct |
| 15 |
Incorrect |
178 ms |
12368 KB |
Output isn't correct |
| 16 |
Correct |
181 ms |
13192 KB |
Output is correct |
| 17 |
Correct |
267 ms |
19268 KB |
Output is correct |
| 18 |
Correct |
325 ms |
21844 KB |
Output is correct |
| 19 |
Correct |
398 ms |
28676 KB |
Output is correct |
| 20 |
Correct |
485 ms |
31808 KB |
Output is correct |
