oj.uz

답안 #1120172

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1120172 2024-11-28T06:20:32 Z vjudge1 Palindrome-Free Numbers (BOI13_numbers) C++17
26.6667 / 100
 1000 ms 596 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define run  ios_base::sync_with_stdio(false);cin.tie(0);
 
#define ll long long
#define pll pair<ll, ll>
#define ull unsigned ll
#define ld double
#define endl "\n"
#define pb push_back
#define fi first
#define se second
 
#define pi acos(-1)
#define N 100007
#define minimum -9223372036854775807
#define maximum -minimum
#define mod 1000000007
 
using namespace std;
using namespace __gnu_pbds;
template <class t>
using ordered_set=tree<t, null_type,less_equal<t>, rb_tree_tag,tree_order_statistics_node_update>;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

ll gcd(ll a, ll b)
{
	if(b==0)
		return a;
	return gcd(b, a%b);
}

ll lcm(ll a, ll b)
{
	return a/gcd(a, b)*b;
}

bool isprime(ll n)
{
	if(n==1)
		return 0;
	for(ll i=2; i*i<=n; i++)
	{
		if(n%i==0)
			return 0;
	}
	return 1;
}

ll binpow(ll a, ll b)
{
    a%=mod;
    ll res=1;
    while(b>0)
	{
        if(b%2==1)
            res=(res*a)%mod;
        a=(a*a)%mod;
        b/=2;
    }
    return res;
}

int main()
{
	run;
	ll a, b;
	cin>>a>>b;
	ll cvb=0;
	for(ll i=a; i<=b; i++)
	{
		string s=to_string(i);
//		cout<<s<<" ";
		bool bul=1;
		for(ll j=0; j<s.length(); j++)
		{
			for(ll k=j	+1; k<s.length(); k++)
			{
				string x=s.substr(j, k-j+1);
//				cout<<x<<endl;
				string revx=x;
				reverse(revx.begin(), revx.end());
				if(revx==x)
					bul=0;
			}
		}
		if(bul)
			cvb++;
	}
	cout<<cvb<<endl;
}
// By Xanlar

Compilation message

numbers.cpp: In function 'int main()':
numbers.cpp:77:16: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |   for(ll j=0; j<s.length(); j++)
      |               ~^~~~~~~~~~~
numbers.cpp:79:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   79 |    for(ll k=j +1; k<s.length(); k++)
      |                   ~^~~~~~~~~~~

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 318 ms 340 KB Output is correct
4 Correct 17 ms 340 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 508 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 34 ms 340 KB Output is correct
15 Correct 18 ms 508 KB Output is correct
16 Correct 2 ms 508 KB Output is correct
17 Correct 16 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 290 ms 448 KB Output is correct
20 Correct 18 ms 340 KB Output is correct

Subtask #2
1.66666666667 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1038 ms 340 KB Time limit exceeded
2 Execution timed out 1037 ms 340 KB Time limit exceeded
3 Execution timed out 1056 ms 340 KB Time limit exceeded
4 Execution timed out 1066 ms 340 KB Time limit exceeded
5 Execution timed out 1043 ms 340 KB Time limit exceeded
6 Execution timed out 1038 ms 340 KB Time limit exceeded
7 Execution timed out 1069 ms 340 KB Time limit exceeded
8 Correct 847 ms 456 KB Output is correct
9 Execution timed out 1054 ms 340 KB Time limit exceeded
10 Execution timed out 1045 ms 340 KB Time limit exceeded
11 Execution timed out 1044 ms 340 KB Time limit exceeded
12 Execution timed out 1058 ms 340 KB Time limit exceeded
13 Execution timed out 1060 ms 340 KB Time limit exceeded
14 Execution timed out 1049 ms 340 KB Time limit exceeded
15 Execution timed out 1063 ms 340 KB Time limit exceeded
16 Execution timed out 1053 ms 340 KB Time limit exceeded
17 Execution timed out 1057 ms 340 KB Time limit exceeded
18 Execution timed out 1045 ms 340 KB Time limit exceeded
19 Execution timed out 1048 ms 340 KB Time limit exceeded
20 Execution timed out 1029 ms 340 KB Time limit exceeded
21 Execution timed out 1089 ms 340 KB Time limit exceeded
22 Execution timed out 1032 ms 340 KB Time limit exceeded
23 Execution timed out 1053 ms 340 KB Time limit exceeded
24 Execution timed out 1067 ms 340 KB Time limit exceeded
25 Execution timed out 1048 ms 340 KB Time limit exceeded
26 Execution timed out 1038 ms 340 KB Time limit exceeded
27 Execution timed out 1061 ms 340 KB Time limit exceeded
28 Execution timed out 1048 ms 340 KB Time limit exceeded
29 Execution timed out 1064 ms 340 KB Time limit exceeded
30 Execution timed out 1046 ms 340 KB Time limit exceeded
31 Execution timed out 1061 ms 340 KB Time limit exceeded
32 Execution timed out 1057 ms 340 KB Time limit exceeded
33 Execution timed out 1042 ms 340 KB Time limit exceeded
34 Execution timed out 1048 ms 340 KB Time limit exceeded
35 Execution timed out 1082 ms 340 KB Time limit exceeded
36 Execution timed out 1086 ms 336 KB Time limit exceeded
37 Execution timed out 1064 ms 336 KB Time limit exceeded
38 Execution timed out 1053 ms 336 KB Time limit exceeded
39 Execution timed out 1052 ms 336 KB Time limit exceeded
40 Execution timed out 1052 ms 336 KB Time limit exceeded
41 Execution timed out 1059 ms 336 KB Time limit exceeded
42 Execution timed out 1051 ms 336 KB Time limit exceeded
43 Execution timed out 1063 ms 336 KB Time limit exceeded
44 Execution timed out 1080 ms 336 KB Time limit exceeded
45 Execution timed out 1088 ms 336 KB Time limit exceeded