제출 #1013799

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1013799		m5588ohammed	새로운 문제 (POI13_mor)	C++14	0 / 100	2807 ms	131072 KiB

mor

#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
map <array<int,3>,int> dis;
vector <int> v[5001];
queue <pair<int,int>> qu;
int n,m,k,w,a,b,d;
void bfs(int x){
    dis[{x,x,0}]=-1;
    qu.push({0,x});
    while(qu.size()!=0){
        auto[mydis,i]=qu.front();
        qu.pop();
        for(int j:v[i]){
            w=mydis+1;
            if(dis[{min(x,j),max(x,j),w%2}]>w||dis[{min(x,j),max(x,j),w%2}]==0){
                dis[{min(x,j),max(x,j),w%2}]=w;
                qu.push({w,j});
            }
        }
    }
    return;
}
signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin>>n>>m>>k;
    for(int i=0;i<m;i++){
        cin>>a>>b;
        v[a].push_back(b);
        v[b].push_back(a);
    }
    for(int i=1;i<=n;i++) bfs(i);
    while(k--){
        cin>>a>>b>>d;
        if(a==b&&d!=0&&v[a].size()==0) cout<<"NIE"<<endl;
        else if(a==b&&d==0) cout<<"TAK"<<endl;
        else if(dis[{min(a,b),max(a,b),d%2}]<=d&&dis[{min(a,b),max(a,b),d%2}]!=0) cout<<"TAK"<<endl;
        else cout<<"NIE"<<endl;
    }
    return 0;
}

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

mor.cpp: In function 'void bfs(int)':
mor.cpp:12:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   12 |         auto[mydis,i]=qu.front();
      |             ^

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