oj.uz

답안 #217508

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
217508 2020-03-30T04:25:23 Z dimash241 Palindromes (info1cup18_palindromes) C++17
100 / 100
 343 ms 24200 KB 
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")

//# include <x86intrin.h>
# include <bits/stdc++.h>

//# include <ext/pb_ds/assoc_container.hpp>
//# include <ext/pb_ds/tree_policy.hpp>

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

#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(),x.end()
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define For(i,x,y)  for (ll i = x; i <= y; i ++) 
#define FOr(i,x,y)  for (ll i = x; i >= y; i --)
#define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
// ROAD to...                                                                                                                                                                                                                Red

inline void Input_Output () {
	//freopen(".in", "r", stdin);
   //freopen(".out", "w", stdout);
}

const double eps = 0.000001;
const ld pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const ll MOD = 1e18 + 9;
const ll INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 6e5 + 123;                                          
const int M = 22;
const int pri = 997;
const int Magic = 2101;

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
 
int n, m, k;
int cnt[N];
string s;
int a[N];
vector < int > g[N];
int u[N];
int ans, res;
int cur;
//	mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
//	shuffle(permutation.begin(), permutation.end(), rng);



int main () {
	SpeedForce;
	cin >> n;

	ll ans = 0;
	for (int i = 1; i <= n; ++i) {
		cin >> cur;
		s = to_string(cur);

		string t = s;
		reverse(every(t));
		if(s==t) ans += cur;
	} 
	cout << ans << '\n';
	return Accepted;
}

// B...a

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 14464 KB Output is correct
2 Correct 17 ms 14592 KB Output is correct
3 Correct 164 ms 19320 KB Output is correct
4 Correct 249 ms 21752 KB Output is correct
5 Correct 326 ms 24056 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 14464 KB Output is correct
2 Correct 15 ms 14464 KB Output is correct
3 Correct 115 ms 15992 KB Output is correct
4 Correct 214 ms 17312 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 14464 KB Output is correct
2 Correct 15 ms 14464 KB Output is correct
3 Correct 115 ms 15992 KB Output is correct
4 Correct 214 ms 17312 KB Output is correct
5 Correct 13 ms 14464 KB Output is correct
6 Correct 17 ms 14464 KB Output is correct
7 Correct 204 ms 17656 KB Output is correct
8 Correct 243 ms 18296 KB Output is correct

Subtask #4
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 14464 KB Output is correct
2 Correct 17 ms 14592 KB Output is correct
3 Correct 164 ms 19320 KB Output is correct
4 Correct 249 ms 21752 KB Output is correct
5 Correct 326 ms 24056 KB Output is correct
6 Correct 13 ms 14464 KB Output is correct
7 Correct 15 ms 14464 KB Output is correct
8 Correct 115 ms 15992 KB Output is correct
9 Correct 214 ms 17312 KB Output is correct
10 Correct 13 ms 14464 KB Output is correct
11 Correct 17 ms 14464 KB Output is correct
12 Correct 204 ms 17656 KB Output is correct
13 Correct 243 ms 18296 KB Output is correct
14 Correct 13 ms 14464 KB Output is correct
15 Correct 23 ms 14840 KB Output is correct
16 Correct 143 ms 18296 KB Output is correct
17 Correct 305 ms 23160 KB Output is correct
18 Correct 321 ms 24056 KB Output is correct
19 Correct 343 ms 24200 KB Output is correct
20 Correct 321 ms 24056 KB Output is correct