結果
問題 | No.1034 テスターのふっぴーさん |
ユーザー |
![]() |
提出日時 | 2020-04-24 22:44:06 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 4,232 bytes |
コンパイル時間 | 2,201 ms |
コンパイル使用メモリ | 180,540 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-10-15 03:16:32 |
合計ジャッジ時間 | 2,908 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 30 |
ソースコード
#ifdef LOCAL#define _GLIBCXX_DEBUG#define __clock__#else#pragma GCC optimize("Ofast")#endif#include<bits/stdc++.h>using namespace std;using ll = long long;using ld = long double;using VI = vector<ll>;using VV = vector<VI>;using VS = vector<string>;using PII = pair<ll, ll>;// tourist settemplate <typename A, typename B>string to_string(pair<A, B> p);template <typename A, typename B, typename C>string to_string(tuple<A, B, C> p);template <typename A, typename B, typename C, typename D>string to_string(tuple<A, B, C, D> p);string to_string(const string& s) {return '"' + s + '"';}string to_string(const char* s) {return to_string((string) s);}string to_string(bool b) {return (b ? "true" : "false");}string to_string(vector<bool> v) {bool first = true;string res = "{";for (int i = 0; i < static_cast<int>(v.size()); i++) {if (!first) {res += ", ";}first = false;res += to_string(v[i]);}res += "}";return res;}template <size_t N>string to_string(bitset<N> v) {string res = "";for (size_t i = 0; i < N; i++) {res += static_cast<char>('0' + v[i]);}return res;}template <typename A>string to_string(A v) {bool first = true;string res = "{";for (const auto &x : v) {if (!first) {res += ", ";}first = false;res += to_string(x);}res += "}";return res;}template <typename A, typename B>string to_string(pair<A, B> p) {return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";}template <typename A, typename B, typename C>string to_string(tuple<A, B, C> p) {return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";}template <typename A, typename B, typename C, typename D>string to_string(tuple<A, B, C, D> p) {return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";}void debug_out() { cerr << '\n'; }template <typename Head, typename... Tail>void debug_out(Head H, Tail... T) {cerr << " " << to_string(H);debug_out(T...);}#ifdef LOCAL#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)#else#define debug(...) 42#endif// tourist set endtemplate<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 (b<a) { a=b; return 1; } return 0; }#define FOR(i,a,b) for(ll i=(a);i<(b);++i)#define rep(i,b) FOR(i, 0, b)#define ALL(v) (v).begin(), (v).end()#define p(s) cout<<(s)<<'\n'#define p2(s, t) cout << (s) << " " << (t) << '\n'#define br() p("")#define pn(s) cout << (#s) << " " << (s) << '\n'#define SZ(x) ((int)(x).size())#define SORT(A) sort(ALL(A))#define RSORT(A) sort(ALL(A), greater<ll>())#define MP make_pair#define p_yes() p("Yes")#define p_no() p("No")ll SUM(VI& V){return accumulate(ALL(V), 0LL);}ll MIN(VI& V){return *min_element(ALL(V));}ll MAX(VI& V){return *max_element(ALL(V));}void print_vector(VI& V){ll n = V.size();rep(i, n){if(i) cout << ' ';cout << V[i];}cout << endl;}ll gcd(ll a,ll b){if(b == 0) return a;return gcd(b,a%b);}ll lcm(ll a,ll b){ll g = gcd(a,b);return a / g * b;}// long doubleusing ld = long double;#define EPS (1e-14)#define equals(a,b) (fabs((a)-(b)) < EPS)void no(){p_no(); exit(0);}void yes(){p_yes(); exit(0);}const ll mod = 1e9 + 7;const ll inf = 1e18;const double PI = acos(-1);// 等比数列の和の公式ll touhi(ll a, ll d, ll n){ll ans = n * (2*a + (n-1)*d) / 2;return ans;}ll simulate(ll N, ll y, ll x){debug("simu", N, y, x);if(y<=x){// 右上return y+x;}else{// 左下return (N-1)*4 - (y+x);}}void solve(){ll N,I,J;cin>>N>>I>>J;ll mi = min({I,J,N-I-1,N-J-1});debug(mi);// mi枚むくll sum = 4 * touhi(N-1, -2, mi);I-=mi;J-=mi;// 最後の1周をシミュレートll t = simulate(N-2*mi, I, J);ll ans = sum+t;p(ans);}int main(){cin.tie(0);ios::sync_with_stdio(false);// inputll Q;cin>>Q;while(Q--){solve();}return 0;}