結果
問題 | No.1512 作文 |
ユーザー |
![]() |
提出日時 | 2025-01-27 14:53:55 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 6,112 bytes |
コンパイル時間 | 5,627 ms |
コンパイル使用メモリ | 240,240 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2025-01-27 14:54:04 |
合計ジャッジ時間 | 7,272 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 21 WA * 17 |
ソースコード
#include <bits/stdc++.h>#include <chrono>#include <complex>#include <cmath>//#define PI M_PIusing namespace std;using ll=long long;#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 irep(i,a,b) for(int i=(int)(a);i<=(int)b;i++)#define nrep(i,a,b) for(it i=(it)(a);i>=(it)b;i--)#define inrep(i,a,b) for(int i=(int)(a);i>=(int)b;i--)#define all(v) v.begin(), v.end()#define rall(v) v.rbegin(), v.rend()#define moda 998244353LL#define modb 1000000007LL#define modc 968244353LL#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 yn(x) out(x?"Yes":"No")#define YN(x) out(x?"YES":"NO")#define fi(x) cout<<fixed<<setprecision(x);template<typename T> using pq = priority_queue<T>;template<typename T> using pqg = priority_queue<T, vector<T>, greater<T>>;template<typename T> using pairs = pair<T,T>;using it=long long;using itn=int;using un=unsigned long long;using idb=double;using db=long double;using st=string;using ch=char;using bo=bool;using P=pair<it,it>;using ip=pair<int,int>;using vi=vector<it>;using ivi=vector<int>;using ivd=vector<idb>;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 sp=set<P>;using isp=set<ip>;using ss=set<st>;using sca=set<ch>;using si=set<it>;using isi=set<int>;using svi=set<vi>;using vvi=vector<vi>;using ivvi=vector<ivi>;using ivvd=vector<ivd>;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 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 ivvvd=vector<ivvd>;using vvvd=vector<vvd>;using vvvb=vector<vvb>;using ivvvp=vector<ivvp>;using vvvvi=vector<vvvi>;using ivvvvi=vector<ivvvi>;using vvvvd=vector<vvvd>;const int dx[8]={0,1,0,-1,1,1,-1,-1};const int dy[8]={1,0,-1,0,1,-1,1,-1};st abc="abcdefghijklmnopqrstuvwxyz";st ABC="ABCDEFGHIJKLMNOPQRSTUVWXYZ";st num="0123456789";st mb="xo";st MB="XO";#include <atcoder/all>using namespace atcoder;using mints=modint998244353;using mint=modint;using minto=modint1000000007;using vm=vector<mint>;using vms=vector<mints>;using vmo=vector<minto>;using vvm=vector<vm>;using vvms=vector<vms>;using vvmo=vector<vmo>;using vvvm=vector<vvm>;using vvvms=vector<vvms>;using vvvmo=vector<vvmo>;using vvvvm=vector<vvvm>;using vvvvms=vector<vvvms>;using vvvvmo=vector<vvvmo>;using vvvvvm=vector<vvvvm>;using vvvvvms=vector<vvvvms>;using vvvvvmo=vector<vvvvmo>;using vvvvvvm=vector<vvvvvm>;using vvvvvvms=vector<vvvvvms>;using vvvvvvmo=vector<vvvvvmo>;namespace {template <typename T, typename U>ostream &operator<<(ostream &os, const pair<T, U> &p) {os << p.first << ' ' << p.second;return os;}template <typename T, typename U>istream &operator>>(istream &is, pair<T, U> &p) {is >> p.first >> p.second;return is;}template <typename T>ostream &operator<<(ostream &os, const vector<T> &v) {int s = (int)v.size();for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];return os;}template <typename T>istream &operator>>(istream &is, vector<T> &v) {for (auto &x : v) is >> x;return is;}istream &operator>>(istream &is, __int128_t &x) {string S;is >> S;x = 0;int flag = 0;for (auto &c : S) {if (c == '-') {flag = true;continue;}x *= 10;x += c - '0';}if (flag) x = -x;return is;}istream &operator>>(istream &is, __uint128_t &x) {string S;is >> S;x = 0;for (auto &c : S) {x *= 10;x += c - '0';}return is;}ostream &operator<<(ostream &os, __int128_t x) {if (x == 0) return os << 0;if (x < 0) os << '-', x = -x;string S;while (x) S.push_back('0' + x % 10), x /= 10;reverse(begin(S), end(S));return os << S;}ostream &operator<<(ostream &os, __uint128_t x) {if (x == 0) return os << 0;string S;while (x) S.push_back('0' + x % 10), x /= 10;reverse(begin(S), end(S));return os << S;}void in() {}template <typename T, class... U>void in(T &t, U &...u) {cin >> t;in(u...);}void out() { cout << '\n'; }template <typename T, class... U, char sep = ' '>void out(const T &t, const U &...u) {cout << t;if (sizeof...(u)) cout << sep;out(u...);}struct IoSetupNya {IoSetupNya() {cin.tie(nullptr);ios::sync_with_stdio(false);cout << fixed << setprecision(15);cerr << fixed << setprecision(7);}} iosetupnya;} //namespace Nyaantemplate<typename T>void dec(vector<T> &a){rep(i,0,a.size()-1)a[i]--;return;}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 outc(int h,int w,int x,int y){return (x<0||x>=h||y<0||y>=w);}/*総和をもとめるセグ木struct nod{it val;int siz;nod(it 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{it a;act(it 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);}*/#define endl '\n'template<typename T>int lod(vector<T> &a,T k){auto d=lower_bound(all(a),k);int e=distance(a.begin(),d);return e;}int main(){ios::sync_with_stdio(false);cin.tie(nullptr);int n;in(n);ivi dp(26);while(n--){st s;in(s);st t=s;sort(all(t));if(t!=s)continue;dp[s[s.size()-1]-'a']=max(dp[s[s.size()-1]-'a'],*max_element(dp.begin(),dp.begin()+s[0]-'a'+1)+(int)s.size());}out(*max_element(all(dp)));}