Submission #1462916


Source Code Expand

#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <new>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef int64_t i64;

int main() {
	ios_base::sync_with_stdio(false);
  int n, m;
  cin >> n >> m;
  vector<bool> x(n), y(n);
  for(; m > 0; m--) {
    int a, b;
    cin >> a >> b; a--; b--;
    if(a == 0) {
      x[b] = true;
    } else if(b == n - 1) {
      y[a] = true;
    }
  }
  for(int i = 1; i + 1 < n; i++) {
    if(x[i] && y[i]) {
      cout << "POSSIBLE" << endl;
      return 0;
    }
  }
  cout << "IMPOSSIBLE" << endl;
  return 0;
}

Submission Info

Submission Time
Task C - Cat Snuke and a Voyage
User arosusti
Language C++14 (GCC 5.4.1)
Score 300
Code Size 924 Byte
Status AC
Exec Time 35 ms
Memory 256 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 4
AC × 11
Set Name Test Cases
Sample example0, example1, example2, example3
All example0, example1, example2, example3, last0, last1, many0, many1, rand0, rand1, rand2
Case Name Status Exec Time Memory
example0 AC 1 ms 256 KiB
example1 AC 1 ms 256 KiB
example2 AC 1 ms 256 KiB
example3 AC 1 ms 256 KiB
last0 AC 35 ms 256 KiB
last1 AC 35 ms 256 KiB
many0 AC 35 ms 256 KiB
many1 AC 34 ms 256 KiB
rand0 AC 23 ms 256 KiB
rand1 AC 35 ms 256 KiB
rand2 AC 21 ms 256 KiB