oj.uz

답안 #1120191

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1120191 2024-11-28T06:28:21 Z vjudge1 Palindrome-Free Numbers (BOI13_numbers) C++17
26.6667 / 100
 1000 ms 512 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long

bool da(int a){
    vector<int> sira;
    while(a){
        sira.push_back(a % 10);
        a /= 10;
    }
    for(int i=0;i<sira.size();++i){
        vector<int> temp;
        temp.push_back(sira[i]);
        for(int j=i+1;j<sira.size();++j){
            bool nuhuh = 0;
            temp.push_back(sira[j]);
            int l=0,r= temp.size() - 1;
            while(l <= r){
                if(temp[l] != temp[r]){
                    nuhuh = 1;
                    break;
                }
                l++;
                r--;
            }
            if(nuhuh)continue;
            return 0;
        }
    }
    return 1;
}

signed main(){
    int a,b,cnt=0;
    cin >> a >> b;
    for(int i=a;i<=b;++i){
        if(da(i))cnt++;
    }
    cout << cnt;
}
//

Compilation message

numbers.cpp: In function 'bool da(long long int)':
numbers.cpp:11:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 |     for(int i=0;i<sira.size();++i){
      |                 ~^~~~~~~~~~~~
numbers.cpp:14:24: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   14 |         for(int j=i+1;j<sira.size();++j){
      |                       ~^~~~~~~~~~~~

Subtask #1
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 73 ms 416 KB Output is correct
4 Correct 28 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 33 ms 336 KB Output is correct
15 Correct 47 ms 432 KB Output is correct
16 Correct 2 ms 336 KB Output is correct
17 Correct 10 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 88 ms 336 KB Output is correct
20 Correct 38 ms 336 KB Output is correct

Subtask #2
1.66666666667 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1046 ms 512 KB Time limit exceeded
2 Execution timed out 1046 ms 336 KB Time limit exceeded
3 Execution timed out 1063 ms 336 KB Time limit exceeded
4 Execution timed out 1057 ms 336 KB Time limit exceeded
5 Execution timed out 1043 ms 336 KB Time limit exceeded
6 Execution timed out 1052 ms 504 KB Time limit exceeded
7 Execution timed out 1058 ms 336 KB Time limit exceeded
8 Correct 872 ms 416 KB Output is correct
9 Execution timed out 1063 ms 336 KB Time limit exceeded
10 Execution timed out 1070 ms 336 KB Time limit exceeded
11 Execution timed out 1056 ms 336 KB Time limit exceeded
12 Execution timed out 1050 ms 336 KB Time limit exceeded
13 Execution timed out 1067 ms 336 KB Time limit exceeded
14 Execution timed out 1055 ms 336 KB Time limit exceeded
15 Execution timed out 1066 ms 336 KB Time limit exceeded
16 Execution timed out 1064 ms 336 KB Time limit exceeded
17 Execution timed out 1041 ms 336 KB Time limit exceeded
18 Execution timed out 1043 ms 336 KB Time limit exceeded
19 Execution timed out 1047 ms 336 KB Time limit exceeded
20 Execution timed out 1044 ms 336 KB Time limit exceeded
21 Execution timed out 1046 ms 336 KB Time limit exceeded
22 Execution timed out 1055 ms 336 KB Time limit exceeded
23 Execution timed out 1053 ms 336 KB Time limit exceeded
24 Execution timed out 1027 ms 336 KB Time limit exceeded
25 Execution timed out 1050 ms 336 KB Time limit exceeded
26 Execution timed out 1078 ms 336 KB Time limit exceeded
27 Execution timed out 1051 ms 336 KB Time limit exceeded
28 Execution timed out 1062 ms 336 KB Time limit exceeded
29 Execution timed out 1041 ms 336 KB Time limit exceeded
30 Execution timed out 1085 ms 336 KB Time limit exceeded
31 Execution timed out 1082 ms 336 KB Time limit exceeded
32 Execution timed out 1058 ms 336 KB Time limit exceeded
33 Execution timed out 1091 ms 336 KB Time limit exceeded
34 Execution timed out 1057 ms 336 KB Time limit exceeded
35 Execution timed out 1043 ms 336 KB Time limit exceeded
36 Execution timed out 1084 ms 336 KB Time limit exceeded
37 Execution timed out 1084 ms 336 KB Time limit exceeded
38 Execution timed out 1084 ms 336 KB Time limit exceeded
39 Execution timed out 1039 ms 336 KB Time limit exceeded
40 Execution timed out 1061 ms 336 KB Time limit exceeded
41 Execution timed out 1036 ms 336 KB Time limit exceeded
42 Execution timed out 1040 ms 336 KB Time limit exceeded
43 Execution timed out 1069 ms 336 KB Time limit exceeded
44 Execution timed out 1068 ms 336 KB Time limit exceeded
45 Execution timed out 1053 ms 336 KB Time limit exceeded