oj.uz

Submission #535859

# Submission time Handle Problem Language Result Execution time Memory
535859 2022-03-11T14:42:09 Z cig32 Poi (IOI09_poi) C++17
100 / 100
 286 ms 12148 KB 
#include<bits/stdc++.h>
using namespace std;
#define LL long long
#define INF INT_MAX
#define LD long double
#define endl '\n'
#define output for(LL i=0;i<sizex;i++) { for(LL j=0;j<sizey;j++) { cout << A[i][j] << " "; }cout<<endl; }cout<<endl;
 
struct con{
 
    int ID, tasks, points;
 
    con(){ ID = tasks = points = 0; }
 
    bool operator < ( const con &o ) const{
        if( points != o.points ) return points > o.points;
        if( tasks != o.tasks ) return tasks > o.tasks;
        return ID < o.ID;
    }
 
};
 
const int maxN = 2001;
int N, T, ID;
int points[maxN];
vector <con> A(maxN);
bool M[maxN][maxN];
 
int main(){ ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
 
    cin >> N >> T >> ID;
 
    A.resize(N+1);
    for(int i=1;i<=N;i++) { A[i].ID = i; A[i].tasks = A[i].points = 0; }
    for(int i=1;i<=T;i++) points[i] = N;
 
    for(int i=1;i<=N;i++) for(int j=1;j<=T;j++){
        cin >> M[i][j];
        if( M[i][j] ) { points[j]--; A[i].tasks++; }
    }
 
    // for(int i=1;i<=T;i++) cout << i << ": " << points[i] << endl;
    // cout << endl;
 
    for(int i=1;i<=N;i++) for(int j=1;j<=T;j++){
        if( M[i][j] ) A[i].points += points[j];
    }
 
    sort( A.begin(), A.end() );
 
    // for(int i=0;i<A.size();i++){
    //     cout << A[i].ID << ": " << A[i].tasks << ' ' << A[i].points << endl;
    // }
 
    for(int i=0;i<A.size();i++){
        if( A[i].ID == ID ){
            cout << A[i].points << ' ' << i+1 << endl; return 0;
        }
    }
 
}

Compilation message

poi.cpp: In function 'int main()':
poi.cpp:55:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<con>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   55 |     for(int i=0;i<A.size();i++){
      |                 ~^~~~~~~~~

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 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 340 KB Output is correct
6 Correct 1 ms 360 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 584 KB Output is correct
10 Correct 3 ms 764 KB Output is correct
11 Correct 10 ms 1108 KB Output is correct
12 Correct 16 ms 1704 KB Output is correct
13 Correct 44 ms 2884 KB Output is correct
14 Correct 79 ms 3964 KB Output is correct
15 Correct 110 ms 5604 KB Output is correct
16 Correct 117 ms 6096 KB Output is correct
17 Correct 178 ms 7980 KB Output is correct
18 Correct 194 ms 8944 KB Output is correct
19 Correct 269 ms 11188 KB Output is correct
20 Correct 286 ms 12148 KB Output is correct