#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
#define sz(x) (int)x.size()
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt __builtin_popcount
#define pb push_back
#define popf pop_front
#define popb pop_back
#define ld long double
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
// for random generations
// mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
mt19937 myrand(373);
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
fastIO();
if(str == "input") {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
} else {
// freopen("skis.in", "r", stdin);
// freopen("skis.out", "w", stdout);
}
}
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const long long inf = -1e18;
const int N = 3e5 + 10;
long long a[N][3], ans;
long long x[N], y[N];
long long n;
void upd(int i) {
long long new_x = x[i], new_y = y[i];
if(y[i] <= 1) {
new_y = 1;
ans += 1 - y[i];
} else {
new_y = 2;
ans += y[i] - 2;
}
if(x[i] < 1) {
new_x = 1;
ans += 1 - x[i];
} else if(x[i] > n) {
new_x = n;
ans += x[i] - n;
}
a[new_x][new_y]++;
}
void solve_() {
cin >> n;
for(int i = 1; i <= 2 * n; i++) {
cin >> x[i] >> y[i];
upd(i);
}
int it = 1;
for(int i = 1; i <= n; i++) {
if(a[i][1] && a[i][2]) {
a[i][1]--, a[i][2]--;
} else {
bool f1 = false, f2 = false;
if(a[i][1]) {
a[i][1]--;
f1 = true;
if(a[i][1]) {
a[i][1]--;
f2 = true;
ans++;
}
}
if(a[i][2]) {
a[i][2]--;
f2 = true;
if(a[i][2]) {
a[i][2]--;
f1 = true;
ans++;
}
}
if(!f1 && !f2) {
while(it <= n && !a[it][1] && !a[it][2]) {
it++;
}
assert(it <= n);
if(!f1 && a[it][1]) a[it][1]--, f1 = true, ans += it - i;
if(!f2 && a[it][2]) a[it][2]--, f2 = true, ans += it - i;
if(!f1 && a[it][2]) a[it][2]--, f1 = true, ans += it - i + 1;
if(!f2 && a[it][1]) a[it][1]--, f2 = true, ans += it - i + (f1 != true);
while(it <= n && !a[it][1] && !a[it][2]) {
it++;
}
assert(it <= n);
if(!f1 && a[it][1]) a[it][1]--, f1 = true, ans += it - i;
if(!f2 && a[it][2]) a[it][2]--, f2 = true, ans += it - i;
if(!f1 && a[it][2]) a[it][2]--, f1 = true, ans += it - i;
if(!f2 && a[it][1]) a[it][1]--, f2 = true, ans += it - i;
} else if(!f1 || !f2) {
while(it <= n && !a[it][1] && !a[it][2]) {
it++;
}
assert(it <= n);
if(!f1 && a[it][1]) a[it][1]--, f1 = true, ans += it - i;
if(!f2 && a[it][2]) a[it][2]--, f2 = true, ans += it - i;
if(!f1 && a[it][2]) a[it][2]--, f1 = true, ans += it - i;
if(!f2 && a[it][1]) a[it][1]--, f2 = true, ans += it - i;
while(it <= n && !a[it][1] && !a[it][2]) {
it++;
}
assert(it <= n);
if(!f1 && a[it][1]) a[it][1]--, f1 = true, ans += it - i;
if(!f2 && a[it][2]) a[it][2]--, f2 = true, ans += it - i;
if(!f1 && a[it][2]) a[it][2]--, f1 = true, ans += it - i;
if(!f2 && a[it][1]) a[it][1]--, f2 = true, ans += it - i;
}
}
//
a[i + 1][1] += a[i][1];
a[i + 1][2] += a[i][2];
ans += a[i][1];
ans += a[i][2];
a[i][1] = 0, a[i][2] = 0;
}
cout << ans << '\n';
}
int main() {
setIO();
auto solve = [&](int test_case)-> void {
for(int i = 1; i <= test_case; i++) {
// cout << "Case #" << i << ": ";
solve_();
}
};
int test_cases = 1;
// cin >> test_cases;
solve(test_cases);
return 0;
}
Compilation message
joi2019_ho_t4.cpp: In function 'void setIO(std::string)':
joi2019_ho_t4.cpp:69:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
69 | freopen("input.txt", "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t4.cpp:70:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
70 | freopen("output.txt", "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
340 KB |
Output is correct |
| 2 |
Correct |
0 ms |
340 KB |
Output is correct |
| 3 |
Correct |
0 ms |
340 KB |
Output is correct |
| 4 |
Correct |
1 ms |
340 KB |
Output is correct |
| 5 |
Correct |
0 ms |
340 KB |
Output is correct |
| 6 |
Correct |
0 ms |
340 KB |
Output is correct |
| 7 |
Correct |
0 ms |
340 KB |
Output is correct |
| 8 |
Correct |
1 ms |
340 KB |
Output is correct |
| 9 |
Correct |
0 ms |
340 KB |
Output is correct |
| 10 |
Incorrect |
0 ms |
340 KB |
Output isn't correct |
| 11 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
340 KB |
Output is correct |
| 2 |
Correct |
0 ms |
340 KB |
Output is correct |
| 3 |
Correct |
0 ms |
340 KB |
Output is correct |
| 4 |
Correct |
1 ms |
340 KB |
Output is correct |
| 5 |
Correct |
0 ms |
340 KB |
Output is correct |
| 6 |
Correct |
0 ms |
340 KB |
Output is correct |
| 7 |
Correct |
0 ms |
340 KB |
Output is correct |
| 8 |
Correct |
1 ms |
340 KB |
Output is correct |
| 9 |
Correct |
0 ms |
340 KB |
Output is correct |
| 10 |
Incorrect |
0 ms |
340 KB |
Output isn't correct |
| 11 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
340 KB |
Output is correct |
| 2 |
Correct |
0 ms |
340 KB |
Output is correct |
| 3 |
Correct |
0 ms |
340 KB |
Output is correct |
| 4 |
Correct |
1 ms |
340 KB |
Output is correct |
| 5 |
Correct |
0 ms |
340 KB |
Output is correct |
| 6 |
Correct |
0 ms |
340 KB |
Output is correct |
| 7 |
Correct |
0 ms |
340 KB |
Output is correct |
| 8 |
Correct |
1 ms |
340 KB |
Output is correct |
| 9 |
Correct |
0 ms |
340 KB |
Output is correct |
| 10 |
Incorrect |
0 ms |
340 KB |
Output isn't correct |
| 11 |
Halted |
0 ms |
0 KB |
- |
