Submission #6336689
Source Code Expand
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define F0Rd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rsz resize
const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int MX = 200005;
const ld PI = 4*atan((ld)1);
template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }
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]); }
}
using namespace input;
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;
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
if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}
}
using namespace io;
template<class T> T invGeneral(T a, T b) {
a %= b; if (a == 0) return b == 1 ? 0 : -1;
T x = invGeneral(b,a);
return x == -1 ? -1 : ((1-(ll)b*x)/a+b)%b;
}
template<class T> struct modular {
T val;
explicit operator T() const { return val; }
modular() { val = 0; }
template<class U> modular(const U& v) {
val = (-MOD <= v && v <= MOD) ? v : v % MOD;
if (val < 0) val += MOD;
}
friend ostream& operator<<(ostream& os, const modular& a) { return os << a.val; }
friend bool operator==(const modular& a, const modular& b) { return a.val == b.val; }
friend bool operator!=(const modular& a, const modular& b) { return !(a == b); }
modular operator-() const { return modular(-val); }
modular& operator+=(const modular& m) { if ((val += m.val) >= MOD) val -= MOD; return *this; }
modular& operator-=(const modular& m) { if ((val -= m.val) < 0) val += MOD; return *this; }
modular& operator*=(const modular& m) { val = (ll)val*m.val%MOD; return *this; }
friend modular exp(modular a, ll p) {
modular ans = 1; for (; p; p /= 2, a *= a) if (p&1) ans *= a;
return ans;
}
friend modular inv(const modular& a) {
auto i = invGeneral(a.val,MOD); assert(i != -1);
return i;
} // equivalent to return exp(b,MOD-2) if MOD is prime
modular& operator/=(const modular& m) { return (*this) *= inv(m); }
friend modular operator+(modular a, const modular& b) { return a += b; }
friend modular operator-(modular a, const modular& b) { return a -= b; }
friend modular operator*(modular a, const modular& b) { return a *= b; }
friend modular operator/(modular a, const modular& b) { return a /= b; }
};
typedef modular<int> mi;
typedef pair<mi,mi> pmi;
typedef vector<mi> vmi;
typedef vector<pmi> vpmi;
int N;
set<pi> S;
void as(bool b) {
if (!b) {
ps(-1);
exit(0);
}
}
bool nex(pi a, pi b) {
return a == b || b == mp(a.f+1,a.s-1);
}
int ans, cur;
void elim(bool a, int b) {
if (!a) cur = b;
else {
ans -= min(cur,b);
cur = b-min(cur,b);
}
}
bool con(pi x) {
return S.count(x);
}
void tri(vpi v) {
map<pi,int> m; trav(t,v) m[t] ++;
auto V = vector<pair<pi,int>>(all(m));
// ps(V);
cur = 0;
F0R(i,sz(V)) {
if (i == 0) cur = V[i].s;
elim(con({V[i].f.f-1,V[i].f.s-1}),V[i].s);
if (i+1 < sz(V)) elim(1,V[i+1].s);
}
// ps("HA",ans);
}
int main() {
setIO(); re(N); ans = 2*N-2;
vpi v;
F0R(i,N) {
int A,B; re(A,B);
if (i == 0) as(A == 0);
else as(A != 0);
if (i == 1) as(B == 0);
else as(B != 0);
v.pb({A,B});
S.insert({A,B});
}
trav(t,S) {
if (t.s) {
bool ok = 0;
FOR(i,-1,2) ok |= S.count({t.f+i,t.s-1});
as(ok);
}
if (t.f) {
bool ok = 0;
FOR(i,-1,2) ok |= S.count({t.f-1,t.s+i});
as(ok);
}
}
sort(all(v),[](pi a, pi b) {
if (a.f+a.s != b.f+b.s) return a.f+a.s < b.f+b.s;
return a.f < b.f;
});
for (int i = 0; i < sz(v);) {
vpi tmp = {v[i]};
while (i+1 < sz(v) && nex(v[i],v[i+1])) tmp.pb(v[++i]);
i ++;
tri(tmp);
}
ps(ans);
}
/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?), set tle
* do smth instead of nothing and stay organized
*/
Submission Info
Submission Time |
|
Task |
A - Distance Pairs |
User |
Benq |
Language |
C++14 (GCC 5.4.1) |
Score |
1500 |
Code Size |
7648 Byte |
Status |
AC |
Exec Time |
139 ms |
Memory |
14708 KB |
Compile Error
./Main.cpp: In function ‘void io::setIn(std::string)’:
./Main.cpp:113:56: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
void setIn(string s) { freopen(s.c_str(),"r",stdin); }
^
./Main.cpp: In function ‘void io::setOut(std::string)’:
./Main.cpp:114:58: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
void setOut(string s) { freopen(s.c_str(),"w",stdout); }
^
Judge Result
Set Name |
sample |
All |
Score / Max Score |
0 / 0 |
1500 / 1500 |
Status |
|
|
Set Name |
Test Cases |
sample |
sample-01.txt, sample-02.txt |
All |
sample-01.txt, sample-02.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt, 01-27.txt, 01-28.txt, 01-29.txt, 01-30.txt, 01-31.txt, sample-01.txt, sample-02.txt |
Case Name |
Status |
Exec Time |
Memory |
01-01.txt |
AC |
50 ms |
5748 KB |
01-02.txt |
AC |
18 ms |
1400 KB |
01-03.txt |
AC |
1 ms |
256 KB |
01-04.txt |
AC |
1 ms |
256 KB |
01-05.txt |
AC |
2 ms |
256 KB |
01-06.txt |
AC |
13 ms |
1144 KB |
01-07.txt |
AC |
37 ms |
1624 KB |
01-08.txt |
AC |
37 ms |
1528 KB |
01-09.txt |
AC |
27 ms |
1400 KB |
01-10.txt |
AC |
22 ms |
1524 KB |
01-11.txt |
AC |
32 ms |
1460 KB |
01-12.txt |
AC |
31 ms |
1452 KB |
01-13.txt |
AC |
121 ms |
6516 KB |
01-14.txt |
AC |
139 ms |
14708 KB |
01-15.txt |
AC |
116 ms |
5748 KB |
01-16.txt |
AC |
17 ms |
2804 KB |
01-17.txt |
AC |
18 ms |
2804 KB |
01-18.txt |
AC |
17 ms |
2804 KB |
01-19.txt |
AC |
125 ms |
8048 KB |
01-20.txt |
AC |
112 ms |
7052 KB |
01-21.txt |
AC |
114 ms |
7156 KB |
01-22.txt |
AC |
76 ms |
4240 KB |
01-23.txt |
AC |
26 ms |
1528 KB |
01-24.txt |
AC |
26 ms |
1528 KB |
01-25.txt |
AC |
1 ms |
256 KB |
01-26.txt |
AC |
1 ms |
256 KB |
01-27.txt |
AC |
14 ms |
1112 KB |
01-28.txt |
AC |
12 ms |
1020 KB |
01-29.txt |
AC |
1 ms |
256 KB |
01-30.txt |
AC |
1 ms |
256 KB |
01-31.txt |
AC |
1 ms |
256 KB |
sample-01.txt |
AC |
1 ms |
256 KB |
sample-02.txt |
AC |
1 ms |
256 KB |