| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 956640 |
2024-04-02T09:23:39 Z |
DeltaStruct |
Poi (IOI09_poi) |
C++17 |
|
470 ms |
31812 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]; int t = count(C.begin(),C.begin()+q,r); sort(C.begin(),C.end(),greater<pair<int,int>>());
cout << r.first << ' ' << find(C.begin(),C.end(),r)-C.begin()+t << endl;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
1 ms |
504 KB |
Output is correct |
| 3 |
Correct |
0 ms |
348 KB |
Output is correct |
| 4 |
Correct |
1 ms |
348 KB |
Output is correct |
| 5 |
Correct |
1 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 |
4 ms |
676 KB |
Output is correct |
| 11 |
Correct |
14 ms |
1380 KB |
Output is correct |
| 12 |
Correct |
24 ms |
1996 KB |
Output is correct |
| 13 |
Correct |
75 ms |
5100 KB |
Output is correct |
| 14 |
Correct |
95 ms |
7004 KB |
Output is correct |
| 15 |
Correct |
179 ms |
12376 KB |
Output is correct |
| 16 |
Correct |
185 ms |
13192 KB |
Output is correct |
| 17 |
Correct |
270 ms |
19284 KB |
Output is correct |
| 18 |
Correct |
315 ms |
21780 KB |
Output is correct |
| 19 |
Correct |
411 ms |
28680 KB |
Output is correct |
| 20 |
Correct |
470 ms |
31812 KB |
Output is correct |
