답안 #128561

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
128561	2019-07-11T06:37:36 Z	구재현(#3166)	Fibonacci representations (CEOI18_fib)	C++14	50 / 100	4000 ms	2048 KB

fib

#include <bits/stdc++.h>
using namespace std;
using lint = long long;
const int mod = 1e9 + 7;
const int MAXN = 200005;
 
set<int> s;
int n, a[MAXN];
lint dp[MAXN][2];
 
int query(){
	n = 0;
	for(auto &i : s) a[++n] = i;
	dp[0][0] = 1;
	for(int i=1; i<=n; i++){
		int d = a[i] - a[i-1];
	//	printf("G = %d. ", d);
		dp[i][0] = (dp[i-1][1] * (d % 2 == 0) + dp[i-1][0] * ((d + 1) / 2)) % mod;
		dp[i][1] = (dp[i-1][1] * (d % 2 == 0) + dp[i-1][0] * ((d - 1) / 2)) % mod;
	//	printf("(%lld, %lld)\n", dp[i][0], dp[i][1]);
	}
	return dp[n][0];
}
 
void add(int x){ // does they amortize??? why???
	if(s.find(x) != s.end()){
		s.erase(x);
		add(x + 1);
		if(x > 2) add(x - 2);
		if(x == 2) add(1); 
		return;
	}
	s.insert(x);
	if(s.find(x + 1) != s.end()){
		s.erase(x);
		s.erase(x + 1);
		add(x + 2);
	}
	else if(s.find(x - 1) != s.end()){
		s.erase(x);
		s.erase(x - 1);
		add(x + 1);
	}
}
 
int main(){
	int n, x, ans = 0;
	scanf("%d",&n);
	for(int i=0; i<n; i++){
		scanf("%d",&x);
		add(x);
		printf("%d\n", query());
	}
}

Compilation message

fib.cpp: In function 'int main()':
fib.cpp:47:12: warning: unused variable 'ans' [-Wunused-variable]
  int n, x, ans = 0;
            ^~~
fib.cpp:48:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
  ~~~~~^~~~~~~~~
fib.cpp:50: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

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	256 KB	Output is correct
5	Correct	2 ms	252 KB	Output is correct
6	Correct	2 ms	252 KB	Output is correct

Subtask #2

20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	256 KB	Output is correct
5	Correct	2 ms	252 KB	Output is correct
6	Correct	2 ms	252 KB	Output is correct
7	Correct	2 ms	380 KB	Output is correct
8	Correct	2 ms	256 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct

Subtask #3

15.0 / 15.0

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

Subtask #4

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	256 KB	Output is correct
5	Correct	2 ms	252 KB	Output is correct
6	Correct	2 ms	252 KB	Output is correct
7	Correct	2 ms	380 KB	Output is correct
8	Correct	2 ms	256 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	256 KB	Output is correct
17	Correct	2 ms	396 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	3 ms	376 KB	Output is correct
21	Correct	2 ms	380 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	2 ms	376 KB	Output is correct

Subtask #5

0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Execution timed out	4034 ms	2048 KB	Time limit exceeded
3	Halted	0 ms	0 KB	-

Subtask #6

0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	2 ms	256 KB	Output is correct
3	Correct	2 ms	376 KB	Output is correct
4	Correct	2 ms	256 KB	Output is correct
5	Correct	2 ms	252 KB	Output is correct
6	Correct	2 ms	252 KB	Output is correct
7	Correct	2 ms	380 KB	Output is correct
8	Correct	2 ms	256 KB	Output is correct
9	Correct	2 ms	376 KB	Output is correct
10	Correct	2 ms	376 KB	Output is correct
11	Correct	2 ms	256 KB	Output is correct
12	Correct	2 ms	376 KB	Output is correct
13	Correct	2 ms	376 KB	Output is correct
14	Correct	2 ms	376 KB	Output is correct
15	Correct	2 ms	376 KB	Output is correct
16	Correct	2 ms	256 KB	Output is correct
17	Correct	2 ms	396 KB	Output is correct
18	Correct	2 ms	376 KB	Output is correct
19	Correct	2 ms	376 KB	Output is correct
20	Correct	3 ms	376 KB	Output is correct
21	Correct	2 ms	380 KB	Output is correct
22	Correct	2 ms	376 KB	Output is correct
23	Correct	2 ms	376 KB	Output is correct
24	Correct	2 ms	376 KB	Output is correct
25	Execution timed out	4034 ms	2048 KB	Time limit exceeded
26	Halted	0 ms	0 KB	-