結果

問題 No.801 エレベーター
ユーザー fgwiebfaoish
提出日時 2020-03-19 22:43:01
言語 C#(csc)
(csc 3.9.0)
結果
TLE  
実行時間 -
コード長 6,016 bytes
コンパイル時間 2,214 ms
コンパイル使用メモリ 114,732 KB
実行使用メモリ 49,312 KB
最終ジャッジ日時 2024-12-14 03:37:34
合計ジャッジ時間 53,238 ms
ジャッジサーバーID
(参考情報)
judge5 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 10 TLE * 16
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff #
プレゼンテーションモードにする

using System;
using System.Collections.Generic;
using System.Collections;
using System.Collections.Specialized;
using System.Linq;
using System.Text;
using System.IO;
using System.Reflection;
using static System.Math;
using System.Numerics;
static class Program{
const int mod=(int)1e9+7;
const double eps=1e-11;
static void Main(){
Sc sc=new Sc();
var s=sc.Ia;
var h=sc.Arr(s[1],()=>sc.Ia);
St st=new St(s[0]+1);
st.Ud3(1,1,1);
var p=new long[s[1]];
for(int i = 0;i<s[2];i++) {
for(int j = 0;j<s[1];j++) {p[j]=st.Get(h[j][0],h[j][1]);}
st.Ud3(1,s[0],0);
for(int j = 0;j<s[1];j++) {st.Ud2(h[j][0],h[j][1],p[j]);}
}
Console.WriteLine("{0}",st.Get(s[0],s[0]));
}
}
public class St{
public Mint[] dat,dat2,dat3;
private bool[] bo3;
private int m=1,cnt=0;
public St(int n){
while(m<n){m<<=1;}
cnt=m+n-1;
dat=new Mint[cnt];
dat2=new Mint[cnt+1];
dat3=new Mint[cnt+1];
bo3=new bool[cnt];
}
private Mint Fdg(int a,int b,int k,int l,int r){
if(k>=cnt){return 0;}
if(bo3[k]){
dat[k]=dat3[k];
if(2*k+1<cnt){dat3[2*k+1]=dat3[k]/2;bo3[2*k+1]=true;dat2[2*k+1]=0;}
if(2*k+2<cnt){dat3[2*k+2]=dat3[k]/2;bo3[2*k+2]=true;dat2[2*k+2]=0;}
bo3[k]=false;
}
if((long)dat2[k]!=0){
dat[k]+=dat2[k];
if(2*k+1<cnt){dat2[2*k+1]+=dat2[k]/2;}
if(2*k+2<cnt){dat2[2*k+2]+=dat2[k]/2;}
dat2[k]=0;
}
if(r<a||b<l){return 0;}
if(a<=l&&r<=b){return dat[k];}
else{return Fdg(a,b,k*2+1,l,(l+r)>>1)+Fdg(a,b,k*2+2,(l+r+1)>>1,r);}
}
public long Get(int a,int b){return (long)Fdg(a,b,0,0,m-1);}
public void Ud2(int a,int b,long d){Hn(a,b,0,0,m-1,d*m);}
private long Hn(int a,int b,int k,int l,int r,long d){
if(a<=l&&r<=b){dat2[k]+=d;return d;}
else if(r>=a&&b>=l){
if(bo3[k]){
dat[k]=dat3[k];
if(2*k+1<cnt){dat3[2*k+1]=dat3[k]/2;bo3[2*k+1]=true;dat2[2*k+1]=0;}
if(2*k+2<cnt){dat3[2*k+2]=dat3[k]/2;bo3[2*k+2]=true;dat2[2*k+2]=0;}
bo3[k]=false;
}
long q=Hn(a,b,k*2+1,l,(l+r)>>1,d>>1)+Hn(a,b,k*2+2,(l+r+1)>>1,r,d>>1);
dat[k]+=q;
return q;
}
return 0;
}
public void Ud3(int a,int b,long d){Hn3(a,b,0,0,m-1,d*m);}
private Mint Hn3(int a,int b,int k,int l,int r,long d){
if(k>=cnt){return 0;}
if(a<=l&&r<=b){dat3[k]=d;dat2[k]=0;bo3[k]=true;return d;}
if(bo3[k]){
dat[k]=dat3[k];
if(2*k+1<cnt){dat3[2*k+1]=dat3[k]/2;bo3[2*k+1]=true;dat2[2*k+1]=0;}
if(2*k+2<cnt){dat3[2*k+2]=dat3[k]/2;bo3[2*k+2]=true;dat2[2*k+2]=0;}
bo3[k]=false;
}
if(r>=a&&b>=l){
if((long)dat2[k]!=0){
if(2*k+1<cnt){dat2[2*k+1]+=dat2[k]/2;}
if(2*k+2<cnt){dat2[2*k+2]+=dat2[k]/2;}
dat2[k]=0;
}
dat[k]=Hn3(a,b,k*2+1,l,(l+r)>>1,d>>1)+Hn3(a,b,k*2+2,(l+r+1)>>1,r,d>>1);
return dat[k];
}
return dat[k]+dat2[k];
}
}
public struct Mint{
const int mod=(int)1e9+7;
private long d;
public Mint(long d){this.d=d;}
public static implicit operator Mint(long d){return new Mint(d%mod);}
public static explicit operator long(Mint d){return d.d;}
public override string ToString(){return d.ToString();}
public static Mint operator+(Mint a,long b){a.d=(a.d+b)%mod;return a;}
public static Mint operator+(Mint a,Mint b){a.d=(a.d+b.d)%mod;return a;}
public static Mint operator-(Mint a,long b){a.d=(mod+a.d-b)%mod;return a;}
public static Mint operator-(Mint a,Mint b){a.d=(mod+a.d-b.d)%mod;return a;}
public static Mint operator*(Mint a,long b){a.d=(a.d*b)%mod;return a;}
public static Mint operator*(Mint a,Mint b){a.d=(a.d*b.d)%mod;return a;}
public static Mint operator/(Mint a,long b){a.d=(a.d*Mi(b))%mod;return a;}
public static Mint operator/(Mint a,Mint b){a.d=(a.d*Mi(b.d))%mod;return a;}
private static long Mi(long a){
a=(a+mod)%mod;
long b=mod,u=1,v=0;
while(b>0){
long t=a/b;
a-=t*b;a^=b;b^=a;a^=b;
u-=t*v;u^=v;v^=u;u^=v;
}
u%=mod;
if(u<0){u+=mod;}
return u%mod;
}
}
public class Sc{
public int I{get{return int.Parse(Console.ReadLine());}}
public long L{get{return long.Parse(Console.ReadLine());}}
public double D{get{return double.Parse(Console.ReadLine());}}
public string S{get{return Console.ReadLine();}}
public int[] Ia{get{return Array.ConvertAll(Console.ReadLine().Split(),int.Parse);}}
public long[] La{get{return Array.ConvertAll(Console.ReadLine().Split(),long.Parse);}}
public double[] Da{get{return Array.ConvertAll(Console.ReadLine().Split(),double.Parse);}}
public string[] Sa{get{return Console.ReadLine().Split();}}
public object[] Oa{get{return Console.ReadLine().Split();}}
public int[] Ia2{get{return Array.ConvertAll(("0 "+Console.ReadLine()+" 0").Split(),int.Parse);}}
public int[] Ia3(int a){return Array.ConvertAll((a.ToString()+" "+Console.ReadLine()).Split(),int.Parse);}
public int[] Ia3(bool a,int b,bool c,int d){return Array.ConvertAll(((a?b.ToString()+" ":"")+Console.ReadLine()+(c?" "+d.ToString():"")).Split
        (),int.Parse);}
public long[] La2{get{return Array.ConvertAll(("0 "+Console.ReadLine()+" 0").Split(),long.Parse);}}
public long[] La3(int a){return Array.ConvertAll((a.ToString()+" "+Console.ReadLine()).Split(),long.Parse);}
public long[] La3(bool a,int b,bool c,int d){return Array.ConvertAll(((a?b.ToString()+" ":"")+Console.ReadLine()+(c?" "+d.ToString():"")).Split
        (),long.Parse);}
public double[] Da2{get{return Array.ConvertAll(("0 "+Console.ReadLine()+" 0").Split(),double.Parse);}}
public double[] Da3(int a){return Array.ConvertAll((a.ToString()+" "+Console.ReadLine()).Split(),double.Parse);}
public double[] Da3(bool a,int b,bool c,int d){return Array.ConvertAll(((a?b.ToString()+" ":"")+Console.ReadLine()+(c?" "+d.ToString():"")).Split
        (),double.Parse);}
public T[] Arr<T>(int n,Func<T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f();}return a;}
public T[] Arr<T>(int n,Func<int,T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f(i);}return a;}
public T[] Arr<T>(int n,Func<string[],T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f(Console.ReadLine().Split());}return a;}
public T[] Arr<T>(int n,Func<int,string[],T> f){var a=new T[n];for(int i=0;i<n;i++){a[i]=f(i,Console.ReadLine().Split());}return a;}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0