# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
304408 |
2020-09-21T09:38:29 Z |
dolijan |
Poi (IOI09_poi) |
C++14 |
|
1143 ms |
4472 KB |
#include <bits/stdc++.h>
using namespace std;
struct skor{
public:
int poeni,br,rb;
};
bool comp(skor a,skor b)
{
if(a.poeni>b.poeni) return true;
else if(a.poeni==b.poeni)
{
if(a.br>b.br) return true;
else if(a.br==b.br)
{
if(a.rb<b.rb) return true;
}
}
return false;
}
int main()
{
int n,t,p;
cin>>n>>t>>p;
int resen[t];
for(int i=0;i<t;i++) resen[i]=0;
bool li[n][t];
for(int i=0;i<n;i++)
{
for(int j=0;j<t;j++)
{
cin>>li[i][j];
resen[j]+=li[i][j];
}
}
skor takm[n];
skor pom;
for(int i=0;i<n;i++)
{
pom.poeni=0;
pom.br=0;
pom.rb=i;
for(int j=0;j<t;j++)
{
if(li[i][j])
{
pom.poeni+=(n-resen[j]);
pom.br++;
}
}
takm[i]=pom;
}
sort(takm,takm+n,comp);
for(int i=0;i<n;i++)
{
if(takm[i].rb==p-1)
{
cout<<takm[i].poeni<<" "<<i+1<<endl;
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
256 KB |
Output is correct |
2 |
Correct |
0 ms |
256 KB |
Output is correct |
3 |
Correct |
0 ms |
256 KB |
Output is correct |
4 |
Correct |
0 ms |
256 KB |
Output is correct |
5 |
Correct |
1 ms |
256 KB |
Output is correct |
6 |
Correct |
1 ms |
256 KB |
Output is correct |
7 |
Correct |
2 ms |
256 KB |
Output is correct |
8 |
Correct |
2 ms |
256 KB |
Output is correct |
9 |
Correct |
5 ms |
256 KB |
Output is correct |
10 |
Correct |
9 ms |
384 KB |
Output is correct |
11 |
Correct |
35 ms |
384 KB |
Output is correct |
12 |
Correct |
59 ms |
504 KB |
Output is correct |
13 |
Correct |
168 ms |
920 KB |
Output is correct |
14 |
Correct |
247 ms |
1144 KB |
Output is correct |
15 |
Correct |
424 ms |
1784 KB |
Output is correct |
16 |
Correct |
474 ms |
2040 KB |
Output is correct |
17 |
Correct |
680 ms |
2740 KB |
Output is correct |
18 |
Correct |
771 ms |
2976 KB |
Output is correct |
19 |
Correct |
1016 ms |
3960 KB |
Output is correct |
20 |
Correct |
1143 ms |
4472 KB |
Output is correct |