VI LongestIncreasingSubsequence(VI v)
{
VPII best;
VI dad(v.size(), -1);
for (int i = 0; i < v.size(); i++)
{
#ifdef STRICTLY_INCREASNG
PII item = make_pair(v[i], 0);
VPII::iterator it = lower_bound(best.begin(), best.end(), item);
item.second = i;
#else
PII item = make_pair(v[i], i);
VPII::iterator it = upper_bound(best.begin(), best.end(), item);
#endif
if (it == best.end())
{
dad[i] = (best.size() == 0 ? -1 : best.back().second);
best.push_back(item);
}
else
{
dad[i] = dad[it->second];
*it = item;
}
}
VI ret;
for (int i = best.back().second; i >= 0; i = dad[i])
ret.push_back(v[i]);
reverse(ret.begin(), ret.end());
return ret;
}
VPII _minpres3(VPII v) {
VPII ret(v);
for (VPII::iterator i = v.begin(); i != v.end(); ++i) {
swap(i->first, i->second);
}
uniform(v);
ret = min(ret, v);
return ret;
}
VPII boundary(PII a)
{
VPII ret;
ret.PB({a.F,0});
ret.PB({a.F,L});
ret.PB({0,a.S});
ret.PB({W,a.S});
return ret;
}
VPII _minpres1(VPII v) {
VPII ret(_minpres2(v));
for (VPII::iterator i = v.begin(); i != v.end(); ++i) {
i->first = -i->first;
}
uniform(v);
ret = min(ret, _minpres2(v));
return ret;
}
VPII _minpres2(VPII v) {
VPII ret(_minpres3(v));
for (VPII::iterator i = v.begin(); i != v.end(); ++i) {
i->second = -i->second;
}
uniform(v);
ret = min(ret, _minpres3(v));
return ret;
}
void back(int mask){
if(printed)return;
VPII cpy=ar;
int topleft, p=ar.size(), maxh=0, dist=0;
for(int i=0; i<p; i++){
if(ar[i].S>maxh)
maxh=ar[i].S, topleft=i;
}
for(int i=0; i<topleft; i++)
dist += ar[i].F;
if(maxh==0){
if(mask==(1<<N)-1)
print();
return ;
}
for(int i=0; i<N; i++)
if(not (mask&(1<<i))){
if(ar[topleft].F>=rect[i].F and ar[topleft].S>=rect[i].S){
ans.pb(node(dist, ar[topleft].S-rect[i].S, dist + rect[i].F, ar[topleft].S));
int oldwidth = ar[topleft].F;
ar[topleft].F = rect[i].F;
ar[topleft].S -= rect[i].S;
if(oldwidth!=rect[i].F)
ar.insert(ar.begin() + topleft + 1, {oldwidth-rect[i].F, maxh});
merge(ar);
back(mask|(1<<i));
ans.pop_back();
ar = cpy;
}
swap(rect[i].F, rect[i].S);
if(ar[topleft].F>=rect[i].F and ar[topleft].S>=rect[i].S){
ans.pb(node(dist, ar[topleft].S-rect[i].S, dist + rect[i].F, ar[topleft].S));
int oldwidth = ar[topleft].F;
ar[topleft].F = rect[i].F;
ar[topleft].S -= rect[i].S;
if(oldwidth!=rect[i].F)
ar.insert(ar.begin() + topleft + 1, {oldwidth-rect[i].F, maxh});
merge(ar);
back(mask|(1<<i));
ans.pop_back();
ar = cpy;
}
swap(rect[i].F, rect[i].S);
}
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(NULL);
int n,var,i,l,flag,d,j;
vector <VI> v(100010);
VPII vec;
cin >>n;
for(i=0;i<n;i++)
{
cin >>var;
v[var].PB(i);
}
for(i=1;i<=100000;i++)
{
l=v[i].size();
if(l==0)
continue;
if(l==1)
{
vec.PB(MP(i,0));
continue;
}
if(l==2)
{
vec.PB(MP(i,v[i][1]-v[i][0]));
continue;
}
flag=1;
d=v[i][1]-v[i][0];
for(j=2;j<l;j++)
{
if(v[i][j]-v[i][j-1]!=d)
flag=0;
}
if(flag==0)
continue;
else
vec.PB(MP(i,d));
}
l=vec.size();
cout <<l<<"\n";
for(i=0;i<l;i++)
cout <<vec[i].F<<" "<<vec[i].S<<"\n";
return 0;
}
void printVector(VPII segm){
cout << " print vector : " << endl;
for(int i=0;i<segm.size();i++){
cout << segm[i].first << " " << segm[i].second << " " << endl;
}
}
void BriArt(VPII &res) {
res.clear(); br = &res;
t = 0;
REP(x, SIZE(g)) g[x].art = g[x].d = 0;
REP(x, SIZE(g)) if(!g[x].d) {
g[x].d=++t;
int c = 0;
FOREACH(it, g[x]) if (!g[it->v].d) {c++; BriArtR(it->v, x);}
g[x].art = (c>1);
}
bool check(string word){
int A = 0;
int B = 0;
int n = word.length();
VPII arches ;
int lastA = -1;
int lastB = -1;
REP(i, n){
if(word[i] == 'A'){
A++;
if(lastA == -1){
lastA = i;
} else {
arches.pb(mp(lastA, i));
lastA = -1;
}
} else {
B++;
if(lastB == -1){
lastB = i;
} else {
arches.pb(mp(lastB, i));
lastB = -1;
}
}
}
if(A%2 || B%2){
return false;
}
for(int i = 1; i< arches.size(); i++){
if(overlap(arches[i-1], arches[i])){
return false;
}
}
return true;
}
int main() {
freopen("cut.in", "rt", stdin);
freopen("cut.out", "wt", stdout);
cin >> n >> m;
ZERO(cc), ZERO(ff);
REPN(i, n) {
int a, b, c;
cin >> a >> b >> c;
a--, b--;
cc[a][b] += c;
cc[b][a] += c;
e.PB(MP(a, b));
}
int main() {
LL tot = 1;
LL n, m;
cin >> n;
for (int i=0; i<2*n; ++i) {
int a;
cin >> a;
x.push_back(MP(a, i%n));
}
sort(x.begin(), x.end());
cin >> m;
init(2*n+10, m);
for (int i=0,j=0,sz=(int)x.size(); i<sz; i=j) {
int p2 = 0;
for (j=i; j<sz&&x[j].first==x[i].first; ++j) p2 += (j + 1 < sz && x[j+1] == x[j]);
// cout << x[i].first << ' ' << j - i << ' ' << p2 << ' ' << r[j-i] << ' ' << cc[j-i] << endl;
tot = (tot * r[j-i] % m) * P(2, cc[j-i]-p2, m) % m;
}
cout << tot << endl;
return 0;
}
void uniform(VPII& v) {
int x = v.front().first;
int y = v.front().second;
for (VPII::const_iterator i = v.begin(); i != v.end(); ++i) {
x = min(x, i->first);
y = min(y, i->second);
}
for (VPII::iterator i = v.begin(); i != v.end(); ++i) {
i->first -= x;
i->second -= y;
}
sort(v.begin(), v.end());
}
int main(){
VPII v;
v.clear();
LL n,i,j,x,y;
cin >> n;
pair <LL,LL> p[100005];
for(i=0;i<n;i++){
cin >> p[i].ff >> p[i].ss;
}
sort(p,p+n);
// for(i=0;i<n;i++)
// trace2(p[i].ff,p[i].ss);
for(i=0;i<n;i++){
x = p[i].ff;y=p[i].ss;
if(i==n-1)
v.pb(mp(x+y,x));
else{
if(p[i+1].ff>x+y)
v.pb(mp(x+y,x));
}
if(i==0)
v.pb(mp(x,x-y));
else{
if(p[i-1].ff<x-y)
v.pb(mp(x,x-y));
}
}
sort(v.begin(),v.end());
LL ans=0,lf=-MOD;
int sz = v.size();
for(i=0;i<sz;i++){
//trace2(v[i].first,v[i].second);
//trace2(lf,v[i].second);
if(v[i].second>lf){ans++;
lf = v[i].first;
// trace2(v[i].second,v[i].first);
}
}
cout << ans << endl;
return 0;
}
int main()
{
srand(time(NULL));
FastIO();
// Keeps track of all elements in kd-tree
VPII vec;
kdtree *rootaddr = NULL;
int n, p_x, p_y;
n = 100;
for(int i = 0 ; i < n ; i++) {
p_x = rand() % 1000;
p_y = rand() % 1000;
vec.push_back(make_pair(p_x, p_y));
}
rootaddr = static_build(rootaddr, vec, 0, 0, n - 1);
// Uncomment the below part to print the kd-tree (preorder traversal)
/*
cout << "tree traversal\n";
print(rootaddr, 0, 'a');
*/
return 0;
}
void merge(VPII& ar){
VPII ret;
ret.pb(ar[0]);
for(int i=1; i<ar.size(); i++){
assert(ar[i].F);
if(ar[i].S==ret.back().S)
ret.back().F+=ar[i].F;
else
ret.pb(ar[i]);
}
ar=ret;
}
VPII gao(const VPII& v, const VPII& w, int u) {
int i, j;
VPII p, q, r;
for (i = 1; i < (int)v.size() && p.empty(); ++i) {
// printf("i = %d\n", i);
p = path(v[i - 1], v[i], w, u);
}
if (p.empty()) {
return v;
}
for (j = (int)v.size() - 2; j >= 0 && q.empty(); --j) {
// printf("j = %d\n", j);
q = path(v[j + 1], v[j], w, u);
}
--i;
++j;
// printf("i = %d; j = %d\n", i, j);
r.insert(r.end(), v.begin(), v.begin() + i);
r.insert(r.end(), p.begin(), p.end());
r.insert(r.end(), q.rbegin(), q.rend());
r.insert(r.end(), v.begin() + j + 1, v.end());
return trim(r);
}
int main()
{
int tc;
scanf("%d",&tc);
while (tc--)
{
int m, n;
scanf("%d %d",&m, &n);
VPII segm;
for(int i=0;i<n;i++)
{
int st, en;
scanf("%d %d",&st, &en);
if(st<=en)
{
segm.push_back(make_pair(st,en));
segm.push_back(make_pair(st+m,en+m));
}
else
segm.push_back(make_pair(st,en+m));
}
printVector(segm);
if(n>m)
{
puts("NO");
continue;
}
sort(segm.begin(),segm.end());
cout << "After Sorting " << endl;
printVector(segm);
int T=0;
int i=0;
set < PII > que;
bool ok = true;
while(true)
{
if(que.empty())
{
if(i==segm.size())
break;
else
T = segm[i].first;
}
while(i<segm.size() && segm[i].first==T)
{
que.insert(make_pair(segm[i].second,i));
i++;
}
int ind = que.begin()->second;
que.erase(que.begin());
if(!(T>=segm[ind].first && T<=segm[ind].second))
{
ok = false;
break;
}
T++;
}
puts(ok?"YES":"NO");
}
}
VPII path(const PII& a, const PII& b, const VPII& w, int u) {
int i, t, k = 1, p = -1;
VPII ret;
// printf("[path] w.size() = %d\n", (int)w.size());
for (i = 1; i < (int)w.size(); ++i) {
t = intersection(a, b, w[i - 1], w[i]);
if (t != -1 && (p == -1 || p > t)) {
p = t;
k = i;
}
}
if (p != -1) {
ret.push_back(point(a, b, p - u));
if ((w[k - 1].first == w[k].first && w[k].first == ret.back().first) ||
(w[k - 1].second == w[k].second && w[k].second == ret.back().second)) {
++k;
}
// printf("k = %d\n", k);
for (i = k ; i < (int)w.size(); ++i) {
ret.push_back(ret.back());
if (i + 1 < (int)w.size() && sameside(w[i - 1], w[i], ret.back(), w[i + 1])) {
if (w[i - 1].first == w[i].first) {
ret.back().second = w[i].second - sign(w[i].second - w[i - 1].second) * u;
} else {
ret.back().first = w[i].first - sign(w[i].first - w[i - 1].first) * u;
}
} else {
if (w[i - 1].first == w[i].first) {
ret.back().second = w[i].second + sign(w[i].second - w[i - 1].second) * u;
} else {
ret.back().first = w[i].first + sign(w[i].first - w[i - 1].first) * u;
}
}
}
}
return ret;
}
VPII trim(const VPII& v) {
VPII ret;
for (int i = 0; i < (int)v.size(); ++i) {
if (ret.size() > 1) {
if (ret.back().first == v[i].first && ret.back().first == (ret.end() - 2)->first) {
ret.pop_back();
} else if (ret.back().second == v[i].second && ret.back().second == (ret.end() - 2)->second) {
ret.pop_back();
}
}
if (ret.empty() || v[i] != ret.back()) {
ret.push_back(v[i]);
}
}
return ret;
}
int main()
{
FILE *fin = freopen("graph.in","r",stdin);
FILE *fout = freopen("graph.out","w",stdout);
memset(indegree, 0, sizeof(indegree));
int m;
cin>>n>>m>>k;
for(int i=0; i<m; i++)
{
int u,v;
cin>>u>>v;
if(V[u].find(v)==V[u].end())
{
V[u].insert(v);
indegree[v]++;
}
}
for(int i=1; i<=n; i++)
{
if(indegree[i]==0)
poss.insert(i);
}
priority_queue <int> deferred;
bool first=false;
int printed = 0;
int cur = 0;
while(printed<n)
{
if(!poss.empty())
{
int num_links = min(k,(int)poss.size()-1);
if(num_links!=0)
{
k-=num_links;
auto endpos = poss.begin();
for(int j=0; j<num_links-1; j++) endpos++;
for(auto it=endpos; ; it--)
{
deferred.push(*it);
if(it==poss.begin())
break;
}
poss.erase(poss.begin(), ++endpos);
}
if(k>0 && !deferred.empty() && deferred.top() > *poss.rbegin())
{
//trace(*poss.rbegin());
deferred.push(*poss.rbegin());
poss.erase(--poss.end());
k--;
}
}
if(poss.empty() && !deferred.empty())
{
int defcur = deferred.top();
deferred.pop();
V[cur].insert(defcur);
ans.push_back(make_pair(cur, defcur));
poss.insert(defcur);
}
if(first)
{
cout<<" ";
}
first=true;
cur = *(poss.begin());
poss.erase(poss.begin());
cout<<cur;
printed++;
for(auto it = V[cur].begin(); it!=V[cur].end(); it++)
{
indegree[*it]--;
if(indegree[*it]==0)
{
poss.insert(*it);
}
}
}
cout<<endl;
cout<<ans.size()<<endl;
for(int i=0; i<ans.size(); i++)
{
cout<<ans[i].first<<" "<<ans[i].second<<endl;
}
return 0;
}
int main()
{
freopen("Text/QCJ1.txt","r",stdin);
int i = 0, h, w = 0, prevv=-2, tot=0, steps=0, len;
VPII walk;
while(gets(board[i])) i++;
h = i-1;
len = strlen(board[i-1]);
while(w<len)
{
if(board[h][w]=='/')
{
if(prevv!=1)
{
walk.push_back(pair<char,int>(prevv,steps));
steps = 0;
}
steps++;
prevv = 1;
w++;
tot++;
}
else if(board[h][w]=='_')
{
if(prevv!=0)
{
walk.push_back(pair<char,int>(prevv,steps));
steps = 0;
}
steps++;
prevv = 0;
w++;
tot++;
}
else if(board[h][w]=='\\')
{
if(prevv!=-1)
{
walk.push_back(pair<char,int>(prevv,steps));
steps = 0;
}
steps++;
prevv = -1;
w++;
tot++;
}
else
{
if(prevv==-1)
{
if(h == i) break;
else h++;
}
else if(prevv==0)
{
h++;
}
else if(prevv==1)
{
h--;
}
}
}
walk.push_back(pair<char,int>(prevv,steps));
printf("Total Walk Distance = %d\n", tot);
for(i=0; i<walk.size(); i++)
{
if(walk[i].first==-1) printf("Down %d steps\n", walk[i].second);
else if(walk[i].first==0) printf("Walk %d steps\n", walk[i].second);
else if(walk[i].first==1) printf("Up %d steps\n", walk[i].second);
}
return 0;
}
