# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
956633 |
2024-04-02T08:56:59 Z |
DeltaStruct |
Poi (IOI09_poi) |
C++17 |
|
460 ms |
31828 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(),m*n); for (int i(0);i < n;++i) for (int k(0);k < m;++k) C[i] += A[i][k]*B[k]*n*(m+1)-A[i][k]*n;
int r = C[q-1]; sort(C.begin(),C.end(),greater<int>());
cout << r/n/(m+1) << ' ' << find(C.begin(),C.end(),r)-C.begin()+1 << 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 |
600 KB |
Output isn't correct |
4 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
5 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
9 |
Incorrect |
2 ms |
348 KB |
Output isn't correct |
10 |
Correct |
4 ms |
604 KB |
Output is correct |
11 |
Correct |
14 ms |
1384 KB |
Output is correct |
12 |
Correct |
24 ms |
2016 KB |
Output is correct |
13 |
Incorrect |
71 ms |
5096 KB |
Output isn't correct |
14 |
Incorrect |
99 ms |
7004 KB |
Output isn't correct |
15 |
Incorrect |
172 ms |
12208 KB |
Output isn't correct |
16 |
Correct |
189 ms |
13188 KB |
Output is correct |
17 |
Correct |
293 ms |
19260 KB |
Output is correct |
18 |
Correct |
317 ms |
21776 KB |
Output is correct |
19 |
Correct |
444 ms |
28676 KB |
Output is correct |
20 |
Correct |
460 ms |
31828 KB |
Output is correct |