| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 956620 |
2024-04-02T08:36:46 Z |
DeltaStruct |
Poi (IOI09_poi) |
C++17 |
|
444 ms |
31832 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*m+A[q-1][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*m+A[q-1][k]*n;
cout << r/n/m << ' ' << upper_bound(C.begin(),C.end(),r,greater<int>())-C.begin() << endl;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
| 4 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 5 |
Correct |
1 ms |
344 KB |
Output is correct |
| 6 |
Correct |
1 ms |
348 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 |
348 KB |
Output is correct |
| 10 |
Correct |
3 ms |
604 KB |
Output is correct |
| 11 |
Correct |
13 ms |
1384 KB |
Output is correct |
| 12 |
Correct |
22 ms |
1884 KB |
Output is correct |
| 13 |
Incorrect |
64 ms |
5100 KB |
Output isn't correct |
| 14 |
Correct |
92 ms |
7004 KB |
Output is correct |
| 15 |
Incorrect |
162 ms |
12204 KB |
Output isn't correct |
| 16 |
Correct |
176 ms |
13396 KB |
Output is correct |
| 17 |
Correct |
262 ms |
19280 KB |
Output is correct |
| 18 |
Correct |
307 ms |
21848 KB |
Output is correct |
| 19 |
Correct |
388 ms |
28752 KB |
Output is correct |
| 20 |
Correct |
444 ms |
31832 KB |
Output is correct |
