제출 #583285

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
583285		Jomnoi	마상시합 토너먼트 (IOI12_tournament)	C++17	0 / 100	1089 ms	2712 KiB

tournament

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

int GetBestPosition(int N, int C, int R, int *K, int *S, int *E) {
    int max_win = -1, best_pos = 0;
    for(int p = 0; p < N; p++) {
        vector <pair <int, int>> order;
        int j = 0;
        for(int i = 0; i < p; i++) {
            order.emplace_back(K[j++], i);
        }
        order.emplace_back(R, p);
        while(j < N - 1) {
            order.emplace_back(K[j++], j + 1);
        }

        int cnt_win = 0;
        for(int c = 0; c < C; c++) {
            int op = 0;
            for(int i = S[c]; i <= E[c]; i++) {
                op = max(op, order[i].first);
            }
            
            vector <pair <int, int>> tmp;
            for(int i = 0; i < S[c]; i++) {
                tmp.push_back(order[i]);
            }
            for(int i = S[c]; i <= E[c]; i++) {
                if(op == order[i].first) {
                    if(order[i].second == p) {
                        cnt_win++;
                    }
                    tmp.push_back(order[i]);
                }
            }
            for(int i = E[c] + 1; i < order.size(); i++) {
                tmp.push_back(order[i]);
            }
        }

        if(max_win < cnt_win) {
            max_win = cnt_win;
            best_pos = p;
        }
    }
    return best_pos;
}

컴파일 시 표준 에러 (stderr) 메시지

tournament.cpp: In function 'int GetBestPosition(int, int, int, int*, int*, int*)':
tournament.cpp:14:35: warning: operation on 'j' may be undefined [-Wsequence-point]
   14 |             order.emplace_back(K[j++], j + 1);
      |                                  ~^~
tournament.cpp:14:35: warning: operation on 'j' may be undefined [-Wsequence-point]
tournament.cpp:36:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |             for(int i = E[c] + 1; i < order.size(); i++) {
      |                                   ~~^~~~~~~~~~~~~~

• Subtask 1: 0 / 17
• Subtask 2: 0 / 32
• Subtask 3: 0 / 51