Submission #1886713


Source Code Expand

#include <iostream>
#include <sstream>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <cstring>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <algorithm>
#include <iterator>
#include <bitset>
#include <ctime>
using namespace std;

#define FOR(i,a,b) for (int i = (a); i < (b); i++)
#define RFOR(i,b,a) for (int i = (b)-1; i >= (a); i--)
#define ITER(it,a) for (__typeof(a.begin()) it = a.begin(); it != a.end(); it++)
#define FILL(a,value) memset(a, value, sizeof(a))

#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;

const double PI = acos(-1.0);
const int INF = 1000 * 1000 * 1000 + 7;
const LL LINF = INF * (LL) INF;

const int MAX = 10 * 100 * 1000 + 47;
const double EPS = 1e-8;


VI G[MAX];
pair<PII, int> P[MAX];
PII Q[MAX];
int C[MAX];
int D[MAX];

int main()
{
    int n, m;
    scanf("%d%d", &n, &m);
    FOR(i, 0, m)
    {
        int a, b;
        scanf("%d%d", &a, &b);
        --a, --b;
        G[a].PB(b);
        G[b].PB(a);
    }

    int q;
    scanf("%d", &q);
    FOR(i, 0, q)
    {
        int a, b, c;
        scanf("%d%d%d", &a, &b, &c);
        --a;
        P[i] = MP(MP(a, b), c);
    }
    FILL(D, -1);
    reverse(P, P + q);
    FOR(i, 0,q)
    {
        int v = P[i].first.first;
        int d = P[i].first.second;
        int c = P[i].second;

        int ql = 0, qr = 0;
        Q[qr++] = MP(v, d);

        while(ql != qr)
        {
            int v = Q[ql].first;
            int d = Q[ql++].second;

            if (D[v] >= d)continue;
            D[v] = d;
            if (!C[v])C[v] = c;

            if (d)
            {
                FOR(i, 0, SZ(G[v]))
                {
                    int to = G[v][i];
                    Q[qr++] = MP(to, d-1);
                }
            }


        }


    }
    FOR(i, 0, n)
        printf("%d\n", C[i]);
}






































Submission Info

Submission Time
Task B - Splatter Painting
User vjudge5
Language C++14 (GCC 5.4.1)
Score 700
Code Size 2094 Byte
Status AC
Exec Time 93 ms
Memory 42616 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:53:26: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &n, &m);
                          ^
./Main.cpp:57:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &a, &b);
                              ^
./Main.cpp:64:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &q);
                    ^
./Main.cpp:68:36: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d", &a, &b, &c);
                                    ^

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 200 / 200 500 / 500
Status
AC × 2
AC × 19
AC × 35
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 12 ms 32640 KB
00_example_02.txt AC 12 ms 32640 KB
10_01.txt AC 12 ms 32640 KB
10_02.txt AC 12 ms 32640 KB
10_03.txt AC 13 ms 32640 KB
10_04.txt AC 12 ms 32640 KB
10_05.txt AC 12 ms 32640 KB
10_06.txt AC 13 ms 32640 KB
10_07.txt AC 12 ms 32640 KB
10_08.txt AC 13 ms 32640 KB
10_09.txt AC 14 ms 32640 KB
10_10.txt AC 13 ms 32640 KB
10_11.txt AC 13 ms 32640 KB
10_12.txt AC 13 ms 32640 KB
10_13.txt AC 13 ms 32640 KB
10_14.txt AC 13 ms 32640 KB
10_15.txt AC 13 ms 32640 KB
10_16.txt AC 14 ms 32640 KB
10_17.txt AC 13 ms 32640 KB
20_01.txt AC 89 ms 39936 KB
20_02.txt AC 88 ms 39808 KB
20_03.txt AC 93 ms 39808 KB
20_04.txt AC 25 ms 35328 KB
20_05.txt AC 13 ms 32640 KB
20_06.txt AC 21 ms 34816 KB
20_07.txt AC 14 ms 32640 KB
20_08.txt AC 28 ms 34816 KB
20_09.txt AC 13 ms 32640 KB
20_10.txt AC 28 ms 34688 KB
20_11.txt AC 33 ms 34816 KB
20_12.txt AC 55 ms 37888 KB
20_13.txt AC 78 ms 40064 KB
20_14.txt AC 86 ms 39936 KB
20_15.txt AC 75 ms 42488 KB
20_16.txt AC 76 ms 42616 KB