結果
| 問題 | No.318 学学学学学 |
| ユーザー |
 ぴろず
|
| 提出日時 | 2015-12-11 02:09:30 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 563 ms / 2,000 ms |
| コード長 | 6,550 bytes |
| コンパイル時間 | 2,971 ms |
| コンパイル使用メモリ | 91,380 KB |
| 実行使用メモリ | 68,716 KB |
| 最終ジャッジ日時 | 2024-06-22 15:13:46 |
| 合計ジャッジ時間 | 11,538 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 26 |
ソースコード
package no318;import java.io.IOException;import java.io.InputStream;import java.io.PrintWriter;import java.util.ArrayList;import java.util.Arrays;import java.util.HashMap;import java.util.InputMismatchException;import java.util.Map;import java.util.NoSuchElementException;public class Main {public static void main(String[] args) {IO io = new IO();int n = io.nextInt();HashMap<Integer, Interval> hm = new HashMap<>();for(int i=0;i<n;i++) {int a = io.nextInt();Interval iv = hm.get(a);if (iv == null) {iv = new Interval(i);hm.put(a, iv);}else{iv.add(i);}}ArrayList<Map.Entry<Integer, Interval>> al = new ArrayList<>(hm.entrySet());al.sort((x,y) -> Integer.compare(x.getKey(), y.getKey()));RangeSetRangeSumLong st = new RangeSetRangeSumLong(n);// System.out.println(al);for(Map.Entry<Integer, Interval> entry:al) {Interval v = entry.getValue();st.set(v.first, v.last + 1, entry.getKey());}long[] ans = st.data();for(int i=0;i<n;i++) {if (i > 0) {io.print(" ");}io.print(ans[i]);}io.println();io.flush();}}class Interval {int first,last;public Interval(int x) {first = last = x;}public void add(int x) {first = Math.min(first, x);last = Math.max(last, x);}public String toString() {return "[" + first + "," + last + "]";}}class RangeSetRangeSumLong {private int size,n;private long[] sum;private boolean[] lazy;private long[] lazyValue;public RangeSetRangeSumLong(int size) {this.size = size;n = 1;while(n<this.size) {n*=2;}sum = new long[n*2-1];lazy = new boolean[n*2-1];lazyValue = new long[n*2-1];}private void propagate(int k) {if (lazy[k] && k < n - 1) {sum[k*2+1] = sum[k*2+2] = sum[k] >> 1;lazy[k*2+1] = lazy[k*2+2] = true;lazyValue[k*2+1] = lazyValue[k*2+1] = lazyValue[k];}lazy[k] = false;}public void set(int begin,int end,long x) {set(begin,end,x,0,0,n);}private void set(int begin,int end,long x,int k,int l,int r) {propagate(k);if (r <= begin || end <= l) {return;}if (begin <= l && r <= end) {sum[k] = x * (r - l);lazy[k] = true;lazyValue[k] = x;propagate(k);return;}set(begin,end,x,k*2+1,l,(l+r)>>>1);set(begin,end,x,k*2+2,(l+r)>>>1,r);sum[k] = sum[k*2+1] + sum[k*2+2];}public long sum(int begin,int end) {return sum(begin,end,0,0,n);}private long sum(int begin,int end,int k,int l,int r) {propagate(k);if (r <= begin || end <= l) {return 0;}if (begin <= l && r <= end) {return sum[k];}long sum1 = sum(begin,end,k*2+1,l,(l+r)/2);long sum2 = sum(begin,end,k*2+2,(l+r)/2,r);sum[k] = sum[k*2+1] + sum[k*2+2];return sum1 + sum2;}public long[] data() {for(int i=0;i<n*2-1;i++) {propagate(i);}return Arrays.copyOfRange(sum,n-1,size+n-1);}//debugpublic String toString() {ArrayList<Long> data = new ArrayList<>();for(int i=0;i<size;i++) {data.add(sum(i, i+1));}return data.toString();}}class IO extends PrintWriter {private final InputStream in;private final byte[] buffer = new byte[1024];private int ptr = 0;private int buflen = 0;public IO() { this(System.in);}public IO(InputStream source) { super(System.out); this.in = source;}private boolean hasNextByte() {if (ptr < buflen) {return true;}else{ptr = 0;try {buflen = in.read(buffer);} catch (IOException e) {e.printStackTrace();}if (buflen <= 0) {return false;}}return true;}private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}private static boolean isNewLine(int c) { return c == '\n' || c == '\r';}public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}public boolean hasNextLine() { while(hasNextByte() && isNewLine(buffer[ptr])) ptr++; return hasNextByte();}public String next() {if (!hasNext()) {throw new NoSuchElementException();}StringBuilder sb = new StringBuilder();int b = readByte();while(isPrintableChar(b)) {sb.appendCodePoint(b);b = readByte();}return sb.toString();}public char[] nextCharArray(int len) {if (!hasNext()) {throw new NoSuchElementException();}char[] s = new char[len];int i = 0;int b = readByte();while(isPrintableChar(b)) {if (i == len) {throw new InputMismatchException();}s[i++] = (char) b;b = readByte();}return s;}public String nextLine() {if (!hasNextLine()) {throw new NoSuchElementException();}StringBuilder sb = new StringBuilder();int b = readByte();while(!isNewLine(b)) {sb.appendCodePoint(b);b = readByte();}return sb.toString();}public long nextLong() {if (!hasNext()) {throw new NoSuchElementException();}long n = 0;boolean minus = false;int b = readByte();if (b == '-') {minus = true;b = readByte();}if (b < '0' || '9' < b) {throw new NumberFormatException();}while(true){if ('0' <= b && b <= '9') {n *= 10;n += b - '0';}else if(b == -1 || !isPrintableChar(b)){return minus ? -n : n;}else{throw new NumberFormatException();}b = readByte();}}public int nextInt() {long nl = nextLong();if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) {throw new NumberFormatException();}return (int) nl;}public char nextChar() {if (!hasNext()) {throw new NoSuchElementException();}return (char) readByte();}public double nextDouble() { return Double.parseDouble(next());}public int[] nextIntArray(int n) { int[] a = new int[n]; for(int i=0;i<n;i++) a[i] = nextInt(); return a;}public long[] nextLongArray(int n) { long[] a = new long[n]; for(int i=0;i<n;i++) a[i] = nextLong(); return a;}public double[] nextDoubleArray(int n) { double[] a = new double[n]; for(int i=0;i<n;i++) a[i] = nextDouble(); return a;}public void nextIntArrays(int[]... a) { for(int i=0;i<a[0].length;i++) for(int j=0;j<a.length;j++) a[j][i] = nextInt();}public int[][] nextIntMatrix(int n,int m) { int[][] a = new int[n][]; for(int i=0;i<n;i++) a[i] = nextIntArray(m); return a;}public char[][] nextCharMap(int n,int m) { char[][] a = new char[n][]; for(int i=0;i<n;i++) a[i] = nextCharArray(m); return a;}public void close() { super.close(); try {in.close();} catch (IOException e) {}}}