結果

問題 No.801 エレベーター
ユーザー fgwiebfaoish
提出日時 2020-03-19 22:48:57
言語 C#(csc)
(csc 3.9.0)
結果
TLE  
実行時間 -
コード長 4,827 bytes
コンパイル時間 4,331 ms
コンパイル使用メモリ 116,712 KB
実行使用メモリ 70,636 KB
最終ジャッジ日時 2024-12-14 03:38:29
合計ジャッジ時間 51,794 ms
ジャッジサーバーID
(参考情報)
judge4 / 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);
Bit2 bit=new Bit2(s[0]);
bit.Ud(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]=bit.Get(h[j][0],h[j][1]);}
bit=new Bit2(s[0]);
for(int j = 0;j<s[1];j++) {bit.Ud(h[j][0],h[j][1],p[j]);}
}
Console.WriteLine("{0}",bit.Get(s[0],s[0]));
}
}
public class Bit2{
private int n;
private Bit bit1,bit2;
public Bit2(int n){
this.n=n;
bit1=new Bit(n);
bit2=new Bit(n);
}
public void Ud(int l,int r,long p){
bit1.Ud(l,-p*(l-1));
bit2.Ud(l,p);
bit1.Ud(r+1,p*r);
bit2.Ud(r+1,-p);
}
public long Get(int l,int r){return (long)(bit2.Get(r)*r+bit1.Get(r)-bit2.Get(l-1)*(l-1)-bit1.Get(l-1));}
}
public class Bit{
private int n;
private Mint[] bit;
public Bit(int n){
this.n=n;
bit=new Mint[n+1];
}
public void Ud(int a,long p){while(a<=n){bit[a]+=p;a+=a&-a;}}
public Mint Get(int n){
Mint a=0;
while(n>0){a+=bit[n];n-=n&-n;}
return a;
}
public Mint Get2(int m,int n){
Mint a=0,b=0;
m--;
while(n>m){a+=bit[n];n-=n&-n;}
if(n==m){return a;}
while(n!=m){b+=bit[m];m-=m&-m;}
return a-b;
}
public void Clear(){bit=new Mint[n+1];}
}
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