제출 #711788

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
711788		pcc	Slagalica (COCI19_slagalica2)	C++14	70 / 70	38 ms	7992 KiB

slagalica

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

#define pii pair<int,int>
#define fs first
#define sc second
vector<int> v[9];
int deg[9];
pii dif[] = {{0,0},{-1,1},{-1,-1},{1,1},{1,-1},{-2,1},{-2,-1},{-1,2},{1,2}};
vector<int> ans;
const int mxn = 1e5+10;
bitset<mxn> vis;
struct Edge{
    int to,val,id;
    Edge(){}
    Edge(int tt,int vv,int ii){
        id = ii;
        to = tt;
        val = vv;
    }
    bool operator<(Edge &b){
        return val<b.val;
    }
};
vector<Edge> paths[9];
int ptr[9];
void dfs(int now){
    while(!paths[now].empty()){
        auto nxt = paths[now].back().to,val = paths[now].back().val;
        paths[now].pop_back();
        dfs(nxt);
        ans.push_back(val);
    }
    return;
}
int main(){
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int n;
    cin>>n;
    for(int i = 0;i<n;i++){
        int a,b;
        cin>>a>>b;
        paths[dif[a].fs+4].push_back(Edge(dif[a].sc+4,b,i));
        deg[dif[a].sc+4]++;
        deg[dif[a].fs+4]--;
    }
    if(paths[2].size()!=1||deg[6] != 1){
        cout<<"-1";
        return 0;
    }
    // paths[6].push_back({2,0});
    for(int i = 3;i<=5;i++){
        if(deg[i] != 0){
            cout<<-1;
            return 0;
        }
    }
    for(auto &i:paths)sort(i.rbegin(),i.rend());
    dfs(2);
    while(!ans.empty())cout<<ans.back()<<' ',ans.pop_back();return 0;
}

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

slagalica.cpp: In function 'int main()':
slagalica.cpp:60:5: warning: this 'while' clause does not guard... [-Wmisleading-indentation]
   60 |     while(!ans.empty())cout<<ans.back()<<' ',ans.pop_back();return 0;
      |     ^~~~~
slagalica.cpp:60:61: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'while'
   60 |     while(!ans.empty())cout<<ans.back()<<' ',ans.pop_back();return 0;
      |                                                             ^~~~~~

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 5 / 5
• Subtask 6: 5 / 5
• Subtask 7: 5 / 5
• Subtask 8: 5 / 5
• Subtask 9: 5 / 5
• Subtask 10: 5 / 5
• Subtask 11: 5 / 5
• Subtask 12: 5 / 5
• Subtask 13: 5 / 5
• Subtask 14: 5 / 5