oj.uz

답안 #134306

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
134306 2019-07-22T11:56:39 Z sebinkim Fibonacci representations (CEOI18_fib) C++14
100 / 100
 584 ms 80512 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair <ll, ll> pll;

const ll mod = 1e9 + 7;

struct matrix{
	ll aa, ab, ba, bb;
	
	matrix() : aa(1), ab(0), ba(0), bb(1) {}
	matrix(ll aa, ll ab, ll ba, ll bb) : 
		aa(aa), ab(ab), ba(ba), bb(bb) {}
	matrix(ll x, ll d)
	{
		aa = x / 2 % mod; ab = (x - 1) / 2 % mod;
		ba = (aa * (d - 1) + 1) % mod;
		bb = (ab * (d - 1) + 1) % mod;
	}
	
	matrix operator * (matrix m)
	{
		return matrix((aa * m.aa + ab * m.ba) % mod, (aa * m.ab + ab * m.bb) % mod,
			(ba * m.aa + bb * m.ba) % mod, (ba * m.ab + bb * m.bb) % mod);
	}
};

struct node{
	ll d, l, r; matrix m;
	node() : d(0) {}
	node(pll p) : d((p.second - p.first) / 2), l(p.first + 1), r(p.second - 1) {}
};

node operator + (node na, node nb)
{
	if(!na.d) return nb;
	if(!nb.d) return na;
	
	node ret = na; ret.r = nb.r;
	matrix m(nb.l - na.r, nb.d);
	ret.m = nb.m * m * na.m;
	
	return ret;
}

struct segtree{
	node T[1101010];
	ll sz = 1 << 19;
	
	void update(ll p, pll v)
	{
		p += sz;
		if(T[p].d) T[p] = node();
		else T[p] = node(v);
		for(p>>=1; p; p>>=1){
			T[p] = T[p << 1] + T[p << 1 | 1];
		}
	}
	
	ll getans()
	{
		matrix m = T[1].m * matrix(T[1].l, T[1].d);
		return (m.ab + m.bb) % mod;
	}
};

segtree T;
set <pll> S;
vector <pll> X[101010];
vector <ll> Z;
ll n;

void insert(ll t, pll p)
{
	Z.push_back(p.first);
	X[t].push_back(p);
	S.insert(p);
}

void erase(ll t, set <pll>::iterator it)
{
	X[t].push_back(*it);
	S.erase(it);
}

void addval(ll t, ll x)
{
	auto it = S.lower_bound(pll(x, 2e9));
	if(it == S.begin() || prev(it) -> second < x){
		pll p(x - 1, x + 1);
		if(it != S.begin() && prev(it) -> second + 1 == x){
			p.first = prev(it) -> first; erase(t, prev(it));
		}
		it = S.lower_bound(pll(x, 2e9));
		if(it != S.end() && x + 1 == it -> first){
			p.second = it -> second; erase(t, it);
		}
		insert(t, p);
	}
	else{
		it = prev(it);
		if(it -> second - x & 1){
			pll p(it -> first + 1, x);
			ll x1 = it -> first - 1, x2 = it -> second;
			erase(t, it); if(p.first < p.second) insert(t, p);
			if(x1 >= 0) addval(t, max(x1, 1ll)); addval(t, x2);
		}
		else{
			pll p(it -> first, min(it -> second - 2, x));
			x = max(it -> second, x + 1);
			erase(t, it); if(p.first < p.second) insert(t, p);
			addval(t, x);	
		}
	}
}

int main()
{
	ll i, x;
	
	scanf("%lld", &n);
	
	for(i=0; i<n; i++){
		scanf("%lld", &x);
		addval(i, x);
	}
	
	sort(Z.begin(), Z.end());
	Z.erase(unique(Z.begin(), Z.end()), Z.end());
	
	for(i=0; i<n; i++){
		for(pll &t: X[i]){
			x = lower_bound(Z.begin(), Z.end(), t.first) - Z.begin();
			T.update(x, t);
		}
		printf("%lld\n", T.getans());
	}
	
	return 0;
}

Compilation message

fib.cpp: In function 'void addval(ll, ll)':
fib.cpp:104:19: warning: suggest parentheses around '-' in operand of '&' [-Wparentheses]
   if(it -> second - x & 1){
      ~~~~~~~~~~~~~^~~
fib.cpp:108:4: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
    if(x1 >= 0) addval(t, max(x1, 1ll)); addval(t, x2);
    ^~
fib.cpp:108:41: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
    if(x1 >= 0) addval(t, max(x1, 1ll)); addval(t, x2);
                                         ^~~~~~
fib.cpp: In function 'int main()':
fib.cpp:123:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld", &n);
  ~~~~~^~~~~~~~~~~~
fib.cpp:126:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld", &x);
   ~~~~~^~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 63096 KB Output is correct
2 Correct 51 ms 62968 KB Output is correct
3 Correct 51 ms 62968 KB Output is correct
4 Correct 53 ms 63096 KB Output is correct
5 Correct 59 ms 63096 KB Output is correct
6 Correct 51 ms 62968 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 63096 KB Output is correct
2 Correct 51 ms 62968 KB Output is correct
3 Correct 51 ms 62968 KB Output is correct
4 Correct 53 ms 63096 KB Output is correct
5 Correct 59 ms 63096 KB Output is correct
6 Correct 51 ms 62968 KB Output is correct
7 Correct 52 ms 63096 KB Output is correct
8 Correct 52 ms 63096 KB Output is correct
9 Correct 52 ms 63080 KB Output is correct
10 Correct 52 ms 62972 KB Output is correct
11 Correct 60 ms 62968 KB Output is correct
12 Correct 52 ms 63096 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 63064 KB Output is correct
2 Correct 51 ms 63060 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 63096 KB Output is correct
2 Correct 51 ms 62968 KB Output is correct
3 Correct 51 ms 62968 KB Output is correct
4 Correct 53 ms 63096 KB Output is correct
5 Correct 59 ms 63096 KB Output is correct
6 Correct 51 ms 62968 KB Output is correct
7 Correct 52 ms 63096 KB Output is correct
8 Correct 52 ms 63096 KB Output is correct
9 Correct 52 ms 63080 KB Output is correct
10 Correct 52 ms 62972 KB Output is correct
11 Correct 60 ms 62968 KB Output is correct
12 Correct 52 ms 63096 KB Output is correct
13 Correct 51 ms 63064 KB Output is correct
14 Correct 51 ms 63060 KB Output is correct
15 Correct 55 ms 63116 KB Output is correct
16 Correct 56 ms 63148 KB Output is correct
17 Correct 52 ms 63096 KB Output is correct
18 Correct 51 ms 63096 KB Output is correct
19 Correct 51 ms 62968 KB Output is correct
20 Correct 52 ms 63024 KB Output is correct
21 Correct 52 ms 62968 KB Output is correct
22 Correct 52 ms 62968 KB Output is correct
23 Correct 52 ms 62968 KB Output is correct

Subtask #5
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 63096 KB Output is correct
2 Correct 392 ms 74220 KB Output is correct
3 Correct 370 ms 73316 KB Output is correct

Subtask #6
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 51 ms 63096 KB Output is correct
2 Correct 51 ms 62968 KB Output is correct
3 Correct 51 ms 62968 KB Output is correct
4 Correct 53 ms 63096 KB Output is correct
5 Correct 59 ms 63096 KB Output is correct
6 Correct 51 ms 62968 KB Output is correct
7 Correct 52 ms 63096 KB Output is correct
8 Correct 52 ms 63096 KB Output is correct
9 Correct 52 ms 63080 KB Output is correct
10 Correct 52 ms 62972 KB Output is correct
11 Correct 60 ms 62968 KB Output is correct
12 Correct 52 ms 63096 KB Output is correct
13 Correct 51 ms 63064 KB Output is correct
14 Correct 51 ms 63060 KB Output is correct
15 Correct 55 ms 63116 KB Output is correct
16 Correct 56 ms 63148 KB Output is correct
17 Correct 52 ms 63096 KB Output is correct
18 Correct 51 ms 63096 KB Output is correct
19 Correct 51 ms 62968 KB Output is correct
20 Correct 52 ms 63024 KB Output is correct
21 Correct 52 ms 62968 KB Output is correct
22 Correct 52 ms 62968 KB Output is correct
23 Correct 52 ms 62968 KB Output is correct
24 Correct 52 ms 63096 KB Output is correct
25 Correct 392 ms 74220 KB Output is correct
26 Correct 370 ms 73316 KB Output is correct
27 Correct 122 ms 66460 KB Output is correct
28 Correct 185 ms 68580 KB Output is correct
29 Correct 145 ms 67312 KB Output is correct
30 Correct 188 ms 68508 KB Output is correct
31 Correct 272 ms 71676 KB Output is correct
32 Correct 245 ms 69852 KB Output is correct
33 Correct 299 ms 71612 KB Output is correct
34 Correct 246 ms 71908 KB Output is correct
35 Correct 325 ms 71148 KB Output is correct
36 Correct 357 ms 71528 KB Output is correct
37 Correct 316 ms 71136 KB Output is correct
38 Correct 350 ms 74352 KB Output is correct
39 Correct 190 ms 69224 KB Output is correct
40 Correct 256 ms 71672 KB Output is correct
41 Correct 432 ms 72956 KB Output is correct
42 Correct 357 ms 74172 KB Output is correct
43 Correct 287 ms 72932 KB Output is correct
44 Correct 396 ms 80476 KB Output is correct
45 Correct 584 ms 79948 KB Output is correct
46 Correct 435 ms 80512 KB Output is correct
47 Correct 500 ms 76748 KB Output is correct
48 Correct 523 ms 80480 KB Output is correct
49 Correct 581 ms 79844 KB Output is correct
50 Correct 411 ms 74856 KB Output is correct