oj.uz

답안 #727061

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
727061 2023-04-20T02:13:57 Z marvinthang 게임 (APIO22_game) C++17
0 / 100
 8 ms 14288 KB 
/*************************************
*    author: marvinthang             *
*    created: 20.04.2023 08:56:45    *
*************************************/

#include <bits/stdc++.h>
#include "game.h"

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i--; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
template <class A, class B> bool minimize(A &a, B b)  { if (a > b) { a = b; return true; } return false; }
template <class A, class B> bool maximize(A &a, B b)  { if (a < b) { a = b; return true; } return false; }

// end of template

const int MAX = 3e5 + 5;
vector <int> adj[MAX], radj[MAX];

int N, K, minFrom[MAX], maxTo[MAX];

void init(int n, int k) {
    N = n; K = k;
    REP(i, N) {
        if (i < K) {
            minFrom[i] = i;
            maxTo[i] = i ? i - 1 : K;
        } else {
            minFrom[i] = K;
            maxTo[i] = -1;
        }
    }
}

bool res;

void dfs(int u, int f) {
    if (res) return;
    if (!maximize(maxTo[u], f)) return;
    if (minFrom[u] <= maxTo[u]) {
        res = true;
        return;
    }
    for (int v: adj[u]) dfs(v, f);
}

void rdfs(int u, int f) {
    if (res) return;
    if (!minimize(minFrom[u], f)) return;
    if (minFrom[u] <= maxTo[u]) {
        res = true;
        return;
    }
    for (int v: radj[u]) rdfs(v, f);
}

int add_teleporter(int u, int v) {
    if (res) return true;
    adj[u].push_back(v);
    radj[v].push_back(u);
    dfs(v, u < K ? max(u, maxTo[u]) : maxTo[u]);
    rdfs(u, minFrom[v]);
    return res;
}

#ifdef LOCAL
#include <cstdio>
#include <cstdlib>
#include <vector>
#include "game.h"

namespace {

int read_int() {
    int x;
    if (scanf("%d", &x) != 1) {
        fprintf(stderr, "Error while reading input\n");
        exit(1);
    }
    return x;
}

}  // namespace

int main() {
    file("game");
    int N = read_int();
    int M = read_int();
    int K = read_int();
    std::vector<int> u(M), v(M);
    for (int i = 0; i < M; ++i) {
        u[i] = read_int();
        v[i] = read_int();
    }

    init(N, K);
    int i;
    for (i = 0; i < M; ++i) {
        int answer = add_teleporter(u[i], v[i]);
        if (answer != 0 && answer != 1) {
            i = -1;
            break;
        } else if (answer == 1) {
            break;
        }
    }
    printf("%d\n", i);
    return 0;
}
#endif

Subtask #1
0.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 8 ms 14288 KB Wrong Answer[1]
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 8 ms 14288 KB Wrong Answer[1]
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 8 ms 14288 KB Wrong Answer[1]
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 8 ms 14288 KB Wrong Answer[1]
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 8 ms 14288 KB Wrong Answer[1]
2 Halted 0 ms 0 KB -