# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
631127 |
2022-08-17T17:39:00 Z |
chinmoy_101 |
Poi (IOI09_poi) |
C++14 |
|
567 ms |
16064 KB |
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int main()
{
int n, t, p;
cin>>n >>t >>p;
int points[t];
memset(points, 0, sizeof points);
int arr[n][n];
vector<pair<int, pair<int, int> > > final_standing; // score, solves, -id
for(int i=0; i<n; i++)
{
for(int j=0; j<t; j++)
{
cin>>arr[i][j];
if(arr[i][j]==0)
{
points[j]++;
}
}
}
for(int i=0; i<n; i++)
{
int ans=0, prob=0;
for(int j=0; j<t; j++)
{
if(arr[i][j]==1)
{
ans+=points[j];
prob++;
}
}
final_standing.push_back(make_pair(ans, make_pair(prob, -i-1)));
}
sort(final_standing.begin(), final_standing.end());
reverse(final_standing.begin(), final_standing.end());
for(int i=0; i<n; i++)
{
if(final_standing[i].second.second== -p)
{
cout<<final_standing[i].first <<" " <<i+1 <<"\n";
return 0;
}
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
3 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Incorrect |
1 ms |
212 KB |
Output isn't correct |
8 |
Correct |
1 ms |
212 KB |
Output is correct |
9 |
Incorrect |
2 ms |
340 KB |
Output isn't correct |
10 |
Correct |
4 ms |
448 KB |
Output is correct |
11 |
Incorrect |
17 ms |
644 KB |
Output isn't correct |
12 |
Correct |
28 ms |
1268 KB |
Output is correct |
13 |
Incorrect |
81 ms |
2204 KB |
Output isn't correct |
14 |
Correct |
115 ms |
4184 KB |
Output is correct |
15 |
Incorrect |
249 ms |
5916 KB |
Output isn't correct |
16 |
Correct |
222 ms |
6892 KB |
Output is correct |
17 |
Incorrect |
377 ms |
9084 KB |
Output isn't correct |
18 |
Correct |
369 ms |
11596 KB |
Output is correct |
19 |
Correct |
518 ms |
15936 KB |
Output is correct |
20 |
Correct |
567 ms |
16064 KB |
Output is correct |