結果
| 問題 | No.930 数列圧縮 |
| ユーザー |
 uwi
|
| 提出日時 | 2019-11-22 22:27:40 |
| 言語 | Java (openjdk 23) |
| 結果 |
AC
|
| 実行時間 | 337 ms / 2,000 ms |
| コード長 | 8,238 bytes |
| コンパイル時間 | 5,409 ms |
| コンパイル使用メモリ | 89,964 KB |
| 実行使用メモリ | 49,968 KB |
| 最終ジャッジ日時 | 2024-10-11 04:11:48 |
| 合計ジャッジ時間 | 11,373 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 24 |
ソースコード
package contest191122;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.InputMismatchException;
import java.util.List;
public class E {
InputStream is;
PrintWriter out;
String INPUT = "";
void solve()
{
int n = ni();
int[] a = na(n);
int min = 9999999;
int[] mins = new int[n];
int p = 0;
for(int i = 0;i < n;i++) {
if(a[i] < min) {
min = a[i];
mins[p++] = i;
}
}
LST lst = new LST(n);
SegmentTreeRMQPos st = new SegmentTreeRMQPos(a);
lst.setRange(n);
int[] route = new int[n];
int rp = 0;
for(int i = p-2;i >= 0;i--) {
while(true) {
int[] mi = st.min(mins[i]+1, n);
if(mi[0] > a[mins[i]])break;
int nex = lst.next(mi[1]+1);
if(nex == -1) {
out.println("No");
return;
}
route[rp++] = mi[0];
lst.unset(mi[1]);
st.update(mi[1], 9999999);
}
}
while(true) {
int nex = lst.next(1);
if(nex == -1)break;
route[rp++] = a[nex];
lst.unset(nex);
}
out.println("Yes");
for(int i = 0;i < rp;i++) {
out.print(route[i] + " ");
}
out.println();
}
public static int sumFenwick(int[] ft, int i)
{
int sum = 0;
for(i++;i > 0;i -= i&-i)sum += ft[i];
return sum;
}
public static void addFenwick(int[] ft, int i, int v)
{
if(v == 0 || i < 0)return;
int n = ft.length;
for(i++;i < n;i += i&-i)ft[i] += v;
}
public static class LST {
public long[][] set;
public int n;
// public int size;
public LST(int n) {
this.n = n;
int d = 1;
for(int m = n;m > 1;m>>>=6, d++);
set = new long[d][];
for(int i = 0, m = n>>>6;i < d;i++, m>>>=6){
set[i] = new long[m+1];
}
// size = 0;
}
// [0,r)
public LST setRange(int r)
{
for(int i = 0;i < set.length;i++, r=r+63>>>6){
for(int j = 0;j < r>>>6;j++){
set[i][j] = -1L;
}
if((r&63) != 0)set[i][r>>>6] |= (1L<<r)-1;
}
return this;
}
// [0,r)
public LST unsetRange(int r)
{
if(r >= 0){
for(int i = 0;i < set.length;i++, r=r+63>>>6){
for(int j = 0;j < r+63>>>6;j++){
set[i][j] = 0;
}
if((r&63) != 0)set[i][r>>>6] &= ~((1L<<r)-1);
}
}
return this;
}
public LST set(int pos)
{
if(pos >= 0 && pos < n){
// if(!get(pos))size++;
for(int i = 0;i < set.length;i++, pos>>>=6){
set[i][pos>>>6] |= 1L<<pos;
}
}
return this;
}
public LST unset(int pos)
{
if(pos >= 0 && pos < n){
// if(get(pos))size--;
for(int i = 0;i < set.length && (i == 0 || set[i-1][pos] == 0L);i++, pos>>>=6){
set[i][pos>>>6] &= ~(1L<<pos);
}
}
return this;
}
public boolean get(int pos)
{
return pos >= 0 && pos < n && set[0][pos>>>6]<<~pos<0;
}
public LST toggle(int pos)
{
return get(pos) ? unset(pos) : set(pos);
}
public int prev(int pos)
{
for(int i = 0;i < set.length && pos >= 0;i++, pos>>>=6, pos--){
int pre = prev(set[i][pos>>>6], pos&63);
if(pre != -1){
pos = pos>>>6<<6|pre;
while(i > 0)pos = pos<<6|63-Long.numberOfLeadingZeros(set[--i][pos]);
return pos;
}
}
return -1;
}
public int next(int pos)
{
for(int i = 0;i < set.length && pos>>>6 < set[i].length;i++, pos>>>=6, pos++){
int nex = next(set[i][pos>>>6], pos&63);
if(nex != -1){
pos = pos>>>6<<6|nex;
while(i > 0)pos = pos<<6|Long.numberOfTrailingZeros(set[--i][pos]);
return pos;
}
}
return -1;
}
private static int prev(long set, int n)
{
long h = set<<~n;
if(h == 0L)return -1;
return -Long.numberOfLeadingZeros(h)+n;
}
private static int next(long set, int n)
{
long h = set>>>n;
if(h == 0L)return -1;
return Long.numberOfTrailingZeros(h)+n;
}
@Override
public String toString()
{
List<Integer> list = new ArrayList<Integer>();
for(int pos = next(0);pos != -1;pos = next(pos+1)){
list.add(pos);
}
return list.toString();
}
}
public static class SegmentTreeRMQPos {
public int M, H, N, B;
public int[] st;
public int[] pos;
public SegmentTreeRMQPos(int n)
{
N = n;
M = Integer.highestOneBit(Math.max(n, 1))<<2;
H = M>>>1;
B = Integer.numberOfTrailingZeros(H);
st = new int[M];
pos = new int[M];
for(int i = M-1;i >= H;i--)pos[i] = i-H;
for(int i = H-1;i >= 0;i--){
pos[i] = pos[2*i];
}
}
public SegmentTreeRMQPos(int[] a)
{
N = a.length;
M = Integer.highestOneBit(Math.max(N, 1))<<2;
H = M>>>1;
B = Integer.numberOfTrailingZeros(H);
st = new int[M];
pos = new int[M];
for(int i = 0;i < N;i++){
st[H+i] = a[i];
pos[H+i] = i;
}
Arrays.fill(st, H+N, M, Integer.MAX_VALUE);
for(int i = (M>>1)-1;i >= 1;i--)propagate(i);
}
public void update(int p, int x)
{
st[H+p] = x;
for(int i = (H+p)>>>1;i >= 1;i >>>= 1)propagate(i);
}
private void propagate(int i)
{
if(st[i*2] <= st[i*2+1]){
st[i] = st[i*2];
pos[i] = pos[i*2];
}else{
st[i] = st[i*2+1];
pos[i] = pos[i*2+1];
}
}
public int[] min(int f, int t) { return min(f, t, B); }
public int[] min(int f, int t, int b)
{
if(f>>b<<b==f && t+1>>b<<b==t+1){
return new int[]{st[(H|f)>>b], pos[(H|f)>>b]};
}
b--;
if((f^t)<<31-b<0){
int w = t>>b<<b;
int[] l = min(f, w-1, b);
int[] r = min(w, t, b);
return l[0] <= r[0] ? l : r;
}else{
return min(f, t, b);
}
}
}
void run() throws Exception
{
is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
out = new PrintWriter(System.out);
long s = System.currentTimeMillis();
solve();
out.flush();
if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
// Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
// @Override
// public void run() {
// long s = System.currentTimeMillis();
// solve();
// out.flush();
// if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
// }
// };
// t.start();
// t.join();
}
public static void main(String[] args) throws Exception { new E().run(); }
private byte[] inbuf = new byte[1024];
public int lenbuf = 0, ptrbuf = 0;
private int readByte()
{
if(lenbuf == -1)throw new InputMismatchException();
if(ptrbuf >= lenbuf){
ptrbuf = 0;
try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
if(lenbuf <= 0)return -1;
}
return inbuf[ptrbuf++];
}
private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
private double nd() { return Double.parseDouble(ns()); }
private char nc() { return (char)skip(); }
private String ns()
{
int b = skip();
StringBuilder sb = new StringBuilder();
while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
sb.appendCodePoint(b);
b = readByte();
}
return sb.toString();
}
private char[] ns(int n)
{
char[] buf = new char[n];
int b = skip(), p = 0;
while(p < n && !(isSpaceChar(b))){
buf[p++] = (char)b;
b = readByte();
}
return n == p ? buf : Arrays.copyOf(buf, p);
}
private int[] na(int n)
{
int[] a = new int[n];
for(int i = 0;i < n;i++)a[i] = ni();
return a;
}
private long[] nal(int n)
{
long[] a = new long[n];
for(int i = 0;i < n;i++)a[i] = nl();
return a;
}
private char[][] nm(int n, int m) {
char[][] map = new char[n][];
for(int i = 0;i < n;i++)map[i] = ns(m);
return map;
}
private int[][] nmi(int n, int m) {
int[][] map = new int[n][];
for(int i = 0;i < n;i++)map[i] = na(m);
return map;
}
private int ni() { return (int)nl(); }
private long nl()
{
long num = 0;
int b;
boolean minus = false;
while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
if(b == '-'){
minus = true;
b = readByte();
}
while(true){
if(b >= '0' && b <= '9'){
num = num * 10 + (b - '0');
}else{
return minus ? -num : num;
}
b = readByte();
}
}
private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}