oj.uz

Submission #232932

# Submission time Handle Problem Language Result Execution time Memory
232932 2020-05-18T17:07:28 Z Zex Poi (IOI09_poi) C++11
100 / 100
 311 ms 12152 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 between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<A.size();i++){
                 ~^~~~~~~~~

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 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 512 KB Output is correct
7 Correct 5 ms 512 KB Output is correct
8 Correct 6 ms 512 KB Output is correct
9 Correct 6 ms 640 KB Output is correct
10 Correct 7 ms 768 KB Output is correct
11 Correct 15 ms 1280 KB Output is correct
12 Correct 20 ms 1792 KB Output is correct
13 Correct 52 ms 2936 KB Output is correct
14 Correct 70 ms 4088 KB Output is correct
15 Correct 122 ms 5624 KB Output is correct
16 Correct 138 ms 6104 KB Output is correct
17 Correct 195 ms 7984 KB Output is correct
18 Correct 221 ms 8952 KB Output is correct
19 Correct 279 ms 11256 KB Output is correct
20 Correct 311 ms 12152 KB Output is correct