QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#508195	#9158. 分数	251Sec	85	524ms	4068kb	C++14	2.7kb	2024-08-07 08:30:26	2024-08-07 08:30:26

Judging History

你现在查看的是最新测评结果

[2024-08-07 08:30:26]
评测

测评结果：85
用时：524ms
内存：4068kb

查看

[2024-08-07 08:30:26]
提交

answer

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/hash_policy.hpp>
using std::bitset;
using std::cout;
using std::deque;
using std::endl;
using std::greater;
using std::lower_bound;
using std::make_pair;
using std::map;
using std::max;
using std::min;
using std::multimap;
using std::multiset;
using std::nth_element;
using std::pair;
using std::priority_queue;
using std::queue;
using std::reverse; 
using std::set;
using std::sort;
using std::sqrt;
using std::stable_sort;
using std::string;
using std::swap;
using std::unique;
using std::upper_bound;
using std::vector;
typedef int li;
typedef long double lf;

inline li read(){
	li ans = 0, f = 1;
	char ch = getchar();
	while(ch < '0' || ch > '9'){
		f = (ch == '-') ? -1 : 1;
		ch = getchar();
	}
	while(ch <= '9' && ch >= '0'){
		ans = ans * 10 + (ch ^ 48);
		ch = getchar();
	}
	return ans * f;
} 

li n, m, maxn;
__gnu_pbds::gp_hash_table<long long, li> mp;

//struct hash_table{
//	li head[(int)1e7 + 12], next[int(5e7) + 9], lenp;
//	long long val[(int)5e7 + 9];
//	const li mod = 1e7 + 9;
//	li query(long long x){
////		cout << x << endl;
//		li p = x % mod;
//		for(li i = head[p]; i; i = next[i]){
//			if(val[i] == x) return 1;
//		}
////		cout << x << endl;
//		next[++lenp] = head[p];
//		val[lenp] = x;
//		head[p] = lenp;
//		return 0;
//	}
//} mp;

li ans;
queue<pair<li, li>> qu;
void dfs(li p, li q, li op){
//	cout << p << " " << q << endl;
//	if(mp[p * 1000000000ll + q]) return;
//	mp[p * 1000000000ll + q] = 1;
//	cout << p << " " << q << endl;
//	if(mp[p * 1000000000 + q]) return;
//	mp[p * 1000000000 + q] = 1;
	if(p <= n && q <= m) ans++;
//	if(ans % 10000)
	if(1 <= q && q <= maxn && 1 <= p && p <= maxn && !op) dfs(q, p, 1);
//	if(p > 2 * q) dfs(p - 2 * q, q);
	if(p + 2 * q <= maxn) dfs(p + 2 * q, q, 0);
}

int main(){
//	freopen("wonderful.ans", "r", stdin);
//	freopen("www.ww", "w", stdout);
//	double begin = clock();
//	mp.lenp = 0;
	n = read(), m = read();
	maxn = max(n, m);
	dfs(1, 2, 0);
//	qu.push({1, 2});
//	mp.query(1 * 1000000000ll + 2);
//	while(!qu.empty()){
//		li p = qu.front().first, q = qu.front().second;
//		if(p <= n && q <= m) ans++;
//		qu.pop();
////		cout << p << " " << q << endl;
//		if(1 <= q && q <= maxn && 1 <= p && p <= maxn){ 
//			if(!mp.query(q * 1000000000ll + p)) qu.push({q, p});
//		}			
//		if(p > 2 * q){
//			if(!mp.query((p - 2 * q) * 1000000000ll + q)) qu.push({p - 2 * q, q});
//		}
//		if(p + 2 * q <= maxn){
//			if(!mp.query((p + 2 * q) * 1000000000ll + q)) qu.push({p + 2 * q, q});
//		}
//	}
	printf("%d\n", ans);
//	printf("%.4Lf s\n", (lf)(clock() - (lf)begin) / (lf)CLOCKS_PER_SEC);
	return 0;
}

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Pretests

Pretest #1:

score: 5

Accepted

time: 0ms

memory: 3792kb

input:

99 99

output:

result:

ok 1 number(s): "406"

Pretest #2:

score: 5

Accepted

time: 0ms

memory: 3768kb

input:

98 97

output:

result:

ok 1 number(s): "405"

Pretest #3:

score: 5

Accepted

time: 0ms

memory: 3768kb

input:

99 96

output:

result:

ok 1 number(s): "396"

Pretest #4:

score: 5

Accepted

time: 0ms

memory: 3988kb

input:

995 977

output:

result:

ok 1 number(s): "11153"

Pretest #5:

score: 5

Accepted

time: 0ms

memory: 3736kb

input:

991 990

output:

result:

ok 1 number(s): "11220"

Pretest #6:

score: 5

Accepted

time: 0ms

memory: 3800kb

input:

976 968

output:

result:

ok 1 number(s): "10900"

Pretest #7:

score: 5

Accepted

time: 0ms

memory: 4068kb

input:

7602 7864

output:

result:

ok 1 number(s): "215706"

Pretest #8:

score: 5

Accepted

time: 1ms

memory: 3960kb

input:

7959 7735

output:

result:

ok 1 number(s): "220256"

Pretest #9:

score: 5

Accepted

time: 1ms

memory: 4068kb

input:

7878 7863

output:

result:

ok 1 number(s): "221162"

Pretest #10:

score: 5

Accepted

time: 1ms

memory: 3692kb

input:

7788 7658

output:

result:

ok 1 number(s): "215323"

Pretest #11:

score: 5

Accepted

time: 19ms

memory: 3724kb

input:

95399 99767

output:

result:

ok 1 number(s): "8285295"

Pretest #12:

score: 5

Accepted

time: 19ms

memory: 3788kb

input:

98051 99642

output:

result:

ok 1 number(s): "8439713"

Pretest #13:

score: 5

Accepted

time: 18ms

memory: 3992kb

input:

95624 96007

output:

result:

ok 1 number(s): "8068127"

Pretest #14:

score: 5

Accepted

time: 19ms

memory: 3768kb

input:

99208 98047

output:

result:

ok 1 number(s): "8412610"

Pretest #15:

score: 5

Accepted

time: 524ms

memory: 3708kb

input:

997417 967722

output:

229917323

result:

ok 1 number(s): "229917323"

Pretest #16:

score: 5

Accepted

time: 515ms

memory: 3996kb

input:

987807 956529

output:

226426912

result:

ok 1 number(s): "226426912"

Pretest #17:

score: 5

Accepted

time: 510ms

memory: 3708kb

input:

971654 984345

output:

228363805

result:

ok 1 number(s): "228363805"

Pretest #18:

score: 0

Time Limit Exceeded

input:

7892259 7983727

output:

result:

Pretest #19:

score: 0

Time Limit Exceeded

input:

7937869 29796968

output:

result:

Pretest #20:

score: 0

Time Limit Exceeded

input:

29717543 29510173

output:

result:

Final Tests

Test #1:

score: 5

Accepted

time: 0ms

memory: 4004kb

input:

96 98

output:

result:

ok 1 number(s): "396"

Test #2:

score: 5

Accepted

time: 0ms

memory: 3988kb

input:

100 99

output:

result:

ok 1 number(s): "408"

Test #3:

score: 5

Accepted

time: 0ms

memory: 3768kb

input:

99 99

output:

result:

ok 1 number(s): "406"

Test #4:

score: 5

Accepted

time: 0ms

memory: 3732kb

input:

963 951

output:

result:

ok 1 number(s): "10634"

Test #5:

score: 5

Accepted

time: 0ms

memory: 3964kb

input:

958 974

output:

result:

ok 1 number(s): "10795"

Test #6:

score: 5

Accepted

time: 0ms

memory: 3704kb

input:

966 990

output:

result:

ok 1 number(s): "11003"

Test #7:

score: 5

Accepted

time: 1ms

memory: 3788kb

input:

7958 7947

output:

result:

ok 1 number(s): "224482"

Test #8:

score: 5

Accepted

time: 1ms

memory: 3728kb

input:

7623 7730

output:

result:

ok 1 number(s): "213444"

Test #9:

score: 5

Accepted

time: 1ms

memory: 3704kb

input:

7845 7783

output:

result:

ok 1 number(s): "218916"

Test #10:

score: 5

Accepted

time: 1ms

memory: 3700kb

input:

7881 7773

output:

result:

ok 1 number(s): "219451"

Test #11:

score: 5

Accepted

time: 19ms

memory: 3708kb

input:

99414 98698

output:

result:

ok 1 number(s): "8465217"

Test #12:

score: 5

Accepted

time: 19ms

memory: 3772kb

input:

98249 96148

output:

result:

ok 1 number(s): "8237486"

Test #13:

score: 5

Accepted

time: 19ms

memory: 3704kb

input:

99003 96832

output:

result:

ok 1 number(s): "8324931"

Test #14:

score: 5

Accepted

time: 19ms

memory: 3792kb

input:

98266 96030

output:

result:

ok 1 number(s): "8231065"

Test #15:

score: 5

Accepted

time: 498ms

memory: 3788kb

input:

968207 958885

output:

223522215

result:

ok 1 number(s): "223522215"

Test #16:

score: 5

Accepted

time: 524ms

memory: 3784kb

input:

959846 998397

output:

228770873

result:

ok 1 number(s): "228770873"

Test #17:

score: 5

Accepted

time: 499ms

memory: 3708kb

input:

965821 972280

output:

225359210

result:

ok 1 number(s): "225359210"

Test #18:

score: 0

Time Limit Exceeded

input:

7855098 7962479

output:

result:

Test #19:

score: 0

Time Limit Exceeded

input:

7841076 29648718

output:

result:

Test #20:

score: 0

Time Limit Exceeded

input:

29365129 29012208