結果
| 問題 | No.709 優勝可能性 |
| ユーザー |
 Grenache
|
| 提出日時 | 2018-09-21 19:12:54 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 585 ms / 3,500 ms |
| コード長 | 5,242 bytes |
| コンパイル時間 | 3,932 ms |
| コンパイル使用メモリ | 80,360 KB |
| 実行使用メモリ | 82,376 KB |
| 最終ジャッジ日時 | 2024-07-18 08:45:18 |
| 合計ジャッジ時間 | 11,365 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 22 |
ソースコード
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 Treeprivate 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-indexedvoid 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);}}}