oj.uz

답안 #880431

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
880431 2023-11-29T12:17:07 Z amin_2008 Palindromes (info1cup18_palindromes) C++17
100 / 100
 141 ms 10040 KB 
#pragma GCC optimize ("O3")
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

// author: amin_2008

#define ios          ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define ll           long long
#define vi           vector<int>
#define vs           vector<string>
#define vb           vector<bool>
#define vc           vector<char>
#define vl           vector<ll>
#define all(v)       v.begin(), v.end()
#define rall(v)      v.rbegin(), v.rend()
#define pb           push_back
#define bpc          __builtin_popcount
#define pii          pair<int, int>
#define pll          pair<ll, ll>
#define piii         pair<pii, int>
#define vpii         vector<pii>
#define vpll         vector<pll>
#define vvpii        vector<vpii>
#define vvi          vector<vector<int>>
#define vvl          vector<vector<ll>>
#define ins          insert
#define ts           to_string
#define sz(x)        (int)(x).size()
#define mp           make_pair
#define F            first
#define S            second
#define lb           lower_bound
#define ub           upper_bound
#define ld           long double
#define ull          unsigned long long
#define endl         '\n'
#define int          ull

using namespace std;
using namespace __gnu_pbds;
using namespace __cxx11;
template<class T> using ordered_set = tree<T, null_type,less<T>, rb_tree_tag,tree_order_statistics_node_update>;

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

const int inf = 1e18;
const int mod = 1e9+7;
const int sz = 5e5+5;
const int N = 500500;
const int logg = 18;
const int P = 40000005;
const int M = 5e5+5;

int a[sz];

void solve()
{
    int n;
    cin >> n;
    int res = 0;
    for(int i = 0, x; i < n; i++)
    {
        cin >> x;
        string s = ts(x);
        string a = s;
        reverse(all(a));
        res += ( s == a ? x : 0 );
    }
    cout << res << endl;
}

signed main()
{
    ios;
    //precompute();
    int t = 1;
    //cin >> t;
    while(t--){
        solve();
    }
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 49 ms 452 KB Output is correct
4 Correct 74 ms 2492 KB Output is correct
5 Correct 109 ms 10040 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 32 ms 348 KB Output is correct
4 Correct 65 ms 1616 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 32 ms 348 KB Output is correct
4 Correct 65 ms 1616 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 66 ms 3496 KB Output is correct
8 Correct 72 ms 4024 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 49 ms 452 KB Output is correct
4 Correct 74 ms 2492 KB Output is correct
5 Correct 109 ms 10040 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 32 ms 348 KB Output is correct
9 Correct 65 ms 1616 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 66 ms 3496 KB Output is correct
13 Correct 72 ms 4024 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 4 ms 604 KB Output is correct
16 Correct 42 ms 4188 KB Output is correct
17 Correct 92 ms 9044 KB Output is correct
18 Correct 141 ms 9916 KB Output is correct
19 Correct 103 ms 9912 KB Output is correct
20 Correct 104 ms 9916 KB Output is correct