Submission #1590031
Source Code Expand
//
// main.cpp
// backToProblemSolving
//
// Created by Khaled Abdelfattah on 6/27/17.
// Copyright © 2017 Khaled Abdelfattah. All rights reserved.
//
#include <bits/stdc++.h>
// #include <iostream>
using namespace std;
//#include "stdc++.h"
typedef long long ll;
#define MAX 1000000000
#define BASE1 23
#define BASE2 31
#define MOD1 1000000007
#define MOD2 217645177
#define eps 1e-6
int colors[100005];
vector<int> adjList[100005];
bool visited[100005][15];
void DFS (int node, int d, int c) {
if (d < 0 || visited[node][d])
return;
visited[node][d] = true;
if (colors[node] == 0)
colors[node] = c;
for (int i : adjList[node])
DFS(i, d - 1, c);
}
int main() {
int n, m;
cin >> n >> m;
memset(colors, 0, n);
memset(visited, 0, sizeof visited);
for (int i = 0; i < m; i ++) {
int u, v;
scanf("%d %d", &u, &v);
v--, u--;
adjList[u].push_back(v);
adjList[v].push_back(u);
}
int q;
cin >> q;
pair<pair<int, int>, int> *quers = new pair<pair<int, int>, int> [q];
for (int i = 0; i < q; i ++) {
int s, d, c;
scanf("%d %d %d", &s, &d, &c);
quers[i] = {{s - 1, d}, c};
}
for (int i = q - 1; i >= 0; i --)
DFS(quers[i].first.first, quers[i].first.second, quers[i].second);
for (int i = 0; i < n; i ++)
cout << colors[i] << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
B - Splatter Painting |
User |
khaledJFT74 |
Language |
C++14 (GCC 5.4.1) |
Score |
700 |
Code Size |
1476 Byte |
Status |
AC |
Exec Time |
241 ms |
Memory |
9464 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:41:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d", &u, &v);
^
./Main.cpp:51:38: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d %d", &s, &d, &c);
^
Judge Result
Set Name |
Sample |
Subtask1 |
All |
Score / Max Score |
0 / 0 |
200 / 200 |
500 / 500 |
Status |
|
|
|
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 |
2 ms |
4352 KB |
00_example_02.txt |
AC |
2 ms |
4352 KB |
10_01.txt |
AC |
3 ms |
4352 KB |
10_02.txt |
AC |
2 ms |
4352 KB |
10_03.txt |
AC |
2 ms |
4352 KB |
10_04.txt |
AC |
2 ms |
4352 KB |
10_05.txt |
AC |
3 ms |
4352 KB |
10_06.txt |
AC |
2 ms |
4352 KB |
10_07.txt |
AC |
5 ms |
4352 KB |
10_08.txt |
AC |
7 ms |
4352 KB |
10_09.txt |
AC |
7 ms |
4352 KB |
10_10.txt |
AC |
7 ms |
4352 KB |
10_11.txt |
AC |
7 ms |
4352 KB |
10_12.txt |
AC |
7 ms |
4352 KB |
10_13.txt |
AC |
6 ms |
4352 KB |
10_14.txt |
AC |
6 ms |
4352 KB |
10_15.txt |
AC |
6 ms |
4352 KB |
10_16.txt |
AC |
7 ms |
4480 KB |
10_17.txt |
AC |
6 ms |
4480 KB |
20_01.txt |
AC |
241 ms |
8832 KB |
20_02.txt |
AC |
238 ms |
8832 KB |
20_03.txt |
AC |
240 ms |
8832 KB |
20_04.txt |
AC |
26 ms |
4992 KB |
20_05.txt |
AC |
5 ms |
4352 KB |
20_06.txt |
AC |
146 ms |
4736 KB |
20_07.txt |
AC |
5 ms |
4480 KB |
20_08.txt |
AC |
19 ms |
5248 KB |
20_09.txt |
AC |
5 ms |
4352 KB |
20_10.txt |
AC |
19 ms |
5248 KB |
20_11.txt |
AC |
25 ms |
5504 KB |
20_12.txt |
AC |
175 ms |
7680 KB |
20_13.txt |
AC |
207 ms |
8704 KB |
20_14.txt |
AC |
207 ms |
8832 KB |
20_15.txt |
AC |
211 ms |
9336 KB |
20_16.txt |
AC |
211 ms |
9464 KB |