| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 363487 |
2021-02-06T08:46:42 Z |
ACmachine |
Matching (CEOI11_mat) |
C++17 |
|
1664 ms |
65536 KB |
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<str> vstr;
#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define rsz resize
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)
const double EPS = 1e-9;
const int MOD = 1e9+7; // 998244353;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};
#ifdef DEBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif
#define dbg(x) cout << "(" << #x << " : " << x << ")" << endl;
// ostreams
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "["; REP(i, v.size()) out << v[i] << ", "; out << "]"; return out;}
// istreams
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
template<class T, class U>
istream& operator>>(istream& in, pair<T, U> &p){ in >> p.ff >> p.ss; return in; }
//searches
template<typename T, typename U>
T bsl(T lo, T hi, U f){ hi++; T mid; while(lo < hi){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; }
template<typename U>
double bsld(double lo, double hi, U f, double p = 1e-9){ int r = 3 + (int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid; } return (lo + hi)/2; }
template<typename T, typename U>
T bsh(T lo, T hi, U f){ lo--; T mid; while(lo < hi){ mid = (lo + hi + 1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; }
template<typename U>
double bshd(double lo, double hi, U f, double p = 1e-9){ int r = 3+(int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? lo = mid : hi = mid; } return (lo + hi)/2; }
// some more utility functions
template<typename T>
pair<T, int> get_min(vector<T> &v){ typename vector<T> :: iterator it = min_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T>
pair<T, int> get_max(vector<T> &v){ typename vector<T> :: iterator it = max_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T> bool ckmin(T& a, const T& b){return b < a ? a = b , true : false;}
template<typename T> bool ckmax(T& a, const T& b){return b > a ? a = b, true : false;}
ll mod = 1745479871;
ll hash_base = 9938119;
vll hash_base_power;
struct node{
int number_of_elements = 0;
ll hash = 0;
void apply(int l, int r, int val){
if(val == -1){ // remove element
hash = 0;
number_of_elements = 0;
}
else{
hash = val;
number_of_elements = 1;
}
}
};
struct segtree{
node comb(node const &a, node const &b){
node res;
res.number_of_elements = a.number_of_elements + b.number_of_elements;
res.hash = a.hash + b.hash * hash_base_power[a.number_of_elements];
res.hash %= mod;
return res;
}
void push(int l, int r, int v){
}
int sz;
vector<node> tree;
segtree(int _sz){ // tree is resized to default values set in node
sz = 1; while(sz < _sz) sz<<=1;
tree.resize(2*sz);
}
void build(vector<node> &init){
for(int i = 0; i < sz; ++i)
if(i < init.size())
tree[i+sz] = init[i];
for(int i = sz-1; i > 0; --i)
tree[i] = comb(tree[i<<1], tree[i<<1|1]);
}
node query(int l, int r){return query0(l, r, 0, sz, 1);}
node query0(int l, int r, int beg, int end, int v){
if(beg >= l && end <= r)
return tree[v];
push(beg, end, v);
int mid = (beg + end) >> 1;
node res;
if(beg >= r || mid <= l) res = query0(l, r, mid, end, v<<1|1); //[beg, mid]
else if(mid >= r || end <= l) res = query0(l, r, beg, mid, v<<1);
else res = comb(query0(l, r, beg, mid, v<<1), query0(l, r, mid, end, v<<1|1));
return res;
}
template<typename... T>
void upd(int l, int r, T ...args){upd0(l, r, 0, sz, 1, args...);}
template<typename... T>
void upd0(int l, int r, int beg, int end, int v, T ...args){
if(beg >= r || end <= l)
return;
if(beg >= l && end <= r){
tree[v].apply(beg, end, args...);
return;
}
push(beg, end, v);
int mid = (beg + end) >> 1;
upd0(l, r, beg, mid, v<<1, args...);
upd0(l, r, mid, end, v<<1|1, args...);
tree[v] = comb(tree[v<<1], tree[v<<1|1]);
}
};
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
hash_base_power = vll(1e6 + 6); hash_base_power[0] = 1ll;
FOR(i, 1, 1e6 + 5, 1){
hash_base_power[i] = hash_base_power[i - 1] * hash_base;
hash_base_power[i] %= mod;
}
int n, m;
cin >> n >> m;
vi s(n); cin >> s;
vi h(m); cin >> h;
vi ch = h;
sort(all(ch)); ch.erase(unique(all(ch)), ch.end());
REP(i, m) h[i] = lower_bound(all(ch), h[i]) - ch.begin();
REP(i, m) h[i]++;
segtree st(m + 5); // also, indexujem od 1;
ll hashS = 0;
ll toAdd = 0;
REP(i, n){
hashS += s[i] * hash_base_power[i];
hashS %= mod;
toAdd += hash_base_power[i];
toAdd %= mod;
}
REP(i, n){
st.upd(h[i], h[i] + 1, i + 1);
}
vector<int> matches;
if(st.query(0, m + 3).hash == hashS) matches.pb(0);
FOR(i, 1, m - n + 1, 1){
hashS += toAdd; hashS %= mod;
st.upd(h[i - 1], h[i - 1] + 1, -1);
st.upd(h[i + n - 1], h[i + n -1] + 1, i + n);
if(st.query(0, m + 3).hash == hashS) matches.pb(i);
}
cout << matches.size() << "\n";
REP(i, matches.size()) {
cout << matches[i] + 1 << (i == (int)matches.size() - 1 ? "\n" : " ");
}
return 0;
}
Compilation message
mat.cpp: In member function 'void segtree::build(std::vector<node>&)':
mat.cpp:120:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<node>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
120 | if(i < init.size())
| ~~^~~~~~~~~~~~~
mat.cpp: In function 'int main()':
mat.cpp:26:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
26 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
| ^
mat.cpp:28:18: note: in expansion of macro 'FOR'
28 | #define REP(i,b) FOR(i,0,b,1)
| ^~~
mat.cpp:192:5: note: in expansion of macro 'REP'
192 | REP(i, matches.size()) {
| ^~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
16 ms |
8172 KB |
Output is correct |
| 2 |
Correct |
15 ms |
8172 KB |
Output is correct |
| 3 |
Correct |
15 ms |
8172 KB |
Output is correct |
| 4 |
Correct |
15 ms |
8172 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
15 ms |
8300 KB |
Output is correct |
| 2 |
Correct |
15 ms |
8172 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
33 ms |
9580 KB |
Output is correct |
| 2 |
Correct |
30 ms |
9452 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
33 ms |
9580 KB |
Output is correct |
| 2 |
Correct |
34 ms |
9580 KB |
Output is correct |
| 3 |
Correct |
17 ms |
8300 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
213 ms |
19564 KB |
Output is correct |
| 2 |
Correct |
224 ms |
19180 KB |
Output is correct |
| 3 |
Correct |
323 ms |
20332 KB |
Output is correct |
| 4 |
Correct |
301 ms |
20332 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
233 ms |
20332 KB |
Output is correct |
| 2 |
Correct |
326 ms |
20076 KB |
Output is correct |
| 3 |
Correct |
243 ms |
20332 KB |
Output is correct |
| 4 |
Correct |
228 ms |
21480 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
228 ms |
20208 KB |
Output is correct |
| 2 |
Correct |
206 ms |
19820 KB |
Output is correct |
| 3 |
Correct |
258 ms |
19956 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1257 ms |
60656 KB |
Output is correct |
| 2 |
Correct |
1202 ms |
65536 KB |
Output is correct |
| 3 |
Correct |
1275 ms |
55036 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1148 ms |
59960 KB |
Output is correct |
| 2 |
Correct |
1664 ms |
55748 KB |
Output is correct |
| 3 |
Correct |
1249 ms |
65536 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1378 ms |
58088 KB |
Output is correct |
| 2 |
Correct |
1175 ms |
65536 KB |
Output is correct |
| 3 |
Correct |
1514 ms |
58988 KB |
Output is correct |
| 4 |
Correct |
771 ms |
65536 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1276 ms |
58768 KB |
Output is correct |
| 2 |
Correct |
1369 ms |
59500 KB |
Output is correct |
| 3 |
Correct |
568 ms |
33260 KB |
Output is correct |
| 4 |
Correct |
914 ms |
65536 KB |
Output is correct |
