| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 311791 |
2020-10-11T17:48:16 Z |
ant101 |
Ideal city (IOI12_city) |
C++14 |
|
91 ms |
17528 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; // 998244353; // = (119<<23)+1
const int MX = 1e5+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;
pl pts[MX];
ll cellsadj[MX][4];
map<ll, map<ll, ll>> gposx;
map<ll, map<ll, ll>> gposy;
ll wh[MX], wl[MX];
vl hnodes[MX], vnodes[MX];
ll currx = 0, curry = 0;
map<ll, ll> c2nx, c2ny;
vl hadj[MX], vadj[MX];
/*
E, S, W, N
0, 1, 2, 3
*/
ll horizcomp = 0, vertcomp = 0;
ll dfsh(ll u, ll p) {
ll totsz = wh[u];
trav(v, hadj[u]) {
if (v != p) {
ll sz = dfsh(v, u);
vertcomp+=mul(sz, N-sz);
add_self(totsz, sz);
}
}
return totsz;
}
ll dfsv(ll u, ll p) {
ll totsz = wl[u];
trav(v, vadj[u]) {
if (v != p) {
ll sz = dfsv(v, u);
horizcomp+=mul(sz, N-sz);
add_self(totsz, sz);
}
}
return totsz;
}
int DistanceSum(int n, int *X, int *Y) {
N = n;
F0R (i, N) {
pts[i] = {X[i], Y[i]};
if (!gposx.count(X[i])) {
map<ll, ll> m;
gposx[X[i]] = m;
}
gposx[X[i]][Y[i]] = i;
if (!gposy.count(Y[i])) {
map<ll, ll> m;
gposy[Y[i]] = m;
}
gposy[Y[i]][X[i]] = i;
}
F0R (i, N) {
F0R (ii, 4) {
ll nx = pts[i].f+dx[ii], ny = pts[i].s+dy[ii];
if (gposx.count(nx)) {
if (gposx[nx].count(ny)) {
cellsadj[i][ii] = gposx[nx][ny];
} else {
cellsadj[i][ii] = -1;
}
} else {
cellsadj[i][ii] = -1;
}
}
}
trav(x, gposx) {
ll lasty = -1;
vl currcomp;
trav(y, x.s) {
if (lasty == -1 || lasty == y.f-1) {
currcomp.pb(y.s);
c2nx[y.s] = currx;
wh[currx]++;
lasty = y.f;
} else {
lasty = y.f;
hnodes[currx++] = currcomp;
currcomp.clear();
currcomp.pb(y.s);
c2nx[y.s] = currx;
wh[currx]++;
}
}
hnodes[currx++] = currcomp;
currcomp.clear();
}
trav(y, gposy) {
ll lastx = -1;
vl currcomp;
trav(x, y.s) {
if (lastx == -1 || lastx == x.f-1) {
currcomp.pb(x.s);
c2ny[x.s] = curry;
wl[curry]++;
lastx = x.f;
} else {
lastx = x.f;
vnodes[curry++] = currcomp;
currcomp.clear();
currcomp.pb(x.s);
c2ny[x.s] = curry;
wl[curry]++;
}
}
vnodes[curry++] = currcomp;
currcomp.clear();
}
F0R (i, currx) {
set<ll> es;
trav(u, hnodes[i]) {
if (cellsadj[u][1] != -1) {
es.insert(c2nx[cellsadj[u][1]]);
}
if (cellsadj[u][3] != -1)
es.insert(c2nx[cellsadj[u][3]]);
}
trav(a, es) {
hadj[i].pb(a);
}
}
F0R (i, curry) {
set<ll> es;
trav(u, vnodes[i]) {
if (cellsadj[u][0] != -1)
es.insert(c2ny[cellsadj[u][0]]);
if (cellsadj[u][2] != -1)
es.insert(c2ny[cellsadj[u][2]]);
}
trav(a, es) {
vadj[i].pb(a);
}
}
dfsh(0, -1);
dfsv(0, -1);
return horizcomp+vertcomp;
}
Compilation message
city.cpp: In function 'void io::setIn(std::string)':
city.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); }
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
city.cpp: In function 'void io::setOut(std::string)':
city.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 |
6 ms |
9728 KB |
Output is correct |
| 2 |
Correct |
6 ms |
9728 KB |
Output is correct |
| 3 |
Correct |
6 ms |
9728 KB |
Output is correct |
| 4 |
Correct |
7 ms |
9728 KB |
Output is correct |
| 5 |
Correct |
6 ms |
9728 KB |
Output is correct |
| 6 |
Correct |
7 ms |
9856 KB |
Output is correct |
| 7 |
Correct |
8 ms |
9984 KB |
Output is correct |
| 8 |
Correct |
7 ms |
9856 KB |
Output is correct |
| 9 |
Correct |
7 ms |
9856 KB |
Output is correct |
| 10 |
Correct |
7 ms |
9856 KB |
Output is correct |
| 11 |
Correct |
6 ms |
9856 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
9 ms |
10240 KB |
Output is correct |
| 2 |
Correct |
11 ms |
10112 KB |
Output is correct |
| 3 |
Correct |
11 ms |
10368 KB |
Output is correct |
| 4 |
Correct |
10 ms |
10240 KB |
Output is correct |
| 5 |
Correct |
12 ms |
10496 KB |
Output is correct |
| 6 |
Correct |
12 ms |
10496 KB |
Output is correct |
| 7 |
Correct |
12 ms |
10496 KB |
Output is correct |
| 8 |
Correct |
12 ms |
10496 KB |
Output is correct |
| 9 |
Correct |
12 ms |
10496 KB |
Output is correct |
| 10 |
Correct |
12 ms |
10496 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
91 ms |
16432 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
91 ms |
17528 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
