제출 #1096448

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1096448		onlk97	즐거운 행로 (APIO20_fun)	C++14	47 / 100	112 ms	21020 KiB

fun

#include "fun.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
 
vector <int> createFunTour(int N,int Q){
    int sz[N];
    for (int i=0; i<N; i++) sz[i]=attractionsBehind(0,i);
    int rt=0,mn=N;
    for (int i=1; i<N; i++){
        if (2*sz[i]>N&&sz[i]<mn){
            mn=sz[i];
            rt=i;
        }
    }
    int dep[N];
    for (int i=0; i<N; i++) dep[i]=hoursRequired(rt,i);
    if (N==2) return {0,1};
    vector <int> neigh;
    for (int i=0; i<N; i++) if (dep[i]==1) neigh.push_back(i);
    int col[N];
    for (int i=0; i<N; i++){
        col[i]=2;
        for (int j=0; j<2; j++){
            if (hoursRequired(neigh[j],i)+1==dep[i]){
                col[i]=j;
                break;
            }
        }
        if (i==rt) col[i]=-1;
    }
    set <pair <int,int> > s[3];
    for (int i=0; i<N; i++) if (col[i]!=-1) s[col[i]].insert({dep[i],i});
    vector <int> op;
    op.push_back(rt);
    int prv=-1;
    int f=1;
    while (s[0].size()!=s[1].size()+s[2].size()&&s[1].size()!=s[0].size()+s[2].size()&&s[2].size()!=s[0].size()+s[1].size()){
        pair <int,int> best={1e9,1e9};
        int ha=-1;
        for (int i=0; i<3; i++){
            if (i==prv||s[i].empty()) continue;
            pair <int,int> tp=*s[i].begin();
            if (f){
                if (tp.first<best.first||tp.first==best.first&&s[i].size()>(ha==-1?-1:s[ha].size())){
                    best=tp;
                    ha=i;
                }
            } else {
                if (tp.first<best.first||tp.first==best.first&&(*--s[i].end()).first<(ha==-1?1e9:(*--s[ha].end()).first)){
                    best=tp;
                    ha=i;
                }
            }
        }
        op.push_back(best.second);
        prv=ha;
        s[ha].erase(best);
        f=0;
    }
    /*
    cout<<"rt "<<rt<<'\n';
    cout<<"neigh "; for (int i:neigh) cout<<i<<' '; cout<<'\n';
    cout<<"col "; for (int i=0; i<N; i++) cout<<col[i]<<' '; cout<<'\n';
    cout<<"cur op "; for (int i:op) cout<<i<<' '; cout<<'\n';
    */
    int w=2;
    if (s[0].size()==s[1].size()+s[2].size()) w=0;
    else if (s[1].size()==s[0].size()+s[2].size()) w=1;
    if (w==prv){
        while (!s[w].empty()){
            pair <int,int> best={1e9,1e9};
            int ha=-1;
            for (int i=0; i<3; i++){
                if (i==w||s[i].empty()) continue;
                pair <int,int> tp=*s[i].begin();
                if (tp.first<best.first||tp.first==best.first&&(*--s[i].end()).first<(ha==-1?1e9:(*--s[ha].end()).first)){
                    best=tp;
                    ha=i;
                }
            }
            op.push_back(best.second);
            s[ha].erase(best);
            pair <int,int> tp=*s[w].begin();
            op.push_back(tp.second);
            s[w].erase(tp);
        }
    } else {
        while (!s[w].empty()){
            pair <int,int> tp=*s[w].begin();
            op.push_back(tp.second);
            s[w].erase(tp);
            pair <int,int> best={1e9,1e9};
            int ha=-1;
            for (int i=0; i<3; i++){
                if (i==w||s[i].empty()) continue;
                tp=*s[i].begin();
                if (tp.first<best.first||tp.first==best.first&&(*--s[i].end()).first<(ha==-1?1e9:(*--s[ha].end()).first)){
                    best=tp;
                    ha=i;
                }
            }
            op.push_back(best.second);
            s[ha].erase(best);
        }
    }
    reverse(op.begin(),op.end());
    return op;
}

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

fun.cpp: In function 'std::vector<int> createFunTour(int, int)':
fun.cpp:45:62: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   45 |                 if (tp.first<best.first||tp.first==best.first&&s[i].size()>(ha==-1?-1:s[ha].size())){
      |                                          ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
fun.cpp:50:62: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   50 |                 if (tp.first<best.first||tp.first==best.first&&(*--s[i].end()).first<(ha==-1?1e9:(*--s[ha].end()).first)){
      |                                          ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
fun.cpp:77:62: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   77 |                 if (tp.first<best.first||tp.first==best.first&&(*--s[i].end()).first<(ha==-1?1e9:(*--s[ha].end()).first)){
      |                                          ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
fun.cpp:98:62: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   98 |                 if (tp.first<best.first||tp.first==best.first&&(*--s[i].end()).first<(ha==-1?1e9:(*--s[ha].end()).first)){
      |                                          ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 10 / 10
• Subtask 2: 16 / 16
• Subtask 3: 21 / 21
• Subtask 4: 0 / 19
• Subtask 5: 0 / 34