Submission #1688515

---

Source Code Expand

#include <iostream>
#include <vector>
using namespace std;
 
const int MAX = 200010;
int N, M;
bool visit0[MAX], visitN[MAX];
 
int main(int argc, const char * argv[]) {
  cin >> N >> M;
  int a[M], b[M];
  for (int i = 0; i < M; i++) {
    cin >> a[i] >> b[i];
    a[i]--; b[i]--;
    if (a[i] == 0) visit0[b[i]] = true;
    if (b[i] == 0) visit0[a[i]] = true;
    if (a[i] == N - 1) visitN[b[i]] = true;
    if (b[i] == N - 1) visitN[a[i]] = true;
  }
  
  bool flag = false;
  for (int i = 0; i < N; i++) {
    if (visit0[i] && visitN[i]) flag = true;
  }
  
  // 解答
  cout << (flag ? "POSSIBLE" : "IMPOSSIBLE") << endl;
    
  return 0;
}

Submission Info

Judge Result