Submission #1369056


Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define forn(i, x, n) for (int i = int(x); i <= int(n); ++i)
#define for1(i, n, x) for (int i = int(n); i >= int(x); --i)
#define F first
#define S second
#define pb push_back

typedef long long ll;
typedef pair <int, int> pii;
typedef long double ld;
typedef vector <ll> vi;

const int N = 2e5 + 1;
const ll INF = 1e18 + 9;
const int B = 1e9 + 7;

int n, m, q;
vi g[N];
int d[N][11];
int a[N], col[N];
int dist[N], u[N];

int main() {
    #ifdef black
    freopen("in", "r", stdin);
    #endif // black
    ios_base :: sync_with_stdio(0);
    cin.tie(0);

    cin >> n >> m;
    forn(i, 1, m) {
        int f, t;
        cin >> f >> t;
        g[f].pb(t);
        g[t].pb(f);
    }
    cin >> q;
    forn(i, 1, q) {
        int v, x;
        cin >> v >> x >> col[i];
        forn(j, 0, x)
            d[v][j] = i;
    }
    forn(i, 1, n) {
        queue <int> q;
        q.push(i);
        dist[i] = 0;
        int mx = 0;
        while (q.size()) {
            int x = q.front();
            q.pop();
            u[x] = i;
            mx = max(mx, d[x][dist[x]]);
            if (dist[x] == 10) continue;
            for (auto to : g[x]) {
                if (u[to] == i) continue;
                u[to] = i;
                dist[to] = dist[x] + 1;
                q.push(to);
            }
        }
        if (mx)
            a[i] = col[mx];
    }
    forn(i, 1, n)
        cout << a[i] << "\n";

    return 0;
}

Submission Info

Submission Time
Task B - Splatter Painting
User sancho
Language C++14 (GCC 5.4.1)
Score 200
Code Size 1538 Byte
Status TLE
Exec Time 2104 ms
Memory 18036 KB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 200 / 200 0 / 500
Status
AC × 2
AC × 19
AC × 29
TLE × 6
Set Name Test Cases
Sample 00_example_01.txt, 00_example_02.txt
Subtask1 00_example_01.txt, 00_example_02.txt, 10_01.txt, 10_02.txt, 10_03.txt, 10_04.txt, 10_05.txt, 10_06.txt, 10_07.txt, 10_08.txt, 10_09.txt, 10_10.txt, 10_11.txt, 10_12.txt, 10_13.txt, 10_14.txt, 10_15.txt, 10_16.txt, 10_17.txt
All 00_example_01.txt, 00_example_02.txt, 10_01.txt, 10_02.txt, 10_03.txt, 10_04.txt, 10_05.txt, 10_06.txt, 10_07.txt, 10_08.txt, 10_09.txt, 10_10.txt, 10_11.txt, 10_12.txt, 10_13.txt, 10_14.txt, 10_15.txt, 10_16.txt, 10_17.txt, 20_01.txt, 20_02.txt, 20_03.txt, 20_04.txt, 20_05.txt, 20_06.txt, 20_07.txt, 20_08.txt, 20_09.txt, 20_10.txt, 20_11.txt, 20_12.txt, 20_13.txt, 20_14.txt, 20_15.txt, 20_16.txt
Case Name Status Exec Time Memory
00_example_01.txt AC 3 ms 8448 KB
00_example_02.txt AC 3 ms 8448 KB
10_01.txt AC 4 ms 8576 KB
10_02.txt AC 3 ms 8448 KB
10_03.txt AC 3 ms 8448 KB
10_04.txt AC 3 ms 8448 KB
10_05.txt AC 4 ms 8576 KB
10_06.txt AC 3 ms 8448 KB
10_07.txt AC 4 ms 8576 KB
10_08.txt AC 43 ms 8576 KB
10_09.txt AC 33 ms 8576 KB
10_10.txt AC 38 ms 8576 KB
10_11.txt AC 38 ms 8576 KB
10_12.txt AC 37 ms 8576 KB
10_13.txt AC 7 ms 8576 KB
10_14.txt AC 7 ms 8576 KB
10_15.txt AC 7 ms 8576 KB
10_16.txt AC 38 ms 8576 KB
10_17.txt AC 40 ms 8576 KB
20_01.txt TLE 2103 ms 17280 KB
20_02.txt TLE 2104 ms 17280 KB
20_03.txt TLE 2104 ms 17280 KB
20_04.txt TLE 2103 ms 9600 KB
20_05.txt AC 7 ms 8576 KB
20_06.txt AC 33 ms 13568 KB
20_07.txt AC 5 ms 8576 KB
20_08.txt AC 32 ms 8960 KB
20_09.txt AC 5 ms 8576 KB
20_10.txt AC 21 ms 8832 KB
20_11.txt AC 47 ms 9088 KB
20_12.txt AC 320 ms 16896 KB
20_13.txt AC 357 ms 17408 KB
20_14.txt AC 361 ms 17408 KB
20_15.txt TLE 2104 ms 18036 KB
20_16.txt TLE 2104 ms 18036 KB