oj.uz

Submission #670835

# Submission time Handle Problem Language Result Execution time Memory
670835 2022-12-10T19:26:12 Z Antekb Demarcation (BOI14_demarcation) C++14
100 / 100
 314 ms 32048 KB 
#include<bits/stdc++.h>
 
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("trapv")
 
#define st first
#define nd second
#define pb push_back
#define eb emplace_back
#define pp(x) pop_back(x)
#define mp(a, b) make_pair(a, b)
#define all(x) (x).begin(), (x).end()
#define rev(x) reverse(all(x))
#define sor(x) sort(all(x))
#define sz(x) (int)(x).size()
#define rsz(x) resize(x)
 
using namespace std;
 
///~~~~~~~~~~~~~~~~~~~~~~~~~~
 
template <typename H, typename T> 
ostream& operator<<(ostream& os, pair<H, T> m){
	return os <<"("<< m.st<<", "<<m.nd<<")";
}
template <typename H> 
ostream& operator<<(ostream& os, vector<H> V){
	os<<"{";
	for(int i=0; i<V.size(); i++){
		if(i)os<<" ";
		os<<V[i];
	}
	os<<"}";
	return os;
}
 
void debug(){cerr<<"\n";}
template <typename H, typename... T>
void debug(H h, T... t) {cerr<<h; if (sizeof...(t)) cerr << ", "; debug(t...);}
#define deb(x...) cerr<<#x<<" = ";debug(x);
 
///~~~~~~~~~~~~~~~~~~~~~~~~~
 
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<pii > vii;
typedef vector<ll> vl;
typedef vector<pll> vll;
typedef string str;
 
#define BOOST ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
 
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
 
const int K=18, N=(1<<K), INF=1e9+5, mod=1e9+7, mod2=998244353;

struct modint{
	int n=0;
	modint(){}
	modint(ll x){
		n=x%mod;
		if(n<0)n+=mod;
	}
	operator int(){
		return n;
	}
	modint operator+(modint a){a.n = n+a.n; if(a.n>=mod)a.n-=mod;return a;}
	modint operator+=(modint a){return (*this)=(*this)+a;}
	modint operator-(modint a){a.n = n-a.n; if(a.n<0)a.n+=mod;return a;}
	modint operator-=(modint a){return (*this)=(*this)-a;}
	modint operator*(modint a){a.n = (n*1ll*a.n)%mod; return a;}
	modint operator*=(modint a){return (*this)=(*this)*a;}
	modint operator^(const ll &m)const{
		modint a(1);
		if(m==0)return a;
		if(m==1)return (*this);
		a=(*this)^(m/2);
		a*=a;
		return a*((*this)^(m&1));
	}
	modint odw(){
		return (*this)^((ll)mod-2);
	}
	modint operator/(modint a){return (*this)*a.odw();}
	modint operator/=(modint a){return (*this)=(*this)/a;}
	bool operator==(modint a){return a.n==n;}
	friend ostream& operator<<(ostream& os, modint m) {
		return os << m.n; 
	}
};
modint fact[N], fact2[N];
typedef vector<modint> vm;
void factinit(){
    fact[0]=1;
    for(int i=1; i<N; i++){
        fact[i]=(fact[i-1]*modint(i))%mod;
    }
    fact2[N-1]=fact[N-1].odw();
    for(int i=N-2; i>=0; i--){
    	fact2[i]=(fact2[i+1]*modint(i+1))%mod;
    }
}
modint npok(int _n, int _k){
    return fact[_n]*fact2[_k]*fact2[_n-_k];
}
int n;
void refx(vii &V){for(pii &i:V)i.nd=-i.nd;}
void refy(vii &V){for(pii &i:V)i.st=-i.st;}
void refxy(vii &V){for(pii &i:V)swap(i.st, i.nd);}
bool cmp(vii &V, vii &V2){
	int m1=0, m2=0;
	for(int i=0; i<V.size(); i++)if(V[i]<V[m1])m1=i;
	for(int i=0; i<V.size(); i++)if(V2[i]<V2[m2])m2=i;
	int x=V[m1].st-V2[m2].st, y=V[m1].nd-V2[m2].nd;
	for(int i=0;i<V.size(); i++){
		if(V[m1].st-x!=V2[m2].st || V[m1].nd-y!=V2[m2].nd){
			return 0;
		}
		if(++m1>=V.size())m1=0;
		if(++m2>=V.size())m2=0;
	}
	return 1;
}
bool row(vii &V, vii &V2){
	//deb(V, V2);
	if(cmp(V, V2))return 1;refx(V);
	if(cmp(V, V2))return 1;refy(V);
	if(cmp(V, V2))return 1;refx(V);
	if(cmp(V, V2))return 1;refxy(V);
	//deb(V, V2);
	if(cmp(V, V2))return 1;refy(V);
	if(cmp(V, V2))return 1;refx(V);
	if(cmp(V, V2))return 1;refy(V);	
	if(cmp(V, V2))return 1;refxy(V);
	rev(V);
	if(cmp(V, V2))return 1;refx(V);
	if(cmp(V, V2))return 1;refy(V);
	if(cmp(V, V2))return 1;refx(V);
	if(cmp(V, V2))return 1;refxy(V);
	//deb(V, V2);
	if(cmp(V, V2))return 1;refy(V);
	if(cmp(V, V2))return 1;refx(V);
	if(cmp(V, V2))return 1;refy(V);	
	if(cmp(V, V2))return 1;refxy(V);
	//deb(V, V2);
	return 0;
}
vector<vector<int>> pocz, kon;
vi war;
bool dob(int l, int r, int h){
	bool ans=1;
	for(l+=n, r+=n; l<r; l>>=1, r>>=1){
		if(l&1){
			ans&=((lower_bound(all(pocz[l]), h)-pocz[l].begin())==(upper_bound(all(kon[l]), h)-kon[l].begin()));
			l++;
		}
		if(r&1){
			--r;
			ans&=((lower_bound(all(pocz[r]), h)-pocz[r].begin())==(upper_bound(all(kon[r]), h)-kon[r].begin()));
		}
		if(!ans)break;
	}
	return ans;
}
int dost=200000;
pair<bool, pair<pii, pii>> solve(vii &V){
	deb("c");
	pair<bool, pair<pii, pii>> nie={0, {{0, 0}, {0, 0}}};
	if(V[0].nd!=V[1].nd){
		for(int i=0; i<n-1; i++)swap(V[i], V[i+1]);
	}
	pocz.clear();
	kon.clear();
	pocz.resize(2*n);
	kon.resize(2*n);
	map<int, int> M;
	for(int i=0; i<n; i++)M[V[i].st]=1;
	int wsk=0;
	for(auto &i:M){
		i.nd=wsk++;
	}
	for(int i=1; i<n; i+=2){
		pii a=V[i], b=V[(i+1)%n];
		assert(a.st==b.st);
		int j=M[a.st]+n;
		pocz[j].pb(min(a.nd, b.nd));
		kon[j].pb(max(a.nd, b.nd));
	}
	for(int i=n; i<n+n; i++){
		if(!pocz[i].size())continue;
		sor(pocz[i]);
		sor(kon[i]);
	}
	for(int i=n-1; i>0; i--){
		int wsk1=0, wsk2=0;
		while(wsk1!=pocz[i+i].size() || wsk2!=pocz[i+i+1].size()){
			if(wsk1!=pocz[i+i].size() && (wsk2==pocz[i+i+1].size() || pocz[i+i][wsk1]<pocz[i+i+1][wsk2])){
				pocz[i].pb(pocz[i+i][wsk1++]);
			}
			else pocz[i].pb(pocz[i+i+1][wsk2++]);
		}
		wsk1=0, wsk2=0;
		while(wsk1!=kon[i+i].size() || wsk2!=kon[i+i+1].size()){
			if(wsk1!=kon[i+i].size() && (wsk2==kon[i+i+1].size() || kon[i+i][wsk1]<kon[i+i+1][wsk2])){
				kon[i].pb(kon[i+i][wsk1++]);
			}
			else kon[i].pb(kon[i+i+1][wsk2++]);
		}
		//deb(pocz[i], kon[i]);
	}
	ll A=0, A2=0;
	for(int i=0; i<n; i+=2){
		A+=(V[i+1].st-V[i].st)*1ll*V[i].nd;
		//deb((V[i+1].st-V[i].st)*1ll*V[i].nd);
		if(i<=n/2)A2+=(V[i+1].st-V[i].st)*1ll*V[i].nd;
	}
	if(A&1)return nie;
	A/=2;
	if(n&2){
		for(int i=1; i<n; i+=2){
			A2-=(V[i].st-V[i-1].st)*1ll*V[i].nd;

			int j=(i+n/2)%n;
			if((V[j].st-V[i].st)*1ll*(V[i].st-V[i-1].st)>0 && (A-A2)%(V[i].st-V[j].st)==0){
				int h=(A-A2)/(V[i].st-V[j].st);
				if(h==V[i].nd && dob(M[min(V[i].st, V[j].st)]+1, M[max(V[i].st, V[j].st)], h)){
					//deb(i);
					vector<pii> V2, V3;
					for(int k=i; k!=j; k=(k+1)%n){
						V2.pb(V[k]);
					}
					V2.eb(V[j].st, h);
					V3.eb(V[j].st, h);
					for(int k=j; k!=i; k=(k+1)%n){
						V3.pb(V[k]);
					}
					//deb(V2, V3);
					assert(dost--);
					if(row(V2, V3)){
						bool b=1;
						for(int k=0; k<n; k+=2){
							if(V[k].nd==h && min(max(V[k].st, V[k+1].st), max(V[i].st, V[j].st))>
								max(min(V[k].st, V[k+1].st), min(V[i].st, V[j].st)))b=0;
							//if(min(V[i].st, V[j].st)<V[k+1].st && max(V[i].st, V[j].st) >V[k+1].st &&min(V[k+1].nd, V[(k+2)%n].nd)<h && max(V[k+1].nd, V[(k+2)%n].nd)>h)b=0;
						}
						if(b)return {1, {V[i], {V[j].st, h}}};
					}
				}
			}
			A2+=(V[j+1].st-V[j].st)*1ll*V[j].nd;
		}
	}
	else{
		deb(A, A2);
		for(int i=1; i<n; i+=2){
			A2-=(V[i].st-V[i-1].st)*1ll*V[i].nd;
			int j=(i+n/2)%n;
			//deb(i, j, A2);
			if(V[i].st!=V[j].st && (A-A2)%(V[i].st-V[j].st)==0){
				//deb(i, j);
				int h=(A-A2)/(V[i].st-V[j].st);
				//deb(h);
				if(h>=min(V[i].nd, V[(i+1)%n].nd) && h<=max(V[i].nd, V[(i+1)%n].nd) && h>=min(V[j].nd, V[(j+1)%n].nd)
					&& h<=max(V[j].nd, V[(j+1)%n].nd) && dob(M[min(V[i].st, V[j].st)]+1, M[max(V[i].st, V[j].st)], h)){
					deb(i);
					vector<pii> V2, V3;
					V2.pb({V[i].st, h});
					if(V[(i+1)%n].nd!=h)V2.pb(V[(i+1)%n]);
					for(int k=(i+1)%n; k!=j%n; k=(k+1)%n){
						if(k!=(i+1)%n)V2.pb(V[k]);
					}
					if(V[j].nd!=h){
						V2.pb(V[j]);
						V2.eb(V[j].st, h);
					}
					V3.pb({V[j].st, h});
					if(V[(j+1)%n].nd!=h)V3.pb(V[(j+1)%n]);
					for(int k=(j+1)%n; k!=i%n; k=(k+1)%n){
						if(k!=(j+1)%n)V3.pb(V[k]);
					}
					if(V[i].nd!=h){
						V3.pb(V[i]);
						V3.eb(V[i].st, h);
					}
					/*if(1){
						cerr<<V2.size()<<" q:\n";
						deb(V2[0], V2[1], V2[V2.size()-2], V2[V2.size()-1]);
						cerr<<V3.size()<<" q:\n";
						deb(V3[0], V3[1], V3[V3.size()-2], V3[V3.size()-1]);

					}*/
										assert(dost--);

					if(row(V2, V3)){
						//deb(i, V[i], V[j]);
						bool b=1;
						for(int k=0; k<n; k+=2){
							if(V[k].nd==h && min(max(V[k].st, V[k+1].st), max(V[i].st, V[j].st))>
								max(min(V[k].st, V[k+1].st), min(V[i].st, V[j].st))){
								b=0;
							}
							if(min(V[i].st, V[j].st)<V[k+1].st && max(V[i].st, V[j].st)>V[k+1].st &&
								min(V[k+1].nd, V[(k+2)%n].nd)<h && max(V[k+1].nd, V[(k+2)%n].nd)>h){
								assert(false);
								b=0;}
						}
						if(b)return {1, {{V[i].st, h}, {V[j].st, h}}};
					}
				}
			}
			A2+=(V[(j+2)%n].st-V[(j+1)%n].st)*1ll*V[(j+1)%n].nd;
		}
		A2=0;
		for(int i=0; i<n; i+=2){
			//A+=(V[i+1].st-V[i].st)*1ll*V[i].nd;
			//deb((V[i+1].st-V[i].st)*1ll*V[i].nd);
			if(i<=n/2+2)A2+=(V[i+1].st-V[i].st)*1ll*V[i].nd;
		}
		for(int i=1; i<n; i+=2){
			A2-=(V[i].st-V[i-1].st)*1ll*V[i].nd;
			int j=(i+n/2+2)%n;
			//deb(i, j, A2);
			if(V[i].st!=V[j].st && (A-A2)%(V[i].st-V[j].st)==0){
				//deb(i, j);
				int h=(A-A2)/(V[i].st-V[j].st);
				//deb(h);
				if(h==V[(i+1)%n].nd && h==V[j].nd && ((V[j].st-V[j-1].st)*1ll*(V[(i+1)%n].st-V[(i+2)%n].st)<0)
					 && ((V[j].st-V[j-1].st)*1ll*(V[j].st-V[i].st)<0)
					 && dob(M[min(V[i].st, V[j].st)]+1, M[V[j].st], h)){
					//deb("\n\nwww\n\n", i);
					//return nie;
					vector<pii> V2, V3;
					for(int k=(i+2)%n; k!=j; k=(k+1)%n){
						V2.pb(V[k]);
					}
					for(int k=j; k!=(i+2)%n; k=(k+1)%n){
						V3.pb(V[k]);
					}
					/*if(1){
						cerr<<V2.size()<<" q:\n";
						//deb(V2[0], V2[1], V2[V2.size()-2], V2[V2.size()-1]);
						for(pii i:V2)cerr<<i.st<<" "<<i.nd<<"\n";
						cerr<<V3.size()<<" q:\n";
						for(pii i:V3)cerr<<i.st<<" "<<i.nd<<"\n";
						//deb(V3[0], V3[1], V3[V3.size()-2], V3[V3.size()-1]);

					}*/
										assert(dost--);

					if(row(V2, V3)){
						//deb(i, V[i], V[j]);
						bool b=1;
						for(int k=0; k<n; k+=2){
							if(V[k].nd==h && min(max(V[k].st, V[k+1].st), max(V[i].st, V[j].st))>
								max(min(V[k].st, V[k+1].st), min(V[i].st, V[j].st))){
								b=0;
							}
							//if(min(V[i].st, V[j].st)<V[k+1].st && max(V[i].st, V[j].st)>V[k+1].st &&min(V[k+1].nd, V[(k+2)%n].nd)<h && max(V[k+1].nd, V[(k+2)%n].nd)>h){b=0;}
						}
						if(b)return {1, {{V[i].st, h}, {V[j].st, h}}};
					}
				}
			}
			A2+=(V[(j+2)%n].st-V[(j+1)%n].st)*1ll*V[(j+1)%n].nd;
		}
	}
	return nie;
}
int main(){
	//factinit();
	//BOOST;
	cin>>n;
	vii V(n);
	for(auto &i:V)cin>>i.st>>i.nd;//, i.st*=2, i.nd*=2;
	war.resize(n+n);
	for(int i=n; i<n+n; i++)war[i]=0;
	for(int i=n-1; i>=0; i--){
		war[i]=war[i+i]+1;
	}
	auto t=solve(V);
	//return 0;
	//deb("a", t.st);
	if(t.st==0){
		refxy(V);
		t=solve(V);
		swap(t.nd.st.st, t.nd.st.nd);
		swap(t.nd.nd.st, t.nd.nd.nd);
	}
	//return 0;
	//deb("a", t.st);
	if(t.st==0){
		refxy(V);
		rev(V);
		t=solve(V);
	}
	//deb("a", t.st);
	if(t.st==0){
		refxy(V);
		t=solve(V);
		swap(t.nd.st.st, t.nd.st.nd);
		swap(t.nd.nd.st, t.nd.nd.nd);
	}
	if(t.st==0)cout<<"NO\n";
	else{
		//cout<<ld(t.nd.st.st)/2<<" "<<ld(t.nd.st.nd)/2<<" "<<ld(t.nd.nd.st)/2<<" "<<ld(t.nd.nd.nd)/2;
		cout<<t.nd.st.st<<" "<<t.nd.st.nd<<" "<<t.nd.nd.st<<" "<<t.nd.nd.nd;
	}
}

Compilation message

demarcation.cpp: In function 'bool cmp(vii&, vii&)':
demarcation.cpp:115:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  115 |  for(int i=0; i<V.size(); i++)if(V[i]<V[m1])m1=i;
      |               ~^~~~~~~~~
demarcation.cpp:116:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  116 |  for(int i=0; i<V.size(); i++)if(V2[i]<V2[m2])m2=i;
      |               ~^~~~~~~~~
demarcation.cpp:118:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  118 |  for(int i=0;i<V.size(); i++){
      |              ~^~~~~~~~~
demarcation.cpp:122:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  122 |   if(++m1>=V.size())m1=0;
      |      ~~~~^~~~~~~~~~
demarcation.cpp:123:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  123 |   if(++m2>=V.size())m2=0;
      |      ~~~~^~~~~~~~~~
demarcation.cpp: In function 'bool row(vii&, vii&)':
demarcation.cpp:129:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  129 |  if(cmp(V, V2))return 1;refx(V);
      |  ^~
demarcation.cpp:129:25: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  129 |  if(cmp(V, V2))return 1;refx(V);
      |                         ^~~~
demarcation.cpp:130:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  130 |  if(cmp(V, V2))return 1;refy(V);
      |  ^~
demarcation.cpp:130:25: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  130 |  if(cmp(V, V2))return 1;refy(V);
      |                         ^~~~
demarcation.cpp:131:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  131 |  if(cmp(V, V2))return 1;refx(V);
      |  ^~
demarcation.cpp:131:25: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  131 |  if(cmp(V, V2))return 1;refx(V);
      |                         ^~~~
demarcation.cpp:132:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  132 |  if(cmp(V, V2))return 1;refxy(V);
      |  ^~
demarcation.cpp:132:25: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  132 |  if(cmp(V, V2))return 1;refxy(V);
      |                         ^~~~~
demarcation.cpp:134:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  134 |  if(cmp(V, V2))return 1;refy(V);
      |  ^~
demarcation.cpp:134:25: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  134 |  if(cmp(V, V2))return 1;refy(V);
      |                         ^~~~
demarcation.cpp:135:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  135 |  if(cmp(V, V2))return 1;refx(V);
      |  ^~
demarcation.cpp:135:25: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  135 |  if(cmp(V, V2))return 1;refx(V);
      |                         ^~~~
demarcation.cpp:136:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  136 |  if(cmp(V, V2))return 1;refy(V);
      |  ^~
demarcation.cpp:136:25: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  136 |  if(cmp(V, V2))return 1;refy(V);
      |                         ^~~~
demarcation.cpp:137:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  137 |  if(cmp(V, V2))return 1;refxy(V);
      |  ^~
demarcation.cpp:137:25: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  137 |  if(cmp(V, V2))return 1;refxy(V);
      |                         ^~~~~
demarcation.cpp:139:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  139 |  if(cmp(V, V2))return 1;refx(V);
      |  ^~
demarcation.cpp:139:25: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  139 |  if(cmp(V, V2))return 1;refx(V);
      |                         ^~~~
demarcation.cpp:140:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  140 |  if(cmp(V, V2))return 1;refy(V);
      |  ^~
demarcation.cpp:140:25: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  140 |  if(cmp(V, V2))return 1;refy(V);
      |                         ^~~~
demarcation.cpp:141:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  141 |  if(cmp(V, V2))return 1;refx(V);
      |  ^~
demarcation.cpp:141:25: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  141 |  if(cmp(V, V2))return 1;refx(V);
      |                         ^~~~
demarcation.cpp:142:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  142 |  if(cmp(V, V2))return 1;refxy(V);
      |  ^~
demarcation.cpp:142:25: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  142 |  if(cmp(V, V2))return 1;refxy(V);
      |                         ^~~~~
demarcation.cpp:144:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  144 |  if(cmp(V, V2))return 1;refy(V);
      |  ^~
demarcation.cpp:144:25: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  144 |  if(cmp(V, V2))return 1;refy(V);
      |                         ^~~~
demarcation.cpp:145:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  145 |  if(cmp(V, V2))return 1;refx(V);
      |  ^~
demarcation.cpp:145:25: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  145 |  if(cmp(V, V2))return 1;refx(V);
      |                         ^~~~
demarcation.cpp:146:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  146 |  if(cmp(V, V2))return 1;refy(V);
      |  ^~
demarcation.cpp:146:25: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  146 |  if(cmp(V, V2))return 1;refy(V);
      |                         ^~~~
demarcation.cpp:147:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  147 |  if(cmp(V, V2))return 1;refxy(V);
      |  ^~
demarcation.cpp:147:25: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  147 |  if(cmp(V, V2))return 1;refxy(V);
      |                         ^~~~~
demarcation.cpp: In function 'std::pair<bool, std::pair<std::pair<int, int>, std::pair<int, int> > > solve(vii&)':
demarcation.cpp:199:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  199 |   while(wsk1!=pocz[i+i].size() || wsk2!=pocz[i+i+1].size()){
      |         ~~~~^~~~~~~~~~~~~~~~~~
demarcation.cpp:199:39: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  199 |   while(wsk1!=pocz[i+i].size() || wsk2!=pocz[i+i+1].size()){
      |                                   ~~~~^~~~~~~~~~~~~~~~~~~~
demarcation.cpp:200:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  200 |    if(wsk1!=pocz[i+i].size() && (wsk2==pocz[i+i+1].size() || pocz[i+i][wsk1]<pocz[i+i+1][wsk2])){
      |       ~~~~^~~~~~~~~~~~~~~~~~
demarcation.cpp:200:38: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  200 |    if(wsk1!=pocz[i+i].size() && (wsk2==pocz[i+i+1].size() || pocz[i+i][wsk1]<pocz[i+i+1][wsk2])){
      |                                  ~~~~^~~~~~~~~~~~~~~~~~~~
demarcation.cpp:206:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  206 |   while(wsk1!=kon[i+i].size() || wsk2!=kon[i+i+1].size()){
      |         ~~~~^~~~~~~~~~~~~~~~~
demarcation.cpp:206:38: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  206 |   while(wsk1!=kon[i+i].size() || wsk2!=kon[i+i+1].size()){
      |                                  ~~~~^~~~~~~~~~~~~~~~~~~
demarcation.cpp:207:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  207 |    if(wsk1!=kon[i+i].size() && (wsk2==kon[i+i+1].size() || kon[i+i][wsk1]<kon[i+i+1][wsk2])){
      |       ~~~~^~~~~~~~~~~~~~~~~
demarcation.cpp:207:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  207 |    if(wsk1!=kon[i+i].size() && (wsk2==kon[i+i+1].size() || kon[i+i][wsk1]<kon[i+i+1][wsk2])){
      |                                 ~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 5532 KB Output is correct
2 Correct 2 ms 2352 KB Output is correct
3 Correct 1 ms 2260 KB Output is correct
4 Correct 18 ms 4968 KB Output is correct
5 Correct 1 ms 2260 KB Output is correct
6 Correct 1 ms 2260 KB Output is correct
7 Correct 2 ms 2356 KB Output is correct
8 Correct 1 ms 2260 KB Output is correct
9 Correct 133 ms 26068 KB Output is correct
10 Correct 1 ms 2360 KB Output is correct
11 Correct 2 ms 2356 KB Output is correct
12 Correct 1 ms 2260 KB Output is correct
13 Correct 1 ms 2260 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2260 KB Output is correct
2 Correct 1 ms 2260 KB Output is correct
3 Correct 1 ms 2260 KB Output is correct
4 Correct 1 ms 2260 KB Output is correct
5 Correct 1 ms 2260 KB Output is correct
6 Correct 1 ms 2260 KB Output is correct
7 Correct 1 ms 2352 KB Output is correct
8 Correct 1 ms 2356 KB Output is correct
9 Correct 1 ms 2260 KB Output is correct
10 Correct 1 ms 2260 KB Output is correct
11 Correct 1 ms 2260 KB Output is correct
12 Correct 2 ms 2356 KB Output is correct
13 Correct 1 ms 2260 KB Output is correct
14 Correct 1 ms 2260 KB Output is correct
15 Correct 1 ms 2260 KB Output is correct
16 Correct 1 ms 2260 KB Output is correct
17 Correct 1 ms 2388 KB Output is correct
18 Correct 1 ms 2388 KB Output is correct
19 Correct 1 ms 2260 KB Output is correct
20 Correct 1 ms 2388 KB Output is correct
21 Correct 1 ms 2388 KB Output is correct
22 Correct 1 ms 2388 KB Output is correct
23 Correct 1 ms 2260 KB Output is correct
24 Correct 1 ms 2288 KB Output is correct
25 Correct 2 ms 2260 KB Output is correct
26 Correct 1 ms 2260 KB Output is correct
27 Correct 1 ms 2360 KB Output is correct
28 Correct 1 ms 2260 KB Output is correct
29 Correct 2 ms 2356 KB Output is correct
30 Correct 1 ms 2260 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2260 KB Output is correct
2 Correct 1 ms 2352 KB Output is correct
3 Correct 2 ms 2360 KB Output is correct
4 Correct 1 ms 2260 KB Output is correct
5 Correct 1 ms 2360 KB Output is correct
6 Correct 1 ms 2260 KB Output is correct
7 Correct 1 ms 2260 KB Output is correct
8 Correct 2 ms 2388 KB Output is correct
9 Correct 1 ms 2356 KB Output is correct
10 Correct 1 ms 2260 KB Output is correct
11 Correct 1 ms 2260 KB Output is correct
12 Correct 1 ms 2260 KB Output is correct
13 Correct 1 ms 2260 KB Output is correct
14 Correct 2 ms 2356 KB Output is correct
15 Correct 2 ms 2260 KB Output is correct
16 Correct 1 ms 2260 KB Output is correct
17 Correct 2 ms 2356 KB Output is correct
18 Correct 1 ms 2388 KB Output is correct
19 Correct 2 ms 2388 KB Output is correct
20 Correct 1 ms 2260 KB Output is correct
21 Correct 1 ms 2388 KB Output is correct
22 Correct 2 ms 2360 KB Output is correct
23 Correct 1 ms 2260 KB Output is correct
24 Correct 2 ms 2260 KB Output is correct
25 Correct 2 ms 2260 KB Output is correct
26 Correct 2 ms 2260 KB Output is correct
27 Correct 1 ms 2260 KB Output is correct
28 Correct 1 ms 2352 KB Output is correct
29 Correct 1 ms 2260 KB Output is correct
30 Correct 1 ms 2352 KB Output is correct
31 Correct 1 ms 2260 KB Output is correct
32 Correct 4 ms 2772 KB Output is correct
33 Correct 4 ms 2748 KB Output is correct
34 Correct 4 ms 2752 KB Output is correct
35 Correct 3 ms 2644 KB Output is correct
36 Correct 4 ms 2772 KB Output is correct
37 Correct 3 ms 2752 KB Output is correct
38 Correct 4 ms 2772 KB Output is correct
39 Correct 2 ms 2516 KB Output is correct

Subtask #4
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 5540 KB Output is correct
2 Correct 1 ms 2260 KB Output is correct
3 Correct 1 ms 2304 KB Output is correct
4 Correct 19 ms 5056 KB Output is correct
5 Correct 1 ms 2352 KB Output is correct
6 Correct 1 ms 2260 KB Output is correct
7 Correct 1 ms 2260 KB Output is correct
8 Correct 1 ms 2260 KB Output is correct
9 Correct 132 ms 26080 KB Output is correct
10 Correct 2 ms 2260 KB Output is correct
11 Correct 2 ms 2388 KB Output is correct
12 Correct 1 ms 2260 KB Output is correct
13 Correct 2 ms 2260 KB Output is correct
14 Correct 1 ms 2260 KB Output is correct
15 Correct 1 ms 2260 KB Output is correct
16 Correct 2 ms 2388 KB Output is correct
17 Correct 2 ms 2356 KB Output is correct
18 Correct 1 ms 2360 KB Output is correct
19 Correct 1 ms 2260 KB Output is correct
20 Correct 1 ms 2260 KB Output is correct
21 Correct 1 ms 2352 KB Output is correct
22 Correct 2 ms 2388 KB Output is correct
23 Correct 1 ms 2356 KB Output is correct
24 Correct 1 ms 2388 KB Output is correct
25 Correct 2 ms 2388 KB Output is correct
26 Correct 2 ms 2260 KB Output is correct
27 Correct 1 ms 2356 KB Output is correct
28 Correct 1 ms 2356 KB Output is correct
29 Correct 1 ms 2356 KB Output is correct
30 Correct 1 ms 2260 KB Output is correct
31 Correct 1 ms 2356 KB Output is correct
32 Correct 1 ms 2260 KB Output is correct
33 Correct 1 ms 2260 KB Output is correct
34 Correct 2 ms 2260 KB Output is correct
35 Correct 4 ms 2796 KB Output is correct
36 Correct 3 ms 2764 KB Output is correct
37 Correct 4 ms 2644 KB Output is correct
38 Correct 4 ms 2644 KB Output is correct
39 Correct 4 ms 2772 KB Output is correct
40 Correct 3 ms 2652 KB Output is correct
41 Correct 5 ms 2748 KB Output is correct
42 Correct 2 ms 2488 KB Output is correct
43 Correct 4 ms 2912 KB Output is correct
44 Correct 39 ms 13080 KB Output is correct
45 Correct 34 ms 13896 KB Output is correct
46 Correct 39 ms 10896 KB Output is correct
47 Correct 47 ms 7768 KB Output is correct
48 Correct 30 ms 8252 KB Output is correct
49 Correct 65 ms 23024 KB Output is correct
50 Correct 73 ms 21252 KB Output is correct
51 Correct 184 ms 32048 KB Output is correct
52 Correct 124 ms 30376 KB Output is correct
53 Correct 184 ms 24160 KB Output is correct
54 Correct 74 ms 22068 KB Output is correct
55 Correct 28 ms 10256 KB Output is correct
56 Correct 185 ms 31568 KB Output is correct
57 Correct 314 ms 30236 KB Output is correct
58 Correct 178 ms 28928 KB Output is correct
59 Correct 81 ms 22588 KB Output is correct
60 Correct 83 ms 13040 KB Output is correct
61 Correct 43 ms 6756 KB Output is correct
62 Correct 40 ms 9032 KB Output is correct
63 Correct 54 ms 11672 KB Output is correct
64 Correct 52 ms 11824 KB Output is correct
65 Correct 76 ms 11184 KB Output is correct
66 Correct 175 ms 23884 KB Output is correct