oj.uz

답안 #448414

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
448414 2021-07-30T06:29:08 Z Khizri Palindrome-Free Numbers (BOI13_numbers) C++17
24.1667 / 100
 1000 ms 312 KB 
#include <bits/stdc++.h>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll long long
#define pb push_back		 
#define F first																 
#define S second 															 
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
	if(a>b) swap(a,b);
	if(a==0) return a+b;
	return gcd(b%a,a);
}
ll lcm(ll a,ll b){
	return a/gcd(a,b)*b;
}
bool is_prime(ll n){
	ll k=sqrt(n);
	if(n==2) return true;
	if(n<2||n%2==0||k*k==n) return false;
	for(int i=3;i<=k;i+=2){
		if(n%i==0){
			return false;
		}
	}
	return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=1e6+5;
ll t=1,a,b,ans;
bool funk(string s){
	for(int i=0;i<s.size();i++){
		string a="";
		a+=s[i];
		for(int j=i+1;j<s.size();j++){
			a+=s[j];
			string b=a;
			reverse(all(b));
			if(a==b){
				return false;
			}
		}
	}
	return true;
}
void solve(){
	cin>>a>>b;
	for(int i=a;i<=b;i++){
		string s;
		ll k=i;
		while(k>0){
			char c=(k%10)+48;
			k/=10;
			s+=c;
		}
		if(funk(s)){
			ans++;
		}
	}
	cout<<ans<<endl;
}
int main(){
	IOS;
	//cin>>t;
	while(t--){
		solve();
	}
	return 0;
}

Compilation message

numbers.cpp: In function 'bool funk(std::string)':
numbers.cpp:45:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |  for(int i=0;i<s.size();i++){
      |              ~^~~~~~~~~
numbers.cpp:48:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |   for(int j=i+1;j<s.size();j++){
      |                 ~^~~~~~~~~

Subtask #1
22.5 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Execution timed out 1066 ms 204 KB Time limit exceeded
4 Correct 23 ms 204 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 0 ms 204 KB Output is correct
14 Correct 25 ms 204 KB Output is correct
15 Correct 23 ms 204 KB Output is correct
16 Correct 2 ms 204 KB Output is correct
17 Correct 11 ms 312 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Execution timed out 1084 ms 204 KB Time limit exceeded
20 Correct 23 ms 204 KB Output is correct

Subtask #2
1.66666666667 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1092 ms 204 KB Time limit exceeded
2 Execution timed out 1077 ms 204 KB Time limit exceeded
3 Execution timed out 1056 ms 204 KB Time limit exceeded
4 Execution timed out 1079 ms 204 KB Time limit exceeded
5 Execution timed out 1077 ms 204 KB Time limit exceeded
6 Execution timed out 1084 ms 204 KB Time limit exceeded
7 Execution timed out 1078 ms 204 KB Time limit exceeded
8 Correct 858 ms 288 KB Output is correct
9 Execution timed out 1088 ms 204 KB Time limit exceeded
10 Execution timed out 1080 ms 204 KB Time limit exceeded
11 Execution timed out 1081 ms 204 KB Time limit exceeded
12 Execution timed out 1091 ms 204 KB Time limit exceeded
13 Execution timed out 1089 ms 204 KB Time limit exceeded
14 Execution timed out 1089 ms 204 KB Time limit exceeded
15 Execution timed out 1075 ms 204 KB Time limit exceeded
16 Execution timed out 1074 ms 204 KB Time limit exceeded
17 Execution timed out 1082 ms 204 KB Time limit exceeded
18 Execution timed out 1089 ms 204 KB Time limit exceeded
19 Execution timed out 1086 ms 204 KB Time limit exceeded
20 Execution timed out 1090 ms 224 KB Time limit exceeded
21 Execution timed out 1078 ms 204 KB Time limit exceeded
22 Execution timed out 1083 ms 204 KB Time limit exceeded
23 Execution timed out 1094 ms 204 KB Time limit exceeded
24 Execution timed out 1098 ms 204 KB Time limit exceeded
25 Execution timed out 1092 ms 204 KB Time limit exceeded
26 Execution timed out 1091 ms 204 KB Time limit exceeded
27 Execution timed out 1097 ms 204 KB Time limit exceeded
28 Execution timed out 1084 ms 204 KB Time limit exceeded
29 Execution timed out 1087 ms 204 KB Time limit exceeded
30 Execution timed out 1083 ms 204 KB Time limit exceeded
31 Execution timed out 1041 ms 204 KB Time limit exceeded
32 Execution timed out 1090 ms 204 KB Time limit exceeded
33 Execution timed out 1095 ms 204 KB Time limit exceeded
34 Execution timed out 1093 ms 204 KB Time limit exceeded
35 Execution timed out 1090 ms 204 KB Time limit exceeded
36 Execution timed out 1087 ms 204 KB Time limit exceeded
37 Execution timed out 1085 ms 204 KB Time limit exceeded
38 Execution timed out 1097 ms 204 KB Time limit exceeded
39 Execution timed out 1092 ms 204 KB Time limit exceeded
40 Execution timed out 1086 ms 204 KB Time limit exceeded
41 Execution timed out 1089 ms 204 KB Time limit exceeded
42 Execution timed out 1088 ms 204 KB Time limit exceeded
43 Execution timed out 1089 ms 204 KB Time limit exceeded
44 Execution timed out 1082 ms 204 KB Time limit exceeded
45 Execution timed out 1082 ms 204 KB Time limit exceeded