Submission #218114

# Submission time Handle Problem Language Result Execution time Memory
218114 2020-04-01T08:48:42 Z kimbj0709 Poi (IOI09_poi) C++17
100 / 100
841 ms 17536 KB
#include <bits/stdc++.h>
using namespace std;
vector<int> arr[2000];
bool comp(pair<int,int> a,pair<int,int> b){
    if(a.first != b.first){
        return a.first>b.first;
    }
    else if(a.first==b.first&&arr[a.second].size()!=arr[b.second].size()){
        return arr[a.second].size()>arr[b.second].size();
    }
    else{
        return a.second < b.second;
    }
}
int main() {
  int no_of_input,no_of_tasks,pos;
  int input;
  vector<int> tasks;
  vector<pair<int,int> > vect1;
  cin >> no_of_input >> no_of_tasks >> pos;
  for(int i=0;i<no_of_tasks;i++){
    tasks.push_back(0);
  }
  for(int i=0;i<no_of_input;i++){
    for(int j=0;j<no_of_tasks;j++){
      cin >> input;
      if(input==1){
        arr[i].push_back(j);
      }
      else{
        tasks[j]++;
      }
    }
  }
  for(int i=0;i<no_of_input;i++){
    int count = 0;
    for(int j=0;j<arr[i].size();j++){
      count += tasks[arr[i][j]];
    }
    vect1.push_back(make_pair(count,i));
    count = 0;
  }
  sort(vect1.begin(),vect1.end(),comp);
  for(int i=0;i<vect1.size();i++){
    if(vect1[i].second == pos-1){
      cout << vect1[i].first << " " << i+1;
      return 0;
    }
  }

}

Compilation message

poi.cpp: In function 'int main()':
poi.cpp:37:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int j=0;j<arr[i].size();j++){
                 ~^~~~~~~~~~~~~~
poi.cpp:44:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0;i<vect1.size();i++){
               ~^~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 6 ms 384 KB Output is correct
8 Correct 6 ms 384 KB Output is correct
9 Correct 8 ms 384 KB Output is correct
10 Correct 11 ms 512 KB Output is correct
11 Correct 31 ms 896 KB Output is correct
12 Correct 49 ms 1272 KB Output is correct
13 Correct 133 ms 3192 KB Output is correct
14 Correct 178 ms 4088 KB Output is correct
15 Correct 320 ms 8184 KB Output is correct
16 Correct 345 ms 8952 KB Output is correct
17 Correct 504 ms 11128 KB Output is correct
18 Correct 581 ms 12664 KB Output is correct
19 Correct 763 ms 15736 KB Output is correct
20 Correct 841 ms 17536 KB Output is correct