| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 332209 |
2020-12-01T16:56:00 Z |
ant101 |
Savez (COCI15_savez) |
C++14 |
|
186 ms |
14796 KB |
#include <iostream>
#include <algorithm>
#include <cstring>
#include <iomanip>
#include <fstream>
#include <cmath>
#include <vector>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <map>
#include <stack>
#include <queue>
#include <assert.h>
#include <limits>
#include <cstdio>
#include <complex>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
#define mp make_pair
#define f first
#define s second
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<pd> vpd;
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pf push_front
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)
const int MOD = 1e9+7; // 998244353; // = (119<<23)+1
const int MX = 2e6+5;
const ll INF = 1e18;
const ld PI = 4*atan((ld)1);
const int dx[4] = {0,1,0,-1}, dy[4] = {1,0,-1,0};
namespace io {
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
void setIO(string s = "") {
ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
// cin.exceptions(cin.failbit); // ex. throws exception when you try to read letter into int
if (sz(s)) {
setIn(s+".in");
setOut(s+".out");
} // for USACO
}
}
using namespace io;
namespace input {
template<class T> void re(complex<T>& x);
template<class T1, class T2> void re(pair<T1,T2>& p);
template<class T> void re(vector<T>& a);
template<class T, size_t SZ> void re(array<T,SZ>& a);
template<class T> void re(T& x) { cin >> x; }
void re(double& x) { string t; re(t); x = stod(t); }
void re(ld& x) { string t; re(t); x = stold(t); }
template<class Arg, class... Args> void re(Arg& first, Args&... rest) {
re(first); re(rest...);
}
template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
}
namespace output {
template<class T1, class T2> void pr(const pair<T1,T2>& x);
template<class T, size_t SZ> void pr(const array<T,SZ>& x);
template<class T> void pr(const vector<T>& x);
template<class T> void pr(const set<T>& x);
template<class T1, class T2> void pr(const map<T1,T2>& x);
template<class T> void pr(const T& x) { cout << x; }
template<class Arg, class... Args> void pr(const Arg& first, const Args&... rest) {
pr(first); pr(rest...);
}
template<class T1, class T2> void pr(const pair<T1,T2>& x) {
pr("{",x.f,", ",x.s,"}");
}
template<class T> void prContain(const T& x) {
pr("{");
bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0; // const needed for vector<bool>
pr("}");
}
template<class T, size_t SZ> void pr(const array<T,SZ>& x) { prContain(x); }
template<class T> void pr(const vector<T>& x) { prContain(x); }
template<class T> void pr(const set<T>& x) { prContain(x); }
template<class T1, class T2> void pr(const map<T1,T2>& x) { prContain(x); }
void ps() { pr("\n"); }
template<class Arg> void ps(const Arg& first) {
pr(first); ps(); // no space at end of line
}
template<class Arg, class... Args> void ps(const Arg& first, const Args&... rest) {
pr(first," "); ps(rest...); // print w/ spaces
}
}
using namespace output;
using namespace input;
ll add(ll a, ll b) {
a += b;
if(a >= MOD) {
a -= MOD;
}
return a;
}
ll sub(ll a, ll b) {
a -= b;
if(a < 0) {
a += MOD;
}
return a;
}
ll mul(ll a, ll b) {
return (a * b)%MOD;
}
void add_self(ll& a, ll b) {
a = add(a, b);
}
void sub_self(ll& a, ll b) {
a = sub(a, b);
}
void mul_self(ll& a, ll b) {
a = mul(a, b);
}
ll N;
vector<vector<ll>> adj;
vector<map<char, ll>> cchar;
ll nodes = 1;
ll dp[MX];
int main() {
// setIn("savez.in.1b");
re(N);
ll best = 1;
vector<ll> asdf;
map<char, ll> asdff;
adj.pb(asdf);
cchar.push_back(asdff);
F0R (ii, N) {
string s;
re(s);
ll currnode = 0, currbest = 0, lv = 0;
ll ch1 = 0, ch2 = 0;
ll currpow = 1;
F0R (i, s.length()) {
add_self(ch1, mul(currpow, s[i]-'A'+1));
mul_self(ch2, 151);
add_self(ch2, s[s.length()-i-1]-'A'+1);
mul_self(currpow, 151);
if (cchar[currnode].find(s[i]) != cchar[currnode].end()) {
currnode = adj[currnode][cchar[currnode][s[i]]];
if (ch1 == ch2) {
currbest = max(currbest, dp[currnode]);
}
} else {
break;
}
}
currnode = 0;
FOR (i, 0, s.length()) {
if (cchar[currnode].find(s[i]) == cchar[currnode].end()) {
cchar[currnode][s[i]] = adj[currnode].size();
adj[currnode].pb(nodes++);
adj.pb(asdf);
cchar.pb(asdff);
currnode = nodes-1;
} else {
currnode = adj[currnode][cchar[currnode][s[i]]];
}
}
dp[currnode] = max(dp[currnode], currbest+1);
best = max(best, dp[currnode]);
}
ps(best);
return 0;
}
Compilation message
savez.cpp: In function 'int main()':
savez.cpp:53:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
53 | #define FOR(i,a,b) for (int i = (a); i < (b); ++i)
| ^
savez.cpp:54:18: note: in expansion of macro 'FOR'
54 | #define F0R(i,a) FOR(i,0,a)
| ^~~
savez.cpp:187:9: note: in expansion of macro 'F0R'
187 | F0R (i, s.length()) {
| ^~~
savez.cpp:53:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
53 | #define FOR(i,a,b) for (int i = (a); i < (b); ++i)
| ^
savez.cpp:202:9: note: in expansion of macro 'FOR'
202 | FOR (i, 0, s.length()) {
| ^~~
savez.cpp:184:40: warning: unused variable 'lv' [-Wunused-variable]
184 | ll currnode = 0, currbest = 0, lv = 0;
| ^~
savez.cpp: In function 'void io::setIn(std::string)':
savez.cpp:67:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
67 | void setIn(string s) { freopen(s.c_str(),"r",stdin); }
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
savez.cpp: In function 'void io::setOut(std::string)':
savez.cpp:68:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
68 | void setOut(string s) { freopen(s.c_str(),"w",stdout); }
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
364 KB |
Output is correct |
| 2 |
Correct |
1 ms |
364 KB |
Output is correct |
| 3 |
Correct |
1 ms |
620 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
492 KB |
Output is correct |
| 2 |
Correct |
1 ms |
364 KB |
Output is correct |
| 3 |
Correct |
26 ms |
14796 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
53 ms |
876 KB |
Output is correct |
| 2 |
Correct |
48 ms |
1832 KB |
Output is correct |
| 3 |
Correct |
46 ms |
1796 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
2288 KB |
Output is correct |
| 2 |
Correct |
44 ms |
2400 KB |
Output is correct |
| 3 |
Correct |
45 ms |
2400 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
46 ms |
1516 KB |
Output is correct |
| 2 |
Correct |
47 ms |
2088 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
48 ms |
1516 KB |
Output is correct |
| 2 |
Correct |
52 ms |
2284 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
51 ms |
1260 KB |
Output is correct |
| 2 |
Correct |
59 ms |
2028 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
57 ms |
1132 KB |
Output is correct |
| 2 |
Correct |
58 ms |
3040 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
82 ms |
492 KB |
Output is correct |
| 2 |
Correct |
87 ms |
1516 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
101 ms |
492 KB |
Output is correct |
| 2 |
Correct |
104 ms |
1788 KB |
Output is correct |
| 3 |
Correct |
186 ms |
2412 KB |
Output is correct |
