oj.uz

Submission #20865

# Submission time Handle Problem Language Result Execution time Memory
20865 2017-02-27T01:47:46 Z sgc109 초음속철도 (OJUZ11_rail) C++11
100 / 100
 819 ms 45020 KB 
#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=a;i<=b;++i)
#define FOR(i,n) for(int i=0;i<n;++i)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define sz(v) ((int)(v).size())
#define inp1(a) scanf("%d",&a)
#define inp2(a,b) scanf("%d%d",&a,&b)
#define inp3(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define inp4(a,b,c,d) scanf("%d%d%d%d",&a,&b,&c,&d)
#define inp5(a,b,c,d,e) scanf("%d%d%d%d%d",&a,&b,&c,&d,&e)z
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef vector<pii> vii;
typedef vector<pll> vll;
typedef vector<vector<int> > vvi;
typedef pair<int,pair<int,int> > piii;
typedef vector<piii> viii;
const int MOD = 1000000007;
const int INF = 0x3c3c3c3c;
const long long INFL = 0x3c3c3c3c3c3c3c3c;
const int MAX_N = 102;

struct Range{
	int l,r;
	bool operator<(Range& rhs){
		return l<rhs.l;
	}
};
int N,M,a,b,E;
Range ranges[200003];
ll dp[1610003];
int lz[1610003];
ll poww[500000];
ll pow2(ll x, int n){
	if(!n) return 1;
	if(n%2) {
		ll& cache = poww[(n-1)/2];
		if(cache==-1) cache = pow2(x,(n-1)/2);
		return x*cache%MOD*cache%MOD;
	}
	ll& cache = poww[n/2];
	if(cache==-1) cache = pow2(x,n/2);
	return cache*cache%MOD;
}
unordered_set<int> us;
ll query(int nl, int nr, int l, int r, int nd){
	if(lz[nd]) (dp[nd]*=poww[lz[nd]])%=MOD,(nl!=nr?lz[2*nd]+=lz[nd],lz[2*nd+1]+=lz[nd]:0),lz[nd]=0;
	if(l<=nl&&nr<=r) return dp[nd];
	if(r<nl||nr<l) return 0;
	return (query(nl,(nl+nr)/2,l,r,2*nd)+query((nl+nr)/2+1,nr,l,r,2*nd+1))%MOD;
} ll query(int l, int r){return query(0,E,l,r,1);}

void update(int nl, int nr, int l, int r, int nd){
	if(lz[nd]) (dp[nd]*=poww[lz[nd]])%=MOD,(nl!=nr?lz[2*nd]+=lz[nd],lz[2*nd+1]+=lz[nd]:0),lz[nd]=0;
	if(l<=nl&&nr<=r) {(dp[nd]*=2)%=MOD,(nl!=nr?lz[2*nd]++,lz[2*nd+1]++:0);return;}
	if(r<nl||nr<l) return;
	update(nl,(nl+nr)/2,l,r,2*nd),update((nl+nr)/2+1,nr,l,r,2*nd+1),dp[nd]=(dp[2*nd]+dp[2*nd+1])%MOD;
} void update(int l, int r){update(0,E,l,r,1);}

void pUpdate(int nl, int nr, int nd, int pos, ll val){
	if(lz[nd]) (dp[nd]*=poww[lz[nd]])%=MOD,(nl!=nr?lz[2*nd]+=lz[nd],lz[2*nd+1]+=lz[nd]:0),lz[nd]=0;
	if(nl==nr&&nl==pos) {dp[nd]=val;return;}
	if(nr<pos||pos<nl) return;
	pUpdate(nl,(nl+nr)/2,2*nd,pos,val),pUpdate((nl+nr)/2+1,nr,2*nd+1,pos,val),dp[nd]=(dp[2*nd]+dp[2*nd+1])%MOD;
} void pUpdate(int pos, ll val){pUpdate(0,E,1,pos,val);}

int main() {
	vi sorted;
	inp2(N,M);
	us.insert(1),sorted.pb(1);
	us.insert(N),sorted.pb(N);
	FOR(i,M){
		inp2(a,b);
		ranges[i]=Range{a,b};
		if(!us.count(a)) us.insert(a),sorted.pb(a);
		if(!us.count(b)) us.insert(b),sorted.pb(b);
	}
	sort(all(sorted));
	E=sz(sorted)-1;
	FOR(i,M) {
		ranges[i].l=lower_bound(all(sorted),ranges[i].l)-sorted.begin();
		ranges[i].r=lower_bound(all(sorted),ranges[i].r)-sorted.begin();
	}
	sort(ranges,ranges+M);
	// 좌표압축 + 정렬까지 완료
	memset(poww,-1,sizeof(poww));
	FOR(i,500000) if(poww[i]==-1) poww[i]=pow2(2,i);
	pUpdate(0,1);
	FOR(i,M){
		pUpdate(ranges[i].r,(query(ranges[i].l,ranges[i].r)+query(ranges[i].r,ranges[i].r))%MOD);
		update(ranges[i].r+1,E);
	}
	printf("%lld",query(E,E));
	return 0;
}

Compilation message

rail.cpp: In function 'int main()':
rail.cpp:74:11: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  inp2(N,M);
           ^
rail.cpp:78:12: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   inp2(a,b);
            ^

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 26368 KB Output is correct
2 Correct 6 ms 26368 KB Output is correct
3 Correct 3 ms 26368 KB Output is correct
4 Correct 3 ms 26368 KB Output is correct
5 Correct 3 ms 26368 KB Output is correct
6 Correct 3 ms 26368 KB Output is correct
7 Correct 3 ms 26368 KB Output is correct
8 Correct 3 ms 26368 KB Output is correct
9 Correct 3 ms 26368 KB Output is correct
10 Correct 3 ms 26368 KB Output is correct
11 Correct 3 ms 26368 KB Output is correct
12 Correct 3 ms 26368 KB Output is correct
13 Correct 3 ms 26368 KB Output is correct
14 Correct 3 ms 26368 KB Output is correct
15 Correct 3 ms 26368 KB Output is correct
16 Correct 3 ms 26368 KB Output is correct
17 Correct 3 ms 26368 KB Output is correct
18 Correct 3 ms 26368 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 26368 KB Output is correct
2 Correct 6 ms 26368 KB Output is correct
3 Correct 3 ms 26368 KB Output is correct
4 Correct 3 ms 26368 KB Output is correct
5 Correct 3 ms 26368 KB Output is correct
6 Correct 3 ms 26368 KB Output is correct
7 Correct 3 ms 26368 KB Output is correct
8 Correct 3 ms 26368 KB Output is correct
9 Correct 3 ms 26368 KB Output is correct
10 Correct 3 ms 26368 KB Output is correct
11 Correct 3 ms 26368 KB Output is correct
12 Correct 3 ms 26368 KB Output is correct
13 Correct 3 ms 26368 KB Output is correct
14 Correct 3 ms 26368 KB Output is correct
15 Correct 3 ms 26368 KB Output is correct
16 Correct 3 ms 26368 KB Output is correct
17 Correct 3 ms 26368 KB Output is correct
18 Correct 3 ms 26368 KB Output is correct
19 Correct 3 ms 26368 KB Output is correct
20 Correct 3 ms 26368 KB Output is correct
21 Correct 3 ms 26368 KB Output is correct
22 Correct 3 ms 26368 KB Output is correct
23 Correct 3 ms 26368 KB Output is correct
24 Correct 3 ms 26368 KB Output is correct
25 Correct 3 ms 26368 KB Output is correct
26 Correct 3 ms 26368 KB Output is correct
27 Correct 3 ms 26368 KB Output is correct
28 Correct 3 ms 26368 KB Output is correct
29 Correct 3 ms 26368 KB Output is correct
30 Correct 3 ms 26368 KB Output is correct
31 Correct 3 ms 26368 KB Output is correct
32 Correct 3 ms 26368 KB Output is correct
33 Correct 6 ms 26368 KB Output is correct
34 Correct 6 ms 26368 KB Output is correct
35 Correct 3 ms 26368 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 26368 KB Output is correct
2 Correct 3 ms 26368 KB Output is correct
3 Correct 3 ms 26368 KB Output is correct
4 Correct 9 ms 26504 KB Output is correct
5 Correct 289 ms 28824 KB Output is correct
6 Correct 626 ms 43964 KB Output is correct
7 Correct 559 ms 43832 KB Output is correct
8 Correct 3 ms 26368 KB Output is correct
9 Correct 553 ms 43040 KB Output is correct
10 Correct 583 ms 43700 KB Output is correct
11 Correct 169 ms 28296 KB Output is correct
12 Correct 589 ms 43964 KB Output is correct
13 Correct 609 ms 43700 KB Output is correct
14 Correct 79 ms 26368 KB Output is correct
15 Correct 469 ms 35728 KB Output is correct
16 Correct 76 ms 26368 KB Output is correct
17 Correct 606 ms 43964 KB Output is correct
18 Correct 606 ms 43964 KB Output is correct
19 Correct 593 ms 42380 KB Output is correct

Subtask #4
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 26368 KB Output is correct
2 Correct 6 ms 26368 KB Output is correct
3 Correct 3 ms 26368 KB Output is correct
4 Correct 3 ms 26368 KB Output is correct
5 Correct 3 ms 26368 KB Output is correct
6 Correct 3 ms 26368 KB Output is correct
7 Correct 3 ms 26368 KB Output is correct
8 Correct 3 ms 26368 KB Output is correct
9 Correct 3 ms 26368 KB Output is correct
10 Correct 3 ms 26368 KB Output is correct
11 Correct 3 ms 26368 KB Output is correct
12 Correct 3 ms 26368 KB Output is correct
13 Correct 3 ms 26368 KB Output is correct
14 Correct 3 ms 26368 KB Output is correct
15 Correct 3 ms 26368 KB Output is correct
16 Correct 3 ms 26368 KB Output is correct
17 Correct 3 ms 26368 KB Output is correct
18 Correct 3 ms 26368 KB Output is correct
19 Correct 3 ms 26368 KB Output is correct
20 Correct 3 ms 26368 KB Output is correct
21 Correct 3 ms 26368 KB Output is correct
22 Correct 3 ms 26368 KB Output is correct
23 Correct 3 ms 26368 KB Output is correct
24 Correct 3 ms 26368 KB Output is correct
25 Correct 3 ms 26368 KB Output is correct
26 Correct 3 ms 26368 KB Output is correct
27 Correct 3 ms 26368 KB Output is correct
28 Correct 3 ms 26368 KB Output is correct
29 Correct 3 ms 26368 KB Output is correct
30 Correct 3 ms 26368 KB Output is correct
31 Correct 3 ms 26368 KB Output is correct
32 Correct 3 ms 26368 KB Output is correct
33 Correct 6 ms 26368 KB Output is correct
34 Correct 6 ms 26368 KB Output is correct
35 Correct 3 ms 26368 KB Output is correct
36 Correct 13 ms 26888 KB Output is correct
37 Correct 13 ms 26888 KB Output is correct
38 Correct 9 ms 26504 KB Output is correct
39 Correct 6 ms 26368 KB Output is correct
40 Correct 13 ms 26664 KB Output is correct
41 Correct 19 ms 26888 KB Output is correct
42 Correct 16 ms 26888 KB Output is correct
43 Correct 3 ms 26368 KB Output is correct
44 Correct 13 ms 26664 KB Output is correct
45 Correct 6 ms 26368 KB Output is correct
46 Correct 9 ms 26664 KB Output is correct
47 Correct 13 ms 26664 KB Output is correct
48 Correct 9 ms 26664 KB Output is correct
49 Correct 13 ms 26368 KB Output is correct
50 Correct 6 ms 26368 KB Output is correct
51 Correct 9 ms 26368 KB Output is correct
52 Correct 6 ms 26504 KB Output is correct
53 Correct 16 ms 26888 KB Output is correct
54 Correct 9 ms 26504 KB Output is correct
55 Correct 13 ms 26888 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 26368 KB Output is correct
2 Correct 6 ms 26368 KB Output is correct
3 Correct 3 ms 26368 KB Output is correct
4 Correct 3 ms 26368 KB Output is correct
5 Correct 3 ms 26368 KB Output is correct
6 Correct 3 ms 26368 KB Output is correct
7 Correct 3 ms 26368 KB Output is correct
8 Correct 3 ms 26368 KB Output is correct
9 Correct 3 ms 26368 KB Output is correct
10 Correct 3 ms 26368 KB Output is correct
11 Correct 3 ms 26368 KB Output is correct
12 Correct 3 ms 26368 KB Output is correct
13 Correct 3 ms 26368 KB Output is correct
14 Correct 3 ms 26368 KB Output is correct
15 Correct 3 ms 26368 KB Output is correct
16 Correct 3 ms 26368 KB Output is correct
17 Correct 3 ms 26368 KB Output is correct
18 Correct 3 ms 26368 KB Output is correct
19 Correct 3 ms 26368 KB Output is correct
20 Correct 3 ms 26368 KB Output is correct
21 Correct 3 ms 26368 KB Output is correct
22 Correct 3 ms 26368 KB Output is correct
23 Correct 3 ms 26368 KB Output is correct
24 Correct 3 ms 26368 KB Output is correct
25 Correct 3 ms 26368 KB Output is correct
26 Correct 3 ms 26368 KB Output is correct
27 Correct 3 ms 26368 KB Output is correct
28 Correct 3 ms 26368 KB Output is correct
29 Correct 3 ms 26368 KB Output is correct
30 Correct 3 ms 26368 KB Output is correct
31 Correct 3 ms 26368 KB Output is correct
32 Correct 3 ms 26368 KB Output is correct
33 Correct 6 ms 26368 KB Output is correct
34 Correct 6 ms 26368 KB Output is correct
35 Correct 3 ms 26368 KB Output is correct
36 Correct 3 ms 26368 KB Output is correct
37 Correct 3 ms 26368 KB Output is correct
38 Correct 3 ms 26368 KB Output is correct
39 Correct 9 ms 26504 KB Output is correct
40 Correct 289 ms 28824 KB Output is correct
41 Correct 626 ms 43964 KB Output is correct
42 Correct 559 ms 43832 KB Output is correct
43 Correct 3 ms 26368 KB Output is correct
44 Correct 553 ms 43040 KB Output is correct
45 Correct 583 ms 43700 KB Output is correct
46 Correct 169 ms 28296 KB Output is correct
47 Correct 589 ms 43964 KB Output is correct
48 Correct 609 ms 43700 KB Output is correct
49 Correct 79 ms 26368 KB Output is correct
50 Correct 469 ms 35728 KB Output is correct
51 Correct 76 ms 26368 KB Output is correct
52 Correct 606 ms 43964 KB Output is correct
53 Correct 606 ms 43964 KB Output is correct
54 Correct 593 ms 42380 KB Output is correct
55 Correct 13 ms 26888 KB Output is correct
56 Correct 13 ms 26888 KB Output is correct
57 Correct 9 ms 26504 KB Output is correct
58 Correct 6 ms 26368 KB Output is correct
59 Correct 13 ms 26664 KB Output is correct
60 Correct 19 ms 26888 KB Output is correct
61 Correct 16 ms 26888 KB Output is correct
62 Correct 3 ms 26368 KB Output is correct
63 Correct 13 ms 26664 KB Output is correct
64 Correct 6 ms 26368 KB Output is correct
65 Correct 9 ms 26664 KB Output is correct
66 Correct 13 ms 26664 KB Output is correct
67 Correct 9 ms 26664 KB Output is correct
68 Correct 13 ms 26368 KB Output is correct
69 Correct 6 ms 26368 KB Output is correct
70 Correct 9 ms 26368 KB Output is correct
71 Correct 6 ms 26504 KB Output is correct
72 Correct 16 ms 26888 KB Output is correct
73 Correct 9 ms 26504 KB Output is correct
74 Correct 13 ms 26888 KB Output is correct
75 Correct 813 ms 45020 KB Output is correct
76 Correct 463 ms 41512 KB Output is correct
77 Correct 273 ms 26504 KB Output is correct
78 Correct 73 ms 26368 KB Output is correct
79 Correct 429 ms 30240 KB Output is correct
80 Correct 813 ms 45020 KB Output is correct
81 Correct 13 ms 26664 KB Output is correct
82 Correct 739 ms 43568 KB Output is correct
83 Correct 96 ms 26368 KB Output is correct
84 Correct 636 ms 41852 KB Output is correct
85 Correct 533 ms 35596 KB Output is correct
86 Correct 559 ms 35728 KB Output is correct
87 Correct 166 ms 26368 KB Output is correct
88 Correct 149 ms 26368 KB Output is correct
89 Correct 733 ms 45020 KB Output is correct
90 Correct 776 ms 45020 KB Output is correct
91 Correct 759 ms 45020 KB Output is correct
92 Correct 726 ms 44624 KB Output is correct
93 Correct 593 ms 35596 KB Output is correct
94 Correct 729 ms 45020 KB Output is correct
95 Correct 819 ms 45020 KB Output is correct