oj.uz

Submission #270661

# Submission time Handle Problem Language Result Execution time Memory
270661 2020-08-17T21:11:14 Z Gilgamesh Just Long Neckties (JOI20_ho_t1) Java 11
9 / 100
 1000 ms 27328 KB 
import java.util.*;
import java.io.*;

public class ho_t1 {
	final static int MOD = 1000000007;
	final static int intMax = 1000000000;
	final static int intMin = -1000000000;
	final static int[] dx = { 0, 0, -1, 1 };
	final static int[] dy = { -1, 1, 0, 0 };

	static int T;

	static class Reader {
		final private int BUFFER_SIZE = 1 << 16;
		private DataInputStream din;
		private byte[] buffer;
		private int bufferPointer, bytesRead;

		public Reader() {
			din = new DataInputStream(System.in);
			buffer = new byte[BUFFER_SIZE];
			bufferPointer = bytesRead = 0;
		}

		public Reader(String file_name) throws IOException {
			din = new DataInputStream(new FileInputStream(file_name));
			buffer = new byte[BUFFER_SIZE];
			bufferPointer = bytesRead = 0;
		}

		public String readLine() throws IOException {
			byte[] buf = new byte[360]; // line length
			int cnt = 0, c;
			while ((c = read()) != -1) {
				if (c == '\n')
					break;
				buf[cnt++] = (byte) c;
			}
			return new String(buf, 0, cnt);
		}

		public int nextInt() throws IOException {
			int ret = 0;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();
			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');

			if (neg)
				return -ret;
			return ret;
		}

		public long nextLong() throws IOException {
			long ret = 0;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();
			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');
			if (neg)
				return -ret;
			return ret;
		}

		public double nextDouble() throws IOException {
			double ret = 0, div = 1;
			byte c = read();
			while (c <= ' ')
				c = read();
			boolean neg = (c == '-');
			if (neg)
				c = read();

			do {
				ret = ret * 10 + c - '0';
			} while ((c = read()) >= '0' && c <= '9');

			if (c == '.') {
				while ((c = read()) >= '0' && c <= '9') {
					ret += (c - '0') / (div *= 10);
				}
			}

			if (neg)
				return -ret;
			return ret;
		}

		private void fillBuffer() throws IOException {
			bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
			if (bytesRead == -1)
				buffer[0] = -1;
		}

		private byte read() throws IOException {
			if (bufferPointer == bytesRead)
				fillBuffer();
			return buffer[bufferPointer++];
		}

		public void close() throws IOException {
			if (din == null)
				return;
			din.close();
		}
	}

	public static void main(String[] args) throws Exception {
		Reader in = new Reader();
		int N = in.nextInt();
		nt[] A = new nt[N + 1];
		int[] B = new int[N];
		for(int i = 0; i <= N; ++i) {
			int len = in.nextInt();
			A[i] = new nt(i, len);
		}
		for(int i = 0; i < N; ++i) {
			B[i] = in.nextInt();
		}
		Arrays.sort(A, (a, b) -> a.len - b.len);
		Arrays.sort(B);
		int[] ans = new int[N + 1];
		int[] dif1 = new int[N];
		int[] dif2 = new int[N];
		for(int i = 0; i < N; ++i) {
			dif1[i] = Math.max(A[i].len - B[i], 0);
			dif2[i] = Math.max(A[i + 1].len - B[i], 0);
		}
		int suffmx[] = new int[N]; //suffmx for dif2
		int prefmx[] = new int[N];
		for(int i = 0; i < N; ++i) {
			prefmx[i] = dif1[i];
			if(i > 0) prefmx[i] = Math.max(prefmx[i - 1], prefmx[i]);
		}
		for(int i = N - 1; i >= 0; --i) {
			suffmx[i] = dif2[i];
			if(i < N - 1) suffmx[i] = Math.max(suffmx[i], suffmx[i + 1]);
		}
		for(int i = 0; i <= N; ++i) {
			if(i > 0) ans[A[i].ind] = prefmx[i - 1];
			if(i < N) ans[A[i].ind] = Math.max(ans[A[i].ind], suffmx[i]);
		}
		for(int i = 0; i <= N; ++i) {
			System.out.print(ans[i] + " ");
		}
		System.out.println();
		in.close();
	}
	static class nt{
		int ind, len;
		nt(int i, int l){
			ind = i; len = l;
		}
	}
}

Subtask #1
1.0 / 1.0

# Verdict Execution time Memory Grader output
1 Correct 212 ms 16084 KB Output is correct
2 Correct 226 ms 16120 KB Output is correct
3 Correct 226 ms 15860 KB Output is correct
4 Correct 222 ms 15992 KB Output is correct
5 Correct 198 ms 15348 KB Output is correct
6 Correct 196 ms 15516 KB Output is correct
7 Correct 198 ms 15992 KB Output is correct
8 Correct 191 ms 15608 KB Output is correct
9 Correct 199 ms 15864 KB Output is correct
10 Correct 203 ms 15960 KB Output is correct
11 Correct 217 ms 16096 KB Output is correct
12 Correct 233 ms 16176 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 212 ms 16084 KB Output is correct
2 Correct 226 ms 16120 KB Output is correct
3 Correct 226 ms 15860 KB Output is correct
4 Correct 222 ms 15992 KB Output is correct
5 Correct 198 ms 15348 KB Output is correct
6 Correct 196 ms 15516 KB Output is correct
7 Correct 198 ms 15992 KB Output is correct
8 Correct 191 ms 15608 KB Output is correct
9 Correct 199 ms 15864 KB Output is correct
10 Correct 203 ms 15960 KB Output is correct
11 Correct 217 ms 16096 KB Output is correct
12 Correct 233 ms 16176 KB Output is correct
13 Correct 221 ms 16104 KB Output is correct
14 Correct 264 ms 16468 KB Output is correct
15 Correct 274 ms 16448 KB Output is correct
16 Correct 208 ms 15352 KB Output is correct
17 Correct 265 ms 16908 KB Output is correct
18 Correct 248 ms 16744 KB Output is correct
19 Correct 278 ms 16752 KB Output is correct
20 Correct 260 ms 16744 KB Output is correct
21 Correct 272 ms 16132 KB Output is correct
22 Correct 256 ms 16628 KB Output is correct
23 Correct 255 ms 16220 KB Output is correct
24 Correct 249 ms 16576 KB Output is correct
25 Correct 250 ms 16880 KB Output is correct
26 Correct 285 ms 16516 KB Output is correct
27 Correct 231 ms 16244 KB Output is correct
28 Correct 272 ms 16996 KB Output is correct
29 Correct 249 ms 16176 KB Output is correct
30 Correct 274 ms 16568 KB Output is correct
31 Correct 267 ms 16092 KB Output is correct
32 Correct 248 ms 16360 KB Output is correct

Subtask #3
0 / 91.0

# Verdict Execution time Memory Grader output
1 Correct 212 ms 16084 KB Output is correct
2 Correct 226 ms 16120 KB Output is correct
3 Correct 226 ms 15860 KB Output is correct
4 Correct 222 ms 15992 KB Output is correct
5 Correct 198 ms 15348 KB Output is correct
6 Correct 196 ms 15516 KB Output is correct
7 Correct 198 ms 15992 KB Output is correct
8 Correct 191 ms 15608 KB Output is correct
9 Correct 199 ms 15864 KB Output is correct
10 Correct 203 ms 15960 KB Output is correct
11 Correct 217 ms 16096 KB Output is correct
12 Correct 233 ms 16176 KB Output is correct
13 Correct 221 ms 16104 KB Output is correct
14 Correct 264 ms 16468 KB Output is correct
15 Correct 274 ms 16448 KB Output is correct
16 Correct 208 ms 15352 KB Output is correct
17 Correct 265 ms 16908 KB Output is correct
18 Correct 248 ms 16744 KB Output is correct
19 Correct 278 ms 16752 KB Output is correct
20 Correct 260 ms 16744 KB Output is correct
21 Correct 272 ms 16132 KB Output is correct
22 Correct 256 ms 16628 KB Output is correct
23 Correct 255 ms 16220 KB Output is correct
24 Correct 249 ms 16576 KB Output is correct
25 Correct 250 ms 16880 KB Output is correct
26 Correct 285 ms 16516 KB Output is correct
27 Correct 231 ms 16244 KB Output is correct
28 Correct 272 ms 16996 KB Output is correct
29 Correct 249 ms 16176 KB Output is correct
30 Correct 274 ms 16568 KB Output is correct
31 Correct 267 ms 16092 KB Output is correct
32 Correct 248 ms 16360 KB Output is correct
33 Execution timed out 1045 ms 27328 KB Time limit exceeded
34 Halted 0 ms 0 KB -