# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
359455 | 2021-01-27T03:09:42 Z | lakshith_ | Poi (IOI09_poi) | C++14 | 673 ms | 16108 KB |
#include <bits/stdc++.h> using namespace std; struct student{ int id; int tasks; int score; }; bool comp(student s1,student s2){ if(s1.score>s2.score)return true; else if(s1.score<s2.score)return false; else if(s1.tasks>s2.tasks)return true; else if(s1.tasks<s2.tasks)return false; else return (s1.id<s2.id); } int main(){ int n,t,p; cin >> n >> t >> p; p--; vector<int> scores(t,n); vector<vector<int>> vec; for(int i=0;i<n;i++){ vector<int> v; for(int j=0;j<t;j++){ int a; cin >> a; if(a==1){ scores[j]--; v.push_back(j); } } vec.push_back(v); } //for(int x:scores)cout << x << "\t"; //cout << "\n"; vector<student> students; for(int i=0;i<n;i++){ int score = 0; for(int x:vec[i])score += scores[x]; students.push_back({i,vec[i].size(),score}); //cout << i << "\t" << vec[i].size() << "\t" << score << "\n"; } sort(students.begin(),students.end(),comp); for(int i=0;i<n;i++) if(students[i].id==p){ cout << students[i].score << " " << i+1 << "\n"; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Correct | 1 ms | 364 KB | Output is correct |
3 | Correct | 1 ms | 364 KB | Output is correct |
4 | Correct | 1 ms | 364 KB | Output is correct |
5 | Correct | 1 ms | 364 KB | Output is correct |
6 | Correct | 1 ms | 364 KB | Output is correct |
7 | Correct | 1 ms | 364 KB | Output is correct |
8 | Correct | 2 ms | 364 KB | Output is correct |
9 | Correct | 3 ms | 364 KB | Output is correct |
10 | Correct | 6 ms | 492 KB | Output is correct |
11 | Correct | 21 ms | 748 KB | Output is correct |
12 | Correct | 35 ms | 1192 KB | Output is correct |
13 | Correct | 105 ms | 2668 KB | Output is correct |
14 | Correct | 144 ms | 3820 KB | Output is correct |
15 | Correct | 253 ms | 6400 KB | Output is correct |
16 | Correct | 280 ms | 6764 KB | Output is correct |
17 | Correct | 400 ms | 9836 KB | Output is correct |
18 | Correct | 460 ms | 11116 KB | Output is correct |
19 | Correct | 601 ms | 14680 KB | Output is correct |
20 | Correct | 673 ms | 16108 KB | Output is correct |