oj.uz

Submission #129064

# Submission time Handle Problem Language Result Execution time Memory
129064 2019-07-11T14:18:25 Z gs14004 Fibonacci representations (CEOI18_fib) C++17
100 / 100
 1451 ms 110984 KB 
#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pi = pair<int, int>;
const int mod = 1e9 + 7;
const int MAXN = 200005;

struct mtrx{
	int a[2][2];
	mtrx operator*(const mtrx &m)const{
		mtrx ret;
		memset(ret.a, 0, sizeof(ret.a));
		for(int i=0; i<2; i++){
			for(int j=0; j<2; j++){
				for(int k=0; k<2; k++){
					ret.a[j][k] += 1ll * a[j][i] * m.a[i][k] % mod;
					if(ret.a[j][k] >= mod) ret.a[j][k] -= mod;
				}
			}
		}
		return ret;
	}
}E, pwr[MAXN];

mtrx num(int n){
	mtrx m;
	m.a[1][0] = m.a[1][1] = (n % 2 == 0);
	m.a[0][0] = (n + 1) / 2;
	m.a[0][1] = (n - 1) / 2;
	return m;
}

set<pi> s;

struct seg{
	vector<mtrx> tree;
	int lim;
	void init(int n){
		for(lim = 1; lim <= n; lim <<= 1);
		tree.resize(2 * lim);
		fill(tree.begin(), tree.end(), E);
	}
	void add(int x, mtrx v){
		x += lim;
		tree[x] = v;
		while(x > 1){
			x >>= 1;
			tree[x] = tree[2*x] * tree[2*x+1];
		}
	}
	mtrx query(){
		return tree[1];
	}
}seg;

struct seq{
	int type; 
	int pos;
	mtrx m;
};

vector<seq> instr;
vector<int> vect;

void batch(){
	sort(vect.begin(), vect.end());
	vect.resize(unique(vect.begin(), vect.end()) - vect.begin());
	seg.init(vect.size());
	for(auto &i : instr){
		if(i.type == 2){
			printf("%d\n", seg.query().a[0][0]);
		}
		else{
			int pos = lower_bound(vect.begin(), vect.end(), i.pos) - vect.begin();
			seg.add(pos, i.m);
		}
	}
}

int query(){
	instr.push_back({2, -1, E});
}

void add_query(int pos, mtrx m){
	vect.push_back(pos);
	instr.push_back({1, pos, m});
}

void rem_query(int pos){
	instr.push_back({1, pos, E});
}

void add(int x){ 
	if(x == 0) x = 1;
	if(x == -1) return;
	auto ins = [](pi x){
		auto itr = s.lower_bound(x);
		int pos = 0;
		if(itr != s.begin()) pos = prev(itr)->second;
		if(itr != s.end()) rem_query(pos);
		s.insert(x);
		add_query(pos, num(x.first - pos));
		if(x.first != x.second) add_query(x.first, pwr[(x.second - x.first) / 2]);
		itr = s.upper_bound(x);
		if(itr != s.end()){
			add_query(x.second, num(itr->first - x.second));
		}
	};
	auto rem = [](pi x){
		if(x.first != x.second) rem_query(x.first);
		auto itr = s.lower_bound(x);
		int pos = 0;
		if(itr != s.begin()) pos = prev(itr)->second;
		if(next(itr) != s.end()) rem_query(x.second);
		rem_query(pos);
		s.erase(x);
		itr = s.lower_bound(x);
		if(itr != s.end()){
			add_query(pos, num(itr->first - pos));
		}
	};
	auto it = s.upper_bound(pi(x + 1, -1));
	if(it != s.begin() && prev(it)->second >= x){
		auto intv = *--it;
		rem(intv);
		if(intv.first % 2 == x % 2){
			add(intv.second + 1);
			intv.second = x - 2;
			if(intv.first <= intv.second){
				auto l = s.lower_bound(pi(intv.second + 3, -1));
				auto nxt = pi(intv.first + 1, intv.second + 1);
				if(l != s.end() && l->first == intv.second + 3){
					nxt.second = l->second;
					rem(*l);
				}
				ins(nxt);
			}
			add(intv.first - 2);
		}
		else{
			ins(pi(intv.first, x - 1));
			add(intv.second + 1);
		}
	}
	else{
		auto nxt = it;
		if(nxt != s.begin()){
			nxt = prev(nxt);
			if(nxt->second == x - 1){
				auto prv = *nxt;
				rem(prv);
				if(prv.first != prv.second){
					prv.second -= 2;
					ins(prv);
				}
				add(x + 1);
				return;
			}
			if(nxt->second == x - 2){
				auto l = s.lower_bound(pi(x + 1, -1));
				if(l != s.end() && l->first == x + 1){
					int pos = l->second + 1;
					rem(*l);
					add(pos);
				}
				else if(l != s.end() && l->first == x + 2){
					auto it = *nxt;
					it.second = l->second;
					rem(*l);
					rem(*nxt);
					ins(it);
				}
				else{
					auto it = *nxt;
					it.second += 2;
					rem(*nxt);
					ins(it);
				}
				return;
			}
		}
		auto l = s.lower_bound(pi(x + 1, -1));
		if(l->first == x + 1){
			int pos = l->second + 1;
			rem(*l);
			add(pos);
		}
		else if(l->first == x + 2){
			auto nxt = *l; nxt.first -= 2;
			rem(*l);
			ins(nxt);
		}
		else{
			ins(pi(x, x));
		}
	}
}

int main(){
	E.a[0][0] = E.a[1][1] = 1;
	pwr[0] = E;
	pwr[1] = num(2);
	for(int i=2; i<MAXN; i++) pwr[i] = pwr[i-1] * pwr[1];
	int n, x;
	scanf("%d",&n);
	for(int i=0; i<n; i++){
		scanf("%d",&x);
		add(x);
		query();
	}
	batch();
}

Compilation message

fib.cpp: In function 'int query()':
fib.cpp:82:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^
fib.cpp: In function 'int main()':
fib.cpp:205:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
fib.cpp:207:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&x);
   ~~~~~^~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 3448 KB Output is correct
2 Correct 9 ms 3448 KB Output is correct
3 Correct 10 ms 3448 KB Output is correct
4 Correct 10 ms 3452 KB Output is correct
5 Correct 10 ms 3448 KB Output is correct
6 Correct 10 ms 3448 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 3448 KB Output is correct
2 Correct 9 ms 3448 KB Output is correct
3 Correct 10 ms 3448 KB Output is correct
4 Correct 10 ms 3452 KB Output is correct
5 Correct 10 ms 3448 KB Output is correct
6 Correct 10 ms 3448 KB Output is correct
7 Correct 10 ms 3448 KB Output is correct
8 Correct 10 ms 3448 KB Output is correct
9 Correct 10 ms 3448 KB Output is correct
10 Correct 10 ms 3448 KB Output is correct
11 Correct 10 ms 3576 KB Output is correct
12 Correct 10 ms 3544 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 3448 KB Output is correct
2 Correct 10 ms 3492 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 3448 KB Output is correct
2 Correct 9 ms 3448 KB Output is correct
3 Correct 10 ms 3448 KB Output is correct
4 Correct 10 ms 3452 KB Output is correct
5 Correct 10 ms 3448 KB Output is correct
6 Correct 10 ms 3448 KB Output is correct
7 Correct 10 ms 3448 KB Output is correct
8 Correct 10 ms 3448 KB Output is correct
9 Correct 10 ms 3448 KB Output is correct
10 Correct 10 ms 3448 KB Output is correct
11 Correct 10 ms 3576 KB Output is correct
12 Correct 10 ms 3544 KB Output is correct
13 Correct 10 ms 3448 KB Output is correct
14 Correct 10 ms 3492 KB Output is correct
15 Correct 10 ms 3448 KB Output is correct
16 Correct 10 ms 3448 KB Output is correct
17 Correct 10 ms 3520 KB Output is correct
18 Correct 10 ms 3440 KB Output is correct
19 Correct 10 ms 3548 KB Output is correct
20 Correct 10 ms 3576 KB Output is correct
21 Correct 10 ms 3576 KB Output is correct
22 Correct 10 ms 3576 KB Output is correct
23 Correct 11 ms 3576 KB Output is correct

Subtask #5
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 3524 KB Output is correct
2 Correct 475 ms 24344 KB Output is correct
3 Correct 537 ms 25156 KB Output is correct

Subtask #6
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 3448 KB Output is correct
2 Correct 9 ms 3448 KB Output is correct
3 Correct 10 ms 3448 KB Output is correct
4 Correct 10 ms 3452 KB Output is correct
5 Correct 10 ms 3448 KB Output is correct
6 Correct 10 ms 3448 KB Output is correct
7 Correct 10 ms 3448 KB Output is correct
8 Correct 10 ms 3448 KB Output is correct
9 Correct 10 ms 3448 KB Output is correct
10 Correct 10 ms 3448 KB Output is correct
11 Correct 10 ms 3576 KB Output is correct
12 Correct 10 ms 3544 KB Output is correct
13 Correct 10 ms 3448 KB Output is correct
14 Correct 10 ms 3492 KB Output is correct
15 Correct 10 ms 3448 KB Output is correct
16 Correct 10 ms 3448 KB Output is correct
17 Correct 10 ms 3520 KB Output is correct
18 Correct 10 ms 3440 KB Output is correct
19 Correct 10 ms 3548 KB Output is correct
20 Correct 10 ms 3576 KB Output is correct
21 Correct 10 ms 3576 KB Output is correct
22 Correct 10 ms 3576 KB Output is correct
23 Correct 11 ms 3576 KB Output is correct
24 Correct 10 ms 3524 KB Output is correct
25 Correct 475 ms 24344 KB Output is correct
26 Correct 537 ms 25156 KB Output is correct
27 Correct 116 ms 9580 KB Output is correct
28 Correct 205 ms 13960 KB Output is correct
29 Correct 134 ms 17880 KB Output is correct
30 Correct 230 ms 14164 KB Output is correct
31 Correct 657 ms 57204 KB Output is correct
32 Correct 398 ms 30816 KB Output is correct
33 Correct 616 ms 34224 KB Output is correct
34 Correct 687 ms 57144 KB Output is correct
35 Correct 700 ms 31720 KB Output is correct
36 Correct 767 ms 33388 KB Output is correct
37 Correct 511 ms 31288 KB Output is correct
38 Correct 435 ms 24444 KB Output is correct
39 Correct 199 ms 30184 KB Output is correct
40 Correct 306 ms 56884 KB Output is correct
41 Correct 789 ms 57108 KB Output is correct
42 Correct 433 ms 24464 KB Output is correct
43 Correct 390 ms 57844 KB Output is correct
44 Correct 1344 ms 110984 KB Output is correct
45 Correct 1268 ms 64944 KB Output is correct
46 Correct 1390 ms 110856 KB Output is correct
47 Correct 867 ms 58304 KB Output is correct
48 Correct 1451 ms 110984 KB Output is correct
49 Correct 1433 ms 65056 KB Output is correct
50 Correct 590 ms 33896 KB Output is correct