oj.uz

Submission #571405

# Submission time Handle Problem Language Result Execution time Memory
571405 2022-06-02T06:53:41 Z amukkalir Poi (IOI09_poi) C++17
100 / 100
 349 ms 12048 KB 
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std; 

const int nax = 2000; 
int pt[nax+5]; 

signed main () {
    int n, t, p; 
    scanf("%d %d %d", &n, &t, &p); 
    
    bool sc[n][t]; 
    for(int i=0; i<n; i++) {
        for(int j=0; j<t; j++) {
            int x; scanf("%d", &x); 
            pt[j] += (x==0); 
            sc[i][j] = x; 
        }
    }

    //point, task, id 
    vector<pair<pair<int,int>, int>> ans; 
    for(int i=0; i<n; i++) {
        int point = 0, task = 0, id = i+1; 
        for(int j=0; j<t; j++) {
            task += sc[i][j]; 
            if(sc[i][j]) point += pt[j]; 
        }
        //cout << id << " " << point << endl; 
        ans.push_back({{-point, -task}, id}); 
    }

    sort(ans.begin(), ans.end()); 
    for(int i=0; i<n; i++) {
        //cout << ans[i].first.first*-1 << " " << ans[i].first.second*-1 << ' ' << ans[i].second << endl; 
        if(ans[i].second == p) {
            printf("%d %d", ans[i].first.first * -1, i+1); 
            return 0; 
        }
    }
}

Compilation message

poi.cpp: In function 'int main()':
poi.cpp:11:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |     scanf("%d %d %d", &n, &t, &p);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
poi.cpp:16:25: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |             int x; scanf("%d", &x);
      |                    ~~~~~^~~~~~~~~~

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 2 ms 212 KB Output is correct
8 Correct 1 ms 296 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 5 ms 340 KB Output is correct
11 Correct 12 ms 596 KB Output is correct
12 Correct 18 ms 864 KB Output is correct
13 Correct 52 ms 1984 KB Output is correct
14 Correct 80 ms 2784 KB Output is correct
15 Correct 127 ms 4676 KB Output is correct
16 Correct 152 ms 5068 KB Output is correct
17 Correct 206 ms 7352 KB Output is correct
18 Correct 234 ms 8172 KB Output is correct
19 Correct 301 ms 10824 KB Output is correct
20 Correct 349 ms 12048 KB Output is correct