oj.uz

답안 #800046

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
800046 2023-08-01T09:35:48 Z SlavaKemDev 급행열차 20/19 (ROI19_express) C++17
24 / 100
 531 ms 647288 KB 
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <iostream>
#include <utility>
#include <vector>
#include <algorithm>
#define _USE_MATH_DEFINES
#include <cmath>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <fstream>
#include <random>
#include <cassert>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#include <thread>

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
using vll = vector<ll>;
using vpll = vector<pair<ll, ll>>;
using vii = vector<int>;

#define fill(a) for (ll i = 0; i < (a).size(); i++) cin >> (a)[i]
#define mp make_pair
#define mt make_tuple
#define bs(a, b) binary_search((a).begin(), (a).end(), (b))

ld EPS = 1e-9;
ld phi = (1 + sqrt(5)) / 2;

ll MOD = 1e9 + 7;
ll INF = 1e18;
ll P = 239;
ll B = 550;

struct Edge {
    ll to, w;
};

vector<vector<Edge>> g;
vector<bitset<10001>> c;
vector<ll> order;
vector<bool> used;

void dfs(ll v) {
    used[v] = true;
    for (Edge edge : g[v])
        if (!used[edge.to])
            dfs(edge.to);
    order.push_back(v);
}

int main() {
#ifdef LOCAL
    freopen("inp.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
    freopen("err.txt", "w", stderr);

    clock_t timer = clock();
#else
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.precision(64);
    cout << fixed;
#endif

    ll t;
    cin >> t;

    while (t--) {
        ll n, m, q, p;
        cin >> n >> m >> q >> p;

        g.assign(n, {});
        used.assign(n, false);
        order.clear();

        for (ll i = 0; i < m; i++) {
            ll u, v, w;
            cin >> u >> v >> w;
            u--; v--;
            if (w <= 10000)
                g[u].push_back({v, w});
        }

        dfs(0);
        reverse(order.begin(), order.end());

        c.assign(n, bitset<10001>());
        c[0][0] = true;
        vector<vector<ll>> cn(n);
        cn[0].push_back(0);


        for (ll v : order) {
            for (Edge edge : g[v])
                if (n <= 10 && m <= 10)
                    for (ll item : cn[v]) cn[edge.to].push_back(item + edge.w);
                else
                    c[edge.to] |= c[v] << edge.w;
        }

        if (n <= 10 && m <= 10) {
            for (auto & v : cn) sort(v.begin(), v.end());
        }

        while (q--) {
            ll f, r;
            cin >> f >> r;
            f--;

            bool ok = false;

            if (n <= 10 && m <= 10) {
                auto lb = lower_bound(cn[f].begin(), cn[f].end(), r);
                if (lb < cn[f].end())
                    ok = *lb <= r * p / (p - 1);
            } else {
                for (ll i = r; i <= r * p / (p - 1); i++) ok |= c[f][i];
            }
            cout << ok;
        }

        cout  << "\n";
    }

#ifdef LOCAL
    cout << endl << "Execution time: " << (ld)(clock() - timer) / CLOCKS_PER_SEC;
#endif
}

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Incorrect 5 ms 504 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 5 ms 980 KB Output is correct
11 Correct 3 ms 1108 KB Output is correct
12 Correct 6 ms 5588 KB Output is correct
13 Correct 4 ms 1748 KB Output is correct
14 Correct 3 ms 340 KB Output is correct
15 Correct 3 ms 488 KB Output is correct
16 Correct 4 ms 596 KB Output is correct
17 Correct 3 ms 468 KB Output is correct
18 Correct 5 ms 596 KB Output is correct
19 Correct 4 ms 468 KB Output is correct
20 Correct 6 ms 596 KB Output is correct
21 Correct 6 ms 460 KB Output is correct
22 Correct 6 ms 3976 KB Output is correct
23 Correct 6 ms 3540 KB Output is correct
24 Correct 6 ms 1364 KB Output is correct
25 Correct 6 ms 1108 KB Output is correct
26 Correct 7 ms 1308 KB Output is correct
27 Correct 6 ms 1504 KB Output is correct
28 Correct 4 ms 340 KB Output is correct
29 Correct 4 ms 468 KB Output is correct
30 Correct 2 ms 596 KB Output is correct
31 Correct 2 ms 596 KB Output is correct
32 Correct 2 ms 1620 KB Output is correct

Subtask #3
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Runtime error 531 ms 647288 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Runtime error 531 ms 647288 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Runtime error 1 ms 596 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Runtime error 1 ms 596 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #7
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Incorrect 5 ms 504 KB Output isn't correct
6 Halted 0 ms 0 KB -