結果

問題 No.709 優勝可能性
ユーザー GrenacheGrenache
提出日時 2018-09-21 19:12:54
言語 Java21
(openjdk 21)
結果
AC  
実行時間 640 ms / 3,500 ms
コード長 5,242 bytes
コンパイル時間 5,602 ms
コンパイル使用メモリ 76,936 KB
実行使用メモリ 81,568 KB
最終ジャッジ日時 2023-09-25 10:47:27
合計ジャッジ時間 14,999 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge11
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 45 ms
49,160 KB
testcase_01 AC 45 ms
49,340 KB
testcase_02 AC 45 ms
49,672 KB
testcase_03 AC 45 ms
49,232 KB
testcase_04 AC 46 ms
49,344 KB
testcase_05 AC 44 ms
49,324 KB
testcase_06 AC 45 ms
49,372 KB
testcase_07 AC 44 ms
49,260 KB
testcase_08 AC 44 ms
47,700 KB
testcase_09 AC 44 ms
49,244 KB
testcase_10 AC 354 ms
59,052 KB
testcase_11 AC 243 ms
57,632 KB
testcase_12 AC 616 ms
63,752 KB
testcase_13 AC 506 ms
66,500 KB
testcase_14 AC 407 ms
65,780 KB
testcase_15 AC 391 ms
63,792 KB
testcase_16 AC 529 ms
69,952 KB
testcase_17 AC 498 ms
81,568 KB
testcase_18 AC 46 ms
49,460 KB
testcase_19 AC 45 ms
49,476 KB
testcase_20 AC 623 ms
59,240 KB
testcase_21 AC 640 ms
65,424 KB
testcase_22 AC 44 ms
49,324 KB
testcase_23 AC 47 ms
49,688 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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


public class Main_yukicoder709 {

	private static Scanner sc;
	private static Printer pr;

	private static void solve() {
		int n = sc.nextInt();
		int m = sc.nextInt();
		
		int[] max = new int[m];
		Arrays.fill(max, Integer.MIN_VALUE);
		List<Queue<Integer>> maxi = new ArrayList<>(m);
		for (int i = 0; i < m ; i++) {
			maxi.add(new ArrayDeque<>());
		}
		
		int[] cnt = new int[n];
		BIT bit = new BIT(n);
		for (int i = 0; i < n; i++) {
			for (int j = 0; j < m; j++) {
				int r = sc.nextInt();
				
				if (r > max[j]) {
					max[j] = r;
					for (int e : maxi.get(j)) {
						cnt[e]--;
						if (cnt[e] == 0) {
							bit.add(i + 1, -1);
						}
					}
					maxi.get(j).clear();
					maxi.get(j).add(i);
					cnt[i]++;
					if (cnt[i] == 1) {
						bit.add(i + 1, 1);
					}
				} else if (r == max[j]) {
					maxi.get(j).add(i);
					cnt[i]++;
					if (cnt[i] == 1) {
						bit.add(i + 1, 1);
					}
				}
			}
			
			pr.println(bit.query(i + 1));
		}
	}

	// Binary Indexed Tree
	private static class BIT {
		// [0,n-1]
		int[] bit;
		int n;
		// [1,n]
		BIT(int n) {
			this.n = n;
			bit = new int[this.n];
		}

		// i:1-indexed
		void add(int i, int x) {
			while (i <= n) {
				bit[i - 1] += x;
				i += i & (-i);
			}
		}

		// i:1-indexed
		// [1,i]
		int query(int i) {
			int sum = 0;
			while (i > 0) {
				sum += bit[i - 1];
				i -= i & (-i);
			}

			return sum;
		}
	}

	// ---------------------------------------------------
	public static void main(String[] args) {
		sc = new Scanner(INPUT == null ? System.in : new ByteArrayInputStream(INPUT.getBytes()));
		pr = new Printer(System.out);

		solve();

//		pr.close();
		pr.flush();
//		sc.close();
	}

	static String INPUT = null;

	@SuppressWarnings("unused")
	private static class Scanner {
		BufferedReader br;

		Scanner (InputStream in) {
			br = new BufferedReader(new InputStreamReader(in));
		}

		private boolean isPrintable(int ch) {
			return ch >= '!' && ch <= '~';
		}

		private boolean isCRLF(int ch) {
			return ch == '\n' || ch == '\r' || ch == -1;
		}

		private int nextPrintable() {
			try {
				int ch;
				while (!isPrintable(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}

				return ch;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		String next() {
			try {
				int ch = nextPrintable();
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (isPrintable(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		int nextInt() {
			try {
				// parseInt from Integer.parseInt()
				boolean negative = false;
				int res = 0;
				int limit = -Integer.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Integer.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				int multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		long nextLong() {
			try {
				// parseLong from Long.parseLong()
				boolean negative = false;
				long res = 0;
				long limit = -Long.MAX_VALUE;
				int radix = 10;

				int fc = nextPrintable();
				if (fc < '0') {
					if (fc == '-') {
						negative = true;
						limit = Long.MIN_VALUE;
					} else if (fc != '+') {
						throw new NumberFormatException();
					}
					fc = br.read();
				}
				long multmin = limit / radix;

				int ch = fc;
				do {
					int digit = ch - '0';
					if (digit < 0 || digit >= radix) {
						throw new NumberFormatException();
					}
					if (res < multmin) {
						throw new NumberFormatException();
					}
					res *= radix;
					if (res < limit + digit) {
						throw new NumberFormatException();
					}
					res -= digit;

				} while (isPrintable(ch = br.read()));

				return negative ? res : -res;
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		float nextFloat() {
			return Float.parseFloat(next());
		}

		double nextDouble() {
			return Double.parseDouble(next());
		}

		String nextLine() {
			try {
				int ch;
				while (isCRLF(ch = br.read())) {
					if (ch == -1) {
						throw new NoSuchElementException();
					}
				}
				StringBuilder sb = new StringBuilder();
				do {
					sb.appendCodePoint(ch);
				} while (!isCRLF(ch = br.read()));

				return sb.toString();
			} catch (IOException e) {
				throw new NoSuchElementException();
			}
		}

		void close() {
			try {
				br.close();
			} catch (IOException e) {
//				throw new NoSuchElementException();
			}
		}
	}

	private static class Printer extends PrintWriter {
		Printer(OutputStream out) {
			super(out);
		}
	}
}
0