結果

問題 No.880 Yet Another Segment Tree Problem
ユーザー uwiuwi
提出日時 2020-09-06 04:54:00
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 8,143 bytes
コンパイル時間 2,911 ms
コンパイル使用メモリ 85,576 KB
実行使用メモリ 63,368 KB
最終ジャッジ日時 2024-05-06 20:36:01
合計ジャッジ時間 25,064 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 55 ms
36,968 KB
testcase_01 AC 80 ms
37,156 KB
testcase_02 AC 89 ms
38,512 KB
testcase_03 AC 85 ms
38,148 KB
testcase_04 AC 80 ms
37,660 KB
testcase_05 AC 62 ms
36,992 KB
testcase_06 AC 60 ms
37,104 KB
testcase_07 AC 74 ms
37,616 KB
testcase_08 AC 79 ms
37,600 KB
testcase_09 AC 83 ms
38,292 KB
testcase_10 AC 64 ms
37,204 KB
testcase_11 WA -
testcase_12 WA -
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 AC 475 ms
55,596 KB
testcase_20 AC 503 ms
55,572 KB
testcase_21 AC 447 ms
54,432 KB
testcase_22 AC 485 ms
54,720 KB
testcase_23 AC 500 ms
55,488 KB
testcase_24 AC 472 ms
57,260 KB
testcase_25 AC 475 ms
57,428 KB
testcase_26 AC 451 ms
56,580 KB
testcase_27 AC 431 ms
56,564 KB
testcase_28 AC 476 ms
56,604 KB
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 AC 310 ms
50,716 KB
testcase_34 AC 324 ms
51,148 KB
testcase_35 AC 308 ms
50,964 KB
testcase_36 AC 302 ms
50,784 KB
testcase_37 AC 311 ms
51,040 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package hackerearth.easy2009;

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

class D3 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), m = ni();
		int[] a = na(n);
		SegmentTreeRGcdizeRUpdateRMaxQRSQ st = new SegmentTreeRGcdizeRUpdateRMaxQRSQ(a);
		for(int z = 0;z < m;z++){
			int t = ni();
			if(t == 1){
				int l = ni()-1;
				int r = ni()-1;
				int x = ni();
				st.update(l, r+1, x);
			}else if(t == 2){
				int l = ni()-1;
				int r = ni()-1;
				int x = ni();
				st.gcdize(l, r+1, x);
			}else if(t == 3){
				int l = ni()-1;
				int r = ni()-1;
				out.println(st.max(l, r+1));
			}else{
				int l = ni()-1;
				int r = ni()-1;
				out.println(st.sum(l, r+1));
			}
			/*
			tr(st.lcms);
			tr(st.covers);
			tr(st.sums);
			*/
		}
	}
	
	void update(int c, int[] rep, int[] b, int[] a, int S, int[] maxs, long[] sums)
	{
		if(rep[c] != 0){
			int len = Math.min(S, a.length - S*c);
			maxs[c] = rep[c];
			sums[c] = (long)rep[c] * len;
		}else{
			maxs[c] = 0;
			sums[c] = 0;
			int to = Math.min(S*c+S, a.length);
			for(int i = S*c;i < to;i++){
				int h = gcd(a[i], b[c]);
				maxs[c] = Math.max(maxs[c], h);
				sums[c] += h;
			}
		}
	}
	
	public static int gcd(int a, int b) {
		if(a == 0)return b;
		if(b == 0)return a;
		
		int ashift = Integer.numberOfTrailingZeros(a);
		int bshift = Integer.numberOfTrailingZeros(b);
		a >>>= ashift;
		b >>>= bshift;
		while(b != a){
			if(a > b){
				int t = a; a = b; b = t;
			}
			b -= a;
			b >>>= Integer.numberOfTrailingZeros(b);
		}
		
		return a<<Math.min(ashift, bshift);
	}
	
	void fall(int c, int[] rep, int[] b, int[] a, int S)
	{
		if(rep[c] != 0){
			for(int i = S*c;i < S*c+S && i < a.length;i++){
				a[i] = rep[c];
			}
			rep[c] = 0;
			b[c] = 0;
			return;
		}
		if(b[c] == 0)return;
		for(int i = S*c;i < S*c+S && i < a.length;i++){
			a[i] = gcd(a[i], b[c]);
		}
		b[c] = 0;
	}
	
	public static class SegmentTreeRGcdizeRUpdateRMaxQRSQ {
		public int M, H, N;
		public int[] maxs;
		public long[] sums;
		public long[] lcms;
		public int[] covers;
		private long I = Long.MAX_VALUE / 8;
		
		public SegmentTreeRGcdizeRUpdateRMaxQRSQ(int[] a)
		{
			N = a.length;
			M = Integer.highestOneBit(Math.max(N-1, 1))<<2;
			H = M>>>1;
			
			maxs = new int[M];
			sums = new long[M];
			lcms = new long[M];
			covers = new int[M];
			for(int i = 0;i < N;i++){
				sums[H+i] = lcms[H+i] = maxs[H+i] = covers[H+i] = a[i];
			}
			for(int i = H-1;i >= 1;i--)propagate(i);
		}
		
		private void propagate(int cur)
		{
			if(cur >= H){
				lcms[cur] = sums[cur] = maxs[cur] = covers[cur];
			}else{
				int L = 2*cur, R = 2*cur+1;
				if(covers[cur] == 0){
					lcms[cur] = lcm(lcms[L], lcms[R]);
					maxs[cur] = Math.max(maxs[L], maxs[R]);
					sums[cur] = sums[L] + sums[R];
				}else{
					int len = H/Integer.highestOneBit(cur);
					lcms[cur] = covers[cur];
					maxs[cur] = covers[cur];
					sums[cur] = covers[cur] * len;
				}
			}
		}
		
		private long lcm(long a, long b)
		{
			if(a >= I || b >= I)return I;
			if(a == 0)return b;
			if(b == 0)return a;
			long ad = a / gcd(a, b);
			if((double)ad * b >= I)return I;
			return ad*b;
		}
		
		public static long gcd(long a, long b) {
			while (b > 0) {
				long c = a;
				a = b;
				b = c % b;
			}
			return a;
		}
		
		public static int gcd(int a, int b) {
			while (b > 0) {
				int c = a;
				a = b;
				b = c % b;
			}
			return a;
		}
		
		public void gcdize(int l, int r, int v) {
			gcdize(l, r, v, 0, H, 1);
		}
		
		void push(int cur)
		{
			if(cur < H && covers[cur] != 0){
				// push
				for(int i = 2*cur;i <= 2*cur+1;i++){
					covers[i] = covers[cur];
					propagate(i);
				}
				covers[cur] = 0;
			}
		}
		
		boolean allsame(int cur)
		{
			return maxs[cur] * (H/Integer.highestOneBit(cur)) == sums[cur];
		}
		
		protected void gcdize(int l, int r, int v, int cl, int cr, int cur)
		{
			if(v % lcms[cur] == 0){
				// not need to dig further
				return;
			}
			if(l <= cl && cr <= r){
				if(allsame(cur)){
					// all nodes have same value
					update(l, r, gcd(v, maxs[cur]), cl, cr, cur);
					return;
				}
			}
			push(cur);
			
			int mid = cl+cr>>>1;
			if(cl < r && l < mid)gcdize(l, r, v, cl, mid, 2*cur);
			if(mid < r && l < cr)gcdize(l, r, v, mid, cr, 2*cur+1);
			propagate(cur);
		}
		
		public void update(int l, int r, int v) {
			update(l, r, v, 0, H, 1);
		}
		
		protected void update(int l, int r, int v, int cl, int cr, int cur)
		{
			if(l <= cl && cr <= r){
				covers[cur] = v;
				propagate(cur);
				return;
			}
			
			push(cur);
			int mid = cl+cr>>>1;
			if(cl < r && l < mid)update(l, r, v, cl, mid, 2*cur);
			if(mid < r && l < cr)update(l, r, v, mid, cr, 2*cur+1);
			propagate(cur);
		}
		
		public long sum(int l, int r) {
			return sum(l, r, 0, H, 1);
		}
		
		protected long sum(int l, int r, int cl, int cr, int cur)
		{
			if(l <= cl && cr <= r){
				return sums[cur];
			}
			
			push(cur);
			
			long ret = 0;
			int mid = cl+cr>>>1;
			if(cl < r && l < mid)ret += sum(l, r, cl, mid, 2*cur);
			if(mid < r && l < cr)ret += sum(l, r, mid, cr, 2*cur+1);
			return ret;
		}
		
		public int max(int l, int r) {
			return max(l, r, 0, H, 1);
		}
		
		protected int max(int l, int r, int cl, int cr, int cur)
		{
			if(l <= cl && cr <= r){
				return maxs[cur];
			}
			
			push(cur);
			
			int ret = 0;
			int mid = cl+cr>>>1;
			if(cl < r && l < mid)ret = Math.max(ret, max(l, r, cl, mid, 2*cur));
			if(mid < r && l < cr)ret = Math.max(ret, max(l, r, mid, cr, 2*cur+1));
			return ret;
		}
	}
	
	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");
	}
	
	public static void main(String[] args) throws Exception { new D3().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 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[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private int ni()
	{
		int num = 0, 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 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)); }
}
0