#1015800 (C++23(gcc13)) No.571 3人兄弟（その２）

提出ソース
結果

問題	No.571 3人兄弟（その２）
ユーザー	kazuppa
提出日時	2024-10-06 11:57:41
言語	C++23(gcc13) (gcc 13.2.0 + boost 1.83.0)
結果	AC
実行時間	2 ms / 2,000 ms
コード長	10,550 bytes
コンパイル時間	10,270 ms
コンパイル使用メモリ	352,628 KB
実行使用メモリ	6,820 KB
最終ジャッジ日時	2024-10-06 11:57:52
合計ジャッジ時間	10,477 ms
ジャッジサーバーID （参考情報）	judge3 / judge4
このコードへのチャレンジ
（要ログイン）
テストケース

テストケース表示
入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 6,820 KB
testcase_01	AC	2 ms 6,820 KB
testcase_02	AC	2 ms 6,820 KB
testcase_03	AC	1 ms 6,816 KB
testcase_04	AC	1 ms 6,816 KB
testcase_05	AC	2 ms 6,816 KB
testcase_06	AC	2 ms 6,820 KB
testcase_07	AC	2 ms 6,816 KB
testcase_08	AC	2 ms 6,820 KB
testcase_09	AC	2 ms 6,820 KB
testcase_10	AC	2 ms 6,816 KB
testcase_11	AC	2 ms 6,820 KB
testcase_12	AC	2 ms 6,820 KB
testcase_13	AC	2 ms 6,820 KB
権限があれば一括ダウンロードができます
ソースコード

raw source code
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#include <atcoder/all>
using namespace atcoder;
using mints=modint998244353;
#pragma GCC target ("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define rep(i,a,b) for(it i=(it)(a);i<=(it)b;i++)
#define nrep(i,a,b) for(it i=(it)(a);i>=(it)b;i--)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define moda 998244353LL
#define modb 1000000007LL
#define gyaku 166374059LL
#define dai 2500000000000000000LL
#define sho -dai
#define aoi 1e+18
#define tyu 2500000000
#define giri 1000000000
#define en 3.14159265358979
#define eps 1e-14
#define endl '\n'
#define yn(x) cout<<(x?"Yes\n":"No\n");
#define YN(x) cout<<(x?"YES\n":"NO\n");
#define ci(x) cin>>x;
#define fi(x) cout<<fixed<<setprecision(x);
using it=long long;
using itn=int;
using un=unsigned long long;
using db=long double;
using st=string;
using ch=char;
using bo=bool;
using P=pair<it,it>;
using ip=pair<int,int>;
using mint=modint;
using minto=modint1000000007;
using vi=vector<it>;
using ivi=vector<int>;
using vd=vector<db>;
using vs=vector<st>;
using vc=vector<ch>;
using vb=vector<bo>;
using vp=vector<P>;
using ivp=vector<ip>;
using vm=vector<mint>;
using vms=vector<mints>;
using vmo=vector<minto>;
using sp=set<P>;
using isp=set<ip>;
using ss=set<st>;
//using sc=set<ch>;
using si=set<it>;
using isi=set<int>;
using svi=set<vi>;
using vvi=vector<vi>;
using ivvi=vector<ivi>;
using vvd=vector<vd>;
using vvs=vector<vs>;
using vvb=vector<vb>;
using vvc=vector<vc>;
using vvp=vector<vp>;
using ivvp=vector<ivp>;
using vvm=vector<vm>;
using vvms=vector<vms>;
using vvmo=vector<vmo>;
using vsi=vector<si>;
using ivsi=vector<isi>;
using vsp=vector<sp>;
using ivsp=vector<isp>;
using vvsi=vector<vsi>;
using ivvsi=vector<ivsi>;
using vvsp=vector<vsp>;
using ivvsp=vector<ivsp>;
using vvvi=vector<vvi>;
using ivvvi=vector<ivvi>;
using vvvd=vector<vvd>;
using vvvb=vector<vvb>;
using vvvm=vector<vvm>;
using vvvms=vector<vvms>;
using vvvmo=vector<vvmo>;
using vvvvi=vector<vvvi>;
using ivvvvi=vector<ivvvi>;
const it dx[4]={0,1,0,-1};
const it dy[4]={1,0,-1,0};

template<typename T>
void scan(vector<T> &a){
  rep(i,0,a.size()-1)cin>>a[i];
}

template<typename T>
void scan(vector<T> &a,vector<T>&b){
  rep(i,0,a.size()-1)cin>>a[i]>>b[i];
}

template<typename T>
void scan(vector<pair<T,T>> &a){
  rep(i,0,a.size()-1)cin>>a[i].first>>a[i].second;
}

template<typename T>
void dec(vector<T> &a){
  rep(i,0,a.size()-1)a[i]--;
}

it gcda(it a,it b){
  if(!a||!b){
    return max(a,b);
  }
  while(a%b&&b%a){
    if(a>b)a%=b;
    else b%=a;
  }
  return min(a,b);
}

it lcma(it a,it b){
  return a/gcda(a,b)*b;
}

bo su(ch c){return ('0'<=c&&c<='9');}

const int MOD = modb;
vi fact, fact_inv, inv;
/*  init_nCk :二項係数のための前処理
    計算量:O(n)
*/
void init_nCk(int SIZE){
  fact.resize(SIZE+5);
  fact_inv.resize(SIZE+5);
  inv.resize(SIZE+5);
  fact[0]=fact[1]=1;
  fact_inv[0]=fact_inv[1]=1;
  inv[1]=1;
  rep(i,2,SIZE+4){
    fact[i]=fact[i-1]*i%MOD;
    inv[i]=MOD-inv[MOD%i]*(MOD/i)%MOD;
    fact_inv[i]=fact_inv[i-1]*inv[i]%MOD;
  }
}
/*  nCk :MODでの二項係数を求める(前処理 int_nCk が必要)
    計算量:O(1)
*/
int nCk(int n, int k){
  assert(!(n<k));
  assert(!(n<0||k<0));
  return fact[n]*(fact_inv[k]*fact_inv[n-k]%MOD)%MOD;
}

struct dsu1{
  ivi par,siz;
  void init(int n){
    rep(i,0,n-1)par.emplace_back(i);
    rep(i,0,n-1)siz.emplace_back(1);
  }
  int leader(int u){
    if(par[u]==u)return u;
    return par[u]=leader(par[u]);
  }
  void merge(int u,int v){
    int ru=leader(u),rv=leader(v);
    if(ru==rv)return;
    if(ru>rv)swap(ru,rv);
    siz[ru]+=siz[rv];
    par[rv]=ru;
  }
  bool same(int u,int v){
    return leader(u)==leader(v);
  }
  int size(int u){
    return siz[leader(u)];
  }
};

struct dsu2{
  ivvi par,siz;int h,w;
  void init(int x,int y){
    h=x,w=y;par.resize(h),siz.resize(h);
    rep(i,0,h-1)
      rep(j,0,w-1)par[i].emplace_back(i*w+j);
    rep(i,0,h-1)
      rep(j,0,w-1)siz[i].emplace_back(1);
  }
  int leader(int x,int y){
    if(par[x][y]==x*par[0].size()+y)return x*w+y;
    return par[x][y]=leader(par[x][y]/w,par[x][y]%w);
  }
  void merge(int a,int b,int c,int d){
    int ru=leader(a,b),rv=leader(c,d);
    if(ru==rv)return;
    if(size(ru/w,ru%w)<size(rv/w,ru%w))swap(ru,rv);
    siz[ru/w][ru%w]+=siz[rv/w][rv%w];
    par[rv/w][rv%w]=ru;
  }
  bool same(int a,int b,int c,int d){
    return leader(a,b)==leader(c,d);
  }
  int size(int a,int b){
    int ru=leader(a,b);
    return siz[ru/w][ru%w];
  }
};

/*総和をもとめるセグ木
struct nod{
  it val;
  int siz;
  nod(int v=0,int s=0):val(v),siz(s){}
};

nod op(nod a,nod b){return nod(a.val+b.val,a.siz+b.siz);}
nod e(){return nod(0,0);}

struct act{
  int a;
  act(int e=0):a(e){}
};

nod mapping(act f,nod x){return nod(f.a+x.val,x.siz);}
act comp(act f,act g){return act(f.a+g.a);}
act id(){return act(0);}
*/

random_device seed_gen;
mt19937_64 engine(seed_gen());
un randint(un l,un r){return l+engine()%(r-l+1);}

bo wa(st &s,st &t){
  rep(i,0,s.size()-1)
    if(s[i]!='.'&&t[i]!='.')return false;
  rep(i,0,s.size()-1)
    if(s[i]=='P'&&t[i]!='P')return false;
  return true;
}

int v,n;ivvi gs(30,ivi(30)),gt(30,ivi(30));
int sc(vb &idou){
  st stringu="U",stringd="D",stringl="L",stringr="R";
  while((int)stringu.size()<v*2)stringu+='.';
  while((int)stringd.size()<v*2)stringd+='.';
  while((int)stringl.size()<v*2)stringl+='.';
  while((int)stringr.size()<v*2)stringr+='.';
  int x=-1,y;ivvi s=gs,t=gt;
  rep(i,0,n-1){
    for(int j=(idou[i]?0:n-1);(idou[i]?j<n:j>=0);(idou[i]?j++:j--))
      if(s[i][j]==1){
        x=i,y=j;
        break;
      }
    if(x!=-1)break;
  }
  int score=0,noko=0;ivi left(n,-1);
  while(true){
    vs kore;
    rep(i,0,n-1)
      for(int j=(idou[i]?0:n-1);(idou[i]?j<n:j>=0);(idou[i]?j++:j--)){
        if(t[i][j]&&noko){
          if(j==0&&left[noko]==-1||j==n-1&&left[noko]==1){
            left[noko]=-left[noko];
            st s="";
            while((int)s.size()<v*2)s+='.';
            s[noko]='R';
            rep(j,0,1)kore.push_back(s);
          }
          while(x>i){
            x--;
            kore.push_back(stringu);
          }
          while(x<i){
            x++;
            kore.push_back(stringd);
          }
          while(y>j+left[noko]){
            y--;
            kore.push_back(stringl);
          }
          while(y<j+left[noko]){
            y++;
            kore.push_back(stringr);
          }
          st f="";
          while((int)f.size()<v*2)f+='.';
          f[v+noko]='P';
          kore.push_back(f);
          noko--;
          t[i][j]=0;
        }
        if(s[i][j]&&noko<v-1){
          noko++;
          if(j==0&&left[noko]==-1||j==n-1&&left[noko]==1){
            left[noko]=-left[noko];
            st s="";
            while((int)s.size()<v*2)s+='.';
            s[noko]='R';
            rep(j,0,1)kore.push_back(s);
          }
          while(x>i){
            x--;
            kore.push_back(stringu);
          }
          while(x<i){
            x++;
            kore.push_back(stringd);
          }
          while(y>j+left[noko]){
            y--;
            kore.push_back(stringl);
          }
          while(y<j+left[noko]){
            y++;
            kore.push_back(stringr);
          }
          st f="";
          while((int)f.size()<v*2)f+='.';
          f[v+noko]='P';
          kore.push_back(f);
          s[i][j]=0;
        }
      }
    rep(i,0,kore.size()-2){
      if(wa(kore[i],kore[i+1])){
        rep(j,0,v*2-1)
          if(kore[i+1][j]!='.')kore[i][j]=kore[i+1][j];
        kore.erase(kore.begin()+i+1);
        i--;
      }
    }
    score+=(int)kore.size();
    bo ok=true;
    rep(i,0,n-1)
      rep(j,0,n-1)
        if(s[i][j]||t[i][j])ok=false;
    if(ok)break;
    kore.clear();
    nrep(i,n-1,0)
      for(int j=(idou[i]?0:n-1);(idou[i]?j<n:j>=0);(idou[i]?j++:j--)){
        if(t[i][j]&&noko){
          if(j==0&&left[noko]==-1||j==n-1&&left[noko]==1){
            left[noko]=-left[noko];
            st s="";
            while((int)s.size()<v*2)s+='.';
            s[noko]='R';
            rep(j,0,1)kore.push_back(s);
          }
          while(x>i){
            x--;
            kore.push_back(stringu);
          }
          while(x<i){
            x++;
            kore.push_back(stringd);
          }
          while(y>j+left[noko]){
            y--;
            kore.push_back(stringl);
          }
          while(y<j+left[noko]){
            y++;
            kore.push_back(stringr);
          }
          st f="";
          while((int)f.size()<v*2)f+='.';
          f[v+noko]='P';
          kore.push_back(f);
          noko--;
          t[i][j]=0;
        }
        if(s[i][j]&&noko<v-1){
          noko++;
          if(j==0&&left[noko]==-1||j==n-1&&left[noko]==1){
            left[noko]=-left[noko];
            st s="";
            while((int)s.size()<v*2)s+='.';
            s[noko]='R';
            rep(j,0,1)kore.push_back(s);
          }
          while(x>i){
            x--;
            kore.push_back(stringu);
          }
          while(x<i){
            x++;
            kore.push_back(stringd);
          }
          while(y>j+left[noko]){
            y--;
            kore.push_back(stringl);
          }
          while(y<j+left[noko]){
            y++;
            kore.push_back(stringr);
          }
          st f="";
          while((int)f.size()<v*2)f+='.';
          f[v+noko]='P';
          kore.push_back(f);
          s[i][j]=0;
        }
      }
    rep(i,0,kore.size()-2){
      if(wa(kore[i],kore[i+1])){
        rep(j,0,v*2-1)
          if(kore[i+1][j]!='.')kore[i][j]=kore[i+1][j];
        kore.erase(kore.begin()+i+1);
        i--;
      }
    }
    score+=(int)kore.size();
    ok=true;
    rep(i,0,n-1)
      rep(j,0,n-1)
        if(s[i][j]||t[i][j])ok=false;
    if(ok)break;
  }
  return score;
}

ch jun(ip &a,ip &b){
  if(a.first!=b.first)return (a.first>b.first?'>':'<');
  return (a.second<b.second?'>':'<');
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  ivp jou(3);scan(jou);
  ch a=jun(jou[0],jou[1]),b=jun(jou[0],jou[2]),c=jun(jou[1],jou[2]);
  if(a=='<'&&b=='<'&&c=='<')cout<<"C\nB\nA";
  if(a=='<'&&b=='<'&&c=='>')cout<<"B\nC\nA";
  if(a=='<'&&b=='>'&&c=='>')cout<<"B\nA\nC";
  if(a=='>'&&b=='<'&&c=='<')cout<<"C\nA\nB";
  if(a=='>'&&b=='>'&&c=='<')cout<<"A\nC\nB";
  if(a=='>'&&b=='>'&&c=='>')cout<<"A\nB\nC";
  cout<<endl;
}
yukicoder

結果

テストケース

ソースコード
