# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
720669 | 2023-04-08T22:10:53 Z | AnjaJ | Poi (IOI09_poi) | C++14 | 276 ms | 7996 KB |
#include <bits/stdc++.h> #include <cstring> using namespace std; struct Res{ int ID, Tasks, Points; Res(){ID = Tasks = Points = 0;} bool operator<(const Res &r) const{ if(Points != r.Points) return Points>r.Points; if(Tasks != r.Tasks) return Tasks>r.Tasks; return ID<r.ID; } }; int PhilID; int Contestants; int Tasks; vector<Res> Results(2001); bool T[2001][2001]; int Values[2001]; int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin>>Contestants>>Tasks>>PhilID; Results.resize(Contestants+1); for(int i=1; i<=Contestants; i++) { Results[i].ID = i; Results[i].Tasks = Results[i].Points = 0; } for(int i=1; i<=Tasks; i++) { Values[i] = Contestants; } for(int i=1; i<=Contestants; i++) { for(int j=1; j<=Tasks; j++) { cin>>T[i][j]; if(T[i][j]) { Values[j]--; Results[i].Tasks++; } } } for(int i=1; i<=Contestants; i++) { for(int j=1; j<=Tasks; j++) { if(T[i][j]) { Results[i].Points += Values[j]; } } } sort(Results.begin(), Results.end()); for(int i=0; i<Results.size(); i++) { if(Results[i].ID == PhilID) { cout<<Results[i].Points<<" "<<i+1<<'\n'; } } return 0; /*for(int i=1; i<=Tasks; i++) { cout<<Values[i]<<" "; }*/ /*cout<<endl; for(int i=1; i<=Contestants; i++) { for(int t : Results[i]) { cout<<t<<" "; } cout<<endl; }*/ }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 356 KB | Output is correct |
2 | Correct | 1 ms | 340 KB | Output is correct |
3 | Correct | 1 ms | 340 KB | Output is correct |
4 | Correct | 1 ms | 340 KB | Output is correct |
5 | Correct | 1 ms | 356 KB | Output is correct |
6 | Correct | 1 ms | 340 KB | Output is correct |
7 | Correct | 1 ms | 468 KB | Output is correct |
8 | Correct | 1 ms | 468 KB | Output is correct |
9 | Correct | 2 ms | 468 KB | Output is correct |
10 | Correct | 3 ms | 724 KB | Output is correct |
11 | Correct | 9 ms | 1108 KB | Output is correct |
12 | Correct | 15 ms | 1620 KB | Output is correct |
13 | Correct | 42 ms | 2860 KB | Output is correct |
14 | Correct | 57 ms | 3920 KB | Output is correct |
15 | Correct | 100 ms | 5568 KB | Output is correct |
16 | Correct | 113 ms | 5960 KB | Output is correct |
17 | Correct | 165 ms | 7040 KB | Output is correct |
18 | Correct | 188 ms | 7276 KB | Output is correct |
19 | Correct | 242 ms | 7996 KB | Output is correct |
20 | Correct | 276 ms | 7864 KB | Output is correct |