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

• 問題: No.2716 Falcon Method
• ユーザー: 👑 binap
• 提出日時: 2024-04-05 22:39:35
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 322 ms / 2,000 ms
• コード長: 2,136 bytes
• コンパイル時間: 4,121 ms
• コンパイル使用メモリ: 264,312 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-10-01 02:47:27
• 合計ジャッジ時間: 9,324 ms
• ジャッジサーバーID （参考情報）: judge5 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	2 ms; 5,248 KB
testcase_02	AC	2 ms; 5,248 KB
testcase_03	AC	2 ms; 5,248 KB
testcase_04	AC	2 ms; 5,248 KB
testcase_05	AC	2 ms; 5,248 KB
testcase_06	AC	4 ms; 5,248 KB
testcase_07	AC	4 ms; 5,248 KB
testcase_08	AC	4 ms; 5,248 KB
testcase_09	AC	4 ms; 5,248 KB
testcase_10	AC	4 ms; 5,248 KB
testcase_11	AC	283 ms; 5,248 KB
testcase_12	AC	213 ms; 5,248 KB
testcase_13	AC	169 ms; 5,248 KB
testcase_14	AC	258 ms; 5,248 KB
testcase_15	AC	177 ms; 5,248 KB
testcase_16	AC	215 ms; 5,248 KB
testcase_17	AC	253 ms; 5,248 KB
testcase_18	AC	316 ms; 5,248 KB
testcase_19	AC	219 ms; 5,248 KB
testcase_20	AC	173 ms; 5,248 KB
testcase_21	AC	232 ms; 5,248 KB
testcase_22	AC	313 ms; 5,376 KB
testcase_23	AC	306 ms; 5,248 KB
testcase_24	AC	322 ms; 5,376 KB
testcase_25	AC	1 ms; 5,248 KB
testcase_26	AC	1 ms; 5,248 KB
testcase_27	AC	306 ms; 5,376 KB
testcase_28	AC	307 ms; 5,248 KB

ソースコード

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<vector<int>> vvi;
typedef vector<vector<long long>> vvl;
typedef long double ld;
typedef pair<int, int> P;

ostream& operator<<(ostream& os, const modint& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}

template<typename T> void chmin(T& a, T b){a = min(a, b);}
template<typename T> void chmax(T& a, T b){a = max(a, b);}

int main(){
	int n, q;
	cin >> n >> q;
	string s;
	cin >> s;
	vector<int> r(n + 1);
	vector<int> d(n + 1);
	rep(i, n){
		r[i + 1] = r[i];
		d[i + 1] = d[i];
		if(s[i] == 'R') r[i + 1]++;
		if(s[i] == 'D') d[i + 1]++;
	}
	auto calc = [&](long long p, long long q){
		long long r_cnt = 0, d_cnt = 0;
		r_cnt += r[(p + q) % n] + r[n] * ((p + q) / n);
		r_cnt -= r[p % n] + r[n] * (p / n);
		d_cnt += d[(p + q) % n] + d[n] * ((p + q) / n);
		d_cnt -= d[p % n] + d[n] * (p / n);
		return make_pair(r_cnt, d_cnt);
	};
	rep(_, q){
		int h, w, p;
		cin >> h >> w >> p;
		long long ok = 0, ng = 2002002002;
		while(ng - ok > 1){
			long long mid = (ng + ok) / 2;
			auto [r_cnt, d_cnt] = calc(p, mid);
			if(r_cnt < w and d_cnt < h) ok = mid;
			else ng = mid;
		}
		p += ng;
		p %= n;
		cout << p << "\n";
	}
	return 0;
}