#969497 (C++17) No.2716 Falcon Method

• 問題: No.2716 Falcon Method
• ユーザー: TKTYI
• 提出日時: 2024-04-05 21:36:17
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 444 ms / 2,000 ms
• コード長: 3,123 bytes
• コンパイル時間: 4,966 ms
• コンパイル使用メモリ: 272,132 KB
• 実行使用メモリ: 9,920 KB
• 最終ジャッジ日時: 2024-04-05 21:36:37
• 合計ジャッジ時間: 11,642 ms
• ジャッジサーバーID （参考情報）: judge12 / judge14

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 6,676 KB
testcase_01	AC	2 ms; 6,676 KB
testcase_02	AC	2 ms; 6,676 KB
testcase_03	AC	2 ms; 6,676 KB
testcase_04	AC	2 ms; 6,676 KB
testcase_05	AC	2 ms; 6,676 KB
testcase_06	AC	5 ms; 6,676 KB
testcase_07	AC	4 ms; 6,676 KB
testcase_08	AC	5 ms; 6,676 KB
testcase_09	AC	4 ms; 6,676 KB
testcase_10	AC	5 ms; 6,676 KB
testcase_11	AC	357 ms; 9,560 KB
testcase_12	AC	267 ms; 9,572 KB
testcase_13	AC	206 ms; 9,720 KB
testcase_14	AC	361 ms; 8,576 KB
testcase_15	AC	226 ms; 9,392 KB
testcase_16	AC	280 ms; 8,576 KB
testcase_17	AC	329 ms; 8,876 KB
testcase_18	AC	420 ms; 9,116 KB
testcase_19	AC	295 ms; 8,576 KB
testcase_20	AC	254 ms; 9,260 KB
testcase_21	AC	316 ms; 8,704 KB
testcase_22	AC	415 ms; 9,920 KB
testcase_23	AC	402 ms; 9,920 KB
testcase_24	AC	444 ms; 9,920 KB
testcase_25	AC	2 ms; 6,676 KB
testcase_26	AC	2 ms; 6,676 KB
testcase_27	AC	379 ms; 9,920 KB
testcase_28	AC	377 ms; 9,920 KB

ソースコード

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vvvi> vvvvi;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef pair<ll,ll> pi;
typedef pair<ll,pi> ppi;
typedef pair<ll,ppi> pppi;
typedef pair<ll,pppi> ppppi;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) (UB(A,x)-LB(A,x))
#define sz(c) ((ll)(c).size())
/*
#include<boost/multiprecision/cpp_int.hpp>
namespace mp=boost::multiprecision;
using Bint=mp::cpp_int;
*/
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>v){REP(i,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
ld dist(ld x1,ld y1,ld x2,ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}
vi fast_mod_convolution(vi&a,vi&b,ll mod){
  const ll m1=167772161,m2=469762049,m3=1224736769;
  const ll m1_inv_m2=inv_mod(m1,m2);
  const ll m12_inv_m3=inv_mod(m1*m2,m3);
  const ll m12_mod=m1*m2%mod;
  auto x=convolution<m1>(a,b);
  auto y=convolution<m2>(a,b);
  auto z=convolution<m3>(a,b);
  vector<ll>ret(sz(a)+sz(b)-1);
  REP(i,sz(ret)){
    ll v1=(y[i]-x[i])*m1_inv_m2%m2;if(v1<0)v1+=m2;
    ll v2=(z[i]-(x[i]+m1*v1)%m3)*m12_inv_m3%m3;if(v2<0)v2+=m3;
  	ret[i]=(x[i]+m1*v1+m12_mod*v2)%mod;
  }
  return ret;
}
const ld EPS=1e-8;
//*
using mint=modint998244353;
const ll mod=998244353;
//*/
/*
using mint=modint1000000007;
const ll mod=1000000007;
//*/
//using mint=modint;
//*
typedef vector<mint> vm;
typedef vector<vm> vvm;
typedef vector<vvm> vvvm;
typedef vector<vvvm> vvvvm;
ostream&operator<<(ostream&os,mint a){os<<a.val();return os;}
istream&operator>>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;}
//*/
int main(){
  ll N,Q;cin>>N>>Q;
  string S;cin>>S;
  vi A(2*N+1),B(2*N+1);
  REP(i,N){
  	A[i+1]=A[i];
  	B[i+1]=B[i];
  	if(S[i]=='R')B[i+1]++;
  	else A[i+1]++;
  }
  REP(i,N)A[i+N+1]=A[i+1]+A[N];
  REP(i,N)B[i+N+1]=B[i+1]+B[N];
  while(Q--){
  	ll H,W,P;cin>>H>>W>>P;
  	ll l=-1,r=1e10;
  	while(r-l>1){
  		ll m=(l+r)/2;
  		//m回先にどこへ...
  		ll x=m/N*A[N]+A[P+m%N]-A[P],y=m/N*B[N]+B[P+m%N]-B[P];
  		if(x>=H||y>=W)r=m;else l=m;
  	}
  	cout<<(P+r)%N<<endl;
  }
  return 0;
}