답안 #972650

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
972650	2024-04-30T19:37:23 Z	marinaluca	Poi (IOI09_poi)	C++17	100 / 100	196 ms	39768 KB

poi

#include <bits/stdc++.h>
#pragma GCC opitmize ("O4")
#pragma GCC optimize ("fast-math")
#pragma GCC optimize ("unroll-loops")

using namespace std;

#define int long long
#define ll long long
#define xx first
#define yy second
#define all (x) begin (x), end(x)

int n, t, p;
const int NMAX = 2e3 + 10;

int solve[NMAX][NMAX];
int puncte[NMAX];

struct elem {
    int idx = 0;
    int sc = 0;
    int ca = 0;
    friend bool operator<(elem a, elem b){
        if (a.sc == b.sc){
            if (a.ca == b.ca){
                return a.idx > b.idx;
            }
            return a.ca < b.ca;
        }
        return a.sc < b.sc;
    }
}v[NMAX];
signed main (void){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> n >> t >> p;
    for (int i = 1; i <= n; ++ i){
        v[i].idx = i;
        for (int j = 1; j <= t; ++ j){
            cin >> solve[i][j];
            if (solve[i][j]){
                v[i].ca ++, puncte[j] ++;
            }
        }
    }
    for (int j = 1; j <= t; ++ j){
        puncte[j] = n - puncte[j];
    }
    for (int i = 1; i <= n; ++ i){
        for (int j = 1; j <= t; ++ j){
            if (solve[i][j]){
                v[i].sc += puncte[j];
            }
        }
    }
    sort (v + 1, v + n +1);
    reverse (v + 1, v + n +1);
    for (int i = 1; i <= n; ++ i){
        if (v[i].idx == p){
            cout << v[i].sc << " " << i << '\n';
            break;
        }
    }
    return 0 ^ 0;
}

Compilation message

poi.cpp:2: warning: ignoring '#pragma GCC opitmize' [-Wunknown-pragmas]
    2 | #pragma GCC opitmize ("O4")
      |

Subtask #1

100.0 / 100.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	3 ms	2396 KB	Output is correct
4	Correct	2 ms	2392 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2392 KB	Output is correct
7	Correct	2 ms	2392 KB	Output is correct
8	Correct	1 ms	2392 KB	Output is correct
9	Correct	2 ms	2396 KB	Output is correct
10	Correct	2 ms	4444 KB	Output is correct
11	Correct	7 ms	6748 KB	Output is correct
12	Correct	10 ms	9052 KB	Output is correct
13	Correct	28 ms	13964 KB	Output is correct
14	Correct	40 ms	18516 KB	Output is correct
15	Correct	72 ms	23892 KB	Output is correct
16	Correct	75 ms	24148 KB	Output is correct
17	Correct	111 ms	29900 KB	Output is correct
18	Correct	121 ms	32576 KB	Output is correct
19	Correct	172 ms	39156 KB	Output is correct
20	Correct	196 ms	39768 KB	Output is correct