結果
問題 | No.935 う し た ぷ に き あ く ん 笑 ビ - ム |
ユーザー |
![]() |
提出日時 | 2019-11-29 22:11:45 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 4,131 bytes |
コンパイル時間 | 2,266 ms |
コンパイル使用メモリ | 195,208 KB |
最終ジャッジ日時 | 2025-01-08 06:02:20 |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 WA * 1 |
other | AC * 4 WA * 54 |
ソースコード
#include <bits/stdc++.h> #define BIT(n) (1LL << (n)) #define BITF(n, i) (((n) >> i) & 1) #define REP(i, n) for (int i = 0; i < n; i++) #define REPB(i, n) for (int i = 0; i < BIT(n); i++) #define REPS(i, x) for (int i = 1; i <= x; i++) #define REPR(i, n) for (int i = n; i >= 0; i--) #define REPZ(i, x) for (int i = 0; i <= x; i++) #define FOR(i, m, n) for (int i = m; i < n; i++) #define FORA(i, n) for (auto &&i : n) #define FORS(i, m, n) for (int i = m; i <= n; i++) using namespace std; #define PRINTARR(x, y) \ cerr << #x << "=\n"; \ for (auto itr = x; itr != y; itr++) cerr << *itr << " "; \ cerr << endl; #define PRINTARR2(x, i0, i1) \ cerr << #x << "=\n"; \ for (int ii0 = 0; ii0 < i0; ii0++) { \ for (int ii1 = 0; ii1 < i1; ii1++) cerr << x[ii0][ii1] << " "; \ cerr << endl; \ } #define DUMPOUT cerr // vector template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (T &x : vec) is >> x; return is; } // pair template <typename T, typename U> ostream &operator<<(ostream &os, pair<T, U> &pair_var) { os << "(" << pair_var.first << ", " << pair_var.second << ")"; return os; } // vector template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << "{"; REP(i, (int)vec.size()) os << vec[i] << (i + 1 == (int)vec.size() ? "" : ", "); os << "}"; return os; } // map template <typename T, typename U> ostream &operator<<(ostream &os, map<T, U> &map_var) { os << "{"; FORA(itr, map_var) { os << *itr; itr++; if (itr != map_var.end()) os << ", "; itr--; } os << "}"; return os; } // set template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) { os << "{"; FORA(itr, set_var) { os << *itr; itr++; if (itr != set_var.end()) os << ", "; itr--; } os << "}"; return os; } void dump_func() { DUMPOUT << endl; } template <class Head, class... Tail> void dump_func(Head &&head, Tail &&... tail) { DUMPOUT << head; if (sizeof...(Tail) > 0) DUMPOUT << ", "; dump_func(std::move(tail)...); } #ifdef DEBUG_ #define DEB #define DUMP(...) \ DUMPOUT << " " << string(#__VA_ARGS__) << ": " \ << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \ << " ", \ dump_func(__VA_ARGS__) #else #define DEB if (false) #define DUMP(...) #endif #define ALL(v) v.begin(), v.end() #define fst first #define snd second #define mp make_pair #define pb push_back #define epb emplace_back #define int long long #define pint pair<int, int> #define ld long double using namespace std; template <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 (a > b) { a = b; return 1; } return 0; } template <class T> using vec = std::vector<T>; template <class T> void print(const T &x) { cout << x << "\n"; } const int MOD = 1000000007, INF0 = 1061109567, INF = INF0 * INF0; const double EPS = 1e-10, PI = acos(-1.0); const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1}; #define MAXN 2020 #define MAXQ 2020 //----// int a[MAXN]; int aSum[MAXN]; int k[MAXQ]; int ans[MAXQ]; int numE[MAXN]; signed main() { cin.tie(0), ios::sync_with_stdio(false); cout << fixed << setprecision(10); int N, Q; string S; cin >> N >> S; REP(i, N) cin >> a[i]; int tmp = 0; int cnt = 0; REP(i, N) { cnt += S[i] == 'E'; numE[i + 1] = cnt; } // PRINTARR(numE, numE + N + 1); REP(i, N) { tmp += a[i]; aSum[i + 1] = tmp; } cin >> Q; REP(i, Q) cin >> k[i]; REP(i, Q) { auto itr = upper_bound(aSum, aSum + N + 1, k[i]); int pos = distance(aSum, itr) - 1; //何匹倒したか // DUMP(pos); // assert(pos != -1); print(numE[pos]); } }