# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
956639 |
2024-04-02T09:22:15 Z |
DeltaStruct |
Poi (IOI09_poi) |
C++17 |
|
472 ms |
39756 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<pair<int,int>> C(n); for (int i(0);i < n;++i) for (int k(0);k < m;++k) C[i].first += A[i][k]*B[k],C[i].second+=A[i][k];
auto r = C[q-1]; sort(C.begin(),C.end(),greater<pair<int,int>>());
cout << r.first << ' ' << find(C.begin(),C.end(),r)-C.begin()+count(C.begin(),C.end(),r) << endl;
}
# |
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 |
1 ms |
432 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Incorrect |
2 ms |
584 KB |
Output isn't correct |
10 |
Correct |
4 ms |
604 KB |
Output is correct |
11 |
Correct |
15 ms |
1548 KB |
Output is correct |
12 |
Correct |
24 ms |
2396 KB |
Output is correct |
13 |
Correct |
70 ms |
6228 KB |
Output is correct |
14 |
Correct |
99 ms |
8776 KB |
Output is correct |
15 |
Correct |
178 ms |
14928 KB |
Output is correct |
16 |
Correct |
190 ms |
16208 KB |
Output is correct |
17 |
Incorrect |
280 ms |
23892 KB |
Output isn't correct |
18 |
Correct |
327 ms |
27008 KB |
Output is correct |
19 |
Incorrect |
422 ms |
35664 KB |
Output isn't correct |
20 |
Correct |
472 ms |
39756 KB |
Output is correct |