結果
問題 | No.2000 Distanced Characters |
ユーザー |
|
提出日時 | 2022-07-08 21:33:55 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 97 ms / 2,000 ms |
コード長 | 2,876 bytes |
コンパイル時間 | 6,677 ms |
コンパイル使用メモリ | 317,068 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-12-28 04:16:00 |
合計ジャッジ時間 | 6,905 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 13 |
ソースコード
#if !__INCLUDE_LEVEL__#include __FILE__int main(){string S;cin >> S;ll N = S.size();vvl D(26,vl(26));rep(i,26){rep(j,26)cin >>D[i][j];}vvl X(26,vl(26,1));map<int,int> minj;rrep(i,N){int a = alpN(S[i]);rep(b,26){if(minj.count(b)==0)continue;int j = minj[b];if(D[a][b]>j-i)X[a][b]=0;}minj[a]=i;}rep(i,26){rep(j,26){if(X[i][j])cout << "Y ";else cout << "N ";}cout << endl;}}#else#include <bits/stdc++.h>#include <atcoder/all>using namespace std;using namespace atcoder;#define rep(i, n) for(int i = 0; i < n; i++)#define rrep(i, n) for(int i = n-1; i >= 0; i--)#define range(i, m, n) for(int i = m; i < n; i++)#define fore(i,a) for(auto &i:a)#define all(v) v.begin(), v.end()#define rall(v) v.rbegin(), v.rend()#define Sum(v) accumulate(all(v),ll(0))#define minv(v) *min_element(all(v))#define maxv(v) *max_element(all(v))typedef long long ll;typedef vector<ll> vl;typedef vector<vector<ll>> vvl;const ll INF = 1e16;const ll MOD1 = 1000000007;const ll MOD2 = 998244353;template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }ll SN(char s){return ll(s-'0');}ll SN(string s){return stoll(s);}int alpN(char s){return int(s-'a');}int AlpN(char s){return int(s-'A');}using Graph = vector<vector<ll>>;using GraphCost = vector<vector<pair<ll,ll>>>;using mint = modint;using mint1 = modint1000000007;using mint2 = modint998244353;using pll = pair<long long, long long>;template <class T>ostream &operator<<(ostream &o,const vector<T>&v){for(int i=0;i<(int)v.size();i++)o<<(i>0?" ":"")<<v[i];return o;}//vector空白区切り出力ostream& operator<<(ostream& os, const mint1& N) {return os << N.val();}//mint出力。デフォはmint1ostream& operator<<(ostream& os, const mint2& N) {return os << N.val();}template<class T> bool contain(const std::string& s, const T& v) {return s.find(v) != std::string::npos;}ll max(int x,ll y){return max((ll)x,y);}ll max(ll x,int y){return max(x,(ll)y);}ll min(int x,ll y){return min((ll)x,y);}ll min(ll x,int y){return min(x,(ll)y);}template <typename T>struct edge {int src, to;T cost;edge(int to, T cost) : src(-1), to(to), cost(cost) {}edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}edge& operator=(const int& x) {to = x;return *this;}operator int() const { return to; }};template <typename T>using Edges = vector<edge<T> >;template <typename T>using WeightedGraph = vector<Edges<T> >;using UnWeightedGraph = vector<vector<int> >;template <typename T>using Matrix = vector<vector<T> >;#endif