結果

問題 No.1150 シュークリームゲーム(Easy)
ユーザー Shuz*Shuz*
提出日時 2020-08-07 22:26:58
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 14 ms / 2,000 ms
コード長 7,446 bytes
コンパイル時間 1,608 ms
コンパイル使用メモリ 172,112 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-09-24 20:55:17
合計ジャッジ時間 3,314 ms
ジャッジサーバーID
(参考情報)
judge1 / judge5
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,812 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 2 ms
6,944 KB
testcase_05 AC 2 ms
6,944 KB
testcase_06 AC 1 ms
6,944 KB
testcase_07 AC 2 ms
6,940 KB
testcase_08 AC 2 ms
6,940 KB
testcase_09 AC 2 ms
6,940 KB
testcase_10 AC 2 ms
6,944 KB
testcase_11 AC 2 ms
6,940 KB
testcase_12 AC 1 ms
6,940 KB
testcase_13 AC 2 ms
6,940 KB
testcase_14 AC 2 ms
6,940 KB
testcase_15 AC 2 ms
6,940 KB
testcase_16 AC 2 ms
6,940 KB
testcase_17 AC 2 ms
6,944 KB
testcase_18 AC 2 ms
6,940 KB
testcase_19 AC 1 ms
6,944 KB
testcase_20 AC 2 ms
6,940 KB
testcase_21 AC 2 ms
6,940 KB
testcase_22 AC 12 ms
6,944 KB
testcase_23 AC 12 ms
6,940 KB
testcase_24 AC 12 ms
6,940 KB
testcase_25 AC 12 ms
6,940 KB
testcase_26 AC 13 ms
6,940 KB
testcase_27 AC 13 ms
6,944 KB
testcase_28 AC 14 ms
6,944 KB
testcase_29 AC 10 ms
6,940 KB
testcase_30 AC 12 ms
6,944 KB
testcase_31 AC 11 ms
6,940 KB
testcase_32 AC 12 ms
6,944 KB
testcase_33 AC 13 ms
6,944 KB
testcase_34 AC 13 ms
6,940 KB
testcase_35 AC 13 ms
6,940 KB
testcase_36 AC 13 ms
6,940 KB
testcase_37 AC 14 ms
6,944 KB
testcase_38 AC 11 ms
6,944 KB
testcase_39 AC 11 ms
6,944 KB
testcase_40 AC 12 ms
6,944 KB
testcase_41 AC 13 ms
6,940 KB
testcase_42 AC 11 ms
6,944 KB
testcase_43 AC 11 ms
6,944 KB
testcase_44 AC 13 ms
6,944 KB
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
#pragma region Template
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using pvector = vector<pair<T, T>>;
template <class T> using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
constexpr const ll dy[4] = {0, 1, 0, -1};
constexpr const ll MOD = 1e9 + 7;
constexpr const ll mod = 998244353;
constexpr const ll INF = 1LL << 60;
constexpr const ll inf = 1 << 30;
constexpr const char rt = '\n';
constexpr const char sp = ' ';
#define rt(i, n) (i == (ll)(n) -1 ? rt : sp)
#define len(x) ((ll)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define ifn(x) if (not(x))
#define elif else if
#define elifn else ifn
#define fi first
#define se second
#define uniq(x) (sort(all(x)), (x).erase(unique(all(x)), (x).end()))
using graph = vector<vector<ll>>;
template <class T> using wgraph = vector<vector<ll, T>>;
bool __DIRECTED__ = true;
istream &operator>>(istream &is, graph &g) {
ll a, b;
is >> a >> b;
g[a - 1].pb(b - 1);
if (__DIRECTED__ == false) g[b - 1].pb(a - 1);
return is;
}
template <class T> istream &operator>>(istream &is, wgraph<T> &g) {
ll a, b;
T c;
is >> a >> b >> c;
g[a - 1].pb({b - 1, c});
if (__DIRECTED__ == false) g[b - 1].pb({a - 1, c});
return is;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
// Debug
#define debug(...) \
{ \
cerr << __LINE__ << ": " << #__VA_ARGS__ << " = "; \
for (auto &&__i : {__VA_ARGS__}) cerr << "[" << __i << "] "; \
cerr << rt; \
}
#define dump(a, h, w) \
{ \
cerr << __LINE__ << ": " << #a << " = [" << rt; \
rep(__i, h) { \
rep(__j, w) { \
if (abs(a[__i][__j]) >= INF / 2 and a[__i][__j] <= -INF / 2) cerr << '-'; \
if (abs(a[__i][__j]) >= INF / 2) cerr << "∞" << sp; \
else \
cerr << a[__i][__j] << sp; \
} \
cerr << rt; \
} \
cerr << "]" << rt; \
}
#define vdump(a, n) \
{ \
cerr << __LINE__ << ": " << #a << " = ["; \
rep(__i, n) { \
if (__i) cerr << sp; \
if (abs(a[__i]) >= INF / 2 and a[__i] <= -INF / 2) cerr << '-'; \
if (abs(a[__i]) >= INF / 2) cerr << "∞" << sp; \
else \
cerr << a[__i]; \
} \
cerr << "]" << rt; \
}
// Loop
#define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i)
#define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i)
#define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i)
#define each(i, a) for (auto &&i : a)
// Stream
#define fout(n) cout << fixed << setprecision(n)
struct io {
io() { cin.tie(nullptr), ios::sync_with_stdio(false); }
} io;
/*
// Speed
#pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunknown-pragmas"
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target( \
"sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native,arch=skylake-avx512")
#pragma GCC diagnostic pop
*/
// Math
inline constexpr ll gcd(const ll a, const ll b) { return b ? gcd(b, a % b) : a; }
inline constexpr ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }
inline constexpr ll modulo(const ll n, const ll m = MOD) {
ll k = n % m;
return k + m * (k < 0);
}
inline constexpr ll chmod(ll &n, const ll m = MOD) {
n %= m;
return n += m * (n < 0);
}
inline constexpr ll mpow(ll a, ll n, const ll m = MOD) {
ll r = 1;
rep(i, 64) {
if (n & (1LL << i)) r *= a;
chmod(r, m);
a *= a;
chmod(a, m);
}
return r;
}
inline ll inv(const ll n, const ll m = MOD) {
ll a = n, b = m, x = 1, y = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
x -= t * y;
swap(x, y);
}
return modulo(x, m);
}
#pragma endregion
signed main() {
ll N, S, T;
cin >> N >> S >> T;
ll A[N], sig = 1;
rep(i, N) cin >> A[i];
if (S < T) swap(S, T), sig = -1;
if ((S - T) & 1) {
if (N & 1) {
ll s = 0;
rep(i, N / 2 + (sig == 1)) s += A[(i + (S + T) / 2) % N];
ll a = accumulate(A, A + N, 0LL);
cout << sig * (s - (a - s)) << rt;
} else {
ll s = 0;
rep(i, N / 2) s += A[(i + (S + T) / 2) % N];
ll a = accumulate(A, A + N, 0LL);
cout << sig * (s - (a - s)) << rt;
}
} else {
if (N & 1) {
ll s = 0;
rep(i, N / 2 + (sig == 1)) s += A[(i + (S + T) / 2 - (sig == 1)) % N];
ll a = accumulate(A, A + N, 0LL);
cout << sig * (s - (a - s)) << rt;
} else {
ll s = 0;
rep(i, N / 2) s += A[(i + (S + T) / 2 - 1) % N];
ll a = accumulate(A, A + N, 0LL);
ll s2 = 0;
rep(i, N / 2) s2 += A[(i + (S + T) / 2) % N];
cout << (sig == 1 ? max(s - (a - s), s2 - (a - s2)) : -min(s - (a - s), s2 - (a - s2)))
<< rt;
}
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0