結果
問題 | No.1034 テスターのふっぴーさん |
ユーザー |
![]() |
提出日時 | 2020-04-24 21:47:34 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 6,049 bytes |
コンパイル時間 | 1,166 ms |
コンパイル使用メモリ | 112,504 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-10-15 02:40:58 |
合計ジャッジ時間 | 2,017 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 30 |
ソースコード
//#include <bits/stdc++.h>#include <iostream>#include <cstdio>#include <vector>#include <map>#include <unordered_map>#include <set>#include <tuple>#include <string>#include <algorithm>#include <functional>#include <queue>#include <stack>#include <cmath>#include <bitset>using namespace std;using ll=long long;using intpair=pair<int,int>;using intpv=vector<intpair>;using llpair=pair<ll,ll>;using llpv=vector<llpair>;using intvec=vector<int>;using llvec=vector<ll>;using intq=queue<int>;using llq=queue<ll>;using intmat=vector<intvec>;using llmat=vector<llvec>;using pairmat=vector<llpv>;#define matrix(T) vector<vector<T>>#define PI 3.141592653589793#define INTINF 1<<30#define LLINF 1LL<<60#define MPRIME 1000000007#define pqueue priority_queue#define pushb push_back#define all(name) name.begin(),name.end()#define rall(name) name.rbegin(),name.rend()#define ABS(x) ( (x)>0 ? (x) : -(x) )#define gsort(vbeg,vend) sort(vbeg,vend,greater<>())#define init(v) for(auto &a: v) cin>>a#define out(n) cout<<n<<endltemplate<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b;return true;}return false;}template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}ll GCD(ll a, ll b) { //最大公約数if(a==0||b==0) return 0;if(a<b) swap(a,b);ll tmp = a%b;while(tmp!=0) {a = b;b = tmp;tmp = a%b;}return b;}ll binpow(ll a, ll ex, ll p) { //繰り返し二乗法ll result=1LL;while(ex>0) {if(ex&1) result=result*a%p;ex>>=1;a=a*a%p;}return result;}ll Fact(ll x, ll p) { //階乗ll f=1;for(ll i=2; i<=x; i++) {f*=i;f%=p;}return f;}ll nPr(ll n, ll r) {if(n<r) return 0;ll result=1LL;for(ll i=0; i<r; i++) result*=n-i;return result;}ll nPrP(ll n, ll r, ll p) { // mod pにおけるnPrif(n<r) return 0;ll result=1LL;for(int i=0; i<r; i++) {result*=n-i;result%=p;}return result;}ll nCr(ll n, ll r) {if (n == r) { return 1; }if (r > n) { return 0; }if (r > n / 2) { r = n - r; }if (n == 0) { return 0; }if (r == 0) { return 1; }if (r == 1) { return n; }double result = 1;for (double i = 1; i <= r; i++) {result *= (n - i + 1) / i;}return (ll)result;}llvec fact,inv,factinv;void prenCrP(ll n, ll p) {fact.resize(n+1);inv.resize(n+1);factinv.resize(n+1);fact[0]=fact[1]=inv[1]=factinv[0]=factinv[1]=1LL;for(ll i=2LL; i<=n; i++) {fact[i]=fact[i-1]*i%p;inv[i]=p-inv[p%i]*(p/i)%p;factinv[i]=factinv[i-1]*inv[i]%p;}}ll nCrP(ll n, ll r, ll p) { // mod pにおけるnCrif (r > n) return 0;return fact[n]*factinv[r]%p*factinv[n-r]%p;}llvec fact2,inv2,factinv2;void prenCrP2(ll n, ll r, ll p) { // nがバカでかいときに使う, 計算量はr依存fact2.resize(r+1);inv2.resize(r+1);factinv2.resize(r+1);fact2[0]=n%p, fact2[1]=n%p*(n-1)%p;inv2[1]=factinv2[0]=factinv2[1]=1LL;for(ll i=2LL; i<=r; i++) {fact2[i]=fact2[i-1]*(n-i)%p;inv2[i]=p-inv2[p%i]*(p/i)%p;factinv2[i]=factinv2[i-1]*inv2[i]%p;}}ll nCrP2(ll r, ll p) {return fact2[r-1]*factinv2[r]%p;}int DigitNum(ll n) { //桁数int digit=0;ll wari=1LL;while(n/wari) {digit++;wari*=10;}return digit;}bool IsPrime(ll num) { //素数判定if (num < 2) return false;else if (num == 2) return true;else if (num % 2 == 0) return false; // 偶数はあらかじめ除くdouble sqrtNum = sqrt(num);for (ll i = 3; i <= sqrtNum; i += 2){if (num % i == 0){// 素数ではないreturn false;}}// 素数であるreturn true;}vector<ll> Divisor(ll x) { // 約数列挙vector<ll> result;ll i=1LL;for( ; i*i<x; i++) {if(x%i) continue;result.push_back(i);result.push_back(x/i);}if(i*i==x&&x%i==0)result.push_back(i);sort(result.begin(),result.end());return result;}vector<llpair> PrimeFact(ll x) { // 素因数分解 {素因数,指数}vector<llpair> result;ll ex=0LL;if(x%2==0) {while(x%2==0) {x/=2;ex++;}result.push_back({2,ex});}for(ll i=3LL; i*i<=x; i+=2) {if(x%i) continue;ex=0LL;while(x%i==0) {x/=i;ex++;}result.push_back({i,ex});}if(x!=1) result.push_back({x,1});return result;}bool Palind(string s) { //回文判定return s == string(s.rbegin(), s.rend());}struct Union_Find {vector<int> parent; //親vector<int> num; //根としたときの木サイズUnion_Find(int N) : parent(N),num(N,1) {for(int i=0; i<N; i++) {parent[i]=i;}}int root(int x) {if(parent[x]==x) return x;return parent[x]=root(parent[x]);}void merge(int x, int y) {int xrt=root(x);int yrt=root(y);if(xrt==yrt) return;parent[xrt]=yrt;num[yrt]+=num[xrt];}bool same(int x, int y) {return root(x)==root(y);}int size(int x) {return num[root(x)];}};struct Ford_Fulkerson {struct _edge {int next;int rev; // 逆辺の_edgeがG[next][rev]に存在するll cap;};vector<vector<_edge>> G;vector<bool> used;Ford_Fulkerson(int N) : G(N),used(N) {}void add_edge(int from, int to, ll cap) {G[from].push_back((_edge){to,(int)G[to].size(),cap});G[to].push_back((_edge){from,(int)G[from].size()-1,0});}ll f_dfs(int s, int t, ll flow) {if(s==t) return flow;used[s]=true;for(_edge &ed : G[s]) {if(!used[ed.next] && ed.cap>0) {ll captmp=f_dfs(ed.next,t,min(flow,ed.cap));if(captmp>0) {ed.cap-=captmp;G[ed.next][ed.rev].cap+=captmp;return captmp;}}}return 0LL;}ll max_flow(int s, int t) {ll res=0LL;while(1) { // 最大になるまで繰り返しused.assign(used.size(),false);ll restmp=f_dfs(s,t,LLINF);if(restmp==0) return res;res+=restmp;}}};int Q;void input() {cin>>Q;}void solve() {for(int i=0; i<Q; i++) {ll N,I,J; cin>>N>>I>>J;ll M=min(min(I,N-1-I),min(J,N-1-J));ll res=(N-M)*M*4;I-=M; J-=M;if(J>=I) res+=I+J;else res+=(N-2*M-1)*4-(I+J);cout<<res<<endl;}}int main() {input();solve();}