Submission #1195350


Source Code Expand

import java.io.*;
import java.math.*;
import java.util.*;

import static java.util.Arrays.*;

public class Main {
	private static final int mod = (int)924844033;

	final Random random = new Random(0);
	final IOFast io = new IOFast();

	/// MAIN CODE
	public void run() throws IOException {
//		int TEST_CASE = Integer.parseInt(new String(io.nextLine()).trim());
		int TEST_CASE = 1;
		while(TEST_CASE-- != 0) {
			int n = io.nextInt();
			int m = io.nextInt();
			
			SimpleAdjListGraph_FixedSizeEdge g = new SimpleAdjListGraph_FixedSizeEdge(n, 2*m);
			
			for (int i = 0; i < m; i++) {
				int a = io.nextInt() - 1;
				int b = io.nextInt() - 1;
				g.addEdge(a, b);
				g.addEdge(b, a);
			}
			int q = io.nextInt();
			int[][] qs = new int[q][];
			while (q-- > 0) {
				int v = io.nextInt() - 1;
				int d = io.nextInt();
				int c = io.nextInt();
				qs[q] = new int[]{v,d,c,};
			}
			for (int[] qq : qs)  g.bfs(qq[0], qq[1], qq[2]);
			for (int i = 0; i < n; i++) {
				io.out.println(g.color[i]);
			}
//			dump(g.color);
		}
	}
	
	static class SimpleAdjListGraph_FixedSizeEdge {
		int m, V, E;
		int[] head, next, to;

		public SimpleAdjListGraph_FixedSizeEdge(int V, int E) {
			head = new int[V];
			next = new int[E];
			to = new int[E];
			this.V = V;
			this.E = E;
			dist = new int[head.length];
			color = new int[head.length];
			q = new int[2 * head.length + 10];
			clear();
		}

		public void clear() {
			m = 0;
			Arrays.fill(dist, -1);
			Arrays.fill(color, 0);
			Arrays.fill(head, -1);
		}

		public void addEdge(int s, int t) {
			next[m] = head[s];
			head[s] = m;
			to[m++] = t;
		}

		final int[] dist;
		final int[] color;
		final int[] q;
		public void bfs(final int src, int d, int c) {
			int s = 0, t = 0;
			
			if (dist[src] >= d) return;
			if (dist[src] < 0) color[src] = c;
			
			dist[src] = d;
			q[t++] = src;
			while(s != t) {
				final int v = q[s++];
				d = dist[v];
				for(int e = head[v]; e != -1; e = next[e]) {
					final int u = to[e];
					if(dist[u] == -1 || dist[u] < d - 1) {
						if (dist[u] < 0) color[u] = c;
						dist[u] = dist[v] - 1;
						if (dist[u] > 0) q[t++] = u;
					}
				}
			}
		}
	}
	
	/// TEMPLATE
	static int gcd(int n, int r) { return r == 0 ? n : gcd(r, n%r); }
	static long gcd(long n, long r) { return r == 0 ? n : gcd(r, n%r); }
	
	static <T> void swap(T[] x, int i, int j) { T t = x[i]; x[i] = x[j]; x[j] = t; }
	static void swap(int[] x, int i, int j) { int t = x[i]; x[i] = x[j]; x[j] = t; }

	void printArrayLn(int[] xs) { for(int i = 0; i < xs.length; i++) io.out.print(xs[i] + (i==xs.length-1?"\n":" ")); }
	void printArrayLn(long[] xs) { for(int i = 0; i < xs.length; i++) io.out.print(xs[i] + (i==xs.length-1?"\n":" ")); }
	
	static void dump(Object... o) { System.err.println(Arrays.deepToString(o)); } 
	
	void main() throws IOException {
		//		IOFast.setFileIO("rle-size.in", "rle-size.out");
		try { run(); }
		catch (EndOfFileRuntimeException e) { }
		io.out.flush();
	}
	public static void main(String[] args) throws IOException { new Main().main(); }
	
	static class EndOfFileRuntimeException extends RuntimeException {
		private static final long serialVersionUID = -8565341110209207657L; }

	static
	public class IOFast {
		private BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		private PrintWriter out = new PrintWriter(System.out);

		void setFileIn(String ins) throws IOException { in.close(); in = new BufferedReader(new FileReader(ins)); }
		void setFileOut(String outs) throws IOException { out.flush(); out.close(); out = new PrintWriter(new FileWriter(outs)); }
		void setFileIO(String ins, String outs) throws IOException { setFileIn(ins); setFileOut(outs); }

		private static int pos, readLen;
		private static final char[] buffer = new char[1024 * 8];
		private static char[] str = new char[500*8*2];
		private static boolean[] isDigit = new boolean[256];
		private static boolean[] isSpace = new boolean[256];
		private static boolean[] isLineSep = new boolean[256];

		static { for(int i = 0; i < 10; i++) { isDigit['0' + i] = true; } isDigit['-'] = true; isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true; isLineSep['\r'] = isLineSep['\n'] = true; }
		public int read() throws IOException { if(pos >= readLen) { pos = 0; readLen = in.read(buffer); if(readLen <= 0) { throw new EndOfFileRuntimeException(); } } return buffer[pos++]; }
		public int nextInt() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; int ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
		public long nextLong() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; long ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
		public char nextChar() throws IOException { while(true) { final int c = read(); if(!isSpace[c]) { return (char)c; } } }
		int reads(int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } if(str.length == len) { char[] rep = new char[str.length * 3 / 2]; System.arraycopy(str, 0, rep, 0, str.length); str = rep; } str[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
		int reads(char[] cs, int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } cs[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
		public char[] nextLine() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isLineSep); try { if(str[len-1] == '\r') { len--; read(); } } catch(EndOfFileRuntimeException e) { ; } return Arrays.copyOf(str, len); }
		public String nextString() throws IOException { return new String(next()); }
		public char[] next() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); return Arrays.copyOf(str, len); }
//		public int next(char[] cs) throws IOException { int len = 0; cs[len++] = nextChar(); len = reads(cs, len, isSpace); return len; }
		public double nextDouble() throws IOException { return Double.parseDouble(nextString()); }
		public long[] nextLongArray(final int n) throws IOException { final long[] res = new long[n]; for(int i = 0; i < n; i++) { res[i] = nextLong(); } return res; }
		public int[] nextIntArray(final int n) throws IOException { final int[] res = new int[n]; for(int i = 0; i < n; i++) { res[i] = nextInt(); } return res; }
		public int[][] nextIntArray2D(final int n, final int k) throws IOException { final int[][] res = new int[n][]; for(int i = 0; i < n; i++) { res[i] = nextIntArray(k); } return res; }
		public int[][] nextIntArray2DWithIndex(final int n, final int k) throws IOException { final int[][] res = new int[n][k+1]; for(int i = 0; i < n; i++) { for(int j = 0; j < k; j++) { res[i][j] = nextInt(); } res[i][k] = i; } return res; }
		public double[] nextDoubleArray(final int n) throws IOException { final double[] res = new double[n]; for(int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; }
	}
}

Submission Info

Submission Time
Task B - Splatter Painting
User tanzaku
Language Java8 (OpenJDK 1.8.0)
Score 0
Code Size 7365 Byte
Status WA
Exec Time 268 ms
Memory 35552 KB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 0 / 200 0 / 500
Status
AC × 2
AC × 11
WA × 8
AC × 21
WA × 14
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 70 ms 17876 KB
00_example_02.txt AC 100 ms 17876 KB
10_01.txt AC 73 ms 16212 KB
10_02.txt AC 69 ms 20052 KB
10_03.txt WA 71 ms 19540 KB
10_04.txt AC 70 ms 18260 KB
10_05.txt AC 74 ms 23252 KB
10_06.txt AC 72 ms 20820 KB
10_07.txt AC 75 ms 23252 KB
10_08.txt AC 87 ms 19284 KB
10_09.txt WA 90 ms 19028 KB
10_10.txt WA 89 ms 22228 KB
10_11.txt WA 96 ms 18388 KB
10_12.txt WA 96 ms 20052 KB
10_13.txt WA 84 ms 20308 KB
10_14.txt WA 80 ms 19540 KB
10_15.txt WA 90 ms 20180 KB
10_16.txt AC 91 ms 20948 KB
10_17.txt AC 96 ms 21332 KB
20_01.txt WA 262 ms 35500 KB
20_02.txt WA 268 ms 35552 KB
20_03.txt WA 257 ms 34868 KB
20_04.txt AC 132 ms 23636 KB
20_05.txt AC 92 ms 22228 KB
20_06.txt WA 153 ms 26580 KB
20_07.txt AC 93 ms 21332 KB
20_08.txt AC 142 ms 26452 KB
20_09.txt AC 94 ms 19796 KB
20_10.txt AC 129 ms 28116 KB
20_11.txt AC 145 ms 24532 KB
20_12.txt WA 189 ms 31164 KB
20_13.txt WA 222 ms 32956 KB
20_14.txt AC 215 ms 33792 KB
20_15.txt AC 246 ms 33720 KB
20_16.txt AC 253 ms 35112 KB