제출 #706132

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
706132		LLLLLLLLLLLLLLLLLLLLLLL	곤돌라 (IOI14_gondola)	C++14	30 / 100	31 ms	4840 KiB

gondola

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

const int MOD = 1e9 + 9;

int valid(int n, int v[]){
    set<int> s(v, v + n);
    if((int) s.size() != n) return 0;

    for(int i = 0; i < n; i++){
        if(v[i] > n) continue;

        int left = (v[i] == 1 ? n : v[i] - 1), right = (v[i] == n ? 1 : v[i] + 1);

        int lefViz = (i == 0 ? v[n - 1] : v[i - 1]);
        int rigViz = (i == n - 1 ? v[0] : v[i + 1]);

        if((lefViz != left && lefViz <= n) || (rigViz != right && rigViz <= n)) return 0;
    }

    return 1;
}

int countReplacement(int n, int v[]){
    if(!valid(n, v)) return 0;
    return 1;
}

int replacement(int n, int v[], int answer[]){
    vector<int> operations, spots, mark(n + 1, 0);
    vector<int> change;

    for(int i = 0; i < n; i++){
        if(v[i] <= n) mark[v[i]] = true;
        else change.push_back(v[i]);
    }

    for(int i = 1; i <= n; i++)
        if(!mark[i]) spots.push_back(i);

    sort(change.begin(), change.end());

    for(int i = 0, val = n + 1; i < change.size(); i++){
        operations.push_back(spots[i]);

        while(val < change[i])
            operations.push_back(val++);
    }

    for(int i = 0; i < operations.size(); i++)
        answer[i] = operations[i];

    return (int) operations.size();
}

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

gondola.cpp: In function 'int replacement(int, int*, int*)':
gondola.cpp:44:35: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   44 |     for(int i = 0, val = n + 1; i < change.size(); i++){
      |                                 ~~^~~~~~~~~~~~~~~
gondola.cpp:51:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   51 |     for(int i = 0; i < operations.size(); i++)
      |                    ~~^~~~~~~~~~~~~~~~~~~

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 10 / 10
• Subtask 4: 5 / 5
• Subtask 5: 0 / 10
• Subtask 6: 0 / 20
• Subtask 7: 5 / 5
• Subtask 8: 0 / 15
• Subtask 9: 0 / 15
• Subtask 10: 0 / 10