Submission #313619

#	Time	Username	Problem	Language	Result	Execution time	Memory
313619		Dan4Life	Poi (IOI09_poi)	C++17	100 / 100	306 ms	23928 KiB

poi

#include <bits/stdc++.h>
using namespace std;

#define pb push_back

struct grade
{
    int points, num, id;
};

bool cmp(grade a, grade b)
{
    if(a.points!=b.points) return a.points>b.points;
    if(a.num!=b.num) return a.num>b.num;
    return a.id<b.id;
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n, t, p;
    cin >> n >> t >> p;
    grade person[2005];
    vector<int> V(t, 0);
    vector< vector<int> > VV;
    for(int i = 0; i < n; i++)
    {
        vector<int> v;
        for(int j = 0; j < t; j++)
        {
            int a; cin >> a; v.pb(a);
        }
        int cnt=0;
        for(auto u : v) cnt+=u;
        for(int j = 0; j < v.size(); j++)
            V[j]+=(v[j]==0);
        person[i].id=i+1;
        person[i].num=cnt;
        person[i].points=0;
        VV.pb(v); v.clear();
    }
    for(int i = 0; i < VV.size(); i++)
        for(int j = 0; j < VV[i].size(); j++)
            if(VV[i][j]==1) person[i].points += V[j];
    sort(person, person+n, cmp);
    for(int i = 0; i < n; i++)
        if(person[i].id==p)
            cout << person[i].points << " " << i+1 << "\n";
}

Compilation message (stderr)

poi.cpp: In function 'int main()':
poi.cpp:35:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |         for(int j = 0; j < v.size(); j++)
      |                        ~~^~~~~~~~~~
poi.cpp:42:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |     for(int i = 0; i < VV.size(); i++)
      |                    ~~^~~~~~~~~~~
poi.cpp:43:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |         for(int j = 0; j < VV[i].size(); j++)
      |                        ~~^~~~~~~~~~~~~~

• Subtask 1: 100 / 100