oj.uz

답안 #759583

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
759583 2023-06-16T12:38:46 Z GrindMachine 경찰관과 강도 (BOI14_coprobber) C++17
16 / 100
 126 ms 262144 KB 
// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "coprobber.h"

vector<int> adj[MAX_N];
int u = 1;

int start(int n_, bool a[MAX_N][MAX_N])
{
    rep(i,MAX_N){
        rep(j,MAX_N){
            if(a[i][j]){
                adj[i].pb(j);
            }
        }
    }

    return u;
}

vector<int> path;
int nxt;

void dfs(int u, int p, int des){
    path.pb(u);
    if(u == des){
        assert(sz(path) >= 2);
        nxt = path[1];
    }

    trav(v,adj[u]){
        if(v == p) conts;
        dfs(v,u,des);
    }

    path.pop_back();
}

int nextMove(int v)
{
    assert(u != v);
    path.clear();
    nxt = -1;
    dfs(u,-1,v);

    assert(nxt != -1);
    u = nxt;
    return u;
}

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 32 ms 1780 KB Output is correct
5 Correct 8 ms 848 KB Output is correct
6 Correct 30 ms 1508 KB Output is correct

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 126 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Runtime error 123 ms 262144 KB Execution killed with signal 9
5 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 208 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 32 ms 1780 KB Output is correct
5 Correct 8 ms 848 KB Output is correct
6 Correct 30 ms 1508 KB Output is correct
7 Runtime error 126 ms 262144 KB Execution killed with signal 9
8 Halted 0 ms 0 KB -