problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k ⌀ | fixed_code stringlengths 12 526k ⌀ | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M ⌀ | fixed_submission_id int64 2 1.54M ⌀ | user_id stringlengths 10 10 ⌀ | language stringclasses 9 values |
|---|---|---|---|---|---|---|---|
p03005 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, p;
cin >> n >> p;
if (n > 1)
cout << p - n;
else
cout << 0 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, p;
cin >> n >> p;
if (p > 1)
cout << n - p;
else
cout << 0 << endl;
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 819,594 | 819,593 | u911150465 | cpp |
p03005 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define MOD 1000000007 // 10^9 + 7
#define INF 1000000000 // 10^9
#define LLINF 1LL << 60
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
if (K != 0)
cout << N - K << endl;
else
cout << 0 << endl;
return 0;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define MOD 1000000007 // 10^9 + 7
#define INF 1000000000 // 10^9
#define LLINF 1LL << 60
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
if (K != 1)
cout << N - K << endl;
else
cout << 0 << endl;
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 819,595 | 819,596 | u774652316 | cpp |
p03005 | #include <cmath>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (K == 1)
cout << N;
else
cout << N - K << endl;
return 0;
}
| #include <cmath>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (K == 1)
cout << 0 << endl;
else
cout << N - K << endl;
return 0;
}
| [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change",
"io.output.newline.add"
] | 819,599 | 819,600 | u982234424 | cpp |
p03005 | #include <iostream>
using namespace std;
int main(void) {
int n, k;
cin >> n >> k;
int ans = n - k;
if (k = 1)
ans = 0;
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
int n, k;
cin >> n >> k;
int ans = n - k;
if (k == 1)
ans = 0;
cout << ans << endl;
return 0;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 819,605 | 819,606 | u803893892 | cpp |
p03005 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (n == 1) {
cout << 0 << endl;
return 0;
}
cout << k - n << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (k == 1) {
cout << 0 << endl;
return 0;
}
cout << n - k << endl;
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 819,614 | 819,615 | u071036035 | cpp |
p03005 | #include <algorithm>
#include <cstdbool>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1000000000000000;
const ll inf = -1e18;
typedef pair<ll, ll> P;
ll ma = 1000000000 + 7;
ll mx = 1000003;
ll h, w, n, m;
string s, t;
char maze[60][60];
int dis[101][101];
int graph[52][52];
bool vis[52];
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
ll gcd(ll x, ll y) {
if (x % y == 0)
return y;
return gcd(y, x % y);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
void comb(vector<vector<ll>> &v) {
for (ll i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (ll k = 1; k < v.size(); k++) {
for (int j = 1; j < k; j++) {
v[k][j] = (v[k - 1][j - 1] + v[k - 1][j]);
}
}
}
int main() {
cin >> n >> m;
ll a = n - (m - 1);
if (m == 1) {
a = 0;
}
cout << a - 1 << endl;
}
| #include <algorithm>
#include <cstdbool>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1000000000000000;
const ll inf = -1e18;
typedef pair<ll, ll> P;
ll ma = 1000000000 + 7;
ll mx = 1000003;
ll h, w, n, m;
string s, t;
char maze[60][60];
int dis[101][101];
int graph[52][52];
bool vis[52];
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
ll gcd(ll x, ll y) {
if (x % y == 0)
return y;
return gcd(y, x % y);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
void comb(vector<vector<ll>> &v) {
for (ll i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (ll k = 1; k < v.size(); k++) {
for (int j = 1; j < k; j++) {
v[k][j] = (v[k - 1][j - 1] + v[k - 1][j]);
}
}
}
int main() {
cin >> n >> m;
ll a = n - (m - 1);
if (m == 1) {
a = 1;
}
cout << a - 1 << endl;
}
| [
"literal.number.change",
"assignment.value.change"
] | 819,616 | 819,617 | u240031669 | cpp |
p03005 | #include <algorithm>
#include <cstdbool>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1000000000000000;
const ll inf = -1e18;
typedef pair<ll, ll> P;
ll ma = 1000000000 + 7;
ll mx = 1000003;
ll h, w, n, m;
string s, t;
char maze[60][60];
int dis[101][101];
int graph[52][52];
bool vis[52];
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
ll gcd(ll x, ll y) {
if (x % y == 0)
return y;
return gcd(y, x % y);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
void comb(vector<vector<ll>> &v) {
for (ll i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (ll k = 1; k < v.size(); k++) {
for (int j = 1; j < k; j++) {
v[k][j] = (v[k - 1][j - 1] + v[k - 1][j]);
}
}
}
int main() {
cin >> n >> m;
ll a = n - (m - 1);
if (m == 1) {
a = 0;
}
cout << a << endl;
}
| #include <algorithm>
#include <cstdbool>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1000000000000000;
const ll inf = -1e18;
typedef pair<ll, ll> P;
ll ma = 1000000000 + 7;
ll mx = 1000003;
ll h, w, n, m;
string s, t;
char maze[60][60];
int dis[101][101];
int graph[52][52];
bool vis[52];
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
ll gcd(ll x, ll y) {
if (x % y == 0)
return y;
return gcd(y, x % y);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
void comb(vector<vector<ll>> &v) {
for (ll i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (ll k = 1; k < v.size(); k++) {
for (int j = 1; j < k; j++) {
v[k][j] = (v[k - 1][j - 1] + v[k - 1][j]);
}
}
}
int main() {
cin >> n >> m;
ll a = n - (m - 1);
if (m == 1) {
a = 1;
}
cout << a - 1 << endl;
}
| [
"literal.number.change",
"assignment.value.change"
] | 819,618 | 819,617 | u240031669 | cpp |
p03005 | /*
*/
#include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (k == 0)
cout << 0 << endl;
else
cout << n - k << endl;
return 0;
} | /*
*/
#include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (k <= 1)
cout << 0 << endl;
else
cout << n - k << endl;
return 0;
} | [] | 819,621 | 819,622 | u697987631 | cpp |
p03005 | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (k == 1) {
cout << 0 << endl;
}
cout << n - k << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (k == 1) {
cout << 0 << endl;
} else {
cout << n - k << endl;
}
return 0;
} | [
"control_flow.branch.else.add"
] | 819,625 | 819,626 | u611571299 | cpp |
p03005 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define ll long long
#define pb push_back
#define sz(x) (int)(x).size()
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define D(x) cerr << #x << " is " << (x) << "\n";
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template <class T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag,
tree_order_statistics_node_update>; /// find_by_order(),order_of_key()
template <class T1, class T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &a) {
os << '{' << a.f << ", " << a.s << '}';
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &a) {
os << '{';
for (int i = 0; i < sz(a); i++) {
if (i > 0 && i < sz(a))
os << ", ";
os << a[i];
}
os << '}';
return os;
}
template <class T> ostream &operator<<(ostream &os, const set<T> &a) {
os << '{';
int i = 0;
for (auto p : a) {
if (i > 0 && i < sz(a))
os << ", ";
os << p;
i++;
}
os << '}';
return os;
}
template <class T> ostream &operator<<(ostream &os, const multiset<T> &a) {
os << '{';
int i = 0;
for (auto p : a) {
if (i > 0 && i < sz(a))
os << ", ";
os << p;
i++;
}
os << '}';
return os;
}
template <class T1, class T2>
ostream &operator<<(ostream &os, const map<T1, T2> &a) {
os << '{';
int i = 0;
for (auto p : a) {
if (i > 0 && i < sz(a))
os << ", ";
os << p;
i++;
}
os << '}';
return os;
}
int main() {
int n, k;
scanf("%i %i", &n, &k);
if (n == 1) {
printf("0\n");
return 0;
}
printf("%i\n", n - k);
return 0;
}
| #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define ll long long
#define pb push_back
#define sz(x) (int)(x).size()
#define mp make_pair
#define f first
#define s second
#define all(x) x.begin(), x.end()
#define D(x) cerr << #x << " is " << (x) << "\n";
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template <class T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag,
tree_order_statistics_node_update>; /// find_by_order(),order_of_key()
template <class T1, class T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &a) {
os << '{' << a.f << ", " << a.s << '}';
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &a) {
os << '{';
for (int i = 0; i < sz(a); i++) {
if (i > 0 && i < sz(a))
os << ", ";
os << a[i];
}
os << '}';
return os;
}
template <class T> ostream &operator<<(ostream &os, const set<T> &a) {
os << '{';
int i = 0;
for (auto p : a) {
if (i > 0 && i < sz(a))
os << ", ";
os << p;
i++;
}
os << '}';
return os;
}
template <class T> ostream &operator<<(ostream &os, const multiset<T> &a) {
os << '{';
int i = 0;
for (auto p : a) {
if (i > 0 && i < sz(a))
os << ", ";
os << p;
i++;
}
os << '}';
return os;
}
template <class T1, class T2>
ostream &operator<<(ostream &os, const map<T1, T2> &a) {
os << '{';
int i = 0;
for (auto p : a) {
if (i > 0 && i < sz(a))
os << ", ";
os << p;
i++;
}
os << '}';
return os;
}
int main() {
int n, k;
scanf("%i %i", &n, &k);
if (k == 1) {
printf("0\n");
return 0;
}
printf("%i\n", n - k);
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,635 | 819,636 | u013064880 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define VV vector
#define pb push_back
#define bitc __builtin_popcountl
#define m_p make_pair
#define inf 1000000000000000000ll
#define MAXN 1000001
#define eps 0.0000000001
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
string char_to_str(char c) {
string tem(1, c);
return tem;
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template <class T> // usage rand<long long>()
T rand() {
return uniform_int_distribution<T>()(rng);
}
// string to integer stuuu()
// string to long long stoll()
// string.substr(position,length);
// integer to string to_string();
//////////////
#define S second
#define F first
#define int long long
///////
signed main() {
fastio;
#ifdef ANIKET_GOYAL
freopen("inputf.in", "r", stdin);
freopen("outputf.in", "w", stdout);
#endif
int n, k;
cin >> n >> k;
if (n == 1) {
cout << "0";
} else {
cout << n - k;
}
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define VV vector
#define pb push_back
#define bitc __builtin_popcountl
#define m_p make_pair
#define inf 1000000000000000000ll
#define MAXN 1000001
#define eps 0.0000000001
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
string char_to_str(char c) {
string tem(1, c);
return tem;
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template <class T> // usage rand<long long>()
T rand() {
return uniform_int_distribution<T>()(rng);
}
// string to integer stuuu()
// string to long long stoll()
// string.substr(position,length);
// integer to string to_string();
//////////////
#define S second
#define F first
#define int long long
///////
signed main() {
fastio;
#ifdef ANIKET_GOYAL
freopen("inputf.in", "r", stdin);
freopen("outputf.in", "w", stdout);
#endif
int n, k;
cin >> n >> k;
if (k == 1) {
cout << "0";
} else {
cout << n - k;
}
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,639 | 819,640 | u883546077 | cpp |
p03005 | #include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define RREP(i, n) for (ll i = ll(n) - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < ll(n); ++i)
#define RFOR(i, m, n) for (ll i = ll(n) - 1; i >= ll(m); --i)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) v.erase(unique(ALL(v)), v.end());
#define INF 1000000001ll
#define MOD 1000000007ll
#define EPS 1e-9
constexpr int dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
constexpr int dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
if (n == 0)
cout << 0 << endl;
else
cout << n - k << endl;
} | #include "bits/stdc++.h"
#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define RREP(i, n) for (ll i = ll(n) - 1; i >= 0; --i)
#define FOR(i, m, n) for (ll i = m; i < ll(n); ++i)
#define RFOR(i, m, n) for (ll i = ll(n) - 1; i >= ll(m); --i)
#define ALL(v) (v).begin(), (v).end()
#define UNIQUE(v) v.erase(unique(ALL(v)), v.end());
#define INF 1000000001ll
#define MOD 1000000007ll
#define EPS 1e-9
constexpr int dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
constexpr int dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
if (k == 1)
cout << 0 << endl;
else
cout << n - k << endl;
} | [
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 819,641 | 819,642 | u918357423 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (k == 1) {
cout << 1;
;
} else {
cout << n - k;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (k == 1) {
cout << 0;
} else {
cout << n - k;
}
return 0;
} | [
"literal.number.change",
"io.output.change"
] | 819,645 | 819,646 | u058348416 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x "=" << x << endl
#define mmax(x, y) (x > y ? x : y)
#define mmin(x, y) (x < y ? x : y)
#define maxch(x, y) x = mmax(x, y)
#define minch(x, y) x = mmin(x, y)
#define uni(x) x.erase(unique(all(x)), x.end())
#define exist(x, y) (find(all(x), y) != x.end())
#define bcnt __builtin_popcountll
#define INF 1e16
#define mod 1000000007
ll n, k;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> k;
if (k == 0)
cout << 0 << endl;
else
cout << ((n - k + 1) - 1) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x "=" << x << endl
#define mmax(x, y) (x > y ? x : y)
#define mmin(x, y) (x < y ? x : y)
#define maxch(x, y) x = mmax(x, y)
#define minch(x, y) x = mmin(x, y)
#define uni(x) x.erase(unique(all(x)), x.end())
#define exist(x, y) (find(all(x), y) != x.end())
#define bcnt __builtin_popcountll
#define INF 1e16
#define mod 1000000007
ll n, k;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> k;
if (k == 1)
cout << 0 << endl;
else
cout << ((n - k + 1) - 1) << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 819,647 | 819,648 | u762921614 | cpp |
p03005 | #include <bits/stdc++.h>
#define jizz ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define pb push_back
#define ET cout << "\n"
#define MEM(i, j) memset(i, j, sizeof i)
#define F first
#define S second
#define MP make_pair
#define ALL(v) v.begin(), v.end()
#define DB(a, s, e) \
{ \
for (int i = s; i < e; ++i) \
cout << a[i] << " "; \
ET; \
}
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int main() {
jizz int n, k;
cin >> n >> k;
if (n > 1)
cout << n - k << "\n";
else
cout << "0\n";
} | #include <bits/stdc++.h>
#define jizz ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define pb push_back
#define ET cout << "\n"
#define MEM(i, j) memset(i, j, sizeof i)
#define F first
#define S second
#define MP make_pair
#define ALL(v) v.begin(), v.end()
#define DB(a, s, e) \
{ \
for (int i = s; i < e; ++i) \
cout << a[i] << " "; \
ET; \
}
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int main() {
jizz int n, k;
cin >> n >> k;
if (k > 1)
cout << n - k << "\n";
else
cout << "0\n";
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,649 | 819,650 | u241716904 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
int main() {
int a, b;
cin >> a, b;
if (b == 1) {
cout << 0 << endl;
return 0;
}
cout << a - b;
} | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
int main() {
int a, b;
cin >> a >> b;
if (b == 1) {
cout << 0 << endl;
return 0;
}
cout << a - b;
} | [] | 819,653 | 819,654 | u687204015 | cpp |
p03005 | #include "bits/stdc++.h"
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REP1(i, n) for (ll i = 1; i < n; i++)
#define REPR(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())
#define ll long long
#define ALL(a) (a).begin(), (a).end()
#define pb(a) push_back(a)
#define MOD 1000000007
int now, n, k;
int main() {
int ans = 0;
cin >> n >> k;
if (n == 1) {
cout << 0 << endl;
return 0;
} else {
cout << (n - k) << endl;
return 0;
}
cout << ans << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REP1(i, n) for (ll i = 1; i < n; i++)
#define REPR(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())
#define ll long long
#define ALL(a) (a).begin(), (a).end()
#define pb(a) push_back(a)
#define MOD 1000000007
int now, n, k;
int main() {
int ans = 0;
cin >> n >> k;
if (k == 1) {
cout << 0 << endl;
return 0;
} else {
cout << (n - k) << endl;
return 0;
}
cout << ans << endl;
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,657 | 819,658 | u837951457 | cpp |
p03005 | #include <bits/stdc++.h>
#define SPEED \
ios::sync_with_stdio(false); \
cin.tie(0)
#define loop(i, a, b) for (int i = a; i < b; i++)
#define ll long long
#define vi vector<int>
#define vl vector<ll>
#define pii pair<int, int>
#define pll pair<long long int, long long int>
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define mo 1000000007
#define INF 1e18
#define eps 0.0000000001
#define stp setprecision(20)
#define endl '\n'
using namespace std;
// mt19937 rng32(chrono::steady_clock::now().time_since_epoch().count());
#define N int(2e5) + 10
int main() {
SPEED;
int n, k;
cin >> n >> k;
int maxi, mini;
if (n == 1) {
cout << 0;
return 0;
} else {
cout << (n - k);
}
}
| #include <bits/stdc++.h>
#define SPEED \
ios::sync_with_stdio(false); \
cin.tie(0)
#define loop(i, a, b) for (int i = a; i < b; i++)
#define ll long long
#define vi vector<int>
#define vl vector<ll>
#define pii pair<int, int>
#define pll pair<long long int, long long int>
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define mo 1000000007
#define INF 1e18
#define eps 0.0000000001
#define stp setprecision(20)
#define endl '\n'
using namespace std;
// mt19937 rng32(chrono::steady_clock::now().time_since_epoch().count());
#define N int(2e5) + 10
int main() {
SPEED;
int n, k;
cin >> n >> k;
int maxi, mini;
if (k == 1) {
cout << 0;
return 0;
} else {
cout << (n - k);
}
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,659 | 819,660 | u908982828 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int ans;
if (N == 1) {
ans = 0;
} else {
ans = N - K;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
int ans;
if (K == 1) {
ans = 0;
} else {
ans = N - K;
}
cout << ans << endl;
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,661 | 819,662 | u541263126 | cpp |
p03005 | #pragma region Macros
#include <bits/stdc++.h>
using namespace std;
// iteration helper
#define FOR(i, l, r) for (int i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define RREP(i, n) RFOR(i, 0, n)
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define EXIST(s, e) ((s).find(e) != (s).end())
#define PB push_back
// MyVector
template <typename T>
class MyVector : private std::vector<T, std::allocator<T>> {
public:
using basetype = std::vector<T, std::allocator<T>>;
using basetype::vector; // constractor
using basetype::operator=;
using basetype::begin;
using basetype::capacity;
using basetype::cbegin;
using basetype::cend;
using basetype::crbegin;
using basetype::crend;
using basetype::empty;
using basetype::end;
using basetype::max_size;
using basetype::rbegin;
using basetype::rend;
using basetype::reserve;
using basetype::resize;
using basetype::shrink_to_fit;
using basetype::size;
// []のかわりに at をつかう
typename MyVector<T>::reference operator[](typename basetype::size_type n) {
basetype::at(n);
}
typename MyVector<T>::const_reference
operator[](typename basetype::size_type n) const {
basetype::at(n);
};
using basetype::assign;
using basetype::at;
using basetype::back;
using basetype::clear;
using basetype::data;
using basetype::emplace;
using basetype::emplace_back;
using basetype::erase;
using basetype::front;
using basetype::insert;
using basetype::pop_back;
using basetype::push_back;
using basetype::swap;
};
#ifdef _DEBUG
#define vector MyVector
#else
#define vector std::vector
#endif
// typedefs
#define ll long long
#define vi vector<int>
#define vi2 vector<vi>
// input
#define ci(x) \
int x; \
cin >> x
#define cs(x) \
string x; \
cin >> x
#define cd(x) \
double x; \
cin >> x
#define cvi(x, n) \
vi x(n); \
REP(i, n) { cin >> x[i]; }
// const input
#define cci(x) \
const int x = []() { \
int t; \
cin >> t; \
return t; \
}()
#define ccs(x) \
const string x = []() { \
string t; \
cin >> t; \
return t; \
}()
#define ccd(x) \
const double x = []() { \
double t; \
cin >> t; \
return t; \
}()
// output
#define pr(x) cout << x << endl
#define prvec(v) REP(i, v.size()) pr(v[i])
#define ppr(x) cout << x
#define lf() cout << endl
// debug methods
// usage: debug(x,y);
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define debug_1(x1) cout << #x1 << ": " << x1 << endl
#define debug_2(x1, x2) \
cout << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << endl
#define debug_3(x1, x2, x3) \
cout << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << ", " #x3 << ": " \
<< x3 << endl
#define debug_4(x1, x2, x3, x4) \
cout << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << ", " #x3 << ": " \
<< x3 << ", " #x4 << ": " << x4 << endl
#define debug_5(x1, x2, x3, x4, x5) \
cout << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << ", " #x3 << ": " \
<< x3 << ", " #x4 << ": " << x4 << ", " #x5 << ": " << x5 << endl
#ifdef _DEBUG
#define debug(...) \
CHOOSE((__VA_ARGS__, debug_5, debug_4, debug_3, debug_2, debug_1, ~)) \
(__VA_ARGS__)
#else
#define debug(...)
#endif
// const number
const double PI = acos(-1.0);
const double EPS = 1e-10;
int powint(int a, int x) {
int res = 1;
REP(i, x) { res = res * a; }
return res;
}
#pragma endregion
signed main() {
#ifdef _DEBUG
try {
#endif
// main program ---------------------------------------------
cci(N);
cci(K);
if (K == 1)
pr(1);
else {
pr(N - K);
}
// end main program -----------------------------------------
#ifdef _DEBUG
} catch (std::out_of_range &ex) {
pr("out of range");
}
#endif
return 0;
}
| #pragma region Macros
#include <bits/stdc++.h>
using namespace std;
// iteration helper
#define FOR(i, l, r) for (int i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define RREP(i, n) RFOR(i, 0, n)
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define EXIST(s, e) ((s).find(e) != (s).end())
#define PB push_back
// MyVector
template <typename T>
class MyVector : private std::vector<T, std::allocator<T>> {
public:
using basetype = std::vector<T, std::allocator<T>>;
using basetype::vector; // constractor
using basetype::operator=;
using basetype::begin;
using basetype::capacity;
using basetype::cbegin;
using basetype::cend;
using basetype::crbegin;
using basetype::crend;
using basetype::empty;
using basetype::end;
using basetype::max_size;
using basetype::rbegin;
using basetype::rend;
using basetype::reserve;
using basetype::resize;
using basetype::shrink_to_fit;
using basetype::size;
// []のかわりに at をつかう
typename MyVector<T>::reference operator[](typename basetype::size_type n) {
basetype::at(n);
}
typename MyVector<T>::const_reference
operator[](typename basetype::size_type n) const {
basetype::at(n);
};
using basetype::assign;
using basetype::at;
using basetype::back;
using basetype::clear;
using basetype::data;
using basetype::emplace;
using basetype::emplace_back;
using basetype::erase;
using basetype::front;
using basetype::insert;
using basetype::pop_back;
using basetype::push_back;
using basetype::swap;
};
#ifdef _DEBUG
#define vector MyVector
#else
#define vector std::vector
#endif
// typedefs
#define ll long long
#define vi vector<int>
#define vi2 vector<vi>
// input
#define ci(x) \
int x; \
cin >> x
#define cs(x) \
string x; \
cin >> x
#define cd(x) \
double x; \
cin >> x
#define cvi(x, n) \
vi x(n); \
REP(i, n) { cin >> x[i]; }
// const input
#define cci(x) \
const int x = []() { \
int t; \
cin >> t; \
return t; \
}()
#define ccs(x) \
const string x = []() { \
string t; \
cin >> t; \
return t; \
}()
#define ccd(x) \
const double x = []() { \
double t; \
cin >> t; \
return t; \
}()
// output
#define pr(x) cout << x << endl
#define prvec(v) REP(i, v.size()) pr(v[i])
#define ppr(x) cout << x
#define lf() cout << endl
// debug methods
// usage: debug(x,y);
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define debug_1(x1) cout << #x1 << ": " << x1 << endl
#define debug_2(x1, x2) \
cout << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << endl
#define debug_3(x1, x2, x3) \
cout << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << ", " #x3 << ": " \
<< x3 << endl
#define debug_4(x1, x2, x3, x4) \
cout << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << ", " #x3 << ": " \
<< x3 << ", " #x4 << ": " << x4 << endl
#define debug_5(x1, x2, x3, x4, x5) \
cout << #x1 << ": " << x1 << ", " #x2 << ": " << x2 << ", " #x3 << ": " \
<< x3 << ", " #x4 << ": " << x4 << ", " #x5 << ": " << x5 << endl
#ifdef _DEBUG
#define debug(...) \
CHOOSE((__VA_ARGS__, debug_5, debug_4, debug_3, debug_2, debug_1, ~)) \
(__VA_ARGS__)
#else
#define debug(...)
#endif
// const number
const double PI = acos(-1.0);
const double EPS = 1e-10;
int powint(int a, int x) {
int res = 1;
REP(i, x) { res = res * a; }
return res;
}
#pragma endregion
signed main() {
#ifdef _DEBUG
try {
#endif
// main program ---------------------------------------------
cci(N);
cci(K);
if (K == 1)
pr(0);
else {
pr(N - K);
}
// end main program -----------------------------------------
#ifdef _DEBUG
} catch (std::out_of_range &ex) {
pr("out of range");
}
#endif
return 0;
}
| [
"literal.number.change",
"call.arguments.change"
] | 819,667 | 819,668 | u820612421 | cpp |
p03005 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (K == 1)
cout << 0;
else
cout << K - N;
}
| #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (K == 1)
cout << 0;
else
cout << N - K;
}
| [
"expression.operation.binary.remove"
] | 819,671 | 819,672 | u998203751 | cpp |
p03005 | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (K == 1) {
cout << 0 << endl;
return 0;
}
return N - K;
} | #include <iostream>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (K == 1) {
cout << 0 << endl;
return 0;
}
cout << N - K << endl;
} | [
"io.output.change",
"io.output.newline.add"
] | 819,675 | 819,676 | u684164049 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
// #define multitest 1
#define Debug 1
#ifdef Debug
#define db(...) ZZ(#__VA_ARGS__, __VA_ARGS__);
template <typename Arg1> void ZZ(const char *name, Arg1 &&arg1) {
std::cerr << name << " = " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void ZZ(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
std::cerr.write(names, comma - names) << " = " << arg1;
ZZ(comma, args...);
}
#else
#define db(...)
#endif
typedef long long ll;
typedef long double ld;
#define f first
#define s second
#define pb push_back
const long long mod = 1000000007;
void solve() {
int n, k;
cin >> n >> k;
if (n == 1) {
cout << 0;
} else
cout << n - k;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int t = 1;
#ifdef multitest
cin >> t;
#endif
while (t--)
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
// #define multitest 1
#define Debug 1
#ifdef Debug
#define db(...) ZZ(#__VA_ARGS__, __VA_ARGS__);
template <typename Arg1> void ZZ(const char *name, Arg1 &&arg1) {
std::cerr << name << " = " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void ZZ(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
std::cerr.write(names, comma - names) << " = " << arg1;
ZZ(comma, args...);
}
#else
#define db(...)
#endif
typedef long long ll;
typedef long double ld;
#define f first
#define s second
#define pb push_back
const long long mod = 1000000007;
void solve() {
int n, k;
cin >> n >> k;
if (k == 1) {
cout << 0;
} else
cout << n - k;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int t = 1;
#ifdef multitest
cin >> t;
#endif
while (t--)
solve();
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,677 | 819,678 | u467423063 | cpp |
p03005 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
#define REP(i, N) for (int i = 0; i < (N); i++)
#define REPP(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define VSORT(c) sort((c).begin(), (c).end())
#define SZ(x) ((int)(x).size())
// vvintを作る マクロで #define vvint(N,M) vector<vector<int>>
using namespace std;
int A, B, C;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> A >> B;
if (B != 0) {
cout << A - B << endl;
} else {
cout << 0 << endl;
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
#define REP(i, N) for (int i = 0; i < (N); i++)
#define REPP(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define VSORT(c) sort((c).begin(), (c).end())
#define SZ(x) ((int)(x).size())
// vvintを作る マクロで #define vvint(N,M) vector<vector<int>>
using namespace std;
int A, B, C;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> A >> B;
if (B != 1) {
cout << A - B << endl;
} else {
cout << 0 << endl;
}
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 819,681 | 819,682 | u921177152 | cpp |
p03005 | #include <algorithm>
#include <fstream>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define out(str) cout << str << endl
#define ALL(a) (a).begin(), (a).end()
#define INF (1 << 29)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int N, K;
int main() {
cin >> N >> K;
if (N == 1)
out(0);
else
out(N - K);
}
| #include <algorithm>
#include <fstream>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define out(str) cout << str << endl
#define ALL(a) (a).begin(), (a).end()
#define INF (1 << 29)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int N, K;
int main() {
cin >> N >> K;
if (K == 1)
out(0);
else
out(N - K);
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,683 | 819,684 | u190907730 | cpp |
p03005 | #include <algorithm>
#include <fstream>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define out(str) cout << str << endl
#define ALL(a) (a).begin(), (a).end()
#define INF (1 << 29)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int N, K;
int main() {
cin >> N >> K;
if (N == 1)
out(K);
else
out(N - K);
}
| #include <algorithm>
#include <fstream>
#include <iostream>
#include <limits>
#include <math.h>
#include <numeric>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <type_traits>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define out(str) cout << str << endl
#define ALL(a) (a).begin(), (a).end()
#define INF (1 << 29)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int N, K;
int main() {
cin >> N >> K;
if (K == 1)
out(0);
else
out(N - K);
}
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 819,685 | 819,684 | u190907730 | cpp |
p03005 | using namespace std;
#include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
if (N == 1)
cout << 0 << endl;
else
cout << N - M << endl;
return 0;
}
| using namespace std;
#include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
if (M == 1)
cout << 0 << endl;
else
cout << N - M << endl;
return 0;
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,690 | 819,691 | u766779796 | cpp |
p03005 | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (n == k)
cout << 0 << endl;
else
cout << n - k << endl;
} | #include <iostream>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
if (k == 1)
cout << 0 << endl;
else
cout << n - k << endl;
} | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 819,692 | 819,693 | u681557252 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, k;
cin >> n >> k;
if (k == 0) {
cout << 0 << endl;
} else {
cout << n - k << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, k;
cin >> n >> k;
if (k == 1) {
cout << 0 << endl;
} else {
cout << n - k << endl;
}
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 819,694 | 819,695 | u023195454 | cpp |
p03005 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9 + 7;
void judge(bool b) { cout << (b ? "Yay!" : ":(") << endl; }
main() {
int N, K;
cin >> N >> K;
if (N == 1)
cout << 0 << endl;
else
cout << N - K << endl;
} | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9 + 7;
void judge(bool b) { cout << (b ? "Yay!" : ":(") << endl; }
main() {
int N, K;
cin >> N >> K;
if (K == 1)
cout << 0 << endl;
else
cout << N - K << endl;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,698 | 819,699 | u157322125 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
cout << ((n == 1) ? 0 : n - k) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
cout << ((k == 1) ? 0 : n - k) << endl;
return 0;
}
| [
"identifier.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 819,700 | 819,701 | u905270643 | cpp |
p03005 | #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
//#define int ll
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef vector<piii> vpii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;
typedef complex<double> base;
#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define mp(a, b) make_pair(a, (b))
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for (int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cout << (#x) << " = " << x << endl;
#ifdef MAX_HOME
#define cerr cout
#else
#define cerr \
if (false) \
cerr
#endif
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << endl;
err(++it, args...);
}
const double PI = 2 * acos(0.0);
const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());
istream &operator>>(istream &in, pii &a) {
in >> a.first >> a.second;
return in;
}
ostream &operator<<(ostream &out, pii &a) {
out << a.first << ' ' << a.second;
return out;
}
template <class T0, class T1>
inline ostream &operator<<(ostream &out, pair<T0, T1> &a) {
return out << "{" << a.first << ", " << a.second << "}";
}
template <class T0, class T1, class T2>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2> &a) {
return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a)
<< "}";
}
template <class T0, class T1, class T2, class T3>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2, T3> &a) {
return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a)
<< ", " << get<3>(a) << "}";
}
template <class T> inline ostream &operator<<(ostream &out, vector<T> &a) {
out << "[";
fori(i, a.size()) out << a[i]
<< vector<string>{", ", "] "}[i + 1 == a.size()];
return out;
}
void smain();
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifdef ART_HOME
freopen("input.txt", "r", stdin);
clock_t start = clock();
#endif
cout << setprecision(0) << fixed;
smain();
#ifdef ART_HOME
cout << "\n\n\n\nTOTAL EXECUTION TIME: "
<< float(clock() - start) / CLOCKS_PER_SEC << endl;
#endif
}
const int N = 1 << 17, psze = 20, oo = 1e9 + 100, B = 100, M = 1e9 + 6;
const ld pi = 2 * atan2(1, 0), EPS = 1e-9;
void smain() {
int n, k;
cin >> n >> k;
if (n == 1) {
cout << "0";
return;
}
cout << n - k;
} | #include <bits/stdc++.h>
#include <random>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
//#define int ll
typedef pair<int, int> pii;
typedef pair<pii, pii> piii;
typedef vector<piii> vpii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<pii> vpi;
typedef vector<short> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<string> vst;
typedef vector<vst> vvst;
typedef pair<ld, ld> pld;
typedef complex<double> base;
#define inmin(a, b) a = min(a, (b))
#define inmax(a, b) a = max(a, (b))
#define mp(a, b) make_pair(a, (b))
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define sqr(x) ((x) * (x))
#define fori(i, n) for (int i = 0; i < int(n); ++i)
#define SZ(a) ((int)((a).size()))
#define triple(T) tuple<T, T, T>
#define quad(T) tuple<T, T, T, T>
#define watch(x) cout << (#x) << " = " << x << endl;
#ifdef MAX_HOME
#define cerr cout
#else
#define cerr \
if (false) \
cerr
#endif
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << endl;
err(++it, args...);
}
const double PI = 2 * acos(0.0);
const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());
istream &operator>>(istream &in, pii &a) {
in >> a.first >> a.second;
return in;
}
ostream &operator<<(ostream &out, pii &a) {
out << a.first << ' ' << a.second;
return out;
}
template <class T0, class T1>
inline ostream &operator<<(ostream &out, pair<T0, T1> &a) {
return out << "{" << a.first << ", " << a.second << "}";
}
template <class T0, class T1, class T2>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2> &a) {
return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a)
<< "}";
}
template <class T0, class T1, class T2, class T3>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2, T3> &a) {
return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a)
<< ", " << get<3>(a) << "}";
}
template <class T> inline ostream &operator<<(ostream &out, vector<T> &a) {
out << "[";
fori(i, a.size()) out << a[i]
<< vector<string>{", ", "] "}[i + 1 == a.size()];
return out;
}
void smain();
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifdef ART_HOME
freopen("input.txt", "r", stdin);
clock_t start = clock();
#endif
cout << setprecision(0) << fixed;
smain();
#ifdef ART_HOME
cout << "\n\n\n\nTOTAL EXECUTION TIME: "
<< float(clock() - start) / CLOCKS_PER_SEC << endl;
#endif
}
const int N = 1 << 17, psze = 20, oo = 1e9 + 100, B = 100, M = 1e9 + 6;
const ld pi = 2 * atan2(1, 0), EPS = 1e-9;
void smain() {
int n, k;
cin >> n >> k;
if (k == 1) {
cout << "0";
return;
}
cout << n - k;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,706 | 819,707 | u350388631 | cpp |
p03005 | //{{{
#include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <sys/time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
enum : int { M = (int)1e9 + 7 };
enum : ll { MLL = (ll)1e18L + 9 };
using namespace std;
#ifdef LOCAL
#include "rprint2.hpp"
#else
#define FUNC(name) \
template <ostream &out = cout, class... T> void name(T &&...) {}
FUNC(prints)
FUNC(printw) FUNC(printwe) FUNC(printb) FUNC(printbe) FUNC(printd) FUNC(printde)
FUNC(printdu);
#endif
template <class S, class T> istream &operator>>(istream &in, pair<S, T> &p) {
return in >> p.first >> p.second;
}
template <class T> istream &operator>>(istream &in, vector<T> &v) {
for (auto &e : v) {
in >> e;
}
return in;
}
//}}}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
cout << (n == 1 ? 0 : n - k) << '\n';
}
| //{{{
#include <algorithm>
#include <cmath>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <sys/time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
enum : int { M = (int)1e9 + 7 };
enum : ll { MLL = (ll)1e18L + 9 };
using namespace std;
#ifdef LOCAL
#include "rprint2.hpp"
#else
#define FUNC(name) \
template <ostream &out = cout, class... T> void name(T &&...) {}
FUNC(prints)
FUNC(printw) FUNC(printwe) FUNC(printb) FUNC(printbe) FUNC(printd) FUNC(printde)
FUNC(printdu);
#endif
template <class S, class T> istream &operator>>(istream &in, pair<S, T> &p) {
return in >> p.first >> p.second;
}
template <class T> istream &operator>>(istream &in, vector<T> &v) {
for (auto &e : v) {
in >> e;
}
return in;
}
//}}}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
cout << (k == 1 ? 0 : n - k) << '\n';
}
| [
"identifier.change",
"control_flow.loop.for.condition.change",
"io.output.change"
] | 819,716 | 819,717 | u817722036 | cpp |
p03005 | #include <bits/stdc++.h>
template <typename InputIterator>
typename InputIterator::value_type summation(InputIterator first,
InputIterator last) {
return std::accumulate(first, last, typename InputIterator::value_type());
}
template <typename T>
std::istream &operator>>(std::istream &stream, std::vector<T> &v);
template <typename T1, typename T2>
std::istream &operator>>(std::istream &stream, std::pair<T1, T2> &p);
template <typename T>
std::istream &operator>>(std::istream &stream, std::vector<T> &v) {
for (auto &i : v) {
stream >> i;
}
return stream;
}
template <typename T1, typename T2>
std::istream &operator>>(std::istream &stream, std::pair<T1, T2> &p) {
stream >> p.first >> p.second;
return stream;
}
int main() {
int64_t n, k;
std::cin >> n >> k;
if (k == 1) {
std::cout << 1 << std::endl;
} else {
std::cout << n - k << std::endl;
}
return 0;
} | #include <bits/stdc++.h>
template <typename InputIterator>
typename InputIterator::value_type summation(InputIterator first,
InputIterator last) {
return std::accumulate(first, last, typename InputIterator::value_type());
}
template <typename T>
std::istream &operator>>(std::istream &stream, std::vector<T> &v);
template <typename T1, typename T2>
std::istream &operator>>(std::istream &stream, std::pair<T1, T2> &p);
template <typename T>
std::istream &operator>>(std::istream &stream, std::vector<T> &v) {
for (auto &i : v) {
stream >> i;
}
return stream;
}
template <typename T1, typename T2>
std::istream &operator>>(std::istream &stream, std::pair<T1, T2> &p) {
stream >> p.first >> p.second;
return stream;
}
int main() {
int64_t n, k;
std::cin >> n >> k;
if (k == 1) {
std::cout << 0 << std::endl;
} else {
std::cout << n - k << std::endl;
}
return 0;
}
| [
"literal.number.change",
"expression.operation.binary.change"
] | 819,728 | 819,729 | u438319362 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const long double PI = acos(-1);
constexpr long double EPS = 1e-15;
constexpr int inf = 2e9;
constexpr ll INF = 2e18;
constexpr ll MOD = 1e9 + 7;
constexpr ll MOD1 = 998244353;
typedef pair<ll, ll> P;
//#define all(v) (v).begin(), (v).end()
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) rep(i, 0, n)
#define sz(s) (s).size()
#define pb push_back
#define fi first
#define se second
//#define mp make_pair
void solve() {
int n, k;
cin >> n >> k;
cout << (n == 1 ? 0 : k - n) << endl;
}
int main(int argc, char *argv[]) {
/*Regular*/
int case_num = 1;
if (argc > 1 && stoi(argv[1]))
cin >> case_num;
REP(case_no, case_num) {
cerr << endl << "case " << case_no + 1 << endl;
solve();
}
// /*ICPC*/
// while (cin >> t >> d >> l, t) {
// solve();
// }
// solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
const long double PI = acos(-1);
constexpr long double EPS = 1e-15;
constexpr int inf = 2e9;
constexpr ll INF = 2e18;
constexpr ll MOD = 1e9 + 7;
constexpr ll MOD1 = 998244353;
typedef pair<ll, ll> P;
//#define all(v) (v).begin(), (v).end()
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) rep(i, 0, n)
#define sz(s) (s).size()
#define pb push_back
#define fi first
#define se second
//#define mp make_pair
void solve() {
int n, k;
cin >> n >> k;
cout << (k == 1 ? 0 : n - k) << endl;
}
int main(int argc, char *argv[]) {
/*Regular*/
int case_num = 1;
if (argc > 1 && stoi(argv[1]))
cin >> case_num;
REP(case_no, case_num) {
cerr << endl << "case " << case_no + 1 << endl;
solve();
}
// /*ICPC*/
// while (cin >> t >> d >> l, t) {
// solve();
// }
// solve();
return 0;
} | [
"identifier.change",
"control_flow.loop.for.condition.change",
"io.output.change",
"expression.operation.binary.remove"
] | 819,730 | 819,731 | u891178744 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int main() {
int N, K;
cin >> N >> K;
if (N == 1)
cout << 0 << '\n';
else
cout << N - K << '\n';
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int main() {
int N, K;
cin >> N >> K;
if (K == 1)
cout << 0 << '\n';
else
cout << N - K << '\n';
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,734 | 819,735 | u459737327 | cpp |
p03005 | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdlib.h>
#include <time.h>
#include <utility>
#include <vector>
using namespace std;
int n, k;
int main() {
cin >> n >> k;
if (n == 1)
cout << "0";
else
cout << n - k;
} | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdlib.h>
#include <time.h>
#include <utility>
#include <vector>
using namespace std;
int n, k;
int main() {
cin >> n >> k;
if (k == 1)
cout << "0";
else
cout << n - k;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,738 | 819,739 | u937608388 | cpp |
p03005 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const int INF = 1 << 28;
const ll MOD = 1000000007;
template <class T> bool chmax(T &a, const T &b) {
return (a < b) ? (a = b, 1) : 0;
}
template <class T> bool chmin(T &a, const T &b) {
return (b < a) ? (a = b, 1) : 0;
}
int main() {
int n, k;
cin >> n >> k;
if (n == 1)
cout << 0 << endl;
else {
cout << n - k << endl;
}
return 0;
} | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
const int INF = 1 << 28;
const ll MOD = 1000000007;
template <class T> bool chmax(T &a, const T &b) {
return (a < b) ? (a = b, 1) : 0;
}
template <class T> bool chmin(T &a, const T &b) {
return (b < a) ? (a = b, 1) : 0;
}
int main() {
int n, k;
cin >> n >> k;
if (k == 1)
cout << 0 << endl;
else {
cout << n - k << endl;
}
return 0;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,742 | 819,743 | u756088996 | cpp |
p03005 | //#include <bits/stdc++.h>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long>> vvll, vvLL;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define mod (ll)(1e9 + 7)
#define FIX(a) ((a) % mod + mod) % mod
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
#define INF 1000000000 // 1e9
#define LLINF 2000000000000000000LL // 2e18
#define fi first
#define se second
#define pb push_back
int dy[] = {0, 0, 1, -1};
int dx[] = {1, -1, 0, 0};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
if (k == 0) {
k = n;
}
cout << n - k << endl;
return 0;
} | //#include <bits/stdc++.h>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long>> vvll, vvLL;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define mod (ll)(1e9 + 7)
#define FIX(a) ((a) % mod + mod) % mod
#define ALL(obj) (obj).begin(), (obj).end()
#define rALL(obj) (obj).rbegin(), (obj).rend()
#define INF 1000000000 // 1e9
#define LLINF 2000000000000000000LL // 2e18
#define fi first
#define se second
#define pb push_back
int dy[] = {0, 0, 1, -1};
int dx[] = {1, -1, 0, 0};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
if (k == 1) {
k = n;
}
cout << n - k << endl;
return 0;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 819,746 | 819,747 | u652420316 | cpp |
p03005 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
typedef double ld;
typedef complex<ld> Point;
const ll INF = mod * mod;
typedef pair<int, int> P;
#define stop \
char nyaa; \
cin >> nyaa;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
typedef vector<int> vec;
typedef vector<string> svec;
const string yey = "Yay!";
const string sad = ":(";
void solve() {
int n, k;
cin >> n >> k;
if (k == 0)
cout << 0 << endl;
else
cout << n - k << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
// cout << fixed << setprecision(9);
// init();
// while (cin >> n>>m>>l,n)solve();
solve();
// stop
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
typedef double ld;
typedef complex<ld> Point;
const ll INF = mod * mod;
typedef pair<int, int> P;
#define stop \
char nyaa; \
cin >> nyaa;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
typedef vector<int> vec;
typedef vector<string> svec;
const string yey = "Yay!";
const string sad = ":(";
void solve() {
int n, k;
cin >> n >> k;
if (k == 1)
cout << 0 << endl;
else
cout << n - k << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
// cout << fixed << setprecision(9);
// init();
// while (cin >> n>>m>>l,n)solve();
solve();
// stop
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 819,750 | 819,751 | u294531924 | cpp |
p03006 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> x(N);
vector<int> y(N);
for (int i = 0; i < N; i++) {
cin >> x.at(i) >> y.at(i);
}
if (N == 1 || N == 2) {
cout << 1 << endl;
return 0;
}
vector<int> count(N * (N - 1) / 2);
int M = 0;
for (int i = 0; i < N - 1; i++) {
for (int j = i + 1; j < N; j++) {
int X = x.at(i) - x.at(j);
int Y = y.at(i) - y.at(j);
if (X == 0 || Y == 0) {
M++;
break;
}
for (int k = 0; k < N - 1; k++) {
for (int l = k + 1; l < N; l++) {
if (x.at(k) - x.at(l) == X && y.at(k) - y.at(l) == Y) {
count.at(M)++;
} else if (x.at(l) - x.at(k) == X && y.at(l) - y.at(k) == Y) {
count.at(M)++;
}
}
}
M++;
}
}
sort(count.begin(), count.end());
reverse(count.begin(), count.end());
cout << max(1, N - 1 - count.at(0)) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> x(N);
vector<int> y(N);
for (int i = 0; i < N; i++) {
cin >> x.at(i) >> y.at(i);
}
if (N == 1 || N == 2) {
cout << 1 << endl;
return 0;
}
vector<int> count(N * (N - 1) / 2);
int M = 0;
for (int i = 0; i < N - 1; i++) {
for (int j = i + 1; j < N; j++) {
int X = x.at(i) - x.at(j);
int Y = y.at(i) - y.at(j);
if (X == 0 && Y == 0) {
M++;
break;
}
for (int k = 0; k < N - 1; k++) {
for (int l = k + 1; l < N; l++) {
if (x.at(k) - x.at(l) == X && y.at(k) - y.at(l) == Y) {
count.at(M)++;
} else if (x.at(l) - x.at(k) == X && y.at(l) - y.at(k) == Y) {
count.at(M)++;
}
}
}
M++;
}
}
sort(count.begin(), count.end());
reverse(count.begin(), count.end());
cout << max(1, N - count.at(0)) << endl;
}
| [
"misc.opposites",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 819,756 | 819,757 | u710877960 | cpp |
p03006 | #include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int n, x[50], y[50], p, q, ans = 50;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d%d", &x[i], &y[i]);
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i != j) {
p = x[i] - x[j];
q = y[i] - y[j];
}
int cnt = 0;
for (int k = 0; k < n; k++) {
for (int l = 0; l < n; l++) {
if (x[k] - x[l] == p && y[k] - y[l] == q) {
cnt++;
}
}
}
ans = min(ans, n - cnt);
}
}
printf("%d\n", max(1, ans));
} | #include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int n, x[50], y[50], p, q, ans = 50;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d%d", &x[i], &y[i]);
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i != j) {
p = x[i] - x[j];
q = y[i] - y[j];
}
int cnt = 0;
for (int k = 0; k < n; k++) {
for (int l = 0; l < n; l++) {
if (k != l && x[k] - x[l] == p && y[k] - y[l] == q) {
cnt++;
}
}
}
ans = min(ans, n - cnt);
}
}
printf("%d\n", max(1, ans));
} | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 819,791 | 819,792 | u855429581 | cpp |
p03006 | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define F first
#define S second
#define pb push_back
#define pu push
#define COUT(x) cout << (x) << endl
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, vector<ll>, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define mp make_pair
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007LL;
const ll INF = 1LL << 60;
using vll = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvll = vector<vll>;
using vstr = vector<string>;
using pll = pair<ll, ll>;
using vc = vector<char>;
using vvc = vector<vc>;
ll dx[4] = {0, 1, 0, -1};
ll dy[4] = {1, 0, -1, 0};
int main() {
ll n;
cin >> n;
map<pll, ll> h;
vector<pll> p(n);
rep(i, n) {
ll a, b;
cin >> a >> b;
p[i] = mp(a, b);
}
sort(all(p));
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
h[pll(p[j].F - p[i].F, p[j].S - p[i].S)]++;
}
}
ll cu = 0;
for (auto u : p) {
cu = max(cu, u.S);
}
ll ans = 0;
ans += n - cu;
COUT(ans);
} | #include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define F first
#define S second
#define pb push_back
#define pu push
#define COUT(x) cout << (x) << endl
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, vector<ll>, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define mp make_pair
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007LL;
const ll INF = 1LL << 60;
using vll = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vvll = vector<vll>;
using vstr = vector<string>;
using pll = pair<ll, ll>;
using vc = vector<char>;
using vvc = vector<vc>;
ll dx[4] = {0, 1, 0, -1};
ll dy[4] = {1, 0, -1, 0};
int main() {
ll n;
cin >> n;
map<pll, ll> h;
vector<pll> p(n);
rep(i, n) {
ll a, b;
cin >> a >> b;
p[i] = mp(a, b);
}
sort(all(p));
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
h[pll(p[j].F - p[i].F, p[j].S - p[i].S)]++;
}
}
ll cu = 0;
for (auto u : h) {
cu = max(cu, u.S);
}
ll ans = 0;
ans += n - cu;
COUT(ans);
} | [
"identifier.change"
] | 819,811 | 819,812 | u103850114 | cpp |
p03006 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int, int> pii;
int n;
ll x[51], y[51];
set<pii> st;
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> x[i] >> y[i];
if (n == 1) {
cout << 1 << endl;
return 0;
}
ll ans = n + 1;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (i == j)
continue;
if (x[i] == x[j] && y[i] - y[j])
continue;
if (x[i] > x[j])
continue;
ll p = x[j] - x[i], q = y[j] - y[i];
st.clear();
for (int i = 1; i <= n; i++)
st.insert(make_pair(x[i], y[i]));
ll tmp = 0;
pii pre;
bool first = true;
while (st.size()) {
pii nx = make_pair(pre.first + p, pre.second + q);
if (!first && st.count(nx)) {
pre = nx;
st.erase(nx);
} else {
pre = *st.begin();
st.erase(st.begin());
tmp++;
}
first = false;
}
// cout<<p<<" "<<q<<endl;
ans = min(ans, tmp);
}
}
printf("%d\n", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<int, int> pii;
int n;
ll x[51], y[51];
set<pii> st;
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> x[i] >> y[i];
if (n == 1) {
cout << 1 << endl;
return 0;
}
ll ans = n + 1;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++) {
if (i == j)
continue;
if (x[i] == x[j] && y[i] == y[j])
continue;
if (x[i] > x[j])
continue;
ll p = x[j] - x[i], q = y[j] - y[i];
st.clear();
for (int i = 1; i <= n; i++)
st.insert(make_pair(x[i], y[i]));
ll tmp = 0;
pii pre;
bool first = true;
while (st.size()) {
pii nx = make_pair(pre.first + p, pre.second + q);
if (!first && st.count(nx)) {
pre = nx;
st.erase(nx);
} else {
pre = *st.begin();
st.erase(st.begin());
tmp++;
}
first = false;
}
// cout<<p<<" "<<q<<endl;
ans = min(ans, tmp);
}
}
printf("%d\n", ans);
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 819,815 | 819,816 | u324752405 | cpp |
p03006 | #include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#define F first
#define S second
using namespace std;
typedef long long ll;
ll n;
ll a[55];
ll b[55];
map<pair<ll, ll>, ll> ma;
ll ans;
int main() {
scanf("%lld", &n);
for (ll i = 0; i < n; i++) {
scanf("%lld%lld", &a[i], &b[i]);
for (ll j = 0; j < i; j++) {
if (a[i] > a[j])
ma[make_pair(a[i] - a[j], b[i] - b[j])]++;
else if (a[i] == a[j])
ma[make_pair(0, abs(b[i] - b[j]))]++;
else
ma[make_pair(a[j] - a[i], b[j] - b[i])]++;
}
}
for (auto i : ma) {
ans = max(ans, i.S);
}
printf("%lld\n", ans);
return 0;
}
| #include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#define F first
#define S second
using namespace std;
typedef long long ll;
ll n;
ll a[55];
ll b[55];
map<pair<ll, ll>, ll> ma;
ll ans;
int main() {
scanf("%lld", &n);
for (ll i = 0; i < n; i++) {
scanf("%lld%lld", &a[i], &b[i]);
for (ll j = 0; j < i; j++) {
if (a[i] > a[j])
ma[make_pair(a[i] - a[j], b[i] - b[j])]++;
else if (a[i] == a[j])
ma[make_pair(0, abs(b[i] - b[j]))]++;
else
ma[make_pair(a[j] - a[i], b[j] - b[i])]++;
}
}
for (auto i : ma) {
ans = max(ans, i.S);
}
printf("%lld\n", n - ans);
return 0;
}
| [
"expression.operation.binary.add"
] | 819,831 | 819,832 | u307227472 | cpp |
p03006 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const int INF = 1001001001;
int main() {
int n;
cin >> n;
vector<pair<int, int>> xy(n);
for (int i = 0; i < n; i++)
cin >> xy.at(i).first >> xy.at(i).second;
map<pair<int, int>, int> mp;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i == j)
continue;
int dx = xy.at(j).first - xy.at(i).first;
int dy = xy.at(j).second - xy.at(i).second;
if (!mp.count(make_pair(dx, dy))) {
mp[make_pair(dx, dy)] = 1;
} else {
mp.at(make_pair(dx, dy))++;
}
}
}
int m = 0;
for (auto a : mp) {
m = max(m, a.second);
}
cout << m + 1;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const int INF = 1001001001;
int main() {
int n;
cin >> n;
vector<pair<int, int>> xy(n);
for (int i = 0; i < n; i++)
cin >> xy.at(i).first >> xy.at(i).second;
map<pair<int, int>, int> mp;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i == j)
continue;
int dx = xy.at(j).first - xy.at(i).first;
int dy = xy.at(j).second - xy.at(i).second;
if (!mp.count(make_pair(dx, dy))) {
mp[make_pair(dx, dy)] = 1;
} else {
mp.at(make_pair(dx, dy))++;
}
}
}
int m = 0;
for (auto a : mp) {
m = max(m, a.second);
}
cout << n - m;
} | [
"expression.operation.binary.remove"
] | 819,839 | 819,840 | u628597699 | cpp |
p03006 | #include <bits/stdc++.h>
#define range(i, l, r) for (long long int(i) = (l); (i) < (r); (i)++)
#define reversed_range(i, l, r) for (long long int(i) = (r)-1; (i) >= l; (i)--)
using namespace std;
template <typename T> using vec = vector<T>;
using lint = long long;
using ulint = unsigned long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
template <typename S, typename T>
ostream &operator<<(ostream &os, pair<S, T> p) {
os << "(";
os << p.first << ", " << p.second;
return os << ")";
}
template <typename T> ostream &operator<<(ostream &os, vec<T> v) {
os << "[";
if (v.size() == 0)
return os << "]";
for (int i = 0; i < v.size() - 1; i++) {
os << v.at(i) << ", ";
}
return os << v.at(v.size() - 1) << "]";
}
template <typename T> ostream &operator<<(ostream &os, set<T> &s) {
os << "{";
if (s.begin() == s.end())
return os << "}";
auto it_first_item = s.begin();
cout << *it_first_item;
for (auto it = ++it_first_item; it != s.end(); it++) {
cout << ", " << *it;
}
return cout << "}";
}
template <typename T> ostream &operator<<(ostream &os, unordered_set<T> &s) {
os << "{";
if (s.begin() == s.end())
return os << "}";
auto it_first_item = s.begin();
cout << *it_first_item;
for (auto it = ++it_first_item; it != s.end(); it++) {
cout << ", " << *it;
}
return cout << "}";
}
template <typename K, typename V>
ostream &operator<<(ostream &os, map<K, V> m) {
os << "{";
if (m.begin() == m.end())
return os << "}";
auto it_first_item = m.begin();
cout << it_first_item->first << ": " << it_first_item->second;
for (auto it = ++it_first_item; it != m.end(); it++) {
cout << ", " << it->first << ": " << it->second;
}
return os << "}";
}
template <typename K, typename V>
ostream &operator<<(ostream &os, unordered_map<K, V> m) {
os << "{";
if (m.begin() == m.end())
return os << "}";
auto it_first_item = m.begin();
cout << it_first_item->first << ": " << it_first_item->second;
for (auto it = ++it_first_item; it != m.end(); it++) {
cout << ", " << it->first << ": " << it->second;
}
return os << "}";
}
lint pow(lint num, lint e, lint MOD) {
lint res = 1;
lint cur_num = num;
while (e) {
if (e & 1) {
res *= cur_num;
res %= MOD;
}
cur_num *= cur_num;
cur_num %= MOD;
e >>= 1;
}
return res;
}
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
lint N;
cin >> N;
vec<plint> balls(N);
range(i, 0, N) {
lint x, y;
cin >> x >> y;
balls.at(i) = {x, y};
}
sort(balls.begin(), balls.end());
lint min_cost = balls.size();
range(i, 0, N - 1) range(j, i + 1, N) {
const plint &b1 = balls.at(i);
const plint &b2 = balls.at(j);
lint p = b2.first - b1.first, q = b2.second - b1.second;
if (p == 0 or q == 0)
continue;
set<plint> taken;
lint cost = 0;
range(k, 0, N) {
const plint &b = balls.at(k);
const plint adj_b = {b.first - p, b.second - q};
cost += (taken.count(adj_b) ? 0 : 1);
taken.emplace(b);
}
min_cost = min(min_cost, cost);
}
cout << min_cost << "\n";
} | #include <bits/stdc++.h>
#define range(i, l, r) for (long long int(i) = (l); (i) < (r); (i)++)
#define reversed_range(i, l, r) for (long long int(i) = (r)-1; (i) >= l; (i)--)
using namespace std;
template <typename T> using vec = vector<T>;
using lint = long long;
using ulint = unsigned long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
template <typename S, typename T>
ostream &operator<<(ostream &os, pair<S, T> p) {
os << "(";
os << p.first << ", " << p.second;
return os << ")";
}
template <typename T> ostream &operator<<(ostream &os, vec<T> v) {
os << "[";
if (v.size() == 0)
return os << "]";
for (int i = 0; i < v.size() - 1; i++) {
os << v.at(i) << ", ";
}
return os << v.at(v.size() - 1) << "]";
}
template <typename T> ostream &operator<<(ostream &os, set<T> &s) {
os << "{";
if (s.begin() == s.end())
return os << "}";
auto it_first_item = s.begin();
cout << *it_first_item;
for (auto it = ++it_first_item; it != s.end(); it++) {
cout << ", " << *it;
}
return cout << "}";
}
template <typename T> ostream &operator<<(ostream &os, unordered_set<T> &s) {
os << "{";
if (s.begin() == s.end())
return os << "}";
auto it_first_item = s.begin();
cout << *it_first_item;
for (auto it = ++it_first_item; it != s.end(); it++) {
cout << ", " << *it;
}
return cout << "}";
}
template <typename K, typename V>
ostream &operator<<(ostream &os, map<K, V> m) {
os << "{";
if (m.begin() == m.end())
return os << "}";
auto it_first_item = m.begin();
cout << it_first_item->first << ": " << it_first_item->second;
for (auto it = ++it_first_item; it != m.end(); it++) {
cout << ", " << it->first << ": " << it->second;
}
return os << "}";
}
template <typename K, typename V>
ostream &operator<<(ostream &os, unordered_map<K, V> m) {
os << "{";
if (m.begin() == m.end())
return os << "}";
auto it_first_item = m.begin();
cout << it_first_item->first << ": " << it_first_item->second;
for (auto it = ++it_first_item; it != m.end(); it++) {
cout << ", " << it->first << ": " << it->second;
}
return os << "}";
}
lint pow(lint num, lint e, lint MOD) {
lint res = 1;
lint cur_num = num;
while (e) {
if (e & 1) {
res *= cur_num;
res %= MOD;
}
cur_num *= cur_num;
cur_num %= MOD;
e >>= 1;
}
return res;
}
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
lint N;
cin >> N;
vec<plint> balls(N);
range(i, 0, N) {
lint x, y;
cin >> x >> y;
balls.at(i) = {x, y};
}
sort(balls.begin(), balls.end());
lint min_cost = balls.size();
range(i, 0, N - 1) range(j, i + 1, N) {
const plint &b1 = balls.at(i);
const plint &b2 = balls.at(j);
lint p = b2.first - b1.first, q = b2.second - b1.second;
if (p == 0 and q == 0)
continue;
set<plint> taken;
lint cost = 0;
range(k, 0, N) {
const plint &b = balls.at(k);
const plint adj_b = {b.first - p, b.second - q};
cost += (taken.count(adj_b) ? 0 : 1);
taken.emplace(b);
}
min_cost = min(min_cost, cost);
}
cout << min_cost << "\n";
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 819,857 | 819,858 | u069838609 | cpp |
p03006 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
vector<P> b(n);
rep(i, n) {
int x, y;
cin >> x >> y;
b[i] = {x, y};
}
map<P, int> mp;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i == j)
continue;
mp[{b[i].first - b[j].first, b[i].second - b[j].second}]++;
}
}
int res = 0;
for (auto p : mp) {
res = max(res, p.second);
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
vector<P> b(n);
rep(i, n) {
int x, y;
cin >> x >> y;
b[i] = {x, y};
}
map<P, int> mp;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i == j)
continue;
mp[{b[i].first - b[j].first, b[i].second - b[j].second}]++;
}
}
int res = 0;
for (auto p : mp) {
res = max(res, p.second);
}
cout << n - res << endl;
return 0;
} | [
"expression.operation.binary.add"
] | 819,875 | 819,876 | u108540384 | cpp |
p03006 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
typedef pair<string, int> s_i;
typedef vector<ll> vel;
typedef vector<int> vei;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> ve_vel;
typedef vector<vector<int>> ve_vei;
typedef vector<vector<char>> ve_vec;
typedef vector<vector<bool>> ve_veb;
typedef vector<vector<string>> ve_ves;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define rep2(i, n) for (int i = 2; i < (int)(n); i++)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define fs first
#define sc second
#define pub push_back
#define puf push_front
#define pob pop_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define maxel(a) *max_element(all(a))
#define minel(a) *min_element(all(a))
#define acc accumulate
#define EPS (1e-7)
//#define INF (1e9)
#define PI (acos(-1))
#define mod (1000000007)
typedef long long int64;
const int64 INF = 1LL << 58;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T> void remove(T &vector, unsigned int index) {
vector.erase(vector.begin() + index);
}
int main() {
int N;
cin >> N;
vel x(N), y(N);
rep(i, N) cin >> x[i] >> y[i];
map<l_l, int> mp;
rep(i, N) rep(j, N) {
if (i == j)
continue;
ll p = x[i] - x[j];
ll q = y[i] - y[j];
if (p < 0) {
p *= -1;
q *= -1;
} else if (p == 0 and q < 0)
q *= -1;
mp[make_pair(p, q)]++;
}
int mx = 0;
for (auto i : mp)
mx = max(mx, i.sc);
cout << N - mx << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
typedef pair<string, int> s_i;
typedef vector<ll> vel;
typedef vector<int> vei;
typedef vector<char> vec;
typedef vector<bool> veb;
typedef vector<string> ves;
typedef vector<vector<ll>> ve_vel;
typedef vector<vector<int>> ve_vei;
typedef vector<vector<char>> ve_vec;
typedef vector<vector<bool>> ve_veb;
typedef vector<vector<string>> ve_ves;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i < (int)(n); i++)
#define rep2(i, n) for (int i = 2; i < (int)(n); i++)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define fs first
#define sc second
#define pub push_back
#define puf push_front
#define pob pop_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define maxel(a) *max_element(all(a))
#define minel(a) *min_element(all(a))
#define acc accumulate
#define EPS (1e-7)
//#define INF (1e9)
#define PI (acos(-1))
#define mod (1000000007)
typedef long long int64;
const int64 INF = 1LL << 58;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T> void remove(T &vector, unsigned int index) {
vector.erase(vector.begin() + index);
}
int main() {
int N;
cin >> N;
vel x(N), y(N);
rep(i, N) cin >> x[i] >> y[i];
map<l_l, int> mp;
rep(i, N) repk(j, i + 1, N) {
if (i == j)
continue;
ll p = x[i] - x[j];
ll q = y[i] - y[j];
if (p < 0) {
p *= -1;
q *= -1;
} else if (p == 0 and q < 0)
q *= -1;
mp[make_pair(p, q)]++;
}
int mx = 0;
for (auto i : mp)
mx = max(mx, i.sc);
cout << N - mx << endl;
return 0;
}
| [
"call.arguments.add"
] | 819,907 | 819,908 | u263715385 | cpp |
p03004 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
typedef pair<ll, ll> P;
#define Mod 1000000007
using VP = vector<P>;
using VVP = vector<VP>;
using VI = vector<ll>;
using VVI = vector<VI>;
using VVVI = vector<VVI>;
#define INF 1ll << 59
ll n;
ll x[101010], y[101010];
char d[101010];
ll val(ll t) {
ll xM = -10000000000, xm = 10000000000, yM = -10000000000, ym = 10000000000;
for (ll i = 0; i < n; i++) {
ll a = x[i], b = y[i];
if (d[i] == 'R')
a += t;
if (d[i] == 'L')
a -= t;
if (d[i] == 'U')
b += t;
if (d[i] == 'D')
b -= t;
xM = max(xM, a);
xm = min(xm, a);
yM = max(yM, b);
ym = min(ym, b);
}
return (xM - xm) * (yM - ym);
}
int main() {
ll i, j;
cin >> n;
for (i = 0; i < n; i++) {
cin >> x[i] >> y[i] >> d[i];
x[i] *= 2;
y[i] *= 2;
}
vector<ll> ts;
ll xMR = -1e10, xML = -1e10, xMN = -1e10;
for (i = 0; i < n; i++) {
if (d[i] == 'R')
xMR = max(xMR, x[i]);
else if (d[i] == 'L')
xML = max(xML, x[i]);
else
xMN = max(xMN, x[i]);
}
ts.pb(xMN - xMR);
ts.pb(xML - xMN);
ts.pb((xML - xMR) / 2);
ll xmR = 1e10, xmL = 1e10, xmN = 1e10;
for (i = 0; i < n; i++) {
if (d[i] == 'R')
xmR = min(xmR, x[i]);
else if (d[i] == 'L')
xmL = min(xmL, x[i]);
else
xmN = min(xmN, x[i]);
}
ts.pb(xmN - xmR);
ts.pb(xmL - xmN);
ts.pb((xmL - xmR) / 2);
ll yMR = -1e10, yML = -1e10, yMN = -1e10;
for (i = 0; i < n; i++) {
if (d[i] == 'U')
yMR = max(yMR, y[i]);
else if (d[i] == 'D')
yML = max(yML, y[i]);
else
yMN = max(yMN, y[i]);
}
ts.pb(yMN - yMR);
ts.pb(yML - yMN);
ts.pb((yML - yMR) / 2);
ll ymR = 1e10, ymL = 1e10, ymN = 1e10;
for (i = 0; i < n; i++) {
if (d[i] == 'U')
ymR = min(ymR, y[i]);
else if (d[i] == 'D')
ymL = min(ymL, y[i]);
else
ymN = min(ymN, y[i]);
}
ts.pb(ymN - ymR);
ts.pb(ymL - ymN);
ts.pb((ymL - ymR) / 2);
ts.pb(0);
ll ans = 1e18;
for (i = 0; i < ts.size(); i++) {
if (ts[i] >= 0 && ts[i] < 1e9) {
ll p = val(ts[i]);
ans = min(ans, p);
}
}
printf("%.15lf\n", ans / (long double)4);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
typedef pair<ll, ll> P;
#define Mod 1000000007
using VP = vector<P>;
using VVP = vector<VP>;
using VI = vector<ll>;
using VVI = vector<VI>;
using VVVI = vector<VVI>;
#define INF 1ll << 59
ll n;
ll x[101010], y[101010];
char d[101010];
ll val(ll t) {
ll xM = -10000000000, xm = 10000000000, yM = -10000000000, ym = 10000000000;
for (ll i = 0; i < n; i++) {
ll a = x[i], b = y[i];
if (d[i] == 'R')
a += t;
if (d[i] == 'L')
a -= t;
if (d[i] == 'U')
b += t;
if (d[i] == 'D')
b -= t;
xM = max(xM, a);
xm = min(xm, a);
yM = max(yM, b);
ym = min(ym, b);
}
return (xM - xm) * (yM - ym);
}
int main() {
ll i, j;
cin >> n;
for (i = 0; i < n; i++) {
cin >> x[i] >> y[i] >> d[i];
x[i] *= 2;
y[i] *= 2;
}
vector<ll> ts;
ll xMR = -1e10, xML = -1e10, xMN = -1e10;
for (i = 0; i < n; i++) {
if (d[i] == 'R')
xMR = max(xMR, x[i]);
else if (d[i] == 'L')
xML = max(xML, x[i]);
else
xMN = max(xMN, x[i]);
}
ts.pb(xMN - xMR);
ts.pb(xML - xMN);
ts.pb((xML - xMR) / 2);
ll xmR = 1e10, xmL = 1e10, xmN = 1e10;
for (i = 0; i < n; i++) {
if (d[i] == 'R')
xmR = min(xmR, x[i]);
else if (d[i] == 'L')
xmL = min(xmL, x[i]);
else
xmN = min(xmN, x[i]);
}
ts.pb(xmN - xmR);
ts.pb(xmL - xmN);
ts.pb((xmL - xmR) / 2);
ll yMR = -1e10, yML = -1e10, yMN = -1e10;
for (i = 0; i < n; i++) {
if (d[i] == 'U')
yMR = max(yMR, y[i]);
else if (d[i] == 'D')
yML = max(yML, y[i]);
else
yMN = max(yMN, y[i]);
}
ts.pb(yMN - yMR);
ts.pb(yML - yMN);
ts.pb((yML - yMR) / 2);
ll ymR = 1e10, ymL = 1e10, ymN = 1e10;
for (i = 0; i < n; i++) {
if (d[i] == 'U')
ymR = min(ymR, y[i]);
else if (d[i] == 'D')
ymL = min(ymL, y[i]);
else
ymN = min(ymN, y[i]);
}
ts.pb(ymN - ymR);
ts.pb(ymL - ymN);
ts.pb((ymL - ymR) / 2);
ts.pb(0);
ll ans = 1e18;
for (i = 0; i < ts.size(); i++) {
if (ts[i] >= 0 && ts[i] < 1e9) {
ll p = val(ts[i]);
ans = min(ans, p);
}
}
printf("%.15lf\n", ans / (double)4);
return 0;
} | [
"variable_declaration.type.narrow.change"
] | 819,931 | 819,932 | u586567203 | cpp |
p03004 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define Would
#define you
#define please
const int cm = 1 << 17;
char cn[cm], *ci = cn + cm, ct;
inline char getcha() {
if (ci - cn == cm) {
fread_unlocked(cn, 1, cm, stdin);
ci = cn;
}
return *ci++;
}
inline int getint() {
int A = 0;
int pn = 1;
if (ci - cn + 16 > cm) {
if ((ct = getcha()) == '-') {
pn = -1;
ct = getcha();
}
A = ct - '0';
while ((ct = getcha()) >= '0')
A = A * 10 + ct - '0';
;
return pn * A;
} else {
if ((ct = *ci++) == '-') {
pn = -1;
ct = *ci++;
}
A = ct - '0';
while ((ct = *ci++) >= '0')
A = A * 10 + ct - '0';
;
return pn * A;
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N = getint();
int RR = -1e9;
int RL = -1e9;
int RUD = -1e9;
int LR = 1e9;
int LL = 1e9;
int LUD = 1e9;
int UU = -1e9;
int UD = -1e9;
int URL = -1e9;
int DU = 1e9;
int DD = 1e9;
int DRL = 1e9;
bool R = false;
bool L = false;
bool U = false;
bool D = false;
rep(i, N) {
int x = getint(), y = getint();
char d = getcha();
getchar();
if (d == 'R') {
R = true;
RR = max(RR, x);
LR = min(LR, x);
URL = max(URL, y);
DRL = min(DRL, y);
} else if (d == 'L') {
L = true;
RL = max(RL, x);
LL = min(LL, x);
URL = max(URL, y);
DRL = min(DRL, y);
} else if (d == 'U') {
U = true;
RUD = max(RUD, x);
LUD = min(LUD, x);
UU = max(UU, y);
DU = min(DU, y);
} else {
D = true;
RUD = max(RUD, x);
LUD = min(LUD, x);
UD = max(UD, y);
DD = min(DD, y);
}
}
vector<double> kouho;
kouho.pb(0);
if (R && L) {
kouho.pb(0.5 * (RL - RR));
kouho.pb(0.5 * (LL - LR));
}
if (R && (U || D)) {
kouho.pb(RUD - RR);
kouho.pb(LUD - LR);
}
if (L && (U || D)) {
kouho.pb(RL - RUD);
kouho.pb(LL - LUD);
}
if (U && D) {
kouho.pb(0.5 * (UD - UU));
kouho.pb(0.5 * (DD - DU));
}
if (U && (R || L)) {
kouho.pb(URL - UU);
kouho.pb(DRL - DU);
}
if (D && (R || L)) {
kouho.pb(UD - URL);
kouho.pb(DD - DRL);
}
double saishou = 1e20;
for (double D : kouho) {
if (D >= 0) {
double Xmax = max({RR + D, RL - D, (double)RUD});
double Xmin = min({LR + D, LL - D, (double)LUD});
double Ymax = max({UU + D, UD - D, (double)URL});
double Ymin = min({DU + D, DD - D, (double)DRL});
saishou = min(saishou, (Xmax - Xmin) * (Ymax - Ymin));
}
}
cout << fixed << setprecision(12) << saishou << endl;
Would you please return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define Would
#define you
#define please
const int cm = 1 << 17;
char cn[cm], *ci = cn + cm, ct;
inline char getcha() {
if (ci - cn == cm) {
fread_unlocked(cn, 1, cm, stdin);
ci = cn;
}
return *ci++;
}
inline int getint() {
int A = 0;
int pn = 1;
if (ci - cn + 16 > cm) {
if ((ct = getcha()) == '-') {
pn = -1;
ct = getcha();
}
A = ct - '0';
while ((ct = getcha()) >= '0')
A = A * 10 + ct - '0';
;
return pn * A;
} else {
if ((ct = *ci++) == '-') {
pn = -1;
ct = *ci++;
}
A = ct - '0';
while ((ct = *ci++) >= '0')
A = A * 10 + ct - '0';
;
return pn * A;
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N = getint();
int RR = -1e9;
int RL = -1e9;
int RUD = -1e9;
int LR = 1e9;
int LL = 1e9;
int LUD = 1e9;
int UU = -1e9;
int UD = -1e9;
int URL = -1e9;
int DU = 1e9;
int DD = 1e9;
int DRL = 1e9;
bool R = false;
bool L = false;
bool U = false;
bool D = false;
rep(i, N) {
int x = getint(), y = getint();
char d = getcha();
getcha();
if (d == 'R') {
R = true;
RR = max(RR, x);
LR = min(LR, x);
URL = max(URL, y);
DRL = min(DRL, y);
} else if (d == 'L') {
L = true;
RL = max(RL, x);
LL = min(LL, x);
URL = max(URL, y);
DRL = min(DRL, y);
} else if (d == 'U') {
U = true;
RUD = max(RUD, x);
LUD = min(LUD, x);
UU = max(UU, y);
DU = min(DU, y);
} else {
D = true;
RUD = max(RUD, x);
LUD = min(LUD, x);
UD = max(UD, y);
DD = min(DD, y);
}
}
vector<double> kouho;
kouho.pb(0);
if (R && L) {
kouho.pb(0.5 * (RL - RR));
kouho.pb(0.5 * (LL - LR));
}
if (R && (U || D)) {
kouho.pb(RUD - RR);
kouho.pb(LUD - LR);
}
if (L && (U || D)) {
kouho.pb(RL - RUD);
kouho.pb(LL - LUD);
}
if (U && D) {
kouho.pb(0.5 * (UD - UU));
kouho.pb(0.5 * (DD - DU));
}
if (U && (R || L)) {
kouho.pb(URL - UU);
kouho.pb(DRL - DU);
}
if (D && (R || L)) {
kouho.pb(UD - URL);
kouho.pb(DD - DRL);
}
double saishou = 1e20;
for (double D : kouho) {
if (D >= 0) {
double Xmax = max({RR + D, RL - D, (double)RUD});
double Xmin = min({LR + D, LL - D, (double)LUD});
double Ymax = max({UU + D, UD - D, (double)URL});
double Ymin = min({DU + D, DD - D, (double)DRL});
saishou = min(saishou, (Xmax - Xmin) * (Ymax - Ymin));
}
}
cout << fixed << setprecision(12) << saishou << endl;
Would you please return 0;
} | [
"identifier.change",
"call.function.change"
] | 819,965 | 819,966 | u096883693 | cpp |
p03004 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(a) (int)a.size()
#define x first
#define y second
#define debug(...) cout << "[" << #__VA_ARGS__ << ": " << __VA_ARGS__ << "]\n"
#define rd() abs((int)rng())
using namespace std;
using namespace __gnu_pbds;
template <class T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
const int maxn = 1e5 + 100;
const int mod = 1e9 + 7;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
int n;
vector<pair<pii, char>> pts;
ld chk(ld tim) {
ld xmin = 1e12, xmax = -1e12, ymin = 1e12, ymax = -1e12;
for (auto pt : pts) {
ld xval = pt.x.x, yval = pt.x.y;
if (pt.y == 'U')
yval += tim;
if (pt.y == 'D')
yval -= tim;
if (pt.y == 'L')
xval -= tim;
if (pt.y == 'R')
xval += tim;
xmin = min(xmin, xval);
xmax = max(xmax, xval);
ymin = min(ymin, yval);
ymax = max(ymax, yval);
}
return (xmax - xmin) * (ymax - ymin);
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
pair<pii, char> a;
cin >> a.x.x >> a.x.y >> a.y;
pts.pb(a);
}
ld l = 0, r = 5e9;
for (int i = 0; i < 100; i++) {
ld m1 = l + (r - l) / 3, m2 = r - (r - l) / 3;
if (chk(m1) < chk(m2))
r = m2;
else
l = m1;
}
cout << setprecision(10) << fixed << chk(l) << "\n";
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(a) (int)a.size()
#define x first
#define y second
#define debug(...) cout << "[" << #__VA_ARGS__ << ": " << __VA_ARGS__ << "]\n"
#define rd() abs((int)rng())
using namespace std;
using namespace __gnu_pbds;
template <class T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
const int maxn = 1e5 + 100;
const int mod = 1e9 + 7;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
int n;
vector<pair<pii, char>> pts;
ld chk(ld tim) {
ld xmin = 1e12, xmax = -1e12, ymin = 1e12, ymax = -1e12;
for (auto pt : pts) {
ld xval = pt.x.x, yval = pt.x.y;
if (pt.y == 'U')
yval += tim;
if (pt.y == 'D')
yval -= tim;
if (pt.y == 'L')
xval -= tim;
if (pt.y == 'R')
xval += tim;
xmin = min(xmin, xval);
xmax = max(xmax, xval);
ymin = min(ymin, yval);
ymax = max(ymax, yval);
}
return (xmax - xmin) * (ymax - ymin);
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
pair<pii, char> a;
cin >> a.x.x >> a.x.y >> a.y;
pts.pb(a);
}
ld l = 0, r = 5e9;
for (int i = 0; i < 200; i++) {
ld m1 = l + (r - l) / 3, m2 = r - (r - l) / 3;
if (chk(m1) < chk(m2))
r = m2;
else
l = m1;
}
cout << setprecision(10) << fixed << chk(l) << "\n";
return 0;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 819,975 | 819,976 | u710999236 | cpp |
p03004 | #include <bits/stdc++.h>
using namespace std;
/*
Coded by ÇØϧÃÎ
The most attractive girl in the world
@@@@@@@@@@##&|;!!!!!!!!!!||||||||%%%%%$$$$$$$$$$$$%%$$$&&&&&&&&&$$&&&&&&&&&@@@&%||||||$&&&&@&%;'```'`':!||%&@@@@#@&&&&&@@@&&$$$&&@@&$$$&@@@@@@@@@@@@@#@@@@@@@@@@#@@@@@#@@@@@@@@@@##$
@@@@@@@@@####$!;!!!!!!!!!||||||||%%%%%%%%%%%%%%%$$$$&&&&&&&&&&&&&&&&&&&&@@@@@@&%|||||!:'`'!$&&&&&&%:''!|||$&&&@@@@@@&&&&&@@@&$$$&&@&&$&&@@@@@@@@@@@@@@@@@@@@@@@@##@@@@#@@@@@@@@@@#@%
@@@@@@@@@####@|;!!!!!!!!!|||||||%%%%%%%%%%%%%$$$$$$$$$$&&&&&&&&&&&&&&&@@@@@@@@&%|;:'''''``````'!$&&&@@&|:;%$$&&&@@@@@&&&&&@@@&$$$&&@@@@@@@@@@@@@@@@@@@@@@@#@@@@@#@@@@@#@@@@#@@@@##@%
@@@@@@@@####@@&|;!!!!!!!!|||||||%%%%%%%%%%%%%%$$$$$$$$&&&&&&&&&&&$$$&&@@@@@@@@@@&$|;'''''````````'':!$&&&$%%%%$$&@@@@@&&&&&@@@@&&&@@#@@@@@@@@@@@@@@@@@@@@@@@@@@@#@@@@@@@@@@#@@@@#@@%
@@@@@@@#####@@@$!;!!!!!!|||||||%%%$$$$$%%%%%%%%%$$$$$$$&&&&&&&&&$$$$&&@@@@@@@@$%$&@@&&&@&$%;:':;:''`````'|%%%%%%$$&@@@@@&&&&@@#@@@@@@#@@@@@@@@@@@@@@@@#@@@@@@@@@#@@@@@@@@@@@@@@#@@@%
@@@@@@#####@$%%%$$$%%%||%%||||%%%%$%%$$$$$%%%%%%%$$$$&&&&&&&&&$$$$$$&&@@@@@@@&$;'''''':!%&&&&&&@@&%;'```:$&&%%%%%$$$&@@@@&&&&@@@@@@@@@#@@@@@##@@@@@@@@#@@@@@@@@@@@@@@#@@@@@@@@@#@@@%
$&@@@@######&&&&&$%%%%|%|||||||%%%%%$$$$$$$$$$$$$&&&&&&&&&&&&&&&&$$$$&&@@@@@@&$!''''''````````:!|$&&&&&&&$&&&$%%%%$$$&&@@@&&&&&@@@@&@@@@@@@@@#@@@@@@@@#@@@@@&&&@@@@@@@@@@@@@@@#@@@@$
$$$&@######@&&&&&&|!!!!!|||||||%%$$$$$$$$$$$$$$$&&&&&$$&&&&&&&&&&&&$$&&&@@@@@@&%;::''````````'':'``....`;|%$&&&$%%$$$$$&@@@&&&&&@@@@@@@@#@@@@@#@@@@@@@@@@@@@@&&@&&&&&&&&&@@@@@@@@@@$
$$$&@#####@&$$&&@#&|!!!!!|||||||%%%$$$$%%%%%$$$$$$$&&&&&&&&&&&&@@@@@&&&&&&@@@@@@@@@@@&&&&&&&&@@@@&&$$%||||%%%$$&&&$$$$$$$&@@@&&&&&@@@@@@@#@@@@@@@@@@@@@@@@@@@@&&@&&&&&&&&@@@@@@@@@#$
$$&@######@&$&@##@&$|!!!!|||||||%%%%%%%%%%%%%$$$$&&&&&&&&&&&&&&&&&&&&$$&&&&&&@@&|'`````````':::;;;;;;!|%%%%%%%%$&@@&$$$$$$$&@@&&&&&@@@@@@@@@@@@@@@@@@@@#@@@@@@@@@&&&&&&&&&@@@@@@@#@%
$&@######@&&&@##@$$$$|!!!||||||||%%%%%%%%%%%%$$$$&&&&&&&&&&&&&&&&&&&&$&&&&&&&&@@$!:::'':::::::::::::''``.:%%$$$$$$&@@@&$$$$$&@@@&&&&@@@@@@@@@@@@#@@@@@@@@@@#@@@@#@@@@@@&&&@@@@@@@@@%
$&@######@&&@#@&$$$$&$|!!!||||||||%%%%%%%%%$$$$$&&&&&&&&&&&&&&&&&&&$$$&&&&&&&&&&&%;::::::::::::':''':'':::%&$$$$$$$$&&@@&$$$$$&@@@&&&&@@@@@@@@@@@@@@@@@@#@@@@@@@@@@@@@@@@@@@@@@@@@@%
&@#######@@@#@&$$$$$&&$|!!|||||||||%%%%%%$$$$$$$$$&&&&&&&&&&&&&&&$$$$$&&&&&&&&&&&$!''::::'''::;!|%%$&&@@@@&&@@$$%%$$$$&&@&&$$$$&@@@&&&&@@@@@@#@@@@@@@@@@@@@@@@@#@@@@@@@@@@@@@@@@@@@%
############&$$$$$$$&&&$|!!||||||||%%%%%%$$$$$$$$$$$$$$&&&&&$$$$$$$$$$&&&&&&&&&&&&@@@&&&&&&&@@@@@@&&&$$%|!;%@@@@&$$$$$$$$&@@&$$$$&@@@&&&@@@@@@@@@#@@@@@@#@@#@@@@@@@@@@@@@@@@@@@@@@@$
########@&$$$$$$$$$&&&&&$|!!||||||%%%%%%$$$$$$$$$$$$$$$$$$$$$$$$$$$$$&&@@&&&&&&&&&&&&&&$$$$$$$$$$&&&$$%!;:::|$&@@@@&$$$$$$$&@@&$$$&@@@&&&@@@@@@@@##@@@@@@@@@@@@#@@@@@@@@@@@@@@@@@@@$
########@$%%%$$$$$$&&&&&&&%!||||%%%$$$%%%%%%%%%%%%%%%%%%%%%%%$$$$$&&&&&&&&&&@@@&&&&&&&&&&&&$$$$$$$$$$$$$&&%!!$$$$&@@@@&$$$$$$&@@@&&&&@@@&&@@@@@@@##@@@@@#@@@@@@@@@@@@@@@@@@@@@@@@@@%
#######@&$$$$$$$$$$$$&$|!||%%%%||%%%%%%%%%%%%%%%%%$$$$$$&$$$$$&&&&&&&&@@@@&&&&&&&&&&&&&&&&&&&$$&&$$$$$$$$$&&&$&@&$$$&@@@&$$$$$$&@@@@&&@@@@&@@@@@@###@@@@@@@@@@@@@@@@@@@@@@@@#@@@@#@%
#######@$$$$$$%$$$$$$$&&$||||%%%%%%$$$$$$$$$$$$$$$$$$$$$$$&&&&&&&&&&@@&&&&&&&&&&&&$$$$$$&&&&$$$$$$$$$$$$$$$$$$&@@@@&$$$&@@@&$$$$&&&@@@&@@@@&&@@@@@###@@@@#@@@@@#@@@@@@@@@@@#@@@@#@@$
#######&$$$$$$$$$$&$$$$$&&&&&$%||%%%%%%$$$$$$$$$$$$$$$$$&&&&&&&&&&&@&&&&&&&&&&&&$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$&&@@@&$$$&@@@&$$&&&@@@@@@#@@@@@@@@##@@@@#@@@@@@@@@@@@@#@@@@@@##@##$
######@$$$$$$$$$$$$$$$$$$&&&&&&$||%%%%%%%$$$$$$$$$$$$$&&&&&&&&&@@&&&&&&&&&&&&&&$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$&@@@@@&&$&&@@@&&&&&@@@@@##@@@@@@@##@@@###@@@@@@@@@@@@@@#@@@#@#@@%
######&$$$$$$$$$$$$$$$$$&&&&&&&&$%|%%%%%%%$$$$$$$$$$&&&&&&&&&&@&&@@&&&&&&&&&&$$$$$$$$$$$$$$$$$$$$$$$&$$$$$$$$$$$$$$$$&@@@@@@&&&&&@@@&&&&@@@@@#@@@@@###@@@##@@@@@@@@@@@@@@#@@@####@#$
#####@$$$$$$$$$$$$$$$$$$$&&&&&&&&&%%%%%%%%%$$$$$$$$&&&&&&&&&&&&&&&&&&&&&&&&$$$$$$$$$$$$$$$$$$$$$$$$$$&$$$$$$$$$$$$$$$$$&&&@@@@@&&&&@@@@@@@@@@@@#@@@@###@@@$%%%%%%%%%%%%%$&@@#######$
#####@&$%$$$$$$$$$$$$$$$$$$&&&&&&&&$%%%%%%%%%%$$$$&&&&&&&&&&&&&&&&$$$$$$$$$$$$$$$$$$$$$$$$$$%$$$$$$$$$%%$$$$$$$$%%$$$$$%&@&&&&@@@@@&&@@@@@&&@@@@#@@@@###@&%%%%%%%%%%%%%%%%%&@##@##@%
####@@@@&$$$$$$$$$$$$$$$$$$&&&&&&&&&&%%%%%%%%%%$$&@&&&&$&&&$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$||$$$$$$$$%%$$$$$|%$$$$$$$%%$&@@@&&&@@@@@@@@@@@@&@@@@@@@@##@&%%%%%%%%%%%%%%%%%%%$@@@@@%
####@@@@@@&$%$$$$$$$$$$$$$$$$$&&&&&&&&$%%%%%%%$&&&&&$$$$$$&$$$$$$$$$$$$$$$$$$$$$$$%%$$$%%%%|!|||$$$$%!|%%%$$&$$$$$$$$$$%%%$&@#@@@@&&@@@@@@@@@@@@@@##@@@@#@@@&$$%%%%%%%%|%%%%%|$@@@@$
###@@@@@@@@$$$%$$$$$$$$$$$$$&&&&&&&&&&&&%%%%%&&&&&$%%%$$&&&$$$$$$$$$%%%$$|%$$$%%%$%%|%%!;!||!!||%$$$$$$$%%$&$$&&$$$$$$$$$$%%$@@#@@@@@@&&@@@@@@@@#@@###@@@########@@$%%%%%%%|%%$&@##$
##@@@@@@@@@&$$$&$$$$$$$$$$$$$$$&&&&&&&&&&&%%%$&%|%%%%%$%%$$%%%%%%$$$%%%$$||%%%$$$$$%%%%%$$$$$%!!|%&&$$$$%|$$$$$$&$$$$$$$$$$$%$$&@@@@@@@@@@@@@@@##@@@@##@@####@@#######&%%%%%%%$@###$
#@@@@@@@@@@&&$$&$$$$$$$$$$$$$$$&&&&&&$||%%%$$%!;!;!|%%%%$%!||||%%%$$$||%$%%%%%%$$$$%$$%%%%$%$$$$||$&&$$&%|%$$$$$$$&$%%$%|%$$$$%$%$@@@@@@##@@@@@@@@@@########@##@@@######&$$&@@@@@##$
@$$&@@@@@@@&&$$$$$$$$$$$$$$$$$$&&&$&&&&$$&$$%!|%%%%%%%%%%||%%%%%%%%$$||%$$$$%%%%$$$%%$$%%%%%%%$$%|%&&$$&$%%$$$$$$$&&$%%&&&&$$$$$$$||$@@@@@@@@@@@@@@@@@@@####@@@@##@@@#@@@@@@@@@@@@@%
&$%%$$&&&$$$$$$$$$$$$$$$$$$$$$$$$$$&&&&&&&&|!|%%%%|%%%%%%$%%%%||||%$$%|%$&&$%%%%$$$$%$$%%%%$$$$$%|$&&&$&$$$&$&$$$$&&&$%$&&&$$&&&&&$%!!|$&@@@@@@@@@@@@@@@@###@@@@@@@@@@@@@@@@@@@@@@@%
$$%$$$$$$$$$$$$$$$$$$$$$$$$$$$$&&&$&&&&&&$|!|||%%|%%%%%%$$%%%%||||%$$%%%$&&$%%%$$&&&$$$$$$$$$$$$$%%&&&&&$$&&$&$$&&&&&&&&&&&&&&&&&&&&$|!!!!$&@@@@@@@@@@@#####@######@##@@&@@@@@@@@@@$
$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$&&&&&&$|!|||%$%%%%%%%$$$$%%%||||%$$%%%$&&$$%%$&&&&&$$$$$$$$$$$$%%&&&&&$$&&$&$$&&&&&&&&&&&&&&&&&&&&&&%!!!!|&&&@@@@@@#########@########@@##########$
$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$&&&&&$&$%|!||%$$%%$%%%%$$$$$%%|||||$$$&$$&$$$%$&&&&&&$$$$$%$$$$$$%$&&&&&&&&&&&$$&&&&&&&&&&&&&&@@&&&&&@@$|!$@&||||%&@#@@####@########@@@@@@@#@&&@@##$
$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$&&&$$&$%|!||%$$%%%%%%%$$$%$$%%||||%$&&&&&&$$$$$$&&&&&$%$$$%%$$$$$%$&&&&&&&&$$$$$&&&&&&&&&&&&&&@@@&&@@@@@&@@&|||||||||%&@###############@@@@@@##@@@@%
%$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$&$&&$$$$%!!|%$$$%%%%%%$$$$%$$$%||||$&&$$&&$$$$$$$&&&$&$%%$%%%%%%$$%$$$&&&&&$$$$$$&&&&&&$&&&&&&&&&&&&&&&@@@@&||||||||||||$@#####@@@########@@@@@###@@$
%%%%%%%%$$$$$$$$$$$$$$$$$$$$$$$$$&&%%&%!!||%$$%%$$%%$$$$%%$$%%|!|%&&$%%&&$%%%%$$$&$|%$||$%%%%%%$$$$$$&&&&$$$$$$&&&&&&$$$&&&&&&&&&&@@&&&@@@&&%|||||||||%&@@##@$$@@@@########@@@@@@##$
;:''':;!|%%$$$$$$$$$$$$$$&&&&&&&&%%&&$!!|%%%%%%%$$$$$$$%%%$%%%|||$$&%!%&$%%%%|%%%&%!|$||%%%%%%%$$$$%%$&&$$$$$$$&&&&&&$$$$&&&&&&&&&&&&&&@@@@&&%|||||||%@@@@#@%|&#$||||%&@@@@@@@@@@@@$
.....
.`;|%%$$$$$$$$$$$&&&&&&$%%$&&$!;|%%|||%%$$&&&&$$%%$$%%%%%%%&%!;|$$%||||%%%$|;!%||$%$$$$$%%%%||$&$%%%$$$$&&&&&&$$$$&&&&&&&&&&&&&@@@@@@&&%|||||$@@@##&%|%@@%||||||||||&@@@@@@@%
........
`;|%$$$&&&&&&&&&&&$%$&&&&$|!|%%|!!|||$&$&&&$$%%%%%||||%$$|;;|%%|||||%$&&$|!|!!%%%%%%|!!|%!%$$%||%$&$&&&&&&&$$$$&&&&&&&&&&&&@@@@@@@@&&%|||$@@@##@$||$#&|||||||||||&#$|||||!
... ..
`;|%$$$$&&&&&&$%$$&&&&&&||%%$||!!||$&$$$$$$%%%%%%||||%$%!:!!!%%$$$%%%%|!;;;;;!!!!!;;;||!%&%|%%%$&&$&&&&&&&$$$$&&&&&&&&&&&@@@@@@@@@&&$||$@##@@@%||%&@$||||||||||%&@$|||||!
..
.'!|%$$&&&&&&&&&&&&&&&&||$$&%||!||%&&$$$$$$%%$%||||||%|!;:;;;|%|!!!!!|!|$$&&&&$$$%!!!!;|&&$%%%$&$$$$%||&@&$$$$&&&&&&&&&@@@@@@@@@@@@&$|%@@@@#@%|||$@&%||||||||||%@@%|||||!
...
.';|%$$&&&&&&&&&&&&&&&%%&$&&%|||||%&&$$$$$$%%$%%%||||%!;:::::::'':;!|%%%%$&@&&$%|!|%|;!$&$%|%%$$$$&$|!|$@@&$$$&@@@@@@@@@@@@@@@@@@@@&$$@@@#@&%|||%&#$|||||||||||$@&%|||||!
....
.:!|%$$&&&&&&&&&&&&&&$$&&&&$|||||%$@&$$&$$&&&$%|%%%%|;::''''''````'!!!;'`'%@&%|!::!;;!$$||%%%$&$$$$|!!|%&@@&&&&@@@@@@@@@@@@@@@@@@@@&&@@@@#@%||||$@@$|||||||||||$#&||||||!
..
.';!|%$$$&&&&&&&&&&&&$$&&&&&$$%||%%&@&$$&$$$$%|!;;;;:::'`````````````````';;:;!;'::::;%$|||!!|$$$%$%||||$@@@&&&@@@@@@@@@@@@@@@@@&&@&&&&&&@@@$%%||&#&%||||||||||%&#$||||||!
.`:!!!|$$&&&&&&&&&&&&&&&&&&&&&&&$%$$$&@&&$&&$$|!|%$$$$%|;''``````````````':;!!!;::''':;!$%|$$%%$$$$$$%!!%&@@@@@@@@@@@@@@@@@@@@@@@@&&&&@&$$&@@@@@@@@@#&%||||||||||%@@$||||||!
;:''`'':;!!!!|%$$&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&$&&&&&$|!%%%%$&$$|;'``````````````''''''''::::;|$&$$$%%$$%%$$$&@@@@@@@@@@@@@@@@@@@@@@@@@@@&&&@&$$$&&&@@@@@@@@@@@@@@&$%|||$@@$||||||!
|!;;;!!!!!!|%$$$&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&%!:;|!||!!:'''``````````````''''''''':;;|$$$$$%%$%$$$&&&&&@@@@@@@@@@@@@@@@@@@@@@@@&&&@&$$$&&&&&@@@@@##@@@@@&&@@@@@@#@&%|||||!
%|!!!!!!||%$$$&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&@@&&&&&&$$$!';;;:'```''`````````````````'''''';;:|$$$$$$$$%$$$&@&&&&@@@#@@@@@@@@@@@@@@@@@@@&&@&$$$$$$$&&&@@@@##@%;''|&@@@@@@@#@@@@@@@%
&$%%%%%%$$$$&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&@&&&@&&&$$$%;``'''``':'``````````````````'''':::;|$$$$$$$%$$$$&&&&&&@@@##@@@@@@@@@@@@@@@@@@&@&$$$&&&$$$&&&@@@@|:''':%@@@@@@@#@@@@@@@@%
@@&$$$$$&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&@&&@@&&&$$$$%:``````';:'```...`````````````'''':;|$$$$$$%%$$$$&&&&&&&@@##@@#######@@#@@@@@@#@&$$&&&&&$%$$&&@@%:'::'!&@@@@&@@@@@@@@@@@%
##@&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&@@&&&&&&&$$%:``````':;:```..``````````````''':;|$$$$$$%%$$$&&&&&&&@@@####################@&$$&&$$$$$$$|;|&$!''':;$&&&&&&@@@@@@@@@@@%
##@&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&$&@&$&&&$&&&&&%'``````.``````....```````````'`'';|$&$$$%$$$$$$&&&&&@@@@@##################@$$$&&$$$$$|:':;%&$;''''|&&&&&&&&@@@@@@@@@@%
##@&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&$%$&@@$$$$$&&&&&@@!````````.......````````````''`'':!%$&&&$$&&&&&&&&&&@@@#@@##############@@&$$$$&$$$$$$|:''|&&|''''!$&&&&&&@@@@@@@@@@@@%
##@&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&|;%&$&@$$$$$$&&&&&@@&;..``..........````````````''``'';%$&&&&&&&&&&&&&&@@@@@##@############@@@$$$$&$!|$$$$!:':%@%:``':%&&@@@@@@@@@@@@@@@@@%
##@&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&$!!$&&$&&$|!|%$$$&&&@@@@$:.........``'''``':;:'`````````':!%$&&&&&&&@&&&&&@@@@@@@#@@#########@@@&$$$%!!$$$$$%;'';$&!``':%@@@@@@@@@@@@@@@@@@@&%
##@&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&|;%&&&&$%%$%!|%%$$$$&&@@@@@$;`.....`...````````````````````';|$&&&&&&&&@@@&&&@###@@@@#@&&##@@@@@&$$$$&&$$$$$$|'```!&%;|&&&&&@@@@@@@@@@@@@@@&&&&%
###&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&%:|&&&&&$$||$&$|%%%$$&&&@@@@@@@@$;`........``'::'`...```'``````:|$$$&@@&$&@@@@@@&@#@@####@#&&#@$|%&$$%%&&$$$$%!'`.`:!$@@&&&&@@@@@@@@@@@@@@&&&&&&&&%
###@&&&&&&&&&&&&&&&&&&&&&&&&&&|:!&&&&&&$$%||$&&$%%%$$&&&&@@@@@@@@@@&%:`.................`'````:!;;|$$$&&@@&&&&@@@@&&@########@!':|&$$%%$|;:;;!|%%%%||$@@&&&&&&&@&&&&&&&&&&&&&&&&&&&%
###@&&&&&&&&&&&&&&&&&&&&&&$!:|&&&&&&&&$$%|%$&&&$%%%$&&&&&@@@@@@@@@@@@&&$;`..............``'';|!;;;;|%$$$$&@@@&&&@@&&$$&&@@@@##@&%||%%%$!:|%%%%%||%!|$@@@&&&&&&&&$$$$$$&&&&&&&&&&&&&%
###@&&&&&&&&&&&&&&&&&&&|:!$&&&&&&&&&&$%%%%$$&&&$%%$$$$&&@#@@@@@@@@@@@&&&&&&|'...........``:!!;;;;;!!;|$&$%|&@@@&&&&&$!|$$$&@@#@@&%%%%$|'':!%%%%|!|$&&@@&&&&&&&$%%%%$$$$$&&$$$$$$&&&%
###@&&&&&&&&&&&&&&&|:;%&&&&&&&&&&&&$$%%%%$$&&&&$$$$$$$$&@#@@@@@@@@@&&&&&&&&&&&&|'.....`;%%!!!!;;;!!!!;!%$$&$|%@@@@@&&@$;:::!|%$&$%%%$%:'``';!!|||%$&@@@&&&&&&$%%%%%%%$$$$$%%%%$$$$$|
###@&&&&&&&&&$|:;%&&&&&&&&&&&&&&&$$%%$%%$&&&&&&$$$$%$$$&@@@@@@@@@##@&&&&&&&&&&&&&&%|%&&&&&$|;;;;;;;;;;;;!$&$&$|!%&@@@@@@&%;::!$$$$$$%;:```````;||||%$&&$$$$$$%|%%%%%%%$$$%%%%%%%%$%|
###@&&$%|||$&&&&&&&&&&&&&&&&&&$$$$%%$$%$&&&&&&&$$$%%$$&&@@@@@@@@@@@##@&&&&&&&&&&&&&&&&&&&&@%;;;;;;;::;;;;!!$&&$$%!;|$$$&&&$&&&$$$$$%!|$&%:...`.`;|!|||!;!|||||||%%%%%%$%%%||||%%%%%|
&&@@&&&&&&&&&&&&&&&&&&&&&&&$$$$$$%%$$%$&&&&&&&&$%%%%$$&&@@@@@@@@@@@@#@&@@&&&&&&&&&&&&&@###&%;;;;;;::::;;;!!!!|$$$&&%!:;!$&&&@&$$$&@&&&$%$&|``..'%#@@&$%%||||!;:'`';|%%$%%|||||||||||
###@&&&&&&&&&&&&&&&&&&&&$$$$$$$$%%$&&$$&&&&&&&&$%%%%$$&&&@@@@@@@@@@@@@@&&&&@@@@@&&@####$;':!!;;;::::;;;;!;!;::::;%&&&&&$$$&@&$$$@@$$$$$&@@@@$%@#@@##@@&%%||||||||%%%|!'`:!||||||||||
###@&&&&&&&&&&&&&&&&&$$$$$$$$$$$$$$$%%$$$$&&&&@$%%%%$$&&&&&@@@@@@@@@&&&&@@&&&&&&&@@@@|:':;;!!;;:::::::;;!!;:::::::::':::';$$$$$&&$&&&@@@&&@@@@@#######@@##@&%||||||||%%%%|!''!|||||!
###@&&&&&&&&&&&&&&$$$$$$$$$$$&&$$$$$%%$$$$$&&&&&$%%$$$&&&&&$&&&@@@@&&&&&&&&&&&&@@@%:''':;;;;;:::::::::;;;:::::::::::::;;!%$$$$$|:::|$&&$&@@@@@&$&@#####@@@@####@&$%||%%%||||||;:!||!
###@&&&&&&&&&&&$$$$$$$$$$$&&&&&$$&&$%%$$$&&&&&&&&$%$$$$$&&&&&&&@@@#@&&&&&&&&@##$;''''':;;;;;:::::::::;!;:::::::::::::::;%&$$$$|''':;%&%!;:'''':|%$&@@@@#@@&&&@##@&&@@$|%%|||||||!:;|
:;$@@&&&&&&&$$$$$$$$$$$&&&&&&&&&$$&&$$&&&&&&&&&&&$%%$$$&&&&&&&&&&&&@@#######@|:'''''';!!!;::::::;;!!!!;::::::::::::::::|$$$$$!'::;!!%&|;;''''''''''';$&@@#@&&$$&@&&@#@@@#####@$%||;:
''''':|$&$$$$$$$$$$&&&&&&&&&&&&&&$$&$$&&&&&&&&&&&&&$$$$$&&$$&&&&&@@@@@&$%$%|:''''''':;:::::::::::::;;:::::::::::::::::|$$$$$!::;;;;|&%;;:''''''''''''':!$&@@@&$$$$&################$
'''''''''';%$$&&&&&&&&&&&&&&&&&&&&$$$$&&&&&&&&&&&&&&$$$$$&@@@@@###@&&$%;''''''''':::;;:::::::::::;;:::'':::::::::::':|$$$$$!::;:::|&%;;:''''''''''''''```:%&@@&&&$$$&##############$
'''''''''''':':|&&&&&&&&&&&&&&&&&&&&$%$&&&&&&&&&&&&&&$$$$$&@@&@@@&$$%%!:''''''::::::!;::::::::::;;::::::::::::::''':|$$$$$|;;:::;%&|::'''''''''''''`.....``;$@@&&&&$$$&@###########$
;:'''''''''''''':::!$&&&&&&&&&&&&&&&&&%|$&&&&&&&&&&&&&&$$$$&$$$$$$|:!|;':::::::::::;!;::::::::;;:::::::::::::''''':|$$$$$|;::::|&&|::'''''''''''``........`''!&@@&&&&$$$&@#########$
.';;;;;:'''''''''''':::;%&@&&&&&&&&&&&&%$&&$$$$&&&&&&$&@&&&$$$$%!:::!|;::::::::::::!!;::::::!;::::::::::::::''''':|&$$$$|;::::|&%;;:'``''''''''````......````'!$@@&&&&&$$$&@#######$
;;;:`.`:;;;;::'''''''''''':;%@@@&&&&&&&&$$$&&&&&&&&&&@@&!::':'':::::||;::::::::::::!!;:::;!!;;:::::::::::::::''':%&$$$$|;:::;%&|:::'`````````'''```..`...````''!$@@&&&&&&&$$&@#####$
;;;;;;;;;'..';;;;::''''''''''':|@@@@&&&&&&$%$&&&&&&&@@%:::::::::::::!|;:::::''''''';!;:;!!;:::::::::::::::::''':%&$$$%|;:::|&%;;:'''```````'''''``...
```''!&@&&&&&&&&&&&&@###$
:::;;;;;;;;!;;;'':;;;;:'''''''''':!&@@@&&&&&$$&&&&@@@$;::::::::::::';|:``````````'';!;;;:'''```````````````''''|$$$$%|;::|&$!;;:'````````''::''``....
.``'':%@&&&&&&&&&&&&&&@#$
::::::::;;;;;;;;;;;;:'':;;:''''''''':;%@@@@&&&&$&@@@$;''''''':''`''`:|;````````````:!!:'''``.........``......`!$%%%%|;;|&$!:;'`````````'''::''.
.. `''``''!$&&@@&&&&&&&&&&&&%
###@%!:::::::;;;;;;;;;;;;;;;;::'''''::::|&@@@&&&&&&%'```.....````''`'||'``````````';;'''``.................
.!$%%%%|!%&$!:;:'``'''````'::::''. ....``''``'''|@&&&@&&&@&&&&&&$|
####@&&&@&|;::::::;;;;;;;;;;;;;;;:'''''''::!&@@@@@%:````......```'```;%;`````````''''``.................
.!$%%%%%$&%;:::''```'''```'::::'`. ...``'```''';$@&&&@@&&&&&&&&&%
####@&&&&&&&&&$!:::::::;;;;;;;;;;;;;:''''''':|@@@$;````.......``''```'!%;``````''''``.......
.... .;%%%%%%$%;::'''`````''''`'::::`. ...`````'''|@&&&&@@&&&&&&&&%
####@&&&&&&&&&&&&&&|;::::::;;;;;;;;;;;;:::'':;;%&;````.........``'````:||:```':''`......
.`:|%%%%%|;::''''``````'''''::::`. ....```'''!$@&&&&@@&&&&&&&%
####@&&&&&&&&&&&&&&&&&&|::::::::;;;;;;;;;:::::;;'````..........``'`````:||:':''`......
.`'!$%%%%|;:''```````````'''''::;'. ......``':%@@&&&&&@&&&&&&%
####@&&&&&&&&&&&&&&&&&&&&&$!:::::::;;;;;;;;;;;;'`````..........`''``````:||:''`.
. .``!$&$%%%%%;'''`````````````'':::;;` .....```'!&@&&&&&&@&&&&&%
####@&&&&&&&&&&&&&&&&&&&&&&&&&|;:::::;;;;;;;;;:``````...........''````':':|%!'.
.``'|$&|;|%|%%%!''````...`````````':::;;` .....```'|@&&&&&&&@&&&&%
####@&&&&&&&&&&&&&&&&&&&&&&&&&&&$!::::::;;;;;:``````....``......''``':'''':!|%;..
..``:|%$|;::;|%||%%!'`````......```''`'':::;:' ....... ....````:%@&&&&&&@@&&&%
####@&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&%;:::::;;:```````....`. ...`'':''`.
.':!||;````````';|%%|;::::';|%||%%;'```.........```'''''::::;'. ....````........
......````:%@&&&&&&@@&&%
####@&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&|:::::'```````...``. ..'::'``.
.```':;!||!;;!||!;::::''``';|%||%|;'```..........```'''''::::;:.....``````````...........`````;&&&&&&&@@@&%
*/
int n;
long double x[100005], y[100005];
char fx[100005];
const long double eps = 1e-16;
long double calcdist(long double t) {
long double mx = -1e18, mn = 1e18;
for (int i = 0; i < n; i++) {
mx = max(mx, y[i] + (fx[i] == 'U' ? t : (fx[i] == 'D' ? -t : 0)));
mn = min(mn, y[i] + (fx[i] == 'U' ? t : (fx[i] == 'D' ? -t : 0)));
}
long double sum = mx - mn;
mx = -1e18, mn = 1e18;
for (int i = 0; i < n; i++) {
mx = max(mx, x[i] + (fx[i] == 'R' ? t : (fx[i] == 'L' ? -t : 0)));
mn = min(mn, x[i] + (fx[i] == 'R' ? t : (fx[i] == 'L' ? -t : 0)));
}
return sum * (mx - mn);
}
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%Lf%Lf %c", x + i, y + i, fx + i);
}
// x
long double l = 0, r = 1e18, ff = 355;
while (ff--) {
long double m = (r + l * 2) / 3;
long double m2 = (r * 2 + l) / 3;
if (calcdist(m) < calcdist(m2)) {
l = m2;
} else {
r = m;
}
}
printf("%.14Lf\n", calcdist(l));
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
/*
Coded by 秦惜梦
The most attractive girl in the world
@@@@@@@@@@##&|;!!!!!!!!!!||||||||%%%%%$$$$$$$$$$$$%%$$$&&&&&&&&&$$&&&&&&&&&@@@&%||||||$&&&&@&%;'```'`':!||%&@@@@#@&&&&&@@@&&$$$&&@@&$$$&@@@@@@@@@@@@@#@@@@@@@@@@#@@@@@#@@@@@@@@@@##$
@@@@@@@@@####$!;!!!!!!!!!||||||||%%%%%%%%%%%%%%%$$$$&&&&&&&&&&&&&&&&&&&&@@@@@@&%|||||!:'`'!$&&&&&&%:''!|||$&&&@@@@@@&&&&&@@@&$$$&&@&&$&&@@@@@@@@@@@@@@@@@@@@@@@@##@@@@#@@@@@@@@@@#@%
@@@@@@@@@####@|;!!!!!!!!!|||||||%%%%%%%%%%%%%$$$$$$$$$$&&&&&&&&&&&&&&&@@@@@@@@&%|;:'''''``````'!$&&&@@&|:;%$$&&&@@@@@&&&&&@@@&$$$&&@@@@@@@@@@@@@@@@@@@@@@@#@@@@@#@@@@@#@@@@#@@@@##@%
@@@@@@@@####@@&|;!!!!!!!!|||||||%%%%%%%%%%%%%%$$$$$$$$&&&&&&&&&&&$$$&&@@@@@@@@@@&$|;'''''````````'':!$&&&$%%%%$$&@@@@@&&&&&@@@@&&&@@#@@@@@@@@@@@@@@@@@@@@@@@@@@@#@@@@@@@@@@#@@@@#@@%
@@@@@@@#####@@@$!;!!!!!!|||||||%%%$$$$$%%%%%%%%%$$$$$$$&&&&&&&&&$$$$&&@@@@@@@@$%$&@@&&&@&$%;:':;:''`````'|%%%%%%$$&@@@@@&&&&@@#@@@@@@#@@@@@@@@@@@@@@@@#@@@@@@@@@#@@@@@@@@@@@@@@#@@@%
@@@@@@#####@$%%%$$$%%%||%%||||%%%%$%%$$$$$%%%%%%%$$$$&&&&&&&&&$$$$$$&&@@@@@@@&$;'''''':!%&&&&&&@@&%;'```:$&&%%%%%$$$&@@@@&&&&@@@@@@@@@#@@@@@##@@@@@@@@#@@@@@@@@@@@@@@#@@@@@@@@@#@@@%
$&@@@@######&&&&&$%%%%|%|||||||%%%%%$$$$$$$$$$$$$&&&&&&&&&&&&&&&&$$$$&&@@@@@@&$!''''''````````:!|$&&&&&&&$&&&$%%%%$$$&&@@@&&&&&@@@@&@@@@@@@@@#@@@@@@@@#@@@@@&&&@@@@@@@@@@@@@@@#@@@@$
$$$&@######@&&&&&&|!!!!!|||||||%%$$$$$$$$$$$$$$$&&&&&$$&&&&&&&&&&&&$$&&&@@@@@@&%;::''````````'':'``....`;|%$&&&$%%$$$$$&@@@&&&&&@@@@@@@@#@@@@@#@@@@@@@@@@@@@@&&@&&&&&&&&&@@@@@@@@@@$
$$$&@#####@&$$&&@#&|!!!!!|||||||%%%$$$$%%%%%$$$$$$$&&&&&&&&&&&&@@@@@&&&&&&@@@@@@@@@@@&&&&&&&&@@@@&&$$%||||%%%$$&&&$$$$$$$&@@@&&&&&@@@@@@@#@@@@@@@@@@@@@@@@@@@@&&@&&&&&&&&@@@@@@@@@#$
$$&@######@&$&@##@&$|!!!!|||||||%%%%%%%%%%%%%$$$$&&&&&&&&&&&&&&&&&&&&$$&&&&&&@@&|'`````````':::;;;;;;!|%%%%%%%%$&@@&$$$$$$$&@@&&&&&@@@@@@@@@@@@@@@@@@@@#@@@@@@@@@&&&&&&&&&@@@@@@@#@%
$&@######@&&&@##@$$$$|!!!||||||||%%%%%%%%%%%%$$$$&&&&&&&&&&&&&&&&&&&&$&&&&&&&&@@$!:::'':::::::::::::''``.:%%$$$$$$&@@@&$$$$$&@@@&&&&@@@@@@@@@@@@#@@@@@@@@@@#@@@@#@@@@@@&&&@@@@@@@@@%
$&@######@&&@#@&$$$$&$|!!!||||||||%%%%%%%%%$$$$$&&&&&&&&&&&&&&&&&&&$$$&&&&&&&&&&&%;::::::::::::':''':'':::%&$$$$$$$$&&@@&$$$$$&@@@&&&&@@@@@@@@@@@@@@@@@@#@@@@@@@@@@@@@@@@@@@@@@@@@@%
&@#######@@@#@&$$$$$&&$|!!|||||||||%%%%%%$$$$$$$$$&&&&&&&&&&&&&&&$$$$$&&&&&&&&&&&$!''::::'''::;!|%%$&&@@@@&&@@$$%%$$$$&&@&&$$$$&@@@&&&&@@@@@@#@@@@@@@@@@@@@@@@@#@@@@@@@@@@@@@@@@@@@%
############&$$$$$$$&&&$|!!||||||||%%%%%%$$$$$$$$$$$$$$&&&&&$$$$$$$$$$&&&&&&&&&&&&@@@&&&&&&&@@@@@@&&&$$%|!;%@@@@&$$$$$$$$&@@&$$$$&@@@&&&@@@@@@@@@#@@@@@@#@@#@@@@@@@@@@@@@@@@@@@@@@@$
########@&$$$$$$$$$&&&&&$|!!||||||%%%%%%$$$$$$$$$$$$$$$$$$$$$$$$$$$$$&&@@&&&&&&&&&&&&&&$$$$$$$$$$&&&$$%!;:::|$&@@@@&$$$$$$$&@@&$$$&@@@&&&@@@@@@@@##@@@@@@@@@@@@#@@@@@@@@@@@@@@@@@@@$
########@$%%%$$$$$$&&&&&&&%!||||%%%$$$%%%%%%%%%%%%%%%%%%%%%%%$$$$$&&&&&&&&&&@@@&&&&&&&&&&&&$$$$$$$$$$$$$&&%!!$$$$&@@@@&$$$$$$&@@@&&&&@@@&&@@@@@@@##@@@@@#@@@@@@@@@@@@@@@@@@@@@@@@@@%
#######@&$$$$$$$$$$$$&$|!||%%%%||%%%%%%%%%%%%%%%%%$$$$$$&$$$$$&&&&&&&&@@@@&&&&&&&&&&&&&&&&&&&$$&&$$$$$$$$$&&&$&@&$$$&@@@&$$$$$$&@@@@&&@@@@&@@@@@@###@@@@@@@@@@@@@@@@@@@@@@@@#@@@@#@%
#######@$$$$$$%$$$$$$$&&$||||%%%%%%$$$$$$$$$$$$$$$$$$$$$$$&&&&&&&&&&@@&&&&&&&&&&&&$$$$$$&&&&$$$$$$$$$$$$$$$$$$&@@@@&$$$&@@@&$$$$&&&@@@&@@@@&&@@@@@###@@@@#@@@@@#@@@@@@@@@@@#@@@@#@@$
#######&$$$$$$$$$$&$$$$$&&&&&$%||%%%%%%$$$$$$$$$$$$$$$$$&&&&&&&&&&&@&&&&&&&&&&&&$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$&&@@@&$$$&@@@&$$&&&@@@@@@#@@@@@@@@##@@@@#@@@@@@@@@@@@@#@@@@@@##@##$
######@$$$$$$$$$$$$$$$$$$&&&&&&$||%%%%%%%$$$$$$$$$$$$$&&&&&&&&&@@&&&&&&&&&&&&&&$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$&@@@@@&&$&&@@@&&&&&@@@@@##@@@@@@@##@@@###@@@@@@@@@@@@@@#@@@#@#@@%
######&$$$$$$$$$$$$$$$$$&&&&&&&&$%|%%%%%%%$$$$$$$$$$&&&&&&&&&&@&&@@&&&&&&&&&&$$$$$$$$$$$$$$$$$$$$$$$&$$$$$$$$$$$$$$$$&@@@@@@&&&&&@@@&&&&@@@@@#@@@@@###@@@##@@@@@@@@@@@@@@#@@@####@#$
#####@$$$$$$$$$$$$$$$$$$$&&&&&&&&&%%%%%%%%%$$$$$$$$&&&&&&&&&&&&&&&&&&&&&&&&$$$$$$$$$$$$$$$$$$$$$$$$$$&$$$$$$$$$$$$$$$$$&&&@@@@@&&&&@@@@@@@@@@@@#@@@@###@@@$%%%%%%%%%%%%%$&@@#######$
#####@&$%$$$$$$$$$$$$$$$$$$&&&&&&&&$%%%%%%%%%%$$$$&&&&&&&&&&&&&&&&$$$$$$$$$$$$$$$$$$$$$$$$$$%$$$$$$$$$%%$$$$$$$$%%$$$$$%&@&&&&@@@@@&&@@@@@&&@@@@#@@@@###@&%%%%%%%%%%%%%%%%%&@##@##@%
####@@@@&$$$$$$$$$$$$$$$$$$&&&&&&&&&&%%%%%%%%%%$$&@&&&&$&&&$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$||$$$$$$$$%%$$$$$|%$$$$$$$%%$&@@@&&&@@@@@@@@@@@@&@@@@@@@@##@&%%%%%%%%%%%%%%%%%%%$@@@@@%
####@@@@@@&$%$$$$$$$$$$$$$$$$$&&&&&&&&$%%%%%%%$&&&&&$$$$$$&$$$$$$$$$$$$$$$$$$$$$$$%%$$$%%%%|!|||$$$$%!|%%%$$&$$$$$$$$$$%%%$&@#@@@@&&@@@@@@@@@@@@@@##@@@@#@@@&$$%%%%%%%%|%%%%%|$@@@@$
###@@@@@@@@$$$%$$$$$$$$$$$$$&&&&&&&&&&&&%%%%%&&&&&$%%%$$&&&$$$$$$$$$%%%$$|%$$$%%%$%%|%%!;!||!!||%$$$$$$$%%$&$$&&$$$$$$$$$$%%$@@#@@@@@@&&@@@@@@@@#@@###@@@########@@$%%%%%%%|%%$&@##$
##@@@@@@@@@&$$$&$$$$$$$$$$$$$$$&&&&&&&&&&&%%%$&%|%%%%%$%%$$%%%%%%$$$%%%$$||%%%$$$$$%%%%%$$$$$%!!|%&&$$$$%|$$$$$$&$$$$$$$$$$$%$$&@@@@@@@@@@@@@@@##@@@@##@@####@@#######&%%%%%%%$@###$
#@@@@@@@@@@&&$$&$$$$$$$$$$$$$$$&&&&&&$||%%%$$%!;!;!|%%%%$%!||||%%%$$$||%$%%%%%%$$$$%$$%%%%$%$$$$||$&&$$&%|%$$$$$$$&$%%$%|%$$$$%$%$@@@@@@##@@@@@@@@@@########@##@@@######&$$&@@@@@##$
@$$&@@@@@@@&&$$$$$$$$$$$$$$$$$$&&&$&&&&$$&$$%!|%%%%%%%%%%||%%%%%%%%$$||%$$$$%%%%$$$%%$$%%%%%%%$$%|%&&$$&$%%$$$$$$$&&$%%&&&&$$$$$$$||$@@@@@@@@@@@@@@@@@@@####@@@@##@@@#@@@@@@@@@@@@@%
&$%%$$&&&$$$$$$$$$$$$$$$$$$$$$$$$$$&&&&&&&&|!|%%%%|%%%%%%$%%%%||||%$$%|%$&&$%%%%$$$$%$$%%%%$$$$$%|$&&&$&$$$&$&$$$$&&&$%$&&&$$&&&&&$%!!|$&@@@@@@@@@@@@@@@@###@@@@@@@@@@@@@@@@@@@@@@@%
$$%$$$$$$$$$$$$$$$$$$$$$$$$$$$$&&&$&&&&&&$|!|||%%|%%%%%%$$%%%%||||%$$%%%$&&$%%%$$&&&$$$$$$$$$$$$$%%&&&&&$$&&$&$$&&&&&&&&&&&&&&&&&&&&$|!!!!$&@@@@@@@@@@@#####@######@##@@&@@@@@@@@@@$
$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$&&&&&&$|!|||%$%%%%%%%$$$$%%%||||%$$%%%$&&$$%%$&&&&&$$$$$$$$$$$$%%&&&&&$$&&$&$$&&&&&&&&&&&&&&&&&&&&&&%!!!!|&&&@@@@@@#########@########@@##########$
$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$&&&&&$&$%|!||%$$%%$%%%%$$$$$%%|||||$$$&$$&$$$%$&&&&&&$$$$$%$$$$$$%$&&&&&&&&&&&$$&&&&&&&&&&&&&&@@&&&&&@@$|!$@&||||%&@#@@####@########@@@@@@@#@&&@@##$
$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$&&&$$&$%|!||%$$%%%%%%%$$$%$$%%||||%$&&&&&&$$$$$$&&&&&$%$$$%%$$$$$%$&&&&&&&&$$$$$&&&&&&&&&&&&&&@@@&&@@@@@&@@&|||||||||%&@###############@@@@@@##@@@@%
%$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$&$&&$$$$%!!|%$$$%%%%%%$$$$%$$$%||||$&&$$&&$$$$$$$&&&$&$%%$%%%%%%$$%$$$&&&&&$$$$$$&&&&&&$&&&&&&&&&&&&&&&@@@@&||||||||||||$@#####@@@########@@@@@###@@$
%%%%%%%%$$$$$$$$$$$$$$$$$$$$$$$$$&&%%&%!!||%$$%%$$%%$$$$%%$$%%|!|%&&$%%&&$%%%%$$$&$|%$||$%%%%%%$$$$$$&&&&$$$$$$&&&&&&$$$&&&&&&&&&&@@&&&@@@&&%|||||||||%&@@##@$$@@@@########@@@@@@##$
;:''':;!|%%$$$$$$$$$$$$$$&&&&&&&&%%&&$!!|%%%%%%%$$$$$$$%%%$%%%|||$$&%!%&$%%%%|%%%&%!|$||%%%%%%%$$$$%%$&&$$$$$$$&&&&&&$$$$&&&&&&&&&&&&&&@@@@&&%|||||||%@@@@#@%|&#$||||%&@@@@@@@@@@@@$
.....
.`;|%%$$$$$$$$$$$&&&&&&$%%$&&$!;|%%|||%%$$&&&&$$%%$$%%%%%%%&%!;|$$%||||%%%$|;!%||$%$$$$$%%%%||$&$%%%$$$$&&&&&&$$$$&&&&&&&&&&&&&@@@@@@&&%|||||$@@@##&%|%@@%||||||||||&@@@@@@@%
........
`;|%$$$&&&&&&&&&&&$%$&&&&$|!|%%|!!|||$&$&&&$$%%%%%||||%$$|;;|%%|||||%$&&$|!|!!%%%%%%|!!|%!%$$%||%$&$&&&&&&&$$$$&&&&&&&&&&&&@@@@@@@@&&%|||$@@@##@$||$#&|||||||||||&#$|||||!
... ..
`;|%$$$$&&&&&&$%$$&&&&&&||%%$||!!||$&$$$$$$%%%%%%||||%$%!:!!!%%$$$%%%%|!;;;;;!!!!!;;;||!%&%|%%%$&&$&&&&&&&$$$$&&&&&&&&&&&@@@@@@@@@&&$||$@##@@@%||%&@$||||||||||%&@$|||||!
..
.'!|%$$&&&&&&&&&&&&&&&&||$$&%||!||%&&$$$$$$%%$%||||||%|!;:;;;|%|!!!!!|!|$$&&&&$$$%!!!!;|&&$%%%$&$$$$%||&@&$$$$&&&&&&&&&@@@@@@@@@@@@&$|%@@@@#@%|||$@&%||||||||||%@@%|||||!
...
.';|%$$&&&&&&&&&&&&&&&%%&$&&%|||||%&&$$$$$$%%$%%%||||%!;:::::::'':;!|%%%%$&@&&$%|!|%|;!$&$%|%%$$$$&$|!|$@@&$$$&@@@@@@@@@@@@@@@@@@@@&$$@@@#@&%|||%&#$|||||||||||$@&%|||||!
....
.:!|%$$&&&&&&&&&&&&&&$$&&&&$|||||%$@&$$&$$&&&$%|%%%%|;::''''''````'!!!;'`'%@&%|!::!;;!$$||%%%$&$$$$|!!|%&@@&&&&@@@@@@@@@@@@@@@@@@@@&&@@@@#@%||||$@@$|||||||||||$#&||||||!
..
.';!|%$$$&&&&&&&&&&&&$$&&&&&$$%||%%&@&$$&$$$$%|!;;;;:::'`````````````````';;:;!;'::::;%$|||!!|$$$%$%||||$@@@&&&@@@@@@@@@@@@@@@@@&&@&&&&&&@@@$%%||&#&%||||||||||%&#$||||||!
.`:!!!|$$&&&&&&&&&&&&&&&&&&&&&&&$%$$$&@&&$&&$$|!|%$$$$%|;''``````````````':;!!!;::''':;!$%|$$%%$$$$$$%!!%&@@@@@@@@@@@@@@@@@@@@@@@@&&&&@&$$&@@@@@@@@@#&%||||||||||%@@$||||||!
;:''`'':;!!!!|%$$&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&$&&&&&$|!%%%%$&$$|;'``````````````''''''''::::;|$&$$$%%$$%%$$$&@@@@@@@@@@@@@@@@@@@@@@@@@@@&&&@&$$$&&&@@@@@@@@@@@@@@&$%|||$@@$||||||!
|!;;;!!!!!!|%$$$&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&%!:;|!||!!:'''``````````````''''''''':;;|$$$$$%%$%$$$&&&&&@@@@@@@@@@@@@@@@@@@@@@@@&&&@&$$$&&&&&@@@@@##@@@@@&&@@@@@@#@&%|||||!
%|!!!!!!||%$$$&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&@@&&&&&&$$$!';;;:'```''`````````````````'''''';;:|$$$$$$$$%$$$&@&&&&@@@#@@@@@@@@@@@@@@@@@@@&&@&$$$$$$$&&&@@@@##@%;''|&@@@@@@@#@@@@@@@%
&$%%%%%%$$$$&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&@&&&@&&&$$$%;``'''``':'``````````````````'''':::;|$$$$$$$%$$$$&&&&&&@@@##@@@@@@@@@@@@@@@@@@&@&$$$&&&$$$&&&@@@@|:''':%@@@@@@@#@@@@@@@@%
@@&$$$$$&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&@&&@@&&&$$$$%:``````';:'```...`````````````'''':;|$$$$$$%%$$$$&&&&&&&@@##@@#######@@#@@@@@@#@&$$&&&&&$%$$&&@@%:'::'!&@@@@&@@@@@@@@@@@%
##@&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&@@&&&&&&&$$%:``````':;:```..``````````````''':;|$$$$$$%%$$$&&&&&&&@@@####################@&$$&&$$$$$$$|;|&$!''':;$&&&&&&@@@@@@@@@@@%
##@&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&$&@&$&&&$&&&&&%'``````.``````....```````````'`'';|$&$$$%$$$$$$&&&&&@@@@@##################@$$$&&$$$$$|:':;%&$;''''|&&&&&&&&@@@@@@@@@@%
##@&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&$%$&@@$$$$$&&&&&@@!````````.......````````````''`'':!%$&&&$$&&&&&&&&&&@@@#@@##############@@&$$$$&$$$$$$|:''|&&|''''!$&&&&&&@@@@@@@@@@@@%
##@&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&|;%&$&@$$$$$$&&&&&@@&;..``..........````````````''``'';%$&&&&&&&&&&&&&&@@@@@##@############@@@$$$$&$!|$$$$!:':%@%:``':%&&@@@@@@@@@@@@@@@@@%
##@&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&$!!$&&$&&$|!|%$$$&&&@@@@$:.........``'''``':;:'`````````':!%$&&&&&&&@&&&&&@@@@@@@#@@#########@@@&$$$%!!$$$$$%;'';$&!``':%@@@@@@@@@@@@@@@@@@@&%
##@&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&|;%&&&&$%%$%!|%%$$$$&&@@@@@$;`.....`...````````````````````';|$&&&&&&&&@@@&&&@###@@@@#@&&##@@@@@&$$$$&&$$$$$$|'```!&%;|&&&&&@@@@@@@@@@@@@@@&&&&%
###&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&%:|&&&&&$$||$&$|%%%$$&&&@@@@@@@@$;`........``'::'`...```'``````:|$$$&@@&$&@@@@@@&@#@@####@#&&#@$|%&$$%%&&$$$$%!'`.`:!$@@&&&&@@@@@@@@@@@@@@&&&&&&&&%
###@&&&&&&&&&&&&&&&&&&&&&&&&&&|:!&&&&&&$$%||$&&$%%%$$&&&&@@@@@@@@@@&%:`.................`'````:!;;|$$$&&@@&&&&@@@@&&@########@!':|&$$%%$|;:;;!|%%%%||$@@&&&&&&&@&&&&&&&&&&&&&&&&&&&%
###@&&&&&&&&&&&&&&&&&&&&&&$!:|&&&&&&&&$$%|%$&&&$%%%$&&&&&@@@@@@@@@@@@&&$;`..............``'';|!;;;;|%$$$$&@@@&&&@@&&$$&&@@@@##@&%||%%%$!:|%%%%%||%!|$@@@&&&&&&&&$$$$$$&&&&&&&&&&&&&%
###@&&&&&&&&&&&&&&&&&&&|:!$&&&&&&&&&&$%%%%$$&&&$%%$$$$&&@#@@@@@@@@@@@&&&&&&|'...........``:!!;;;;;!!;|$&$%|&@@@&&&&&$!|$$$&@@#@@&%%%%$|'':!%%%%|!|$&&@@&&&&&&&$%%%%$$$$$&&$$$$$$&&&%
###@&&&&&&&&&&&&&&&|:;%&&&&&&&&&&&&$$%%%%$$&&&&$$$$$$$$&@#@@@@@@@@@&&&&&&&&&&&&|'.....`;%%!!!!;;;!!!!;!%$$&$|%@@@@@&&@$;:::!|%$&$%%%$%:'``';!!|||%$&@@@&&&&&&$%%%%%%%$$$$$%%%%$$$$$|
###@&&&&&&&&&$|:;%&&&&&&&&&&&&&&&$$%%$%%$&&&&&&$$$$%$$$&@@@@@@@@@##@&&&&&&&&&&&&&&%|%&&&&&$|;;;;;;;;;;;;!$&$&$|!%&@@@@@@&%;::!$$$$$$%;:```````;||||%$&&$$$$$$%|%%%%%%%$$$%%%%%%%%$%|
###@&&$%|||$&&&&&&&&&&&&&&&&&&$$$$%%$$%$&&&&&&&$$$%%$$&&@@@@@@@@@@@##@&&&&&&&&&&&&&&&&&&&&@%;;;;;;;::;;;;!!$&&$$%!;|$$$&&&$&&&$$$$$%!|$&%:...`.`;|!|||!;!|||||||%%%%%%$%%%||||%%%%%|
&&@@&&&&&&&&&&&&&&&&&&&&&&&$$$$$$%%$$%$&&&&&&&&$%%%%$$&&@@@@@@@@@@@@#@&@@&&&&&&&&&&&&&@###&%;;;;;;::::;;;!!!!|$$$&&%!:;!$&&&@&$$$&@&&&$%$&|``..'%#@@&$%%||||!;:'`';|%%$%%|||||||||||
###@&&&&&&&&&&&&&&&&&&&&$$$$$$$$%%$&&$$&&&&&&&&$%%%%$$&&&@@@@@@@@@@@@@@&&&&@@@@@&&@####$;':!!;;;::::;;;;!;!;::::;%&&&&&$$$&@&$$$@@$$$$$&@@@@$%@#@@##@@&%%||||||||%%%|!'`:!||||||||||
###@&&&&&&&&&&&&&&&&&$$$$$$$$$$$$$$$%%$$$$&&&&@$%%%%$$&&&&&@@@@@@@@@&&&&@@&&&&&&&@@@@|:':;;!!;;:::::::;;!!;:::::::::':::';$$$$$&&$&&&@@@&&@@@@@#######@@##@&%||||||||%%%%|!''!|||||!
###@&&&&&&&&&&&&&&$$$$$$$$$$$&&$$$$$%%$$$$$&&&&&$%%$$$&&&&&$&&&@@@@&&&&&&&&&&&&@@@%:''':;;;;;:::::::::;;;:::::::::::::;;!%$$$$$|:::|$&&$&@@@@@&$&@#####@@@@####@&$%||%%%||||||;:!||!
###@&&&&&&&&&&&$$$$$$$$$$$&&&&&$$&&$%%$$$&&&&&&&&$%$$$$$&&&&&&&@@@#@&&&&&&&&@##$;''''':;;;;;:::::::::;!;:::::::::::::::;%&$$$$|''':;%&%!;:'''':|%$&@@@@#@@&&&@##@&&@@$|%%|||||||!:;|
:;$@@&&&&&&&$$$$$$$$$$$&&&&&&&&&$$&&$$&&&&&&&&&&&$%%$$$&&&&&&&&&&&&@@#######@|:'''''';!!!;::::::;;!!!!;::::::::::::::::|$$$$$!'::;!!%&|;;''''''''''';$&@@#@&&$$&@&&@#@@@#####@$%||;:
''''':|$&$$$$$$$$$$&&&&&&&&&&&&&&$$&$$&&&&&&&&&&&&&$$$$$&&$$&&&&&@@@@@&$%$%|:''''''':;:::::::::::::;;:::::::::::::::::|$$$$$!::;;;;|&%;;:''''''''''''':!$&@@@&$$$$&################$
'''''''''';%$$&&&&&&&&&&&&&&&&&&&&$$$$&&&&&&&&&&&&&&$$$$$&@@@@@###@&&$%;''''''''':::;;:::::::::::;;:::'':::::::::::':|$$$$$!::;:::|&%;;:''''''''''''''```:%&@@&&&$$$&##############$
'''''''''''':':|&&&&&&&&&&&&&&&&&&&&$%$&&&&&&&&&&&&&&$$$$$&@@&@@@&$$%%!:''''''::::::!;::::::::::;;::::::::::::::''':|$$$$$|;;:::;%&|::'''''''''''''`.....``;$@@&&&&$$$&@###########$
;:'''''''''''''':::!$&&&&&&&&&&&&&&&&&%|$&&&&&&&&&&&&&&$$$$&$$$$$$|:!|;':::::::::::;!;::::::::;;:::::::::::::''''':|$$$$$|;::::|&&|::'''''''''''``........`''!&@@&&&&$$$&@#########$
.';;;;;:'''''''''''':::;%&@&&&&&&&&&&&&%$&&$$$$&&&&&&$&@&&&$$$$%!:::!|;::::::::::::!!;::::::!;::::::::::::::''''':|&$$$$|;::::|&%;;:'``''''''''````......````'!$@@&&&&&$$$&@#######$
;;;:`.`:;;;;::'''''''''''':;%@@@&&&&&&&&$$$&&&&&&&&&&@@&!::':'':::::||;::::::::::::!!;:::;!!;;:::::::::::::::''':%&$$$$|;:::;%&|:::'`````````'''```..`...````''!$@@&&&&&&&$$&@#####$
;;;;;;;;;'..';;;;::''''''''''':|@@@@&&&&&&$%$&&&&&&&@@%:::::::::::::!|;:::::''''''';!;:;!!;:::::::::::::::::''':%&$$$%|;:::|&%;;:'''```````'''''``...
```''!&@&&&&&&&&&&&&@###$
:::;;;;;;;;!;;;'':;;;;:'''''''''':!&@@@&&&&&$$&&&&@@@$;::::::::::::';|:``````````'';!;;;:'''```````````````''''|$$$$%|;::|&$!;;:'````````''::''``....
.``'':%@&&&&&&&&&&&&&&@#$
::::::::;;;;;;;;;;;;:'':;;:''''''''':;%@@@@&&&&$&@@@$;''''''':''`''`:|;````````````:!!:'''``.........``......`!$%%%%|;;|&$!:;'`````````'''::''.
.. `''``''!$&&@@&&&&&&&&&&&&%
###@%!:::::::;;;;;;;;;;;;;;;;::'''''::::|&@@@&&&&&&%'```.....````''`'||'``````````';;'''``.................
.!$%%%%|!%&$!:;:'``'''````'::::''. ....``''``'''|@&&&@&&&@&&&&&&$|
####@&&&@&|;::::::;;;;;;;;;;;;;;;:'''''''::!&@@@@@%:````......```'```;%;`````````''''``.................
.!$%%%%%$&%;:::''```'''```'::::'`. ...``'```''';$@&&&@@&&&&&&&&&%
####@&&&&&&&&&$!:::::::;;;;;;;;;;;;;:''''''':|@@@$;````.......``''```'!%;``````''''``.......
.... .;%%%%%%$%;::'''`````''''`'::::`. ...`````'''|@&&&&@@&&&&&&&&%
####@&&&&&&&&&&&&&&|;::::::;;;;;;;;;;;;:::'':;;%&;````.........``'````:||:```':''`......
.`:|%%%%%|;::''''``````'''''::::`. ....```'''!$@&&&&@@&&&&&&&%
####@&&&&&&&&&&&&&&&&&&|::::::::;;;;;;;;;:::::;;'````..........``'`````:||:':''`......
.`'!$%%%%|;:''```````````'''''::;'. ......``':%@@&&&&&@&&&&&&%
####@&&&&&&&&&&&&&&&&&&&&&$!:::::::;;;;;;;;;;;;'`````..........`''``````:||:''`.
. .``!$&$%%%%%;'''`````````````'':::;;` .....```'!&@&&&&&&@&&&&&%
####@&&&&&&&&&&&&&&&&&&&&&&&&&|;:::::;;;;;;;;;:``````...........''````':':|%!'.
.``'|$&|;|%|%%%!''````...`````````':::;;` .....```'|@&&&&&&&@&&&&%
####@&&&&&&&&&&&&&&&&&&&&&&&&&&&$!::::::;;;;;:``````....``......''``':'''':!|%;..
..``:|%$|;::;|%||%%!'`````......```''`'':::;:' ....... ....````:%@&&&&&&@@&&&%
####@&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&%;:::::;;:```````....`. ...`'':''`.
.':!||;````````';|%%|;::::';|%||%%;'```.........```'''''::::;'. ....````........
......````:%@&&&&&&@@&&%
####@&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&|:::::'```````...``. ..'::'``.
.```':;!||!;;!||!;::::''``';|%||%|;'```..........```'''''::::;:.....``````````...........`````;&&&&&&&@@@&%
*/
int n;
long double x[100005], y[100005];
char fx[100005];
const long double eps = 1e-16;
long double calcdist(long double t) {
long double mx = -1e18, mn = 1e18;
for (int i = 0; i < n; i++) {
mx = max(mx, y[i] + (fx[i] == 'U' ? t : (fx[i] == 'D' ? -t : 0)));
mn = min(mn, y[i] + (fx[i] == 'U' ? t : (fx[i] == 'D' ? -t : 0)));
}
long double sum = mx - mn;
mx = -1e18, mn = 1e18;
for (int i = 0; i < n; i++) {
mx = max(mx, x[i] + (fx[i] == 'R' ? t : (fx[i] == 'L' ? -t : 0)));
mn = min(mn, x[i] + (fx[i] == 'R' ? t : (fx[i] == 'L' ? -t : 0)));
}
return sum * (mx - mn);
}
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%Lf%Lf %c", x + i, y + i, fx + i);
}
// x
long double l = 0, r = 1e18, ff = 355;
while (ff--) {
long double m = (r + l * 2) / 3;
long double m2 = (r * 2 + l) / 3;
if (calcdist(m) < calcdist(m2)) {
r = m2;
} else {
l = m;
}
}
printf("%.14Lf\n", calcdist(l));
return 0;
}
| [
"assignment.variable.change",
"identifier.change"
] | 819,977 | 819,978 | u545001286 | cpp |
p03004 | #include <bits/stdc++.h>
using namespace std;
/*
Coded by ÇØϧÃÎ
The most attractive girl in the world
@@@@@@@@@@##&|;!!!!!!!!!!||||||||%%%%%$$$$$$$$$$$$%%$$$&&&&&&&&&$$&&&&&&&&&@@@&%||||||$&&&&@&%;'```'`':!||%&@@@@#@&&&&&@@@&&$$$&&@@&$$$&@@@@@@@@@@@@@#@@@@@@@@@@#@@@@@#@@@@@@@@@@##$
@@@@@@@@@####$!;!!!!!!!!!||||||||%%%%%%%%%%%%%%%$$$$&&&&&&&&&&&&&&&&&&&&@@@@@@&%|||||!:'`'!$&&&&&&%:''!|||$&&&@@@@@@&&&&&@@@&$$$&&@&&$&&@@@@@@@@@@@@@@@@@@@@@@@@##@@@@#@@@@@@@@@@#@%
@@@@@@@@@####@|;!!!!!!!!!|||||||%%%%%%%%%%%%%$$$$$$$$$$&&&&&&&&&&&&&&&@@@@@@@@&%|;:'''''``````'!$&&&@@&|:;%$$&&&@@@@@&&&&&@@@&$$$&&@@@@@@@@@@@@@@@@@@@@@@@#@@@@@#@@@@@#@@@@#@@@@##@%
@@@@@@@@####@@&|;!!!!!!!!|||||||%%%%%%%%%%%%%%$$$$$$$$&&&&&&&&&&&$$$&&@@@@@@@@@@&$|;'''''````````'':!$&&&$%%%%$$&@@@@@&&&&&@@@@&&&@@#@@@@@@@@@@@@@@@@@@@@@@@@@@@#@@@@@@@@@@#@@@@#@@%
@@@@@@@#####@@@$!;!!!!!!|||||||%%%$$$$$%%%%%%%%%$$$$$$$&&&&&&&&&$$$$&&@@@@@@@@$%$&@@&&&@&$%;:':;:''`````'|%%%%%%$$&@@@@@&&&&@@#@@@@@@#@@@@@@@@@@@@@@@@#@@@@@@@@@#@@@@@@@@@@@@@@#@@@%
@@@@@@#####@$%%%$$$%%%||%%||||%%%%$%%$$$$$%%%%%%%$$$$&&&&&&&&&$$$$$$&&@@@@@@@&$;'''''':!%&&&&&&@@&%;'```:$&&%%%%%$$$&@@@@&&&&@@@@@@@@@#@@@@@##@@@@@@@@#@@@@@@@@@@@@@@#@@@@@@@@@#@@@%
$&@@@@######&&&&&$%%%%|%|||||||%%%%%$$$$$$$$$$$$$&&&&&&&&&&&&&&&&$$$$&&@@@@@@&$!''''''````````:!|$&&&&&&&$&&&$%%%%$$$&&@@@&&&&&@@@@&@@@@@@@@@#@@@@@@@@#@@@@@&&&@@@@@@@@@@@@@@@#@@@@$
$$$&@######@&&&&&&|!!!!!|||||||%%$$$$$$$$$$$$$$$&&&&&$$&&&&&&&&&&&&$$&&&@@@@@@&%;::''````````'':'``....`;|%$&&&$%%$$$$$&@@@&&&&&@@@@@@@@#@@@@@#@@@@@@@@@@@@@@&&@&&&&&&&&&@@@@@@@@@@$
$$$&@#####@&$$&&@#&|!!!!!|||||||%%%$$$$%%%%%$$$$$$$&&&&&&&&&&&&@@@@@&&&&&&@@@@@@@@@@@&&&&&&&&@@@@&&$$%||||%%%$$&&&$$$$$$$&@@@&&&&&@@@@@@@#@@@@@@@@@@@@@@@@@@@@&&@&&&&&&&&@@@@@@@@@#$
$$&@######@&$&@##@&$|!!!!|||||||%%%%%%%%%%%%%$$$$&&&&&&&&&&&&&&&&&&&&$$&&&&&&@@&|'`````````':::;;;;;;!|%%%%%%%%$&@@&$$$$$$$&@@&&&&&@@@@@@@@@@@@@@@@@@@@#@@@@@@@@@&&&&&&&&&@@@@@@@#@%
$&@######@&&&@##@$$$$|!!!||||||||%%%%%%%%%%%%$$$$&&&&&&&&&&&&&&&&&&&&$&&&&&&&&@@$!:::'':::::::::::::''``.:%%$$$$$$&@@@&$$$$$&@@@&&&&@@@@@@@@@@@@#@@@@@@@@@@#@@@@#@@@@@@&&&@@@@@@@@@%
$&@######@&&@#@&$$$$&$|!!!||||||||%%%%%%%%%$$$$$&&&&&&&&&&&&&&&&&&&$$$&&&&&&&&&&&%;::::::::::::':''':'':::%&$$$$$$$$&&@@&$$$$$&@@@&&&&@@@@@@@@@@@@@@@@@@#@@@@@@@@@@@@@@@@@@@@@@@@@@%
&@#######@@@#@&$$$$$&&$|!!|||||||||%%%%%%$$$$$$$$$&&&&&&&&&&&&&&&$$$$$&&&&&&&&&&&$!''::::'''::;!|%%$&&@@@@&&@@$$%%$$$$&&@&&$$$$&@@@&&&&@@@@@@#@@@@@@@@@@@@@@@@@#@@@@@@@@@@@@@@@@@@@%
############&$$$$$$$&&&$|!!||||||||%%%%%%$$$$$$$$$$$$$$&&&&&$$$$$$$$$$&&&&&&&&&&&&@@@&&&&&&&@@@@@@&&&$$%|!;%@@@@&$$$$$$$$&@@&$$$$&@@@&&&@@@@@@@@@#@@@@@@#@@#@@@@@@@@@@@@@@@@@@@@@@@$
########@&$$$$$$$$$&&&&&$|!!||||||%%%%%%$$$$$$$$$$$$$$$$$$$$$$$$$$$$$&&@@&&&&&&&&&&&&&&$$$$$$$$$$&&&$$%!;:::|$&@@@@&$$$$$$$&@@&$$$&@@@&&&@@@@@@@@##@@@@@@@@@@@@#@@@@@@@@@@@@@@@@@@@$
########@$%%%$$$$$$&&&&&&&%!||||%%%$$$%%%%%%%%%%%%%%%%%%%%%%%$$$$$&&&&&&&&&&@@@&&&&&&&&&&&&$$$$$$$$$$$$$&&%!!$$$$&@@@@&$$$$$$&@@@&&&&@@@&&@@@@@@@##@@@@@#@@@@@@@@@@@@@@@@@@@@@@@@@@%
#######@&$$$$$$$$$$$$&$|!||%%%%||%%%%%%%%%%%%%%%%%$$$$$$&$$$$$&&&&&&&&@@@@&&&&&&&&&&&&&&&&&&&$$&&$$$$$$$$$&&&$&@&$$$&@@@&$$$$$$&@@@@&&@@@@&@@@@@@###@@@@@@@@@@@@@@@@@@@@@@@@#@@@@#@%
#######@$$$$$$%$$$$$$$&&$||||%%%%%%$$$$$$$$$$$$$$$$$$$$$$$&&&&&&&&&&@@&&&&&&&&&&&&$$$$$$&&&&$$$$$$$$$$$$$$$$$$&@@@@&$$$&@@@&$$$$&&&@@@&@@@@&&@@@@@###@@@@#@@@@@#@@@@@@@@@@@#@@@@#@@$
#######&$$$$$$$$$$&$$$$$&&&&&$%||%%%%%%$$$$$$$$$$$$$$$$$&&&&&&&&&&&@&&&&&&&&&&&&$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$&&@@@&$$$&@@@&$$&&&@@@@@@#@@@@@@@@##@@@@#@@@@@@@@@@@@@#@@@@@@##@##$
######@$$$$$$$$$$$$$$$$$$&&&&&&$||%%%%%%%$$$$$$$$$$$$$&&&&&&&&&@@&&&&&&&&&&&&&&$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$&@@@@@&&$&&@@@&&&&&@@@@@##@@@@@@@##@@@###@@@@@@@@@@@@@@#@@@#@#@@%
######&$$$$$$$$$$$$$$$$$&&&&&&&&$%|%%%%%%%$$$$$$$$$$&&&&&&&&&&@&&@@&&&&&&&&&&$$$$$$$$$$$$$$$$$$$$$$$&$$$$$$$$$$$$$$$$&@@@@@@&&&&&@@@&&&&@@@@@#@@@@@###@@@##@@@@@@@@@@@@@@#@@@####@#$
#####@$$$$$$$$$$$$$$$$$$$&&&&&&&&&%%%%%%%%%$$$$$$$$&&&&&&&&&&&&&&&&&&&&&&&&$$$$$$$$$$$$$$$$$$$$$$$$$$&$$$$$$$$$$$$$$$$$&&&@@@@@&&&&@@@@@@@@@@@@#@@@@###@@@$%%%%%%%%%%%%%$&@@#######$
#####@&$%$$$$$$$$$$$$$$$$$$&&&&&&&&$%%%%%%%%%%$$$$&&&&&&&&&&&&&&&&$$$$$$$$$$$$$$$$$$$$$$$$$$%$$$$$$$$$%%$$$$$$$$%%$$$$$%&@&&&&@@@@@&&@@@@@&&@@@@#@@@@###@&%%%%%%%%%%%%%%%%%&@##@##@%
####@@@@&$$$$$$$$$$$$$$$$$$&&&&&&&&&&%%%%%%%%%%$$&@&&&&$&&&$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$||$$$$$$$$%%$$$$$|%$$$$$$$%%$&@@@&&&@@@@@@@@@@@@&@@@@@@@@##@&%%%%%%%%%%%%%%%%%%%$@@@@@%
####@@@@@@&$%$$$$$$$$$$$$$$$$$&&&&&&&&$%%%%%%%$&&&&&$$$$$$&$$$$$$$$$$$$$$$$$$$$$$$%%$$$%%%%|!|||$$$$%!|%%%$$&$$$$$$$$$$%%%$&@#@@@@&&@@@@@@@@@@@@@@##@@@@#@@@&$$%%%%%%%%|%%%%%|$@@@@$
###@@@@@@@@$$$%$$$$$$$$$$$$$&&&&&&&&&&&&%%%%%&&&&&$%%%$$&&&$$$$$$$$$%%%$$|%$$$%%%$%%|%%!;!||!!||%$$$$$$$%%$&$$&&$$$$$$$$$$%%$@@#@@@@@@&&@@@@@@@@#@@###@@@########@@$%%%%%%%|%%$&@##$
##@@@@@@@@@&$$$&$$$$$$$$$$$$$$$&&&&&&&&&&&%%%$&%|%%%%%$%%$$%%%%%%$$$%%%$$||%%%$$$$$%%%%%$$$$$%!!|%&&$$$$%|$$$$$$&$$$$$$$$$$$%$$&@@@@@@@@@@@@@@@##@@@@##@@####@@#######&%%%%%%%$@###$
#@@@@@@@@@@&&$$&$$$$$$$$$$$$$$$&&&&&&$||%%%$$%!;!;!|%%%%$%!||||%%%$$$||%$%%%%%%$$$$%$$%%%%$%$$$$||$&&$$&%|%$$$$$$$&$%%$%|%$$$$%$%$@@@@@@##@@@@@@@@@@########@##@@@######&$$&@@@@@##$
@$$&@@@@@@@&&$$$$$$$$$$$$$$$$$$&&&$&&&&$$&$$%!|%%%%%%%%%%||%%%%%%%%$$||%$$$$%%%%$$$%%$$%%%%%%%$$%|%&&$$&$%%$$$$$$$&&$%%&&&&$$$$$$$||$@@@@@@@@@@@@@@@@@@@####@@@@##@@@#@@@@@@@@@@@@@%
&$%%$$&&&$$$$$$$$$$$$$$$$$$$$$$$$$$&&&&&&&&|!|%%%%|%%%%%%$%%%%||||%$$%|%$&&$%%%%$$$$%$$%%%%$$$$$%|$&&&$&$$$&$&$$$$&&&$%$&&&$$&&&&&$%!!|$&@@@@@@@@@@@@@@@@###@@@@@@@@@@@@@@@@@@@@@@@%
$$%$$$$$$$$$$$$$$$$$$$$$$$$$$$$&&&$&&&&&&$|!|||%%|%%%%%%$$%%%%||||%$$%%%$&&$%%%$$&&&$$$$$$$$$$$$$%%&&&&&$$&&$&$$&&&&&&&&&&&&&&&&&&&&$|!!!!$&@@@@@@@@@@@#####@######@##@@&@@@@@@@@@@$
$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$&&&&&&$|!|||%$%%%%%%%$$$$%%%||||%$$%%%$&&$$%%$&&&&&$$$$$$$$$$$$%%&&&&&$$&&$&$$&&&&&&&&&&&&&&&&&&&&&&%!!!!|&&&@@@@@@#########@########@@##########$
$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$&&&&&$&$%|!||%$$%%$%%%%$$$$$%%|||||$$$&$$&$$$%$&&&&&&$$$$$%$$$$$$%$&&&&&&&&&&&$$&&&&&&&&&&&&&&@@&&&&&@@$|!$@&||||%&@#@@####@########@@@@@@@#@&&@@##$
$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$&&&$$&$%|!||%$$%%%%%%%$$$%$$%%||||%$&&&&&&$$$$$$&&&&&$%$$$%%$$$$$%$&&&&&&&&$$$$$&&&&&&&&&&&&&&@@@&&@@@@@&@@&|||||||||%&@###############@@@@@@##@@@@%
%$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$&$&&$$$$%!!|%$$$%%%%%%$$$$%$$$%||||$&&$$&&$$$$$$$&&&$&$%%$%%%%%%$$%$$$&&&&&$$$$$$&&&&&&$&&&&&&&&&&&&&&&@@@@&||||||||||||$@#####@@@########@@@@@###@@$
%%%%%%%%$$$$$$$$$$$$$$$$$$$$$$$$$&&%%&%!!||%$$%%$$%%$$$$%%$$%%|!|%&&$%%&&$%%%%$$$&$|%$||$%%%%%%$$$$$$&&&&$$$$$$&&&&&&$$$&&&&&&&&&&@@&&&@@@&&%|||||||||%&@@##@$$@@@@########@@@@@@##$
;:''':;!|%%$$$$$$$$$$$$$$&&&&&&&&%%&&$!!|%%%%%%%$$$$$$$%%%$%%%|||$$&%!%&$%%%%|%%%&%!|$||%%%%%%%$$$$%%$&&$$$$$$$&&&&&&$$$$&&&&&&&&&&&&&&@@@@&&%|||||||%@@@@#@%|&#$||||%&@@@@@@@@@@@@$
.....
.`;|%%$$$$$$$$$$$&&&&&&$%%$&&$!;|%%|||%%$$&&&&$$%%$$%%%%%%%&%!;|$$%||||%%%$|;!%||$%$$$$$%%%%||$&$%%%$$$$&&&&&&$$$$&&&&&&&&&&&&&@@@@@@&&%|||||$@@@##&%|%@@%||||||||||&@@@@@@@%
........
`;|%$$$&&&&&&&&&&&$%$&&&&$|!|%%|!!|||$&$&&&$$%%%%%||||%$$|;;|%%|||||%$&&$|!|!!%%%%%%|!!|%!%$$%||%$&$&&&&&&&$$$$&&&&&&&&&&&&@@@@@@@@&&%|||$@@@##@$||$#&|||||||||||&#$|||||!
... ..
`;|%$$$$&&&&&&$%$$&&&&&&||%%$||!!||$&$$$$$$%%%%%%||||%$%!:!!!%%$$$%%%%|!;;;;;!!!!!;;;||!%&%|%%%$&&$&&&&&&&$$$$&&&&&&&&&&&@@@@@@@@@&&$||$@##@@@%||%&@$||||||||||%&@$|||||!
..
.'!|%$$&&&&&&&&&&&&&&&&||$$&%||!||%&&$$$$$$%%$%||||||%|!;:;;;|%|!!!!!|!|$$&&&&$$$%!!!!;|&&$%%%$&$$$$%||&@&$$$$&&&&&&&&&@@@@@@@@@@@@&$|%@@@@#@%|||$@&%||||||||||%@@%|||||!
...
.';|%$$&&&&&&&&&&&&&&&%%&$&&%|||||%&&$$$$$$%%$%%%||||%!;:::::::'':;!|%%%%$&@&&$%|!|%|;!$&$%|%%$$$$&$|!|$@@&$$$&@@@@@@@@@@@@@@@@@@@@&$$@@@#@&%|||%&#$|||||||||||$@&%|||||!
....
.:!|%$$&&&&&&&&&&&&&&$$&&&&$|||||%$@&$$&$$&&&$%|%%%%|;::''''''````'!!!;'`'%@&%|!::!;;!$$||%%%$&$$$$|!!|%&@@&&&&@@@@@@@@@@@@@@@@@@@@&&@@@@#@%||||$@@$|||||||||||$#&||||||!
..
.';!|%$$$&&&&&&&&&&&&$$&&&&&$$%||%%&@&$$&$$$$%|!;;;;:::'`````````````````';;:;!;'::::;%$|||!!|$$$%$%||||$@@@&&&@@@@@@@@@@@@@@@@@&&@&&&&&&@@@$%%||&#&%||||||||||%&#$||||||!
.`:!!!|$$&&&&&&&&&&&&&&&&&&&&&&&$%$$$&@&&$&&$$|!|%$$$$%|;''``````````````':;!!!;::''':;!$%|$$%%$$$$$$%!!%&@@@@@@@@@@@@@@@@@@@@@@@@&&&&@&$$&@@@@@@@@@#&%||||||||||%@@$||||||!
;:''`'':;!!!!|%$$&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&$&&&&&$|!%%%%$&$$|;'``````````````''''''''::::;|$&$$$%%$$%%$$$&@@@@@@@@@@@@@@@@@@@@@@@@@@@&&&@&$$$&&&@@@@@@@@@@@@@@&$%|||$@@$||||||!
|!;;;!!!!!!|%$$$&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&%!:;|!||!!:'''``````````````''''''''':;;|$$$$$%%$%$$$&&&&&@@@@@@@@@@@@@@@@@@@@@@@@&&&@&$$$&&&&&@@@@@##@@@@@&&@@@@@@#@&%|||||!
%|!!!!!!||%$$$&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&@@&&&&&&$$$!';;;:'```''`````````````````'''''';;:|$$$$$$$$%$$$&@&&&&@@@#@@@@@@@@@@@@@@@@@@@&&@&$$$$$$$&&&@@@@##@%;''|&@@@@@@@#@@@@@@@%
&$%%%%%%$$$$&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&@&&&@&&&$$$%;``'''``':'``````````````````'''':::;|$$$$$$$%$$$$&&&&&&@@@##@@@@@@@@@@@@@@@@@@&@&$$$&&&$$$&&&@@@@|:''':%@@@@@@@#@@@@@@@@%
@@&$$$$$&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&@&&@@&&&$$$$%:``````';:'```...`````````````'''':;|$$$$$$%%$$$$&&&&&&&@@##@@#######@@#@@@@@@#@&$$&&&&&$%$$&&@@%:'::'!&@@@@&@@@@@@@@@@@%
##@&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&@@&&&&&&&$$%:``````':;:```..``````````````''':;|$$$$$$%%$$$&&&&&&&@@@####################@&$$&&$$$$$$$|;|&$!''':;$&&&&&&@@@@@@@@@@@%
##@&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&$&@&$&&&$&&&&&%'``````.``````....```````````'`'';|$&$$$%$$$$$$&&&&&@@@@@##################@$$$&&$$$$$|:':;%&$;''''|&&&&&&&&@@@@@@@@@@%
##@&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&$%$&@@$$$$$&&&&&@@!````````.......````````````''`'':!%$&&&$$&&&&&&&&&&@@@#@@##############@@&$$$$&$$$$$$|:''|&&|''''!$&&&&&&@@@@@@@@@@@@%
##@&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&|;%&$&@$$$$$$&&&&&@@&;..``..........````````````''``'';%$&&&&&&&&&&&&&&@@@@@##@############@@@$$$$&$!|$$$$!:':%@%:``':%&&@@@@@@@@@@@@@@@@@%
##@&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&$!!$&&$&&$|!|%$$$&&&@@@@$:.........``'''``':;:'`````````':!%$&&&&&&&@&&&&&@@@@@@@#@@#########@@@&$$$%!!$$$$$%;'';$&!``':%@@@@@@@@@@@@@@@@@@@&%
##@&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&|;%&&&&$%%$%!|%%$$$$&&@@@@@$;`.....`...````````````````````';|$&&&&&&&&@@@&&&@###@@@@#@&&##@@@@@&$$$$&&$$$$$$|'```!&%;|&&&&&@@@@@@@@@@@@@@@&&&&%
###&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&%:|&&&&&$$||$&$|%%%$$&&&@@@@@@@@$;`........``'::'`...```'``````:|$$$&@@&$&@@@@@@&@#@@####@#&&#@$|%&$$%%&&$$$$%!'`.`:!$@@&&&&@@@@@@@@@@@@@@&&&&&&&&%
###@&&&&&&&&&&&&&&&&&&&&&&&&&&|:!&&&&&&$$%||$&&$%%%$$&&&&@@@@@@@@@@&%:`.................`'````:!;;|$$$&&@@&&&&@@@@&&@########@!':|&$$%%$|;:;;!|%%%%||$@@&&&&&&&@&&&&&&&&&&&&&&&&&&&%
###@&&&&&&&&&&&&&&&&&&&&&&$!:|&&&&&&&&$$%|%$&&&$%%%$&&&&&@@@@@@@@@@@@&&$;`..............``'';|!;;;;|%$$$$&@@@&&&@@&&$$&&@@@@##@&%||%%%$!:|%%%%%||%!|$@@@&&&&&&&&$$$$$$&&&&&&&&&&&&&%
###@&&&&&&&&&&&&&&&&&&&|:!$&&&&&&&&&&$%%%%$$&&&$%%$$$$&&@#@@@@@@@@@@@&&&&&&|'...........``:!!;;;;;!!;|$&$%|&@@@&&&&&$!|$$$&@@#@@&%%%%$|'':!%%%%|!|$&&@@&&&&&&&$%%%%$$$$$&&$$$$$$&&&%
###@&&&&&&&&&&&&&&&|:;%&&&&&&&&&&&&$$%%%%$$&&&&$$$$$$$$&@#@@@@@@@@@&&&&&&&&&&&&|'.....`;%%!!!!;;;!!!!;!%$$&$|%@@@@@&&@$;:::!|%$&$%%%$%:'``';!!|||%$&@@@&&&&&&$%%%%%%%$$$$$%%%%$$$$$|
###@&&&&&&&&&$|:;%&&&&&&&&&&&&&&&$$%%$%%$&&&&&&$$$$%$$$&@@@@@@@@@##@&&&&&&&&&&&&&&%|%&&&&&$|;;;;;;;;;;;;!$&$&$|!%&@@@@@@&%;::!$$$$$$%;:```````;||||%$&&$$$$$$%|%%%%%%%$$$%%%%%%%%$%|
###@&&$%|||$&&&&&&&&&&&&&&&&&&$$$$%%$$%$&&&&&&&$$$%%$$&&@@@@@@@@@@@##@&&&&&&&&&&&&&&&&&&&&@%;;;;;;;::;;;;!!$&&$$%!;|$$$&&&$&&&$$$$$%!|$&%:...`.`;|!|||!;!|||||||%%%%%%$%%%||||%%%%%|
&&@@&&&&&&&&&&&&&&&&&&&&&&&$$$$$$%%$$%$&&&&&&&&$%%%%$$&&@@@@@@@@@@@@#@&@@&&&&&&&&&&&&&@###&%;;;;;;::::;;;!!!!|$$$&&%!:;!$&&&@&$$$&@&&&$%$&|``..'%#@@&$%%||||!;:'`';|%%$%%|||||||||||
###@&&&&&&&&&&&&&&&&&&&&$$$$$$$$%%$&&$$&&&&&&&&$%%%%$$&&&@@@@@@@@@@@@@@&&&&@@@@@&&@####$;':!!;;;::::;;;;!;!;::::;%&&&&&$$$&@&$$$@@$$$$$&@@@@$%@#@@##@@&%%||||||||%%%|!'`:!||||||||||
###@&&&&&&&&&&&&&&&&&$$$$$$$$$$$$$$$%%$$$$&&&&@$%%%%$$&&&&&@@@@@@@@@&&&&@@&&&&&&&@@@@|:':;;!!;;:::::::;;!!;:::::::::':::';$$$$$&&$&&&@@@&&@@@@@#######@@##@&%||||||||%%%%|!''!|||||!
###@&&&&&&&&&&&&&&$$$$$$$$$$$&&$$$$$%%$$$$$&&&&&$%%$$$&&&&&$&&&@@@@&&&&&&&&&&&&@@@%:''':;;;;;:::::::::;;;:::::::::::::;;!%$$$$$|:::|$&&$&@@@@@&$&@#####@@@@####@&$%||%%%||||||;:!||!
###@&&&&&&&&&&&$$$$$$$$$$$&&&&&$$&&$%%$$$&&&&&&&&$%$$$$$&&&&&&&@@@#@&&&&&&&&@##$;''''':;;;;;:::::::::;!;:::::::::::::::;%&$$$$|''':;%&%!;:'''':|%$&@@@@#@@&&&@##@&&@@$|%%|||||||!:;|
:;$@@&&&&&&&$$$$$$$$$$$&&&&&&&&&$$&&$$&&&&&&&&&&&$%%$$$&&&&&&&&&&&&@@#######@|:'''''';!!!;::::::;;!!!!;::::::::::::::::|$$$$$!'::;!!%&|;;''''''''''';$&@@#@&&$$&@&&@#@@@#####@$%||;:
''''':|$&$$$$$$$$$$&&&&&&&&&&&&&&$$&$$&&&&&&&&&&&&&$$$$$&&$$&&&&&@@@@@&$%$%|:''''''':;:::::::::::::;;:::::::::::::::::|$$$$$!::;;;;|&%;;:''''''''''''':!$&@@@&$$$$&################$
'''''''''';%$$&&&&&&&&&&&&&&&&&&&&$$$$&&&&&&&&&&&&&&$$$$$&@@@@@###@&&$%;''''''''':::;;:::::::::::;;:::'':::::::::::':|$$$$$!::;:::|&%;;:''''''''''''''```:%&@@&&&$$$&##############$
'''''''''''':':|&&&&&&&&&&&&&&&&&&&&$%$&&&&&&&&&&&&&&$$$$$&@@&@@@&$$%%!:''''''::::::!;::::::::::;;::::::::::::::''':|$$$$$|;;:::;%&|::'''''''''''''`.....``;$@@&&&&$$$&@###########$
;:'''''''''''''':::!$&&&&&&&&&&&&&&&&&%|$&&&&&&&&&&&&&&$$$$&$$$$$$|:!|;':::::::::::;!;::::::::;;:::::::::::::''''':|$$$$$|;::::|&&|::'''''''''''``........`''!&@@&&&&$$$&@#########$
.';;;;;:'''''''''''':::;%&@&&&&&&&&&&&&%$&&$$$$&&&&&&$&@&&&$$$$%!:::!|;::::::::::::!!;::::::!;::::::::::::::''''':|&$$$$|;::::|&%;;:'``''''''''````......````'!$@@&&&&&$$$&@#######$
;;;:`.`:;;;;::'''''''''''':;%@@@&&&&&&&&$$$&&&&&&&&&&@@&!::':'':::::||;::::::::::::!!;:::;!!;;:::::::::::::::''':%&$$$$|;:::;%&|:::'`````````'''```..`...````''!$@@&&&&&&&$$&@#####$
;;;;;;;;;'..';;;;::''''''''''':|@@@@&&&&&&$%$&&&&&&&@@%:::::::::::::!|;:::::''''''';!;:;!!;:::::::::::::::::''':%&$$$%|;:::|&%;;:'''```````'''''``...
```''!&@&&&&&&&&&&&&@###$
:::;;;;;;;;!;;;'':;;;;:'''''''''':!&@@@&&&&&$$&&&&@@@$;::::::::::::';|:``````````'';!;;;:'''```````````````''''|$$$$%|;::|&$!;;:'````````''::''``....
.``'':%@&&&&&&&&&&&&&&@#$
::::::::;;;;;;;;;;;;:'':;;:''''''''':;%@@@@&&&&$&@@@$;''''''':''`''`:|;````````````:!!:'''``.........``......`!$%%%%|;;|&$!:;'`````````'''::''.
.. `''``''!$&&@@&&&&&&&&&&&&%
###@%!:::::::;;;;;;;;;;;;;;;;::'''''::::|&@@@&&&&&&%'```.....````''`'||'``````````';;'''``.................
.!$%%%%|!%&$!:;:'``'''````'::::''. ....``''``'''|@&&&@&&&@&&&&&&$|
####@&&&@&|;::::::;;;;;;;;;;;;;;;:'''''''::!&@@@@@%:````......```'```;%;`````````''''``.................
.!$%%%%%$&%;:::''```'''```'::::'`. ...``'```''';$@&&&@@&&&&&&&&&%
####@&&&&&&&&&$!:::::::;;;;;;;;;;;;;:''''''':|@@@$;````.......``''```'!%;``````''''``.......
.... .;%%%%%%$%;::'''`````''''`'::::`. ...`````'''|@&&&&@@&&&&&&&&%
####@&&&&&&&&&&&&&&|;::::::;;;;;;;;;;;;:::'':;;%&;````.........``'````:||:```':''`......
.`:|%%%%%|;::''''``````'''''::::`. ....```'''!$@&&&&@@&&&&&&&%
####@&&&&&&&&&&&&&&&&&&|::::::::;;;;;;;;;:::::;;'````..........``'`````:||:':''`......
.`'!$%%%%|;:''```````````'''''::;'. ......``':%@@&&&&&@&&&&&&%
####@&&&&&&&&&&&&&&&&&&&&&$!:::::::;;;;;;;;;;;;'`````..........`''``````:||:''`.
. .``!$&$%%%%%;'''`````````````'':::;;` .....```'!&@&&&&&&@&&&&&%
####@&&&&&&&&&&&&&&&&&&&&&&&&&|;:::::;;;;;;;;;:``````...........''````':':|%!'.
.``'|$&|;|%|%%%!''````...`````````':::;;` .....```'|@&&&&&&&@&&&&%
####@&&&&&&&&&&&&&&&&&&&&&&&&&&&$!::::::;;;;;:``````....``......''``':'''':!|%;..
..``:|%$|;::;|%||%%!'`````......```''`'':::;:' ....... ....````:%@&&&&&&@@&&&%
####@&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&%;:::::;;:```````....`. ...`'':''`.
.':!||;````````';|%%|;::::';|%||%%;'```.........```'''''::::;'. ....````........
......````:%@&&&&&&@@&&%
####@&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&|:::::'```````...``. ..'::'``.
.```':;!||!;;!||!;::::''``';|%||%|;'```..........```'''''::::;:.....``````````...........`````;&&&&&&&@@@&%
*/
int n;
long double x[100005], y[100005];
char fx[100005];
const long double eps = 1e-16;
long double calcdist(long double t) {
long double mx = -1e18, mn = 1e18;
for (int i = 0; i < n; i++) {
mx = max(mx, y[i] + (fx[i] == 'U' ? t : (fx[i] == 'D' ? -t : 0)));
mn = min(mn, y[i] + (fx[i] == 'U' ? t : (fx[i] == 'D' ? -t : 0)));
}
long double sum = mx - mn;
mx = -1e18, mn = 1e18;
for (int i = 0; i < n; i++) {
mx = max(mx, x[i] + (fx[i] == 'R' ? t : (fx[i] == 'L' ? -t : 0)));
mn = min(mn, x[i] + (fx[i] == 'R' ? t : (fx[i] == 'L' ? -t : 0)));
}
return sum * (mx - mn);
}
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%Lf%Lf %c", x + i, y + i, fx + i);
}
// x
long double l = 0, r = 1e18, ff = 233;
while (ff--) {
long double m = (r + l * 2) / 3;
long double m2 = (r * 2 + l) / 3;
if (calcdist(m) < calcdist(m2)) {
l = m2;
} else {
r = m;
}
}
printf("%.14Lf\n", calcdist(l));
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
/*
Coded by 秦惜梦
The most attractive girl in the world
@@@@@@@@@@##&|;!!!!!!!!!!||||||||%%%%%$$$$$$$$$$$$%%$$$&&&&&&&&&$$&&&&&&&&&@@@&%||||||$&&&&@&%;'```'`':!||%&@@@@#@&&&&&@@@&&$$$&&@@&$$$&@@@@@@@@@@@@@#@@@@@@@@@@#@@@@@#@@@@@@@@@@##$
@@@@@@@@@####$!;!!!!!!!!!||||||||%%%%%%%%%%%%%%%$$$$&&&&&&&&&&&&&&&&&&&&@@@@@@&%|||||!:'`'!$&&&&&&%:''!|||$&&&@@@@@@&&&&&@@@&$$$&&@&&$&&@@@@@@@@@@@@@@@@@@@@@@@@##@@@@#@@@@@@@@@@#@%
@@@@@@@@@####@|;!!!!!!!!!|||||||%%%%%%%%%%%%%$$$$$$$$$$&&&&&&&&&&&&&&&@@@@@@@@&%|;:'''''``````'!$&&&@@&|:;%$$&&&@@@@@&&&&&@@@&$$$&&@@@@@@@@@@@@@@@@@@@@@@@#@@@@@#@@@@@#@@@@#@@@@##@%
@@@@@@@@####@@&|;!!!!!!!!|||||||%%%%%%%%%%%%%%$$$$$$$$&&&&&&&&&&&$$$&&@@@@@@@@@@&$|;'''''````````'':!$&&&$%%%%$$&@@@@@&&&&&@@@@&&&@@#@@@@@@@@@@@@@@@@@@@@@@@@@@@#@@@@@@@@@@#@@@@#@@%
@@@@@@@#####@@@$!;!!!!!!|||||||%%%$$$$$%%%%%%%%%$$$$$$$&&&&&&&&&$$$$&&@@@@@@@@$%$&@@&&&@&$%;:':;:''`````'|%%%%%%$$&@@@@@&&&&@@#@@@@@@#@@@@@@@@@@@@@@@@#@@@@@@@@@#@@@@@@@@@@@@@@#@@@%
@@@@@@#####@$%%%$$$%%%||%%||||%%%%$%%$$$$$%%%%%%%$$$$&&&&&&&&&$$$$$$&&@@@@@@@&$;'''''':!%&&&&&&@@&%;'```:$&&%%%%%$$$&@@@@&&&&@@@@@@@@@#@@@@@##@@@@@@@@#@@@@@@@@@@@@@@#@@@@@@@@@#@@@%
$&@@@@######&&&&&$%%%%|%|||||||%%%%%$$$$$$$$$$$$$&&&&&&&&&&&&&&&&$$$$&&@@@@@@&$!''''''````````:!|$&&&&&&&$&&&$%%%%$$$&&@@@&&&&&@@@@&@@@@@@@@@#@@@@@@@@#@@@@@&&&@@@@@@@@@@@@@@@#@@@@$
$$$&@######@&&&&&&|!!!!!|||||||%%$$$$$$$$$$$$$$$&&&&&$$&&&&&&&&&&&&$$&&&@@@@@@&%;::''````````'':'``....`;|%$&&&$%%$$$$$&@@@&&&&&@@@@@@@@#@@@@@#@@@@@@@@@@@@@@&&@&&&&&&&&&@@@@@@@@@@$
$$$&@#####@&$$&&@#&|!!!!!|||||||%%%$$$$%%%%%$$$$$$$&&&&&&&&&&&&@@@@@&&&&&&@@@@@@@@@@@&&&&&&&&@@@@&&$$%||||%%%$$&&&$$$$$$$&@@@&&&&&@@@@@@@#@@@@@@@@@@@@@@@@@@@@&&@&&&&&&&&@@@@@@@@@#$
$$&@######@&$&@##@&$|!!!!|||||||%%%%%%%%%%%%%$$$$&&&&&&&&&&&&&&&&&&&&$$&&&&&&@@&|'`````````':::;;;;;;!|%%%%%%%%$&@@&$$$$$$$&@@&&&&&@@@@@@@@@@@@@@@@@@@@#@@@@@@@@@&&&&&&&&&@@@@@@@#@%
$&@######@&&&@##@$$$$|!!!||||||||%%%%%%%%%%%%$$$$&&&&&&&&&&&&&&&&&&&&$&&&&&&&&@@$!:::'':::::::::::::''``.:%%$$$$$$&@@@&$$$$$&@@@&&&&@@@@@@@@@@@@#@@@@@@@@@@#@@@@#@@@@@@&&&@@@@@@@@@%
$&@######@&&@#@&$$$$&$|!!!||||||||%%%%%%%%%$$$$$&&&&&&&&&&&&&&&&&&&$$$&&&&&&&&&&&%;::::::::::::':''':'':::%&$$$$$$$$&&@@&$$$$$&@@@&&&&@@@@@@@@@@@@@@@@@@#@@@@@@@@@@@@@@@@@@@@@@@@@@%
&@#######@@@#@&$$$$$&&$|!!|||||||||%%%%%%$$$$$$$$$&&&&&&&&&&&&&&&$$$$$&&&&&&&&&&&$!''::::'''::;!|%%$&&@@@@&&@@$$%%$$$$&&@&&$$$$&@@@&&&&@@@@@@#@@@@@@@@@@@@@@@@@#@@@@@@@@@@@@@@@@@@@%
############&$$$$$$$&&&$|!!||||||||%%%%%%$$$$$$$$$$$$$$&&&&&$$$$$$$$$$&&&&&&&&&&&&@@@&&&&&&&@@@@@@&&&$$%|!;%@@@@&$$$$$$$$&@@&$$$$&@@@&&&@@@@@@@@@#@@@@@@#@@#@@@@@@@@@@@@@@@@@@@@@@@$
########@&$$$$$$$$$&&&&&$|!!||||||%%%%%%$$$$$$$$$$$$$$$$$$$$$$$$$$$$$&&@@&&&&&&&&&&&&&&$$$$$$$$$$&&&$$%!;:::|$&@@@@&$$$$$$$&@@&$$$&@@@&&&@@@@@@@@##@@@@@@@@@@@@#@@@@@@@@@@@@@@@@@@@$
########@$%%%$$$$$$&&&&&&&%!||||%%%$$$%%%%%%%%%%%%%%%%%%%%%%%$$$$$&&&&&&&&&&@@@&&&&&&&&&&&&$$$$$$$$$$$$$&&%!!$$$$&@@@@&$$$$$$&@@@&&&&@@@&&@@@@@@@##@@@@@#@@@@@@@@@@@@@@@@@@@@@@@@@@%
#######@&$$$$$$$$$$$$&$|!||%%%%||%%%%%%%%%%%%%%%%%$$$$$$&$$$$$&&&&&&&&@@@@&&&&&&&&&&&&&&&&&&&$$&&$$$$$$$$$&&&$&@&$$$&@@@&$$$$$$&@@@@&&@@@@&@@@@@@###@@@@@@@@@@@@@@@@@@@@@@@@#@@@@#@%
#######@$$$$$$%$$$$$$$&&$||||%%%%%%$$$$$$$$$$$$$$$$$$$$$$$&&&&&&&&&&@@&&&&&&&&&&&&$$$$$$&&&&$$$$$$$$$$$$$$$$$$&@@@@&$$$&@@@&$$$$&&&@@@&@@@@&&@@@@@###@@@@#@@@@@#@@@@@@@@@@@#@@@@#@@$
#######&$$$$$$$$$$&$$$$$&&&&&$%||%%%%%%$$$$$$$$$$$$$$$$$&&&&&&&&&&&@&&&&&&&&&&&&$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$&&@@@&$$$&@@@&$$&&&@@@@@@#@@@@@@@@##@@@@#@@@@@@@@@@@@@#@@@@@@##@##$
######@$$$$$$$$$$$$$$$$$$&&&&&&$||%%%%%%%$$$$$$$$$$$$$&&&&&&&&&@@&&&&&&&&&&&&&&$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$&@@@@@&&$&&@@@&&&&&@@@@@##@@@@@@@##@@@###@@@@@@@@@@@@@@#@@@#@#@@%
######&$$$$$$$$$$$$$$$$$&&&&&&&&$%|%%%%%%%$$$$$$$$$$&&&&&&&&&&@&&@@&&&&&&&&&&$$$$$$$$$$$$$$$$$$$$$$$&$$$$$$$$$$$$$$$$&@@@@@@&&&&&@@@&&&&@@@@@#@@@@@###@@@##@@@@@@@@@@@@@@#@@@####@#$
#####@$$$$$$$$$$$$$$$$$$$&&&&&&&&&%%%%%%%%%$$$$$$$$&&&&&&&&&&&&&&&&&&&&&&&&$$$$$$$$$$$$$$$$$$$$$$$$$$&$$$$$$$$$$$$$$$$$&&&@@@@@&&&&@@@@@@@@@@@@#@@@@###@@@$%%%%%%%%%%%%%$&@@#######$
#####@&$%$$$$$$$$$$$$$$$$$$&&&&&&&&$%%%%%%%%%%$$$$&&&&&&&&&&&&&&&&$$$$$$$$$$$$$$$$$$$$$$$$$$%$$$$$$$$$%%$$$$$$$$%%$$$$$%&@&&&&@@@@@&&@@@@@&&@@@@#@@@@###@&%%%%%%%%%%%%%%%%%&@##@##@%
####@@@@&$$$$$$$$$$$$$$$$$$&&&&&&&&&&%%%%%%%%%%$$&@&&&&$&&&$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$||$$$$$$$$%%$$$$$|%$$$$$$$%%$&@@@&&&@@@@@@@@@@@@&@@@@@@@@##@&%%%%%%%%%%%%%%%%%%%$@@@@@%
####@@@@@@&$%$$$$$$$$$$$$$$$$$&&&&&&&&$%%%%%%%$&&&&&$$$$$$&$$$$$$$$$$$$$$$$$$$$$$$%%$$$%%%%|!|||$$$$%!|%%%$$&$$$$$$$$$$%%%$&@#@@@@&&@@@@@@@@@@@@@@##@@@@#@@@&$$%%%%%%%%|%%%%%|$@@@@$
###@@@@@@@@$$$%$$$$$$$$$$$$$&&&&&&&&&&&&%%%%%&&&&&$%%%$$&&&$$$$$$$$$%%%$$|%$$$%%%$%%|%%!;!||!!||%$$$$$$$%%$&$$&&$$$$$$$$$$%%$@@#@@@@@@&&@@@@@@@@#@@###@@@########@@$%%%%%%%|%%$&@##$
##@@@@@@@@@&$$$&$$$$$$$$$$$$$$$&&&&&&&&&&&%%%$&%|%%%%%$%%$$%%%%%%$$$%%%$$||%%%$$$$$%%%%%$$$$$%!!|%&&$$$$%|$$$$$$&$$$$$$$$$$$%$$&@@@@@@@@@@@@@@@##@@@@##@@####@@#######&%%%%%%%$@###$
#@@@@@@@@@@&&$$&$$$$$$$$$$$$$$$&&&&&&$||%%%$$%!;!;!|%%%%$%!||||%%%$$$||%$%%%%%%$$$$%$$%%%%$%$$$$||$&&$$&%|%$$$$$$$&$%%$%|%$$$$%$%$@@@@@@##@@@@@@@@@@########@##@@@######&$$&@@@@@##$
@$$&@@@@@@@&&$$$$$$$$$$$$$$$$$$&&&$&&&&$$&$$%!|%%%%%%%%%%||%%%%%%%%$$||%$$$$%%%%$$$%%$$%%%%%%%$$%|%&&$$&$%%$$$$$$$&&$%%&&&&$$$$$$$||$@@@@@@@@@@@@@@@@@@@####@@@@##@@@#@@@@@@@@@@@@@%
&$%%$$&&&$$$$$$$$$$$$$$$$$$$$$$$$$$&&&&&&&&|!|%%%%|%%%%%%$%%%%||||%$$%|%$&&$%%%%$$$$%$$%%%%$$$$$%|$&&&$&$$$&$&$$$$&&&$%$&&&$$&&&&&$%!!|$&@@@@@@@@@@@@@@@@###@@@@@@@@@@@@@@@@@@@@@@@%
$$%$$$$$$$$$$$$$$$$$$$$$$$$$$$$&&&$&&&&&&$|!|||%%|%%%%%%$$%%%%||||%$$%%%$&&$%%%$$&&&$$$$$$$$$$$$$%%&&&&&$$&&$&$$&&&&&&&&&&&&&&&&&&&&$|!!!!$&@@@@@@@@@@@#####@######@##@@&@@@@@@@@@@$
$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$&&&&&&$|!|||%$%%%%%%%$$$$%%%||||%$$%%%$&&$$%%$&&&&&$$$$$$$$$$$$%%&&&&&$$&&$&$$&&&&&&&&&&&&&&&&&&&&&&%!!!!|&&&@@@@@@#########@########@@##########$
$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$&&&&&$&$%|!||%$$%%$%%%%$$$$$%%|||||$$$&$$&$$$%$&&&&&&$$$$$%$$$$$$%$&&&&&&&&&&&$$&&&&&&&&&&&&&&@@&&&&&@@$|!$@&||||%&@#@@####@########@@@@@@@#@&&@@##$
$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$&&&$$&$%|!||%$$%%%%%%%$$$%$$%%||||%$&&&&&&$$$$$$&&&&&$%$$$%%$$$$$%$&&&&&&&&$$$$$&&&&&&&&&&&&&&@@@&&@@@@@&@@&|||||||||%&@###############@@@@@@##@@@@%
%$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$&$&&$$$$%!!|%$$$%%%%%%$$$$%$$$%||||$&&$$&&$$$$$$$&&&$&$%%$%%%%%%$$%$$$&&&&&$$$$$$&&&&&&$&&&&&&&&&&&&&&&@@@@&||||||||||||$@#####@@@########@@@@@###@@$
%%%%%%%%$$$$$$$$$$$$$$$$$$$$$$$$$&&%%&%!!||%$$%%$$%%$$$$%%$$%%|!|%&&$%%&&$%%%%$$$&$|%$||$%%%%%%$$$$$$&&&&$$$$$$&&&&&&$$$&&&&&&&&&&@@&&&@@@&&%|||||||||%&@@##@$$@@@@########@@@@@@##$
;:''':;!|%%$$$$$$$$$$$$$$&&&&&&&&%%&&$!!|%%%%%%%$$$$$$$%%%$%%%|||$$&%!%&$%%%%|%%%&%!|$||%%%%%%%$$$$%%$&&$$$$$$$&&&&&&$$$$&&&&&&&&&&&&&&@@@@&&%|||||||%@@@@#@%|&#$||||%&@@@@@@@@@@@@$
.....
.`;|%%$$$$$$$$$$$&&&&&&$%%$&&$!;|%%|||%%$$&&&&$$%%$$%%%%%%%&%!;|$$%||||%%%$|;!%||$%$$$$$%%%%||$&$%%%$$$$&&&&&&$$$$&&&&&&&&&&&&&@@@@@@&&%|||||$@@@##&%|%@@%||||||||||&@@@@@@@%
........
`;|%$$$&&&&&&&&&&&$%$&&&&$|!|%%|!!|||$&$&&&$$%%%%%||||%$$|;;|%%|||||%$&&$|!|!!%%%%%%|!!|%!%$$%||%$&$&&&&&&&$$$$&&&&&&&&&&&&@@@@@@@@&&%|||$@@@##@$||$#&|||||||||||&#$|||||!
... ..
`;|%$$$$&&&&&&$%$$&&&&&&||%%$||!!||$&$$$$$$%%%%%%||||%$%!:!!!%%$$$%%%%|!;;;;;!!!!!;;;||!%&%|%%%$&&$&&&&&&&$$$$&&&&&&&&&&&@@@@@@@@@&&$||$@##@@@%||%&@$||||||||||%&@$|||||!
..
.'!|%$$&&&&&&&&&&&&&&&&||$$&%||!||%&&$$$$$$%%$%||||||%|!;:;;;|%|!!!!!|!|$$&&&&$$$%!!!!;|&&$%%%$&$$$$%||&@&$$$$&&&&&&&&&@@@@@@@@@@@@&$|%@@@@#@%|||$@&%||||||||||%@@%|||||!
...
.';|%$$&&&&&&&&&&&&&&&%%&$&&%|||||%&&$$$$$$%%$%%%||||%!;:::::::'':;!|%%%%$&@&&$%|!|%|;!$&$%|%%$$$$&$|!|$@@&$$$&@@@@@@@@@@@@@@@@@@@@&$$@@@#@&%|||%&#$|||||||||||$@&%|||||!
....
.:!|%$$&&&&&&&&&&&&&&$$&&&&$|||||%$@&$$&$$&&&$%|%%%%|;::''''''````'!!!;'`'%@&%|!::!;;!$$||%%%$&$$$$|!!|%&@@&&&&@@@@@@@@@@@@@@@@@@@@&&@@@@#@%||||$@@$|||||||||||$#&||||||!
..
.';!|%$$$&&&&&&&&&&&&$$&&&&&$$%||%%&@&$$&$$$$%|!;;;;:::'`````````````````';;:;!;'::::;%$|||!!|$$$%$%||||$@@@&&&@@@@@@@@@@@@@@@@@&&@&&&&&&@@@$%%||&#&%||||||||||%&#$||||||!
.`:!!!|$$&&&&&&&&&&&&&&&&&&&&&&&$%$$$&@&&$&&$$|!|%$$$$%|;''``````````````':;!!!;::''':;!$%|$$%%$$$$$$%!!%&@@@@@@@@@@@@@@@@@@@@@@@@&&&&@&$$&@@@@@@@@@#&%||||||||||%@@$||||||!
;:''`'':;!!!!|%$$&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&$&&&&&$|!%%%%$&$$|;'``````````````''''''''::::;|$&$$$%%$$%%$$$&@@@@@@@@@@@@@@@@@@@@@@@@@@@&&&@&$$$&&&@@@@@@@@@@@@@@&$%|||$@@$||||||!
|!;;;!!!!!!|%$$$&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&%!:;|!||!!:'''``````````````''''''''':;;|$$$$$%%$%$$$&&&&&@@@@@@@@@@@@@@@@@@@@@@@@&&&@&$$$&&&&&@@@@@##@@@@@&&@@@@@@#@&%|||||!
%|!!!!!!||%$$$&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&@@&&&&&&$$$!';;;:'```''`````````````````'''''';;:|$$$$$$$$%$$$&@&&&&@@@#@@@@@@@@@@@@@@@@@@@&&@&$$$$$$$&&&@@@@##@%;''|&@@@@@@@#@@@@@@@%
&$%%%%%%$$$$&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&@&&&@&&&$$$%;``'''``':'``````````````````'''':::;|$$$$$$$%$$$$&&&&&&@@@##@@@@@@@@@@@@@@@@@@&@&$$$&&&$$$&&&@@@@|:''':%@@@@@@@#@@@@@@@@%
@@&$$$$$&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&@&&@@&&&$$$$%:``````';:'```...`````````````'''':;|$$$$$$%%$$$$&&&&&&&@@##@@#######@@#@@@@@@#@&$$&&&&&$%$$&&@@%:'::'!&@@@@&@@@@@@@@@@@%
##@&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&@@&&&&&&&$$%:``````':;:```..``````````````''':;|$$$$$$%%$$$&&&&&&&@@@####################@&$$&&$$$$$$$|;|&$!''':;$&&&&&&@@@@@@@@@@@%
##@&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&$&@&$&&&$&&&&&%'``````.``````....```````````'`'';|$&$$$%$$$$$$&&&&&@@@@@##################@$$$&&$$$$$|:':;%&$;''''|&&&&&&&&@@@@@@@@@@%
##@&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&$%$&@@$$$$$&&&&&@@!````````.......````````````''`'':!%$&&&$$&&&&&&&&&&@@@#@@##############@@&$$$$&$$$$$$|:''|&&|''''!$&&&&&&@@@@@@@@@@@@%
##@&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&|;%&$&@$$$$$$&&&&&@@&;..``..........````````````''``'';%$&&&&&&&&&&&&&&@@@@@##@############@@@$$$$&$!|$$$$!:':%@%:``':%&&@@@@@@@@@@@@@@@@@%
##@&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&$!!$&&$&&$|!|%$$$&&&@@@@$:.........``'''``':;:'`````````':!%$&&&&&&&@&&&&&@@@@@@@#@@#########@@@&$$$%!!$$$$$%;'';$&!``':%@@@@@@@@@@@@@@@@@@@&%
##@&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&|;%&&&&$%%$%!|%%$$$$&&@@@@@$;`.....`...````````````````````';|$&&&&&&&&@@@&&&@###@@@@#@&&##@@@@@&$$$$&&$$$$$$|'```!&%;|&&&&&@@@@@@@@@@@@@@@&&&&%
###&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&%:|&&&&&$$||$&$|%%%$$&&&@@@@@@@@$;`........``'::'`...```'``````:|$$$&@@&$&@@@@@@&@#@@####@#&&#@$|%&$$%%&&$$$$%!'`.`:!$@@&&&&@@@@@@@@@@@@@@&&&&&&&&%
###@&&&&&&&&&&&&&&&&&&&&&&&&&&|:!&&&&&&$$%||$&&$%%%$$&&&&@@@@@@@@@@&%:`.................`'````:!;;|$$$&&@@&&&&@@@@&&@########@!':|&$$%%$|;:;;!|%%%%||$@@&&&&&&&@&&&&&&&&&&&&&&&&&&&%
###@&&&&&&&&&&&&&&&&&&&&&&$!:|&&&&&&&&$$%|%$&&&$%%%$&&&&&@@@@@@@@@@@@&&$;`..............``'';|!;;;;|%$$$$&@@@&&&@@&&$$&&@@@@##@&%||%%%$!:|%%%%%||%!|$@@@&&&&&&&&$$$$$$&&&&&&&&&&&&&%
###@&&&&&&&&&&&&&&&&&&&|:!$&&&&&&&&&&$%%%%$$&&&$%%$$$$&&@#@@@@@@@@@@@&&&&&&|'...........``:!!;;;;;!!;|$&$%|&@@@&&&&&$!|$$$&@@#@@&%%%%$|'':!%%%%|!|$&&@@&&&&&&&$%%%%$$$$$&&$$$$$$&&&%
###@&&&&&&&&&&&&&&&|:;%&&&&&&&&&&&&$$%%%%$$&&&&$$$$$$$$&@#@@@@@@@@@&&&&&&&&&&&&|'.....`;%%!!!!;;;!!!!;!%$$&$|%@@@@@&&@$;:::!|%$&$%%%$%:'``';!!|||%$&@@@&&&&&&$%%%%%%%$$$$$%%%%$$$$$|
###@&&&&&&&&&$|:;%&&&&&&&&&&&&&&&$$%%$%%$&&&&&&$$$$%$$$&@@@@@@@@@##@&&&&&&&&&&&&&&%|%&&&&&$|;;;;;;;;;;;;!$&$&$|!%&@@@@@@&%;::!$$$$$$%;:```````;||||%$&&$$$$$$%|%%%%%%%$$$%%%%%%%%$%|
###@&&$%|||$&&&&&&&&&&&&&&&&&&$$$$%%$$%$&&&&&&&$$$%%$$&&@@@@@@@@@@@##@&&&&&&&&&&&&&&&&&&&&@%;;;;;;;::;;;;!!$&&$$%!;|$$$&&&$&&&$$$$$%!|$&%:...`.`;|!|||!;!|||||||%%%%%%$%%%||||%%%%%|
&&@@&&&&&&&&&&&&&&&&&&&&&&&$$$$$$%%$$%$&&&&&&&&$%%%%$$&&@@@@@@@@@@@@#@&@@&&&&&&&&&&&&&@###&%;;;;;;::::;;;!!!!|$$$&&%!:;!$&&&@&$$$&@&&&$%$&|``..'%#@@&$%%||||!;:'`';|%%$%%|||||||||||
###@&&&&&&&&&&&&&&&&&&&&$$$$$$$$%%$&&$$&&&&&&&&$%%%%$$&&&@@@@@@@@@@@@@@&&&&@@@@@&&@####$;':!!;;;::::;;;;!;!;::::;%&&&&&$$$&@&$$$@@$$$$$&@@@@$%@#@@##@@&%%||||||||%%%|!'`:!||||||||||
###@&&&&&&&&&&&&&&&&&$$$$$$$$$$$$$$$%%$$$$&&&&@$%%%%$$&&&&&@@@@@@@@@&&&&@@&&&&&&&@@@@|:':;;!!;;:::::::;;!!;:::::::::':::';$$$$$&&$&&&@@@&&@@@@@#######@@##@&%||||||||%%%%|!''!|||||!
###@&&&&&&&&&&&&&&$$$$$$$$$$$&&$$$$$%%$$$$$&&&&&$%%$$$&&&&&$&&&@@@@&&&&&&&&&&&&@@@%:''':;;;;;:::::::::;;;:::::::::::::;;!%$$$$$|:::|$&&$&@@@@@&$&@#####@@@@####@&$%||%%%||||||;:!||!
###@&&&&&&&&&&&$$$$$$$$$$$&&&&&$$&&$%%$$$&&&&&&&&$%$$$$$&&&&&&&@@@#@&&&&&&&&@##$;''''':;;;;;:::::::::;!;:::::::::::::::;%&$$$$|''':;%&%!;:'''':|%$&@@@@#@@&&&@##@&&@@$|%%|||||||!:;|
:;$@@&&&&&&&$$$$$$$$$$$&&&&&&&&&$$&&$$&&&&&&&&&&&$%%$$$&&&&&&&&&&&&@@#######@|:'''''';!!!;::::::;;!!!!;::::::::::::::::|$$$$$!'::;!!%&|;;''''''''''';$&@@#@&&$$&@&&@#@@@#####@$%||;:
''''':|$&$$$$$$$$$$&&&&&&&&&&&&&&$$&$$&&&&&&&&&&&&&$$$$$&&$$&&&&&@@@@@&$%$%|:''''''':;:::::::::::::;;:::::::::::::::::|$$$$$!::;;;;|&%;;:''''''''''''':!$&@@@&$$$$&################$
'''''''''';%$$&&&&&&&&&&&&&&&&&&&&$$$$&&&&&&&&&&&&&&$$$$$&@@@@@###@&&$%;''''''''':::;;:::::::::::;;:::'':::::::::::':|$$$$$!::;:::|&%;;:''''''''''''''```:%&@@&&&$$$&##############$
'''''''''''':':|&&&&&&&&&&&&&&&&&&&&$%$&&&&&&&&&&&&&&$$$$$&@@&@@@&$$%%!:''''''::::::!;::::::::::;;::::::::::::::''':|$$$$$|;;:::;%&|::'''''''''''''`.....``;$@@&&&&$$$&@###########$
;:'''''''''''''':::!$&&&&&&&&&&&&&&&&&%|$&&&&&&&&&&&&&&$$$$&$$$$$$|:!|;':::::::::::;!;::::::::;;:::::::::::::''''':|$$$$$|;::::|&&|::'''''''''''``........`''!&@@&&&&$$$&@#########$
.';;;;;:'''''''''''':::;%&@&&&&&&&&&&&&%$&&$$$$&&&&&&$&@&&&$$$$%!:::!|;::::::::::::!!;::::::!;::::::::::::::''''':|&$$$$|;::::|&%;;:'``''''''''````......````'!$@@&&&&&$$$&@#######$
;;;:`.`:;;;;::'''''''''''':;%@@@&&&&&&&&$$$&&&&&&&&&&@@&!::':'':::::||;::::::::::::!!;:::;!!;;:::::::::::::::''':%&$$$$|;:::;%&|:::'`````````'''```..`...````''!$@@&&&&&&&$$&@#####$
;;;;;;;;;'..';;;;::''''''''''':|@@@@&&&&&&$%$&&&&&&&@@%:::::::::::::!|;:::::''''''';!;:;!!;:::::::::::::::::''':%&$$$%|;:::|&%;;:'''```````'''''``...
```''!&@&&&&&&&&&&&&@###$
:::;;;;;;;;!;;;'':;;;;:'''''''''':!&@@@&&&&&$$&&&&@@@$;::::::::::::';|:``````````'';!;;;:'''```````````````''''|$$$$%|;::|&$!;;:'````````''::''``....
.``'':%@&&&&&&&&&&&&&&@#$
::::::::;;;;;;;;;;;;:'':;;:''''''''':;%@@@@&&&&$&@@@$;''''''':''`''`:|;````````````:!!:'''``.........``......`!$%%%%|;;|&$!:;'`````````'''::''.
.. `''``''!$&&@@&&&&&&&&&&&&%
###@%!:::::::;;;;;;;;;;;;;;;;::'''''::::|&@@@&&&&&&%'```.....````''`'||'``````````';;'''``.................
.!$%%%%|!%&$!:;:'``'''````'::::''. ....``''``'''|@&&&@&&&@&&&&&&$|
####@&&&@&|;::::::;;;;;;;;;;;;;;;:'''''''::!&@@@@@%:````......```'```;%;`````````''''``.................
.!$%%%%%$&%;:::''```'''```'::::'`. ...``'```''';$@&&&@@&&&&&&&&&%
####@&&&&&&&&&$!:::::::;;;;;;;;;;;;;:''''''':|@@@$;````.......``''```'!%;``````''''``.......
.... .;%%%%%%$%;::'''`````''''`'::::`. ...`````'''|@&&&&@@&&&&&&&&%
####@&&&&&&&&&&&&&&|;::::::;;;;;;;;;;;;:::'':;;%&;````.........``'````:||:```':''`......
.`:|%%%%%|;::''''``````'''''::::`. ....```'''!$@&&&&@@&&&&&&&%
####@&&&&&&&&&&&&&&&&&&|::::::::;;;;;;;;;:::::;;'````..........``'`````:||:':''`......
.`'!$%%%%|;:''```````````'''''::;'. ......``':%@@&&&&&@&&&&&&%
####@&&&&&&&&&&&&&&&&&&&&&$!:::::::;;;;;;;;;;;;'`````..........`''``````:||:''`.
. .``!$&$%%%%%;'''`````````````'':::;;` .....```'!&@&&&&&&@&&&&&%
####@&&&&&&&&&&&&&&&&&&&&&&&&&|;:::::;;;;;;;;;:``````...........''````':':|%!'.
.``'|$&|;|%|%%%!''````...`````````':::;;` .....```'|@&&&&&&&@&&&&%
####@&&&&&&&&&&&&&&&&&&&&&&&&&&&$!::::::;;;;;:``````....``......''``':'''':!|%;..
..``:|%$|;::;|%||%%!'`````......```''`'':::;:' ....... ....````:%@&&&&&&@@&&&%
####@&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&%;:::::;;:```````....`. ...`'':''`.
.':!||;````````';|%%|;::::';|%||%%;'```.........```'''''::::;'. ....````........
......````:%@&&&&&&@@&&%
####@&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&|:::::'```````...``. ..'::'``.
.```':;!||!;;!||!;::::''``';|%||%|;'```..........```'''''::::;:.....``````````...........`````;&&&&&&&@@@&%
*/
int n;
long double x[100005], y[100005];
char fx[100005];
const long double eps = 1e-16;
long double calcdist(long double t) {
long double mx = -1e18, mn = 1e18;
for (int i = 0; i < n; i++) {
mx = max(mx, y[i] + (fx[i] == 'U' ? t : (fx[i] == 'D' ? -t : 0)));
mn = min(mn, y[i] + (fx[i] == 'U' ? t : (fx[i] == 'D' ? -t : 0)));
}
long double sum = mx - mn;
mx = -1e18, mn = 1e18;
for (int i = 0; i < n; i++) {
mx = max(mx, x[i] + (fx[i] == 'R' ? t : (fx[i] == 'L' ? -t : 0)));
mn = min(mn, x[i] + (fx[i] == 'R' ? t : (fx[i] == 'L' ? -t : 0)));
}
return sum * (mx - mn);
}
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%Lf%Lf %c", x + i, y + i, fx + i);
}
// x
long double l = 0, r = 1e18, ff = 355;
while (ff--) {
long double m = (r + l * 2) / 3;
long double m2 = (r * 2 + l) / 3;
if (calcdist(m) < calcdist(m2)) {
r = m2;
} else {
l = m;
}
}
printf("%.14Lf\n", calcdist(l));
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"assignment.variable.change",
"identifier.change"
] | 819,979 | 819,978 | u545001286 | cpp |
p03004 | #include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
int main() {
ll N;
cin >> N;
vector<double> x(N), y(N);
vector<char> d(N);
for (ll i = 0; i < N; i++) {
cin >> x[i] >> y[i] >> d[i];
if (d[i] == 'R') {
d[i] = 0;
} else if (d[i] == 'L') {
d[i] = 1;
} else if (d[i] == 'U') {
d[i] = 2;
} else if (d[i] == 'D') {
d[i] = 3;
} else {
assert(false);
}
}
enum { RIGHT, LEFT, UP, DOWN, DIR_NUM };
vector<double> x_max(DIR_NUM, LLONG_MIN);
vector<double> x_min(DIR_NUM, LLONG_MAX);
vector<double> y_max(DIR_NUM, LLONG_MIN);
vector<double> y_min(DIR_NUM, LLONG_MAX);
for (ll i = 0; i < N; i++) {
x_max[d[i]] = max(x_max[d[i]], x[i]);
x_min[d[i]] = min(x_min[d[i]], x[i]);
y_max[d[i]] = max(y_max[d[i]], y[i]);
y_min[d[i]] = min(y_min[d[i]], y[i]);
}
set<double> candidates;
{
double const_x = max(x_max[UP], x_max[DOWN]);
double left = x_max[LEFT] - const_x;
double right = const_x - x_max[RIGHT];
if (left >= right) {
candidates.insert(max((x_max[LEFT] - x_max[RIGHT]) / 2, 0.0));
} else {
candidates.insert(max(left, 0.0));
candidates.insert(max(right, 0.0));
}
}
{
double const_x = min(x_min[UP], x_min[DOWN]);
double right = x_min[LEFT] - const_x;
double left = const_x - x_min[RIGHT];
if (left >= right) {
candidates.insert(max((x_max[LEFT] - x_max[RIGHT]) / 2, 0.0));
} else {
candidates.insert(max(left, 0.0));
candidates.insert(max(right, 0.0));
}
}
{
double const_y = max(y_max[RIGHT], y_max[LEFT]);
double left = y_max[DOWN] - const_y;
double right = const_y - y_max[UP];
if (left >= right) {
candidates.insert(max((y_max[DOWN] - y_max[UP]) / 2, 0.0));
} else {
candidates.insert(max(left, 0.0));
candidates.insert(max(right, 0.0));
}
}
{
double const_y = min(y_min[RIGHT], y_min[LEFT]);
double right = y_min[DOWN] - const_y;
double left = const_y - y_min[UP];
if (left >= right) {
candidates.insert(max((y_max[DOWN] - y_max[UP]) / 2, 0.0));
} else {
candidates.insert(max(left, 0.0));
candidates.insert(max(right, 0.0));
}
}
auto x_max_at = [&](double time) {
return max(
{x_max[RIGHT] + time, x_max[LEFT] - time, x_max[UP], x_max[DOWN]});
};
auto x_min_at = [&](double time) {
return min(
{x_min[RIGHT] + time, x_min[LEFT] - time, x_min[UP], x_min[DOWN]});
};
auto y_max_at = [&](double time) {
return max(
{y_max[RIGHT], y_max[LEFT], y_max[UP] + time, y_max[DOWN] - time});
};
auto y_min_at = [&](double time) {
return min(
{y_min[RIGHT], y_min[LEFT], y_min[UP] + time, y_min[DOWN] - time});
};
auto score = [&](double time) {
return (x_max_at(time) - x_min_at(time)) *
(y_max_at(time) - y_min_at(time));
};
double ans = LLONG_MAX;
for (auto candidate : candidates) {
ans = min(ans, score(candidate));
}
cout << fixed << setprecision(15) << ans << endl;
} | #include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
int main() {
ll N;
cin >> N;
vector<double> x(N), y(N);
vector<char> d(N);
for (ll i = 0; i < N; i++) {
cin >> x[i] >> y[i] >> d[i];
if (d[i] == 'R') {
d[i] = 0;
} else if (d[i] == 'L') {
d[i] = 1;
} else if (d[i] == 'U') {
d[i] = 2;
} else if (d[i] == 'D') {
d[i] = 3;
} else {
assert(false);
}
}
enum { RIGHT, LEFT, UP, DOWN, DIR_NUM };
vector<double> x_max(DIR_NUM, LLONG_MIN);
vector<double> x_min(DIR_NUM, LLONG_MAX);
vector<double> y_max(DIR_NUM, LLONG_MIN);
vector<double> y_min(DIR_NUM, LLONG_MAX);
for (ll i = 0; i < N; i++) {
x_max[d[i]] = max(x_max[d[i]], x[i]);
x_min[d[i]] = min(x_min[d[i]], x[i]);
y_max[d[i]] = max(y_max[d[i]], y[i]);
y_min[d[i]] = min(y_min[d[i]], y[i]);
}
set<double> candidates;
{
double const_x = max(x_max[UP], x_max[DOWN]);
double left = x_max[LEFT] - const_x;
double right = const_x - x_max[RIGHT];
if (left >= right) {
candidates.insert(max((x_max[LEFT] - x_max[RIGHT]) / 2, 0.0));
} else {
candidates.insert(max(left, 0.0));
candidates.insert(max(right, 0.0));
}
}
{
double const_x = min(x_min[UP], x_min[DOWN]);
double right = x_min[LEFT] - const_x;
double left = const_x - x_min[RIGHT];
if (left >= right) {
candidates.insert(max((x_min[LEFT] - x_min[RIGHT]) / 2, 0.0));
} else {
candidates.insert(max(left, 0.0));
candidates.insert(max(right, 0.0));
}
}
{
double const_y = max(y_max[RIGHT], y_max[LEFT]);
double left = y_max[DOWN] - const_y;
double right = const_y - y_max[UP];
if (left >= right) {
candidates.insert(max((y_max[DOWN] - y_max[UP]) / 2, 0.0));
} else {
candidates.insert(max(left, 0.0));
candidates.insert(max(right, 0.0));
}
}
{
double const_y = min(y_min[RIGHT], y_min[LEFT]);
double right = y_min[DOWN] - const_y;
double left = const_y - y_min[UP];
if (left >= right) {
candidates.insert(max((y_min[DOWN] - y_min[UP]) / 2, 0.0));
} else {
candidates.insert(max(left, 0.0));
candidates.insert(max(right, 0.0));
}
}
auto x_max_at = [&](double time) {
return max(
{x_max[RIGHT] + time, x_max[LEFT] - time, x_max[UP], x_max[DOWN]});
};
auto x_min_at = [&](double time) {
return min(
{x_min[RIGHT] + time, x_min[LEFT] - time, x_min[UP], x_min[DOWN]});
};
auto y_max_at = [&](double time) {
return max(
{y_max[RIGHT], y_max[LEFT], y_max[UP] + time, y_max[DOWN] - time});
};
auto y_min_at = [&](double time) {
return min(
{y_min[RIGHT], y_min[LEFT], y_min[UP] + time, y_min[DOWN] - time});
};
auto score = [&](double time) {
return (x_max_at(time) - x_min_at(time)) *
(y_max_at(time) - y_min_at(time));
};
double ans = LLONG_MAX;
for (auto candidate : candidates) {
ans = min(ans, score(candidate));
}
cout << fixed << setprecision(15) << ans << endl;
}
| [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 820,010 | 820,011 | u456065785 | cpp |
p03004 | #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> x(N), y(N);
vector<char> d(N);
for (int i = 0; i < N; i++)
cin >> x[i] >> y[i] >> d[i];
for (int i = 0; i < N; i++) {
x[i] *= 2;
y[i] *= 2;
}
long long oo = 0x100000000LL;
auto fx = [&](long long t) -> long long {
long long mn = oo;
long long mx = -oo;
for (int i = 0; i < N; i++) {
long long a = x[i] + (d[i] == 'R' ? t : d[i] == 'L' ? -t : 0);
mn = min(mn, a);
mx = max(mx, a);
}
return mx - mn;
};
auto fy = [&](long long t) -> long long {
long long mn = oo;
long long mx = -oo;
for (int i = 0; i < N; i++) {
long long a = y[i] + (d[i] == 'U' ? t : d[i] == 'D' ? -t : 0);
mn = min(mn, a);
mx = max(mx, a);
}
return mx - mn;
};
auto flex = [&](function<long long(long long)> f) -> vector<long long> {
long long s[] = {-2, -1, 0, 1};
long long p = 0;
vector<long long> r;
for (int i = 0; i < 4; i++) {
if (f(p + 1) - f(p) == s[i]) {
for (long long b = oo; b > 0; b /= 2)
if (f(p + b + 1) - f(p + b) == s[i])
p += b;
p++;
}
r.push_back(p);
}
return r;
};
long long ans = fx(0) * fy(0);
for (long long t : flex(fx))
ans = min(ans, fx(t) * fy(t));
for (long long t : flex(fy))
ans = min(ans, fx(t) * fy(t));
printf("%.2f\n", ans * .25);
}
| #include <algorithm>
#include <functional>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> x(N), y(N);
vector<char> d(N);
for (int i = 0; i < N; i++)
cin >> x[i] >> y[i] >> d[i];
for (int i = 0; i < N; i++) {
x[i] *= 2;
y[i] *= 2;
}
long long oo = 0x10000000LL;
auto fx = [&](long long t) -> long long {
long long mn = oo;
long long mx = -oo;
for (int i = 0; i < N; i++) {
long long a = x[i] + (d[i] == 'R' ? t : d[i] == 'L' ? -t : 0);
mn = min(mn, a);
mx = max(mx, a);
}
return mx - mn;
};
auto fy = [&](long long t) -> long long {
long long mn = oo;
long long mx = -oo;
for (int i = 0; i < N; i++) {
long long a = y[i] + (d[i] == 'U' ? t : d[i] == 'D' ? -t : 0);
mn = min(mn, a);
mx = max(mx, a);
}
return mx - mn;
};
auto flex = [&](function<long long(long long)> f) -> vector<long long> {
long long s[] = {-2, -1, 0, 1};
long long p = 0;
vector<long long> r;
for (int i = 0; i < 4; i++) {
if (f(p + 1) - f(p) == s[i]) {
for (long long b = oo; b > 0; b /= 2)
if (f(p + b + 1) - f(p + b) == s[i])
p += b;
p++;
}
r.push_back(p);
}
return r;
};
long long ans = fx(0) * fy(0);
for (long long t : flex(fx))
ans = min(ans, fx(t) * fy(t));
for (long long t : flex(fy))
ans = min(ans, fx(t) * fy(t));
printf("%.2f\n", ans * .25);
}
| [
"literal.number.change",
"variable_declaration.value.change"
] | 820,015 | 820,016 | u374099594 | cpp |
p03004 | // F - Minimum Bounding Box
#include <bits/stdc++.h>
using namespace std;
#define EPS 1e-9
int n;
vector<pair<long long, long long>> p, m;
double func(double t) {
double minx = 1e18, miny = 1e18, maxx = -1e18, maxy = -1e18;
for (int i = 0; i < n; i++) {
double x = p[i].first + t * m[i].first, y = p[i].second + t * m[i].second;
minx = min(minx, x);
maxx = max(maxx, x);
miny = min(miny, y);
maxy = max(maxy, y);
}
return (maxx - minx) * (maxy - miny);
}
int main(int argc, char *argv[]) {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
long long x, y;
string s;
cin >> x >> y >> s;
p.resize(n), m.resize(n);
p[i] = make_pair(x, y);
if (s[0] == 'R')
m[i] = make_pair(1, 0);
else if (s[0] == 'L')
m[i] = make_pair(-1, 0);
else if (s[0] == 'U')
m[i] = make_pair(0, 1);
else if (s[0] == 'D')
m[i] = make_pair(0, -1);
}
double l = 0, r = 1e9;
for (int k = 0; k < 90; k++) {
double m1 = l + (r - l) / 3, m2 = r - (r - l) / 3;
if (func(m1) > func(m2))
l = m1;
else
r = m2;
}
double ans = func((l + r) / 2);
cout << fixed << setprecision(15) << ans << endl;
return 0;
}
| // F - Minimum Bounding Box
#include <bits/stdc++.h>
using namespace std;
#define EPS 1e-9
int n;
vector<pair<long long, long long>> p, m;
double func(double t) {
double minx = 1e18, miny = 1e18, maxx = -1e18, maxy = -1e18;
for (int i = 0; i < n; i++) {
double x = p[i].first + t * m[i].first, y = p[i].second + t * m[i].second;
minx = min(minx, x);
maxx = max(maxx, x);
miny = min(miny, y);
maxy = max(maxy, y);
}
return (maxx - minx) * (maxy - miny);
}
int main(int argc, char *argv[]) {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
long long x, y;
string s;
cin >> x >> y >> s;
p.resize(n), m.resize(n);
p[i] = make_pair(x, y);
if (s[0] == 'R')
m[i] = make_pair(1, 0);
else if (s[0] == 'L')
m[i] = make_pair(-1, 0);
else if (s[0] == 'U')
m[i] = make_pair(0, 1);
else if (s[0] == 'D')
m[i] = make_pair(0, -1);
}
double l = 0, r = 1e9;
for (int k = 0; k < 300; k++) {
double m1 = l + (r - l) / 3, m2 = r - (r - l) / 3;
if (func(m1) > func(m2))
l = m1;
else
r = m2;
}
double ans = func((l + r) / 2);
cout << fixed << setprecision(15) << ans << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 820,017 | 820,018 | u839953699 | cpp |
p03004 | // F - Minimum Bounding Box
#include <bits/stdc++.h>
using namespace std;
#define EPS 1e-9
int n;
vector<pair<long long, long long>> p, m;
double func(double t) {
double minx = 1e18, miny = 1e18, maxx = -1e18, maxy = -1e18;
for (int i = 0; i < n; i++) {
double x = p[i].first + t * m[i].first, y = p[i].second + t * m[i].second;
minx = min(minx, x);
maxx = max(maxx, x);
miny = min(miny, y);
maxy = max(maxy, y);
}
return (maxx - minx) * (maxy - miny);
}
int main(int argc, char *argv[]) {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
long long x, y;
string s;
cin >> x >> y >> s;
p.resize(n), m.resize(n);
p[i] = make_pair(x, y);
if (s[0] == 'R')
m[i] = make_pair(1, 0);
else if (s[0] == 'L')
m[i] = make_pair(-1, 0);
else if (s[0] == 'U')
m[i] = make_pair(0, 1);
else if (s[0] == 'D')
m[i] = make_pair(0, -1);
}
double l = 0, r = 1e9;
for (int k = 0; k < 80; k++) {
double m1 = l + (r - l) / 3, m2 = r - (r - l) / 3;
if (func(m1) > func(m2))
l = m1;
else
r = m2;
}
double ans = func((l + r) / 2);
cout << fixed << setprecision(15) << ans << endl;
return 0;
}
| // F - Minimum Bounding Box
#include <bits/stdc++.h>
using namespace std;
#define EPS 1e-9
int n;
vector<pair<long long, long long>> p, m;
double func(double t) {
double minx = 1e18, miny = 1e18, maxx = -1e18, maxy = -1e18;
for (int i = 0; i < n; i++) {
double x = p[i].first + t * m[i].first, y = p[i].second + t * m[i].second;
minx = min(minx, x);
maxx = max(maxx, x);
miny = min(miny, y);
maxy = max(maxy, y);
}
return (maxx - minx) * (maxy - miny);
}
int main(int argc, char *argv[]) {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
long long x, y;
string s;
cin >> x >> y >> s;
p.resize(n), m.resize(n);
p[i] = make_pair(x, y);
if (s[0] == 'R')
m[i] = make_pair(1, 0);
else if (s[0] == 'L')
m[i] = make_pair(-1, 0);
else if (s[0] == 'U')
m[i] = make_pair(0, 1);
else if (s[0] == 'D')
m[i] = make_pair(0, -1);
}
double l = 0, r = 1e9;
for (int k = 0; k < 300; k++) {
double m1 = l + (r - l) / 3, m2 = r - (r - l) / 3;
if (func(m1) > func(m2))
l = m1;
else
r = m2;
}
double ans = func((l + r) / 2);
cout << fixed << setprecision(15) << ans << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 820,019 | 820,018 | u839953699 | cpp |
p03004 | // F - Minimum Bounding Box
#include <bits/stdc++.h>
using namespace std;
#define EPS 1e-9
int n;
vector<pair<long long, long long>> p, m;
double func(double t) {
double minx = 1e18, miny = 1e18, maxx = -1e18, maxy = -1e18;
for (int i = 0; i < n; i++) {
double x = p[i].first + t * m[i].first, y = p[i].second + t * m[i].second;
minx = min(minx, x);
maxx = max(maxx, x);
miny = min(miny, y);
maxy = max(maxy, y);
}
return (maxx - minx) * (maxy - miny);
}
int main(int argc, char *argv[]) {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
long long x, y;
string s;
cin >> x >> y >> s;
p.resize(n), m.resize(n);
p[i] = make_pair(x, y);
if (s[0] == 'R')
m[i] = make_pair(1, 0);
else if (s[0] == 'L')
m[i] = make_pair(-1, 0);
else if (s[0] == 'U')
m[i] = make_pair(0, 1);
else if (s[0] == 'D')
m[i] = make_pair(0, -1);
}
double l = 0, r = 1e9;
for (int k = 0; k < 60; k++) {
double m1 = l + (r - l) / 3, m2 = r - (r - l) / 3;
if (func(m1) > func(m2))
l = m1;
else
r = m2;
}
double ans = func((l + r) / 2);
cout << fixed << setprecision(15) << ans << endl;
return 0;
}
| // F - Minimum Bounding Box
#include <bits/stdc++.h>
using namespace std;
#define EPS 1e-9
int n;
vector<pair<long long, long long>> p, m;
double func(double t) {
double minx = 1e18, miny = 1e18, maxx = -1e18, maxy = -1e18;
for (int i = 0; i < n; i++) {
double x = p[i].first + t * m[i].first, y = p[i].second + t * m[i].second;
minx = min(minx, x);
maxx = max(maxx, x);
miny = min(miny, y);
maxy = max(maxy, y);
}
return (maxx - minx) * (maxy - miny);
}
int main(int argc, char *argv[]) {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
long long x, y;
string s;
cin >> x >> y >> s;
p.resize(n), m.resize(n);
p[i] = make_pair(x, y);
if (s[0] == 'R')
m[i] = make_pair(1, 0);
else if (s[0] == 'L')
m[i] = make_pair(-1, 0);
else if (s[0] == 'U')
m[i] = make_pair(0, 1);
else if (s[0] == 'D')
m[i] = make_pair(0, -1);
}
double l = 0, r = 1e9;
for (int k = 0; k < 300; k++) {
double m1 = l + (r - l) / 3, m2 = r - (r - l) / 3;
if (func(m1) > func(m2))
l = m1;
else
r = m2;
}
double ans = func((l + r) / 2);
cout << fixed << setprecision(15) << ans << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 820,020 | 820,018 | u839953699 | cpp |
p03004 | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pf push_front
#define ppb pop_back
#define mp make_pair
#define bpp __builtin_popcountll
#define sqr(x) ((x) * (x))
#define al 0x3F3F3F3F
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define in insert
#define ppf pop_front
#define endl '\n'
#define int long long
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
const int mod = (int)1e9 + 7;
const int N = (int)2e5 + 123;
const ll inf = (ll)3e18 + 1;
const double pi = acos(-1.0);
const double eps = 1e-10;
const int dx[] = {0, 0, 1, 0, -1};
const int dy[] = {0, 1, 0, -1, 0};
int n;
ld x[N], y[N];
char d[N];
inline ld f(ld c) {
ld mx_x = -inf, mx_y = -inf, mn_x = inf, mn_y = inf;
for (int i = 1; i <= n; i++) {
if (d[i] == 'D') {
ld val = y[i] - c;
mx_y = max(mx_y, val);
mn_y = min(mn_y, val);
mx_x = max(mx_x, x[i]);
mn_x = min(mn_x, x[i]);
}
if (d[i] == 'U') {
ld val = y[i] + c;
mx_y = max(mx_y, val);
mn_y = min(mn_y, val);
mx_x = max(mx_x, x[i]);
mn_x = min(mn_x, x[i]);
}
if (d[i] == 'R') {
ld val = x[i] + c;
mx_x = max(mx_x, val);
mn_x = min(mn_x, val);
mx_y = max(mx_y, y[i]);
mn_y = min(mn_y, y[i]);
}
if (d[i] == 'L') {
ld val = x[i] - c;
mx_x = max(mx_x, val);
mn_x = min(mn_x, val);
mx_y = max(mx_y, y[i]);
mn_y = min(mn_y, y[i]);
}
}
return (mx_x - mn_x) * (mx_y - mn_y);
}
inline void boost() {
ios_base ::sync_with_stdio(NULL);
cin.tie(NULL), cout.tie(NULL);
}
inline void Solve() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> x[i] >> y[i] >> d[i];
ld l = 0.0, r = 100000000.0;
ld ans;
for (int it = 0; it <= 100; it++) {
ld h = (r - l) / 3.0;
ld m1 = l + h;
ld m2 = m1 + h;
ld M1 = f(m1), M2 = f(m2);
if (M1 < M2)
r = m2, ans = M1;
else
l = m1, ans = M2;
}
cout << fixed << setprecision(10) << ans;
}
main() {
// freopen (".in", "r", stdin);
// frexopen (".out", "w", stdout);
boost();
int tt = 1;
// cin >> tt;
while (tt--) {
Solve();
}
return 0;
}
| #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pf push_front
#define ppb pop_back
#define mp make_pair
#define bpp __builtin_popcountll
#define sqr(x) ((x) * (x))
#define al 0x3F3F3F3F
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define in insert
#define ppf pop_front
#define endl '\n'
#define int long long
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
const int mod = (int)1e9 + 7;
const int N = (int)2e5 + 123;
const ll inf = (ll)3e18 + 1;
const double pi = acos(-1.0);
const double eps = 1e-10;
const int dx[] = {0, 0, 1, 0, -1};
const int dy[] = {0, 1, 0, -1, 0};
int n;
ld x[N], y[N];
char d[N];
inline ld f(ld c) {
ld mx_x = -inf, mx_y = -inf, mn_x = inf, mn_y = inf;
for (int i = 1; i <= n; i++) {
if (d[i] == 'D') {
ld val = y[i] - c;
mx_y = max(mx_y, val);
mn_y = min(mn_y, val);
mx_x = max(mx_x, x[i]);
mn_x = min(mn_x, x[i]);
}
if (d[i] == 'U') {
ld val = y[i] + c;
mx_y = max(mx_y, val);
mn_y = min(mn_y, val);
mx_x = max(mx_x, x[i]);
mn_x = min(mn_x, x[i]);
}
if (d[i] == 'R') {
ld val = x[i] + c;
mx_x = max(mx_x, val);
mn_x = min(mn_x, val);
mx_y = max(mx_y, y[i]);
mn_y = min(mn_y, y[i]);
}
if (d[i] == 'L') {
ld val = x[i] - c;
mx_x = max(mx_x, val);
mn_x = min(mn_x, val);
mx_y = max(mx_y, y[i]);
mn_y = min(mn_y, y[i]);
}
}
return (mx_x - mn_x) * (mx_y - mn_y);
}
inline void boost() {
ios_base ::sync_with_stdio(NULL);
cin.tie(NULL), cout.tie(NULL);
}
inline void Solve() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> x[i] >> y[i] >> d[i];
ld l = 0.0, r = 100000000.0;
ld ans;
for (int it = 0; it <= 400; it++) {
ld h = (r - l) / 3.0;
ld m1 = l + h;
ld m2 = r - h;
ld M1 = f(m1), M2 = f(m2);
if (M1 < M2)
r = m2, ans = M1;
else
l = m1, ans = M2;
}
cout << fixed << setprecision(9) << ans;
}
main() {
// freopen (".in", "r", stdin);
// frexopen (".out", "w", stdout);
boost();
int tt = 1;
// cin >> tt;
while (tt--) {
Solve();
}
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"io.output.change"
] | 820,023 | 820,024 | u237010411 | cpp |
p03004 | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pf push_front
#define ppb pop_back
#define mp make_pair
#define bpp __builtin_popcountll
#define sqr(x) ((x) * (x))
#define al 0x3F3F3F3F
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define in insert
#define ppf pop_front
#define endl '\n'
#define int long long
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
const int mod = (int)1e9 + 7;
const int N = (int)2e5 + 123;
const ll inf = (ll)3e18 + 1;
const double pi = acos(-1.0);
const double eps = 1e-10;
const int dx[] = {0, 0, 1, 0, -1};
const int dy[] = {0, 1, 0, -1, 0};
int n;
ld x[N], y[N];
char d[N];
inline ld f(ld c) {
ld mx_x = -inf, mx_y = -inf, mn_x = inf, mn_y = inf;
for (int i = 1; i <= n; i++) {
if (d[i] == 'D') {
ld val = y[i] - c;
if (mx_y < val)
mx_y = val;
if (mn_y > val)
mn_y = val;
if (mx_x < x[i])
mx_x = x[i];
if (mn_x > x[i])
mn_x = x[i];
}
if (d[i] == 'U') {
ld val = y[i] + c;
if (mx_y < val)
mx_y = val;
if (mn_y > val)
mn_y = val;
if (mx_x < x[i])
mx_x = x[i];
if (mn_x > x[i])
mn_x = x[i];
}
if (d[i] == 'R') {
ld val = x[i] + c;
if (mx_x < val)
mx_x = val;
if (mn_x > val)
mn_x = val;
if (mx_y < y[i])
mx_y = y[i];
if (mn_y > y[i])
mn_y = y[i];
}
if (d[i] == 'L') {
ld val = x[i] - c;
if (mx_x < val)
mx_x = val;
if (mn_x > val)
mn_x = val;
if (mx_y < y[i])
mx_y = y[i];
if (mn_y > y[i])
mn_y = y[i];
}
}
return (mx_x - mn_x) * (mx_y - mn_y);
}
inline void boost() {
ios_base ::sync_with_stdio(NULL);
cin.tie(NULL), cout.tie(NULL);
}
inline void Solve() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> x[i] >> y[i] >> d[i];
ld l = 0.0, r = 100000000.0;
ld ans;
for (int it = 0; it <= 100; it++) {
ld h = (r - l) / 3.0;
ld m1 = l + h;
ld m2 = m1 + h;
ld M1 = f(m1), M2 = f(m2);
if (M1 < M2)
r = m2, ans = M1;
else
l = m1, ans = M2;
}
cout << fixed << setprecision(9) << ans;
}
main() {
// freopen (".in", "r", stdin);
// frexopen (".out", "w", stdout);
boost();
int tt = 1;
// cin >> tt;
while (tt--) {
Solve();
}
return 0;
}
| #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pf push_front
#define ppb pop_back
#define mp make_pair
#define bpp __builtin_popcountll
#define sqr(x) ((x) * (x))
#define al 0x3F3F3F3F
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define in insert
#define ppf pop_front
#define endl '\n'
#define int long long
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
const int mod = (int)1e9 + 7;
const int N = (int)2e5 + 123;
const ll inf = (ll)3e18 + 1;
const double pi = acos(-1.0);
const double eps = 1e-10;
const int dx[] = {0, 0, 1, 0, -1};
const int dy[] = {0, 1, 0, -1, 0};
int n;
ld x[N], y[N];
char d[N];
inline ld f(ld c) {
ld mx_x = -inf, mx_y = -inf, mn_x = inf, mn_y = inf;
for (int i = 1; i <= n; i++) {
if (d[i] == 'D') {
ld val = y[i] - c;
if (mx_y < val)
mx_y = val;
if (mn_y > val)
mn_y = val;
if (mx_x < x[i])
mx_x = x[i];
if (mn_x > x[i])
mn_x = x[i];
}
if (d[i] == 'U') {
ld val = y[i] + c;
if (mx_y < val)
mx_y = val;
if (mn_y > val)
mn_y = val;
if (mx_x < x[i])
mx_x = x[i];
if (mn_x > x[i])
mn_x = x[i];
}
if (d[i] == 'R') {
ld val = x[i] + c;
if (mx_x < val)
mx_x = val;
if (mn_x > val)
mn_x = val;
if (mx_y < y[i])
mx_y = y[i];
if (mn_y > y[i])
mn_y = y[i];
}
if (d[i] == 'L') {
ld val = x[i] - c;
if (mx_x < val)
mx_x = val;
if (mn_x > val)
mn_x = val;
if (mx_y < y[i])
mx_y = y[i];
if (mn_y > y[i])
mn_y = y[i];
}
}
return (mx_x - mn_x) * (mx_y - mn_y);
}
inline void boost() {
ios_base ::sync_with_stdio(NULL);
cin.tie(NULL), cout.tie(NULL);
}
inline void Solve() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> x[i] >> y[i] >> d[i];
ld l = 0.0, r = 100000000.0;
ld ans;
for (int it = 0; it <= 400; it++) {
ld h = (r - l) / 3.0;
ld m1 = l + h;
ld m2 = r - h;
ld M1 = f(m1), M2 = f(m2);
if (M1 < M2)
r = m2, ans = M1;
else
l = m1, ans = M2;
}
cout << fixed << setprecision(9) << ans;
}
main() {
// freopen (".in", "r", stdin);
// frexopen (".out", "w", stdout);
boost();
int tt = 1;
// cin >> tt;
while (tt--) {
Solve();
}
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 820,025 | 820,026 | u237010411 | cpp |
p03004 | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pf push_front
#define ppb pop_back
#define mp make_pair
#define bpp __builtin_popcountll
#define sqr(x) ((x) * (x))
#define al 0x3F3F3F3F
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define in insert
#define ppf pop_front
#define endl '\n'
#define int long long
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
const int mod = (int)1e9 + 7;
const int N = (int)2e5 + 123;
const ll inf = (ll)3e18 + 1;
const double pi = acos(-1.0);
const double eps = 1e-10;
const int dx[] = {0, 0, 1, 0, -1};
const int dy[] = {0, 1, 0, -1, 0};
int n;
ld x[N], y[N];
char d[N];
inline ld f(ld c) {
ld mx_x = -inf, mx_y = -inf, mn_x = inf, mn_y = inf;
for (int i = 1; i <= n; i++) {
if (d[i] == 'D') {
ld val = y[i] - c;
if (mx_y < val)
mx_y = val;
if (mn_y > val)
mn_y = val;
if (mx_x < x[i])
mx_x = x[i];
if (mn_x > x[i])
mn_x = x[i];
}
if (d[i] == 'U') {
ld val = y[i] + c;
if (mx_y < val)
mx_y = val;
if (mn_y > val)
mn_y = val;
if (mx_x < x[i])
mx_x = x[i];
if (mn_x > x[i])
mn_x = x[i];
}
if (d[i] == 'R') {
ld val = x[i] + c;
if (mx_x < val)
mx_x = val;
if (mn_x > val)
mn_x = val;
if (mx_y < y[i])
mx_y = y[i];
if (mn_y > y[i])
mn_y = y[i];
}
if (d[i] == 'L') {
ld val = x[i] - c;
if (mx_x < val)
mx_x = val;
if (mn_x > val)
mn_x = val;
if (mx_y < y[i])
mx_y = y[i];
if (mn_y > y[i])
mn_y = y[i];
}
}
return (mx_x - mn_x) * (mx_y - mn_y);
}
inline void boost() {
ios_base ::sync_with_stdio(NULL);
cin.tie(NULL), cout.tie(NULL);
}
inline void Solve() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> x[i] >> y[i] >> d[i];
ld l = 0.0, r = 100000000.0;
ld ans;
for (int it = 0; it <= 100; it++) {
ld h = (r - l) / 3.0;
ld m1 = l + h;
ld m2 = m1 - h;
ld M1 = f(m1), M2 = f(m2);
if (M1 < M2)
r = m2, ans = M1;
else
l = m1, ans = M2;
}
cout << fixed << setprecision(10) << ans;
}
main() {
// freopen (".in", "r", stdin);
// frexopen (".out", "w", stdout);
boost();
int tt = 1;
// cin >> tt;
while (tt--) {
Solve();
}
return 0;
}
| #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pf push_front
#define ppb pop_back
#define mp make_pair
#define bpp __builtin_popcountll
#define sqr(x) ((x) * (x))
#define al 0x3F3F3F3F
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define in insert
#define ppf pop_front
#define endl '\n'
#define int long long
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
const int mod = (int)1e9 + 7;
const int N = (int)2e5 + 123;
const ll inf = (ll)3e18 + 1;
const double pi = acos(-1.0);
const double eps = 1e-10;
const int dx[] = {0, 0, 1, 0, -1};
const int dy[] = {0, 1, 0, -1, 0};
int n;
ld x[N], y[N];
char d[N];
inline ld f(ld c) {
ld mx_x = -inf, mx_y = -inf, mn_x = inf, mn_y = inf;
for (int i = 1; i <= n; i++) {
if (d[i] == 'D') {
ld val = y[i] - c;
if (mx_y < val)
mx_y = val;
if (mn_y > val)
mn_y = val;
if (mx_x < x[i])
mx_x = x[i];
if (mn_x > x[i])
mn_x = x[i];
}
if (d[i] == 'U') {
ld val = y[i] + c;
if (mx_y < val)
mx_y = val;
if (mn_y > val)
mn_y = val;
if (mx_x < x[i])
mx_x = x[i];
if (mn_x > x[i])
mn_x = x[i];
}
if (d[i] == 'R') {
ld val = x[i] + c;
if (mx_x < val)
mx_x = val;
if (mn_x > val)
mn_x = val;
if (mx_y < y[i])
mx_y = y[i];
if (mn_y > y[i])
mn_y = y[i];
}
if (d[i] == 'L') {
ld val = x[i] - c;
if (mx_x < val)
mx_x = val;
if (mn_x > val)
mn_x = val;
if (mx_y < y[i])
mx_y = y[i];
if (mn_y > y[i])
mn_y = y[i];
}
}
return (mx_x - mn_x) * (mx_y - mn_y);
}
inline void boost() {
ios_base ::sync_with_stdio(NULL);
cin.tie(NULL), cout.tie(NULL);
}
inline void Solve() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> x[i] >> y[i] >> d[i];
ld l = 0.0, r = 100000000.0;
ld ans;
for (int it = 0; it <= 400; it++) {
ld h = (r - l) / 3.0;
ld m1 = l + h;
ld m2 = r - h;
ld M1 = f(m1), M2 = f(m2);
if (M1 < M2)
r = m2, ans = M1;
else
l = m1, ans = M2;
}
cout << fixed << setprecision(9) << ans;
}
main() {
// freopen (".in", "r", stdin);
// frexopen (".out", "w", stdout);
boost();
int tt = 1;
// cin >> tt;
while (tt--) {
Solve();
}
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"identifier.change",
"io.output.change"
] | 820,027 | 820,026 | u237010411 | cpp |
p03004 | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pf push_front
#define ppb pop_back
#define mp make_pair
#define bpp __builtin_popcountll
#define sqr(x) ((x) * (x))
#define al 0x3F3F3F3F
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define in insert
#define ppf pop_front
#define endl '\n'
#define int long long
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
const int mod = (int)1e9 + 7;
const int N = (int)2e5 + 123;
const ll inf = (ll)3e18 + 1;
const double pi = acos(-1.0);
const double eps = 1e-10;
const int dx[] = {0, 0, 1, 0, -1};
const int dy[] = {0, 1, 0, -1, 0};
int n;
ld x[N], y[N];
char d[N];
inline ld f(ld c) {
ld mx_x = -inf, mx_y = -inf, mn_x = inf, mn_y = inf;
for (int i = 1; i <= n; i++) {
if (d[i] == 'D') {
ld val = y[i] - c;
if (mx_y < val)
mx_y = val;
if (mn_y > val)
mn_y = val;
if (mx_x < x[i])
mx_x = x[i];
if (mn_x > x[i])
mn_x = x[i];
}
if (d[i] == 'U') {
ld val = y[i] + c;
if (mx_y < val)
mx_y = val;
if (mn_y > val)
mn_y = val;
if (mx_x < x[i])
mx_x = x[i];
if (mn_x > x[i])
mn_x = x[i];
}
if (d[i] == 'R') {
ld val = x[i] + c;
if (mx_x < val)
mx_x = val;
if (mn_x > val)
mn_x = val;
if (mx_y < y[i])
mx_y = y[i];
if (mn_y > y[i])
mn_y = y[i];
}
if (d[i] == 'L') {
ld val = x[i] - c;
if (mx_x < val)
mx_x = val;
if (mn_x > val)
mn_x = val;
if (mx_y < y[i])
mx_y = y[i];
if (mn_y > y[i])
mn_y = y[i];
}
}
return (mx_x - mn_x) * (mx_y - mn_y);
}
inline void boost() {
ios_base ::sync_with_stdio(NULL);
cin.tie(NULL), cout.tie(NULL);
}
inline void Solve() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> x[i] >> y[i] >> d[i];
ld l = 0.0, r = 100000000.0;
ld ans;
for (int it = 0; it <= 100; it++) {
ld h = (r - l) / 3.0;
ld m1 = l + h;
ld m2 = m1 + h;
ld M1 = f(m1), M2 = f(m2);
if (M1 < M2)
r = m2, ans = M1;
else
l = m1, ans = M2;
}
cout << fixed << setprecision(9) << ans;
}
main() {
// freopen (".in", "r", stdin);
// frexopen (".out", "w", stdout);
boost();
int tt = 1;
// cin >> tt;
while (tt--) {
Solve();
}
return 0;
}
| #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pf push_front
#define ppb pop_back
#define mp make_pair
#define bpp __builtin_popcountll
#define sqr(x) ((x) * (x))
#define al 0x3F3F3F3F
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define in insert
#define ppf pop_front
#define endl '\n'
#define int long long
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
const int mod = (int)1e9 + 7;
const int N = (int)2e5 + 123;
const ll inf = (ll)3e18 + 1;
const double pi = acos(-1.0);
const double eps = 1e-10;
const int dx[] = {0, 0, 1, 0, -1};
const int dy[] = {0, 1, 0, -1, 0};
int n;
ld x[N], y[N];
char d[N];
inline ld f(ld c) {
ld mx_x = -inf, mx_y = -inf, mn_x = inf, mn_y = inf;
for (int i = 1; i <= n; i++) {
if (d[i] == 'D') {
ld val = y[i] - c;
if (mx_y < val)
mx_y = val;
if (mn_y > val)
mn_y = val;
if (mx_x < x[i])
mx_x = x[i];
if (mn_x > x[i])
mn_x = x[i];
}
if (d[i] == 'U') {
ld val = y[i] + c;
if (mx_y < val)
mx_y = val;
if (mn_y > val)
mn_y = val;
if (mx_x < x[i])
mx_x = x[i];
if (mn_x > x[i])
mn_x = x[i];
}
if (d[i] == 'R') {
ld val = x[i] + c;
if (mx_x < val)
mx_x = val;
if (mn_x > val)
mn_x = val;
if (mx_y < y[i])
mx_y = y[i];
if (mn_y > y[i])
mn_y = y[i];
}
if (d[i] == 'L') {
ld val = x[i] - c;
if (mx_x < val)
mx_x = val;
if (mn_x > val)
mn_x = val;
if (mx_y < y[i])
mx_y = y[i];
if (mn_y > y[i])
mn_y = y[i];
}
}
return (mx_x - mn_x) * (mx_y - mn_y);
}
inline void boost() {
ios_base ::sync_with_stdio(NULL);
cin.tie(NULL), cout.tie(NULL);
}
inline void Solve() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> x[i] >> y[i] >> d[i];
ld l = 0.0, r = 100000000.0;
ld ans;
for (int it = 0; it <= 400; it++) {
ld h = (r - l) / 3.0;
ld m1 = l + h;
ld m2 = m1 + h;
ld M1 = f(m1), M2 = f(m2);
if (M1 < M2)
r = m2, ans = M1;
else
l = m1, ans = M2;
}
cout << fixed << setprecision(9) << ans;
}
main() {
// freopen (".in", "r", stdin);
// frexopen (".out", "w", stdout);
boost();
int tt = 1;
// cin >> tt;
while (tt--) {
Solve();
}
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 820,025 | 820,028 | u237010411 | cpp |
p03004 | #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pf push_front
#define ppb pop_back
#define mp make_pair
#define bpp __builtin_popcountll
#define sqr(x) ((x) * (x))
#define al 0x3F3F3F3F
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define in insert
#define ppf pop_front
#define endl '\n'
#define int long long
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
const int mod = (int)1e9 + 7;
const int N = (int)2e5 + 123;
const ll inf = (ll)3e18 + 1;
const double pi = acos(-1.0);
const double eps = 1e-10;
const int dx[] = {0, 0, 1, 0, -1};
const int dy[] = {0, 1, 0, -1, 0};
int n;
ld x[N], y[N];
char d[N];
inline ld f(ld c) {
ld mx_x = -inf, mx_y = -inf, mn_x = inf, mn_y = inf;
for (int i = 1; i <= n; i++) {
if (d[i] == 'D') {
ld val = y[i] - c;
if (mx_y < val)
mx_y = val;
if (mn_y > val)
mn_y = val;
if (mx_x < x[i])
mx_x = x[i];
if (mn_x > x[i])
mn_x = x[i];
}
if (d[i] == 'U') {
ld val = y[i] + c;
if (mx_y < val)
mx_y = val;
if (mn_y > val)
mn_y = val;
if (mx_x < x[i])
mx_x = x[i];
if (mn_x > x[i])
mn_x = x[i];
}
if (d[i] == 'R') {
ld val = x[i] + c;
if (mx_x < val)
mx_x = val;
if (mn_x > val)
mn_x = val;
if (mx_y < y[i])
mx_y = y[i];
if (mn_y > y[i])
mn_x = y[i];
}
if (d[i] == 'L') {
ld val = x[i] - c;
if (mx_x < val)
mx_x = val;
if (mn_x > val)
mn_x = val;
if (mx_y < y[i])
mx_y = y[i];
if (mn_y > y[i])
mn_x = y[i];
}
}
return (mx_x - mn_x) * (mx_y - mn_y);
}
inline void boost() {
ios_base ::sync_with_stdio(NULL);
cin.tie(NULL), cout.tie(NULL);
}
inline void Solve() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> x[i] >> y[i] >> d[i];
ld l = 0.0, r = 100000000.0;
ld ans;
for (int it = 0; it <= 100; it++) {
ld h = (r - l) / 3.0;
ld m1 = l + h;
ld m2 = m1 + h;
ld M1 = f(m1), M2 = f(m2);
if (M1 < M2)
r = m2, ans = M1;
else
l = m1, ans = M2;
}
cout << fixed << setprecision(10) << ans;
}
main() {
// freopen (".in", "r", stdin);
// frexopen (".out", "w", stdout);
boost();
int tt = 1;
// cin >> tt;
while (tt--) {
Solve();
}
return 0;
}
| #pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,sse3,sse4,popcnt,abm,mmx")
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define F first
#define S second
#define lb lower_bound
#define ub upper_bound
#define pb push_back
#define pf push_front
#define ppb pop_back
#define mp make_pair
#define bpp __builtin_popcountll
#define sqr(x) ((x) * (x))
#define al 0x3F3F3F3F
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define in insert
#define ppf pop_front
#define endl '\n'
#define int long long
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
const int mod = (int)1e9 + 7;
const int N = (int)2e5 + 123;
const ll inf = (ll)3e18 + 1;
const double pi = acos(-1.0);
const double eps = 1e-10;
const int dx[] = {0, 0, 1, 0, -1};
const int dy[] = {0, 1, 0, -1, 0};
int n;
ld x[N], y[N];
char d[N];
inline ld f(ld c) {
ld mx_x = -inf, mx_y = -inf, mn_x = inf, mn_y = inf;
for (int i = 1; i <= n; i++) {
if (d[i] == 'D') {
ld val = y[i] - c;
if (mx_y < val)
mx_y = val;
if (mn_y > val)
mn_y = val;
if (mx_x < x[i])
mx_x = x[i];
if (mn_x > x[i])
mn_x = x[i];
}
if (d[i] == 'U') {
ld val = y[i] + c;
if (mx_y < val)
mx_y = val;
if (mn_y > val)
mn_y = val;
if (mx_x < x[i])
mx_x = x[i];
if (mn_x > x[i])
mn_x = x[i];
}
if (d[i] == 'R') {
ld val = x[i] + c;
if (mx_x < val)
mx_x = val;
if (mn_x > val)
mn_x = val;
if (mx_y < y[i])
mx_y = y[i];
if (mn_y > y[i])
mn_y = y[i];
}
if (d[i] == 'L') {
ld val = x[i] - c;
if (mx_x < val)
mx_x = val;
if (mn_x > val)
mn_x = val;
if (mx_y < y[i])
mx_y = y[i];
if (mn_y > y[i])
mn_y = y[i];
}
}
return (mx_x - mn_x) * (mx_y - mn_y);
}
inline void boost() {
ios_base ::sync_with_stdio(NULL);
cin.tie(NULL), cout.tie(NULL);
}
inline void Solve() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> x[i] >> y[i] >> d[i];
ld l = 0.0, r = 100000000.0;
ld ans;
for (int it = 0; it <= 400; it++) {
ld h = (r - l) / 3.0;
ld m1 = l + h;
ld m2 = m1 + h;
ld M1 = f(m1), M2 = f(m2);
if (M1 < M2)
r = m2, ans = M1;
else
l = m1, ans = M2;
}
cout << fixed << setprecision(9) << ans;
}
main() {
// freopen (".in", "r", stdin);
// frexopen (".out", "w", stdout);
boost();
int tt = 1;
// cin >> tt;
while (tt--) {
Solve();
}
return 0;
}
| [
"assignment.variable.change",
"identifier.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"io.output.change"
] | 820,029 | 820,028 | u237010411 | cpp |
p03004 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define FORR(i, m, n) for (ll i = m; i >= n; i--)
#define REPO(i, n) for (ll i = 1; i <= n; i++)
#define ll long long
#define INF (ll)1 << 60
#define MINF (-1 * INF)
#define ALL(n) n.begin(), n.end()
#define MOD (ll)1000000007
#define P pair<ll, ll>
ll n;
double x[110000], y[110000];
char d[110000];
const double EPS = 1e-10;
double f(double a) {
double xmx = 1e8 * 3 * -1, xmi = 1e8 * 3, ymx = 1e8 * 3 * -1, ymi = 1e8 * 3;
REP(i, n) {
double nowx = x[i], nowy = y[i];
if (d[i] == 'R')
nowx += a;
if (d[i] == 'L')
nowx -= a;
if (d[i] == 'U')
nowy += a;
if (d[i] == 'D')
nowy -= a;
xmx = max(xmx, nowx);
xmi = min(xmi, nowx);
ymx = max(ymx, nowy);
ymi = min(ymi, nowy);
// cout << nowx << " " << nowy << endl;
}
// cout << xmx << " " << xmi << " " << ymx << " " << ymi << endl;
return (xmx - xmi) * (ymx - ymi);
}
int main() {
cin >> n;
REP(i, n) { cin >> x[i] >> y[i] >> d[i]; }
double low = 0.0, high = 1e8 * 3;
while (high - low > EPS) {
double width = high - low, ml = low + width / 3.0,
mr = low + 2.0 * width / 3.0;
if (f(ml) <= f(mr)) {
high = mr;
} else {
low = ml;
}
}
// cout << (high + low) * 0.5 << endl;
cout << setprecision(10) << fixed << f((high + low) * 0.5) << endl;
}
| #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, m, n) for (ll i = m; i < n; i++)
#define FORR(i, m, n) for (ll i = m; i >= n; i--)
#define REPO(i, n) for (ll i = 1; i <= n; i++)
#define ll long long
#define INF (ll)1 << 60
#define MINF (-1 * INF)
#define ALL(n) n.begin(), n.end()
#define MOD (ll)1000000007
#define P pair<ll, ll>
ll n;
double x[110000], y[110000];
char d[110000];
const double EPS = 1e-10;
double f(double a) {
double xmx = 1e8 * 3 * -1, xmi = 1e8 * 3, ymx = 1e8 * 3 * -1, ymi = 1e8 * 3;
REP(i, n) {
double nowx = x[i], nowy = y[i];
if (d[i] == 'R')
nowx += a;
if (d[i] == 'L')
nowx -= a;
if (d[i] == 'U')
nowy += a;
if (d[i] == 'D')
nowy -= a;
xmx = max(xmx, nowx);
xmi = min(xmi, nowx);
ymx = max(ymx, nowy);
ymi = min(ymi, nowy);
// cout << nowx << " " << nowy << endl;
}
// cout << xmx << " " << xmi << " " << ymx << " " << ymi << endl;
return (xmx - xmi) * (ymx - ymi);
}
int main() {
cin >> n;
REP(i, n) { cin >> x[i] >> y[i] >> d[i]; }
double low = 0.0, high = 1e8 * 3;
REP(i, 300) {
double width = high - low, ml = low + width / 3.0,
mr = low + 2.0 * width / 3.0;
if (f(ml) <= f(mr)) {
high = mr;
} else {
low = ml;
}
}
// cout << (high + low) * 0.5 << endl;
cout << setprecision(10) << fixed << f((high + low) * 0.5) << endl;
}
| [
"expression.operation.binary.remove"
] | 820,037 | 820,038 | u196497077 | cpp |
p03004 | #include <algorithm>
#include <cmath>
#include <cstdio>
typedef long double llf;
const int MN = 1e5 + 4;
const llf INF = 1e100, EPS = 7e-12, GR = (1 + sqrt(5)) / 2.0;
int N;
llf ans = INF;
struct pnt {
llf x, y;
llf ox, oy;
char c;
} pnts[MN];
static inline void mov(pnt &p, llf dt) {
switch (p.c) {
case 'R':
p.x = p.ox + dt;
p.y = p.oy;
break;
case 'L':
p.x = p.ox - dt;
p.y = p.oy;
break;
case 'U':
p.x = p.ox;
p.y = p.oy + dt;
break;
case 'D':
p.x = p.ox;
p.y = p.oy - dt;
break;
}
}
static inline llf bb() {
llf mxx = -INF, mxy = -INF, mnx = INF, mny = INF;
for (int i = 0; i < N; ++i) {
mxx = std::max(mxx, pnts[i].x);
mnx = std::min(mnx, pnts[i].x);
mxy = std::max(mxy, pnts[i].y);
mny = std::min(mny, pnts[i].y);
}
return (mxx - mnx) * (mxy - mny);
}
int main() {
scanf("%d", &N);
for (int i = 0; i < N; ++i) {
scanf("%Lf %Lf %c", &pnts[i].ox, &pnts[i].oy, &pnts[i].c);
}
// do GSS
llf lo = 0, hi = 1e9, mi1, mi2;
for (int i = 0; i < 80; ++i) {
mi1 = hi - (hi - lo) / GR;
mi2 = lo + (hi - lo) / GR;
llf b1, b2;
for (int i = 0; i < N; ++i)
mov(pnts[i], mi1);
b1 = bb();
for (int i = 0; i < N; ++i)
mov(pnts[i], mi2);
b2 = bb();
if (b1 < b2)
hi = mi2;
else
lo = mi1;
ans = std::min(std::min(b1, b2), ans);
}
printf("%.9Lf\n", ans);
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
typedef double llf;
const int MN = 1e5 + 4;
const llf INF = 1e100, EPS = 7e-12, GR = (1 + sqrt(5)) / 2.0;
int N;
llf ans = INF;
struct pnt {
llf x, y;
llf ox, oy;
char c;
} pnts[MN];
static inline void mov(pnt &p, llf dt) {
switch (p.c) {
case 'R':
p.x = p.ox + dt;
p.y = p.oy;
break;
case 'L':
p.x = p.ox - dt;
p.y = p.oy;
break;
case 'U':
p.x = p.ox;
p.y = p.oy + dt;
break;
case 'D':
p.x = p.ox;
p.y = p.oy - dt;
break;
}
}
static inline llf bb() {
llf mxx = -INF, mxy = -INF, mnx = INF, mny = INF;
for (int i = 0; i < N; ++i) {
mxx = std::max(mxx, pnts[i].x);
mnx = std::min(mnx, pnts[i].x);
mxy = std::max(mxy, pnts[i].y);
mny = std::min(mny, pnts[i].y);
}
return (mxx - mnx) * (mxy - mny);
}
int main() {
scanf("%d", &N);
for (int i = 0; i < N; ++i) {
scanf("%lf %lf %c", &pnts[i].ox, &pnts[i].oy, &pnts[i].c);
}
// do GSS
llf lo = 0, hi = 1e9, mi1, mi2;
for (int i = 0; i < 500; ++i) {
mi1 = hi - (hi - lo) / GR;
mi2 = lo + (hi - lo) / GR;
llf b1, b2;
for (int i = 0; i < N; ++i)
mov(pnts[i], mi1);
b1 = bb();
for (int i = 0; i < N; ++i)
mov(pnts[i], mi2);
b2 = bb();
if (b1 < b2)
hi = mi2;
else
lo = mi1;
ans = std::min(std::min(b1, b2), ans);
}
printf("%.9lf\n", ans);
}
| [
"variable_declaration.type.narrow.change",
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"io.output.change"
] | 820,041 | 820,042 | u596743351 | cpp |
p03004 | #include <algorithm>
#include <cmath>
#include <cstdio>
typedef long double llf;
const int MN = 1e5 + 4;
const llf INF = 1e100, EPS = 7e-12, GR = (1 + sqrt(5)) / 2.0;
int N;
llf ans = INF;
struct pnt {
llf x, y;
llf ox, oy;
char c;
} pnts[MN];
static inline void mov(pnt &p, llf dt) {
switch (p.c) {
case 'R':
p.x = p.ox + dt;
p.y = p.oy;
break;
case 'L':
p.x = p.ox - dt;
p.y = p.oy;
break;
case 'U':
p.x = p.ox;
p.y = p.oy + dt;
break;
case 'D':
p.x = p.ox;
p.y = p.oy - dt;
break;
}
}
static inline llf bb() {
llf mxx = -INF, mxy = -INF, mnx = INF, mny = INF;
for (int i = 0; i < N; ++i) {
mxx = std::max(mxx, pnts[i].x);
mnx = std::min(mnx, pnts[i].x);
mxy = std::max(mxy, pnts[i].y);
mny = std::min(mny, pnts[i].y);
}
return (mxx - mnx) * (mxy - mny);
}
int main() {
scanf("%d", &N);
for (int i = 0; i < N; ++i) {
scanf("%Lf %Lf %c", &pnts[i].ox, &pnts[i].oy, &pnts[i].c);
}
// do GSS
llf lo = 0, hi = 1e9, mi1, mi2;
for (int i = 0; i < 80; ++i) {
mi1 = hi - (hi - lo) / GR;
mi2 = lo + (hi - lo) / GR;
llf b1, b2;
for (int i = 0; i < N; ++i)
mov(pnts[i], mi1);
b1 = bb();
for (int i = 0; i < N; ++i)
mov(pnts[i], mi2);
b2 = bb();
if (b1 < b2)
hi = mi2;
else
lo = mi1;
ans = std::min(std::min(b1, b2), ans);
}
printf("%.9Lf\n", ans);
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
typedef long double llf;
const int MN = 1e5 + 4;
const llf INF = 1e100, EPS = 7e-12, GR = (1 + sqrt(5)) / 2.0;
int N;
llf ans = INF;
struct pnt {
llf x, y;
llf ox, oy;
char c;
} pnts[MN];
static inline void mov(pnt &p, llf dt) {
switch (p.c) {
case 'R':
p.x = p.ox + dt;
p.y = p.oy;
break;
case 'L':
p.x = p.ox - dt;
p.y = p.oy;
break;
case 'U':
p.x = p.ox;
p.y = p.oy + dt;
break;
case 'D':
p.x = p.ox;
p.y = p.oy - dt;
break;
}
}
static inline llf bb() {
llf mxx = -INF, mxy = -INF, mnx = INF, mny = INF;
for (int i = 0; i < N; ++i) {
mxx = std::max(mxx, pnts[i].x);
mnx = std::min(mnx, pnts[i].x);
mxy = std::max(mxy, pnts[i].y);
mny = std::min(mny, pnts[i].y);
}
return (mxx - mnx) * (mxy - mny);
}
int main() {
scanf("%d", &N);
for (int i = 0; i < N; ++i) {
scanf("%Lf %Lf %c", &pnts[i].ox, &pnts[i].oy, &pnts[i].c);
}
// do GSS
llf lo = 0, hi = 1e9, mi1, mi2;
for (int i = 0; i < 500; ++i) {
mi1 = hi - (hi - lo) / GR;
mi2 = lo + (hi - lo) / GR;
llf b1, b2;
for (int i = 0; i < N; ++i)
mov(pnts[i], mi1);
b1 = bb();
for (int i = 0; i < N; ++i)
mov(pnts[i], mi2);
b2 = bb();
if (b1 < b2)
hi = mi2;
else
lo = mi1;
ans = std::min(std::min(b1, b2), ans);
}
printf("%.9Lf\n", ans);
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 820,041 | 820,043 | u596743351 | cpp |
p03004 | #define LOCAL
#include "bits/stdc++.h"
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0);
#define LLINF ((long long)1e15) // 1234567890987654321
#define INF 1234567890ll
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define db 0
#define EPS (1e-12) // 0.0000001 the value
#define PI (acos((ld)-1.0))
#define MAXN (100006)
#define ll long double
#define ld long double
mt19937
rng(chrono::steady_clock::now()
.time_since_epoch()
.count()); // can be used by calling rng() or shuffle(A, A+n, rng)
#define FOR(ii, ss, ee) for (ll ii = ss; ii < (ll)ee; ++ii)
#define space " "
#define cbr cerr << "hi\n"
#define mmst(x, v) memset((x), v, sizeof((x)))
#define siz(x) ((ll)x.size())
#define ph push
#define btinpct(x) __builtin_popcountll((x))
#define all(x) (x).begin(), (x).end()
#define lbd(x, y) lower_bound(all(x), y)
#define ubd(x, y) upper_bound(all(x), y)
typedef pair<ll, ll> pi;
typedef pair<char, pi> spi;
typedef pair<pi, pi> dpi;
// inline ll rand(ll x, ll y) { ++y; return (rng() % (y-x)) + x; }
// //inclusivesss string to_string(char c) {string s(1,c);return s;}string
// to_string(bool b){return (b ? "true" : "false");}template <typename A,
// typename B>string to_string(pair<A, B> p) {return "(" + to_string(p.first) +
// ", " + to_string(p.second) + ")";}template <typename A>string to_string(A v)
// {bool first = true;string res = "{";for (const auto &x : v) {if (!first) {res
// += ", ";}first = false;res += to_string(x);}res += "}";return res;}void
// degug_out() { cerr << endl; }template <typename Head, typename... Tail>void
// degug_out(Head H, Tail... T) {cerr << " " <<
// to_string(H);degug_out(T...);}inline ll gcd(ll a,ll
// b){if(a>b)swap(a,b);if(a==0)return b;return gcd(b%a,a);}
#ifdef LOCAL
#define degug(...) cerr << "[" << #__VA_ARGS__ << "]:", degug_out(__VA_ARGS__)
#else
#define degug(...) 42
#define cerr \
if (0) \
cout
#endif
ll n;
spi A[MAXN];
ll tstar(ll x) {
ll mxx = -LLINF, mix = LLINF, may = -LLINF, miy = LLINF;
FOR(ii, 0, n) {
int i = ii;
ll movex = 0, movey = 0;
if (A[i].f == 'L') {
movex -= x;
} else if (A[i].f == 'R') {
movex += x;
} else if (A[i].f == 'D') {
movey -= x;
} else if (A[i].f == 'U') {
movey += x;
} else
assert(0);
mxx = max(mxx, movex + A[i].s.f);
mix = min(mix, movex + A[i].s.f);
may = max(may, movey + A[i].s.s);
miy = min(miy, movey + A[i].s.s);
}
return (mxx - mix) * (may - miy);
}
int main() {
FAST cin >> n;
FOR(i, 0, n) { cin >> A[(int)i].s.f >> A[(int)i].s.s >> A[(int)i].f; }
ll st = 0, en = 2e8 + 100;
FOR(i, 0, 100) {
ll lmid = st + (en - st) / (ld)3;
ll umid = en - (en - st) / (ld)3;
if (st == lmid && en == umid)
break;
if (tstar(lmid) > tstar(umid))
st = lmid;
else
en = umid;
}
cout << fixed << setprecision(15) << tstar((st + en) / (ld)2) << '\n';
}
| #define LOCAL
#include "bits/stdc++.h"
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0);
#define LLINF ((long long)1e15) // 1234567890987654321
#define INF 1234567890ll
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define db 0
#define EPS (1e-12) // 0.0000001 the value
#define PI (acos((ld)-1.0))
#define MAXN (100006)
#define ll long double
#define ld long double
mt19937
rng(chrono::steady_clock::now()
.time_since_epoch()
.count()); // can be used by calling rng() or shuffle(A, A+n, rng)
#define FOR(ii, ss, ee) for (ll ii = ss; ii < (ll)ee; ++ii)
#define space " "
#define cbr cerr << "hi\n"
#define mmst(x, v) memset((x), v, sizeof((x)))
#define siz(x) ((ll)x.size())
#define ph push
#define btinpct(x) __builtin_popcountll((x))
#define all(x) (x).begin(), (x).end()
#define lbd(x, y) lower_bound(all(x), y)
#define ubd(x, y) upper_bound(all(x), y)
typedef pair<ll, ll> pi;
typedef pair<char, pi> spi;
typedef pair<pi, pi> dpi;
// inline ll rand(ll x, ll y) { ++y; return (rng() % (y-x)) + x; }
// //inclusivesss string to_string(char c) {string s(1,c);return s;}string
// to_string(bool b){return (b ? "true" : "false");}template <typename A,
// typename B>string to_string(pair<A, B> p) {return "(" + to_string(p.first) +
// ", " + to_string(p.second) + ")";}template <typename A>string to_string(A v)
// {bool first = true;string res = "{";for (const auto &x : v) {if (!first) {res
// += ", ";}first = false;res += to_string(x);}res += "}";return res;}void
// degug_out() { cerr << endl; }template <typename Head, typename... Tail>void
// degug_out(Head H, Tail... T) {cerr << " " <<
// to_string(H);degug_out(T...);}inline ll gcd(ll a,ll
// b){if(a>b)swap(a,b);if(a==0)return b;return gcd(b%a,a);}
#ifdef LOCAL
#define degug(...) cerr << "[" << #__VA_ARGS__ << "]:", degug_out(__VA_ARGS__)
#else
#define degug(...) 42
#define cerr \
if (0) \
cout
#endif
ll n;
spi A[MAXN];
ll tstar(ll x) {
ll mxx = -LLINF, mix = LLINF, may = -LLINF, miy = LLINF;
FOR(ii, 0, n) {
int i = ii;
ll movex = 0, movey = 0;
if (A[i].f == 'L') {
movex -= x;
} else if (A[i].f == 'R') {
movex += x;
} else if (A[i].f == 'D') {
movey -= x;
} else if (A[i].f == 'U') {
movey += x;
} else
assert(0);
mxx = max(mxx, movex + A[i].s.f);
mix = min(mix, movex + A[i].s.f);
may = max(may, movey + A[i].s.s);
miy = min(miy, movey + A[i].s.s);
}
return (mxx - mix) * (may - miy);
}
int main() {
FAST cin >> n;
FOR(i, 0, n) { cin >> A[(int)i].s.f >> A[(int)i].s.s >> A[(int)i].f; }
ll st = 0, en = 2e8 + 100;
FOR(i, 0, 120) {
ll lmid = st + (en - st) / (ld)3;
ll umid = en - (en - st) / (ld)3;
if (st == lmid && en == umid)
break;
if (tstar(lmid) > tstar(umid))
st = lmid;
else
en = umid;
}
cout << fixed << setprecision(15) << tstar((st + en) / (ld)2) << '\n';
}
| [
"literal.number.change",
"call.arguments.change"
] | 820,047 | 820,048 | u844961982 | cpp |
p03004 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int N;
vector<pair<double, pair<double, int>>> calc(vector<int> x, vector<int> d) {
int eqmax = -1e9, eqmin = 1e9, upmax = -1e9, upmin = 1e9, downmax = -1e9,
downmin = 1e9;
for (int i = 0; i < N; i++) {
if (d[i] == 0) {
eqmax = max(eqmax, x[i]);
eqmin = max(eqmin, x[i]);
} else if (d[i] == 1) {
upmax = max(upmax, x[i]);
upmin = min(upmin, x[i]);
} else {
downmax = max(downmax, x[i]);
downmin = min(downmin, x[i]);
}
}
vector<pair<double, pair<double, int>>> mi, ma;
if (eqmax > -1e9) {
if (eqmax < downmax) {
if (upmax > -1e9) {
if (upmax < downmax) {
double mit = (downmax - upmax) / 2.0;
if (downmax - mit < eqmax) {
ma = {{0, {downmax, -1}},
{downmax - eqmax, {eqmax, 0}},
{eqmax - upmax, {eqmax, 1}}};
} else {
ma = {{0, {downmax, -1}}, {mit, {downmax - mit, 1}}};
}
} else {
if (upmax < eqmax) {
ma = {{0, {eqmax, 0}}, {eqmax - upmax, {eqmax, 1}}};
} else {
ma = {{0, {upmax, 1}}};
}
}
} else {
ma = {{0, {downmax, -1}}, {downmax - eqmax, {eqmax, 0}}};
}
} else {
if (upmax > -1e9) {
if (eqmax > upmax) {
ma = {{0, {eqmax, 0}}, {eqmax - upmax, {eqmax, 1}}};
} else {
ma = {{0, {upmax, 1}}};
}
} else {
ma = {{0, {eqmax, 0}}};
}
}
} else {
if (downmax > -1e9) {
if (upmax > -1e9) {
if (upmax < downmax) {
ma = {{0, {downmax, -1}},
{(downmax - upmax) / 2.0, {(downmax + upmax) / 2.0, 1}}};
} else {
ma = {{0, {upmax, 1}}};
}
} else {
ma = {{0, {downmax, -1}}};
}
} else {
ma = {{0, {upmax, 1}}};
}
}
if (eqmin < 1e9) {
if (eqmin > upmin) {
if (downmin < 1e9) {
if (downmin > upmin) {
double mit = (downmin - upmin) / 2.0;
if (downmin - mit > eqmin) {
mi = {{0, {upmin, 1}},
{eqmin - upmin, {eqmin, 0}},
{downmin - eqmin, {eqmin, -1}}};
} else {
mi = {{0, {upmin, 1}}, {mit, {downmin - mit, -1}}};
}
} else {
if (downmin > eqmin) {
mi = {{0, {eqmin, 0}}, {downmin - eqmin, {eqmin, -1}}};
} else {
mi = {{0, {downmin, -1}}};
}
}
} else {
mi = {{0, {upmin, 1}}, {eqmin - upmin, {eqmin, 0}}};
}
} else {
if (downmin < 1e9) {
if (eqmin < downmin) {
mi = {{0, {eqmin, 0}}, {downmin - eqmin, {eqmin, -1}}};
} else {
mi = {{0, {downmin, -1}}};
}
} else {
mi = {{0, {eqmin, 0}}};
}
}
} else {
if (upmin < 1e9) {
if (downmin < 1e9) {
if (upmin < downmin) {
mi = {{0, {upmin, 1}},
{(downmin - upmin) / 2.0, {(downmin + upmin) / 2.0, -1}}};
} else {
mi = {{0, {downmin, -1}}};
}
} else {
mi = {{0, {upmin, 1}}};
}
} else {
mi = {{0, {downmin, -1}}};
}
}
vector<pair<double, pair<double, int>>> ret;
vector<double> epoc;
for (int i = 0; i < ma.size(); i++)
epoc.push_back(ma[i].first);
for (int i = 0; i < mi.size(); i++)
epoc.push_back(mi[i].first);
sort(epoc.begin(), epoc.end());
double M = ma[0].second.first, m = mi[0].second.first;
int idM = 0, idm = 0;
for (double nowt : epoc) {
while (idM + 1 < ma.size() && ma[idM + 1].first <= nowt) {
idM++;
M = ma[idM].second.first;
}
while (idm + 1 < mi.size() && mi[idm + 1].first <= nowt) {
idm++;
m = mi[idm].second.first;
}
M += (nowt - ma[idM].first) * ma[idM].second.second;
m += (nowt - mi[idm].first) * mi[idm].second.second;
ret.push_back(make_pair(
nowt, make_pair(M - m, ma[idM].second.second - mi[idm].second.second)));
}
return ret;
}
main() {
cin >> N;
vector<int> x, y;
vector<char> d;
for (int i = 0; i < N; i++) {
int a, b;
char c;
cin >> a >> b >> c;
x.push_back(a);
y.push_back(b);
d.push_back(c);
}
vector<int> E(N);
for (int i = 0; i < N; i++) {
E[i] = d[i] == 'L' ? -1 : d[i] == 'R' ? 1 : 0;
}
vector<pair<double, pair<double, int>>> A = calc(x, E);
for (int i = 0; i < N; i++) {
E[i] = d[i] == 'D' ? -1 : d[i] == 'U' ? 1 : 0;
}
vector<pair<double, pair<double, int>>> B = calc(y, E);
vector<double> T;
for (pair<double, pair<double, int>> p : A)
T.push_back(p.first);
for (pair<double, pair<double, int>> p : B)
T.push_back(p.first);
sort(T.begin(), T.end());
double ans = 1e150;
int ia = 0, ib = 0;
for (double nowt : T) {
double xm = 1e150, xM = -1e150, ym = 1e150, yM = -1e150;
for (int i = 0; i < N; i++) {
xm = min(xm, nowt * (d[i] == 'L' ? -1 : d[i] == 'R' ? 1 : 0) + x[i]);
xM = max(xM, nowt * (d[i] == 'L' ? -1 : d[i] == 'R' ? 1 : 0) + x[i]);
ym = min(ym, nowt * (d[i] == 'D' ? -1 : d[i] == 'U' ? 1 : 0) + y[i]);
yM = max(yM, nowt * (d[i] == 'D' ? -1 : d[i] == 'U' ? 1 : 0) + y[i]);
}
ans = min(ans, (xM - xm) * (yM - ym));
}
cout << fixed << setprecision(9) << ans << endl;
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int N;
vector<pair<double, pair<double, int>>> calc(vector<int> x, vector<int> d) {
int eqmax = -1e9, eqmin = 1e9, upmax = -1e9, upmin = 1e9, downmax = -1e9,
downmin = 1e9;
for (int i = 0; i < N; i++) {
if (d[i] == 0) {
eqmax = max(eqmax, x[i]);
eqmin = min(eqmin, x[i]);
} else if (d[i] == 1) {
upmax = max(upmax, x[i]);
upmin = min(upmin, x[i]);
} else {
downmax = max(downmax, x[i]);
downmin = min(downmin, x[i]);
}
}
vector<pair<double, pair<double, int>>> mi, ma;
if (eqmax > -1e9) {
if (eqmax < downmax) {
if (upmax > -1e9) {
if (upmax < downmax) {
double mit = (downmax - upmax) / 2.0;
if (downmax - mit < eqmax) {
ma = {{0, {downmax, -1}},
{downmax - eqmax, {eqmax, 0}},
{eqmax - upmax, {eqmax, 1}}};
} else {
ma = {{0, {downmax, -1}}, {mit, {downmax - mit, 1}}};
}
} else {
if (upmax < eqmax) {
ma = {{0, {eqmax, 0}}, {eqmax - upmax, {eqmax, 1}}};
} else {
ma = {{0, {upmax, 1}}};
}
}
} else {
ma = {{0, {downmax, -1}}, {downmax - eqmax, {eqmax, 0}}};
}
} else {
if (upmax > -1e9) {
if (eqmax > upmax) {
ma = {{0, {eqmax, 0}}, {eqmax - upmax, {eqmax, 1}}};
} else {
ma = {{0, {upmax, 1}}};
}
} else {
ma = {{0, {eqmax, 0}}};
}
}
} else {
if (downmax > -1e9) {
if (upmax > -1e9) {
if (upmax < downmax) {
ma = {{0, {downmax, -1}},
{(downmax - upmax) / 2.0, {(downmax + upmax) / 2.0, 1}}};
} else {
ma = {{0, {upmax, 1}}};
}
} else {
ma = {{0, {downmax, -1}}};
}
} else {
ma = {{0, {upmax, 1}}};
}
}
if (eqmin < 1e9) {
if (eqmin > upmin) {
if (downmin < 1e9) {
if (downmin > upmin) {
double mit = (downmin - upmin) / 2.0;
if (downmin - mit > eqmin) {
mi = {{0, {upmin, 1}},
{eqmin - upmin, {eqmin, 0}},
{downmin - eqmin, {eqmin, -1}}};
} else {
mi = {{0, {upmin, 1}}, {mit, {downmin - mit, -1}}};
}
} else {
if (downmin > eqmin) {
mi = {{0, {eqmin, 0}}, {downmin - eqmin, {eqmin, -1}}};
} else {
mi = {{0, {downmin, -1}}};
}
}
} else {
mi = {{0, {upmin, 1}}, {eqmin - upmin, {eqmin, 0}}};
}
} else {
if (downmin < 1e9) {
if (eqmin < downmin) {
mi = {{0, {eqmin, 0}}, {downmin - eqmin, {eqmin, -1}}};
} else {
mi = {{0, {downmin, -1}}};
}
} else {
mi = {{0, {eqmin, 0}}};
}
}
} else {
if (upmin < 1e9) {
if (downmin < 1e9) {
if (upmin < downmin) {
mi = {{0, {upmin, 1}},
{(downmin - upmin) / 2.0, {(downmin + upmin) / 2.0, -1}}};
} else {
mi = {{0, {downmin, -1}}};
}
} else {
mi = {{0, {upmin, 1}}};
}
} else {
mi = {{0, {downmin, -1}}};
}
}
vector<pair<double, pair<double, int>>> ret;
vector<double> epoc;
for (int i = 0; i < ma.size(); i++)
epoc.push_back(ma[i].first);
for (int i = 0; i < mi.size(); i++)
epoc.push_back(mi[i].first);
sort(epoc.begin(), epoc.end());
double M = ma[0].second.first, m = mi[0].second.first;
int idM = 0, idm = 0;
for (double nowt : epoc) {
while (idM + 1 < ma.size() && ma[idM + 1].first <= nowt) {
idM++;
M = ma[idM].second.first;
}
while (idm + 1 < mi.size() && mi[idm + 1].first <= nowt) {
idm++;
m = mi[idm].second.first;
}
M += (nowt - ma[idM].first) * ma[idM].second.second;
m += (nowt - mi[idm].first) * mi[idm].second.second;
ret.push_back(make_pair(
nowt, make_pair(M - m, ma[idM].second.second - mi[idm].second.second)));
}
return ret;
}
main() {
cin >> N;
vector<int> x, y;
vector<char> d;
for (int i = 0; i < N; i++) {
int a, b;
char c;
cin >> a >> b >> c;
x.push_back(a);
y.push_back(b);
d.push_back(c);
}
vector<int> E(N);
for (int i = 0; i < N; i++) {
E[i] = d[i] == 'L' ? -1 : d[i] == 'R' ? 1 : 0;
}
vector<pair<double, pair<double, int>>> A = calc(x, E);
for (int i = 0; i < N; i++) {
E[i] = d[i] == 'D' ? -1 : d[i] == 'U' ? 1 : 0;
}
vector<pair<double, pair<double, int>>> B = calc(y, E);
vector<double> T;
for (pair<double, pair<double, int>> p : A)
T.push_back(p.first);
for (pair<double, pair<double, int>> p : B)
T.push_back(p.first);
sort(T.begin(), T.end());
double ans = 1e150;
int ia = 0, ib = 0;
for (double nowt : T) {
double xm = 1e150, xM = -1e150, ym = 1e150, yM = -1e150;
for (int i = 0; i < N; i++) {
xm = min(xm, nowt * (d[i] == 'L' ? -1 : d[i] == 'R' ? 1 : 0) + x[i]);
xM = max(xM, nowt * (d[i] == 'L' ? -1 : d[i] == 'R' ? 1 : 0) + x[i]);
ym = min(ym, nowt * (d[i] == 'D' ? -1 : d[i] == 'U' ? 1 : 0) + y[i]);
yM = max(yM, nowt * (d[i] == 'D' ? -1 : d[i] == 'U' ? 1 : 0) + y[i]);
}
ans = min(ans, (xM - xm) * (yM - ym));
}
cout << fixed << setprecision(9) << ans << endl;
}
| [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 820,057 | 820,058 | u657913472 | cpp |
p03004 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int N;
vector<double> calc(vector<int> x, vector<int> d) {
int eqmax = -1e9, eqmin = 1e9, upmax = -1e9, upmin = 1e9, downmax = -1e9,
downmin = 1e9;
for (int i = 0; i < N; i++) {
if (d[i] == 0) {
eqmax = max(eqmax, x[i]);
eqmin = max(eqmin, x[i]);
} else if (d[i] == 1) {
upmax = max(upmax, x[i]);
upmin = min(upmin, x[i]);
} else {
downmax = max(downmax, x[i]);
downmin = min(downmin, x[i]);
}
}
vector<double> ret;
ret.push_back(0);
if (eqmax > -1e9) {
if (eqmax < downmax) {
if (upmax > -1e9) {
if (upmax < downmax) {
double mit = (downmax - upmax) / 2.0;
if (downmax - mit < eqmax) {
ret.push_back(downmax - eqmax);
ret.push_back(eqmax - upmax);
} else {
ret.push_back(mit);
}
}
} else {
ret.push_back(downmax - eqmax);
}
} else {
if (upmax > -1e9) {
if (eqmax > upmax) {
ret.push_back(eqmax - upmax);
}
}
}
} else {
if (downmax > -1e9) {
if (upmax > -1e9) {
if (upmax < downmax) {
ret.push_back((downmax - upmax) / 2.0);
}
}
}
}
if (eqmin < 1e9) {
if (eqmin > upmin) {
if (downmin < 1e9) {
if (downmin > upmin) {
double mit = (downmin - upmin) / 2.0;
if (downmin - mit > eqmin) {
ret.push_back(eqmin - upmin);
ret.push_back(downmin - eqmin);
} else {
ret.push_back(mit);
}
}
} else {
ret.push_back(eqmin - upmin);
}
} else {
if (downmin < 1e9) {
if (eqmin < downmin) {
ret.push_back(downmin - eqmin);
}
}
}
} else {
if (upmin < 1e9) {
if (downmin < 1e9) {
if (upmin < downmin) {
ret.push_back((downmin - upmin) / 2.0);
}
}
}
}
return ret;
}
main() {
cin >> N;
vector<int> x, y;
vector<char> d;
for (int i = 0; i < N; i++) {
int a, b;
char c;
cin >> a >> b >> c;
x.push_back(a);
y.push_back(b);
d.push_back(c);
}
vector<int> E(N);
for (int i = 0; i < N; i++) {
E[i] = d[i] == 'L' ? -1 : d[i] == 'R' ? 1 : 0;
}
vector<double> A = calc(x, E);
for (int i = 0; i < N; i++) {
E[i] = d[i] == 'D' ? -1 : d[i] == 'U' ? 1 : 0;
}
vector<double> B = calc(y, E);
vector<double> T;
for (double p : A)
T.push_back(p);
for (double p : B)
T.push_back(p);
double ans = 1e150;
for (double nowt : T) {
double xm = 1e150, xM = -1e150, ym = 1e150, yM = -1e150;
for (int i = 0; i < N; i++) {
xm = min(xm, nowt * (d[i] == 'L' ? -1 : d[i] == 'R' ? 1 : 0) + x[i]);
xM = max(xM, nowt * (d[i] == 'L' ? -1 : d[i] == 'R' ? 1 : 0) + x[i]);
ym = min(ym, nowt * (d[i] == 'D' ? -1 : d[i] == 'U' ? 1 : 0) + y[i]);
yM = max(yM, nowt * (d[i] == 'D' ? -1 : d[i] == 'U' ? 1 : 0) + y[i]);
}
ans = min(ans, (xM - xm) * (yM - ym));
}
cout << fixed << setprecision(16) << ans << endl;
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int N;
vector<double> calc(vector<int> x, vector<int> d) {
int eqmax = -1e9, eqmin = 1e9, upmax = -1e9, upmin = 1e9, downmax = -1e9,
downmin = 1e9;
for (int i = 0; i < N; i++) {
if (d[i] == 0) {
eqmax = max(eqmax, x[i]);
eqmin = min(eqmin, x[i]);
} else if (d[i] == 1) {
upmax = max(upmax, x[i]);
upmin = min(upmin, x[i]);
} else {
downmax = max(downmax, x[i]);
downmin = min(downmin, x[i]);
}
}
vector<double> ret;
ret.push_back(0);
if (eqmax > -1e9) {
if (eqmax < downmax) {
if (upmax > -1e9) {
if (upmax < downmax) {
double mit = (downmax - upmax) / 2.0;
if (downmax - mit < eqmax) {
ret.push_back(downmax - eqmax);
ret.push_back(eqmax - upmax);
} else {
ret.push_back(mit);
}
}
} else {
ret.push_back(downmax - eqmax);
}
} else {
if (upmax > -1e9) {
if (eqmax > upmax) {
ret.push_back(eqmax - upmax);
}
}
}
} else {
if (downmax > -1e9) {
if (upmax > -1e9) {
if (upmax < downmax) {
ret.push_back((downmax - upmax) / 2.0);
}
}
}
}
if (eqmin < 1e9) {
if (eqmin > upmin) {
if (downmin < 1e9) {
if (downmin > upmin) {
double mit = (downmin - upmin) / 2.0;
if (downmin - mit > eqmin) {
ret.push_back(eqmin - upmin);
ret.push_back(downmin - eqmin);
} else {
ret.push_back(mit);
}
}
} else {
ret.push_back(eqmin - upmin);
}
} else {
if (downmin < 1e9) {
if (eqmin < downmin) {
ret.push_back(downmin - eqmin);
}
}
}
} else {
if (upmin < 1e9) {
if (downmin < 1e9) {
if (upmin < downmin) {
ret.push_back((downmin - upmin) / 2.0);
}
}
}
}
return ret;
}
main() {
cin >> N;
vector<int> x, y;
vector<char> d;
for (int i = 0; i < N; i++) {
int a, b;
char c;
cin >> a >> b >> c;
x.push_back(a);
y.push_back(b);
d.push_back(c);
}
vector<int> E(N);
for (int i = 0; i < N; i++) {
E[i] = d[i] == 'L' ? -1 : d[i] == 'R' ? 1 : 0;
}
vector<double> A = calc(x, E);
for (int i = 0; i < N; i++) {
E[i] = d[i] == 'D' ? -1 : d[i] == 'U' ? 1 : 0;
}
vector<double> B = calc(y, E);
vector<double> T;
for (double p : A)
T.push_back(p);
for (double p : B)
T.push_back(p);
double ans = 1e150;
for (double nowt : T) {
double xm = 1e150, xM = -1e150, ym = 1e150, yM = -1e150;
for (int i = 0; i < N; i++) {
xm = min(xm, nowt * (d[i] == 'L' ? -1 : d[i] == 'R' ? 1 : 0) + x[i]);
xM = max(xM, nowt * (d[i] == 'L' ? -1 : d[i] == 'R' ? 1 : 0) + x[i]);
ym = min(ym, nowt * (d[i] == 'D' ? -1 : d[i] == 'U' ? 1 : 0) + y[i]);
yM = max(yM, nowt * (d[i] == 'D' ? -1 : d[i] == 'U' ? 1 : 0) + y[i]);
}
ans = min(ans, (xM - xm) * (yM - ym));
}
cout << fixed << setprecision(9) << ans << endl;
}
| [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change",
"literal.number.change",
"io.output.change"
] | 820,059 | 820,060 | u657913472 | cpp |
p03004 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int N;
vector<double> calc(vector<int> x, vector<int> d) {
int eqmax = -1e9, eqmin = 1e9, upmax = -1e9, upmin = 1e9, downmax = -1e9,
downmin = 1e9;
for (int i = 0; i < N; i++) {
if (d[i] == 0) {
eqmax = max(eqmax, x[i]);
eqmin = max(eqmin, x[i]);
} else if (d[i] == 1) {
upmax = max(upmax, x[i]);
upmin = min(upmin, x[i]);
} else {
downmax = max(downmax, x[i]);
downmin = min(downmin, x[i]);
}
}
vector<double> ret;
ret.push_back(0);
if (eqmax > -1e9) {
if (eqmax < downmax) {
if (upmax > -1e9) {
if (upmax < downmax) {
double mit = (downmax - upmax) / 2.0;
if (downmax - mit < eqmax) {
ret.push_back(downmax - eqmax);
ret.push_back(eqmax - upmax);
} else {
ret.push_back(mit);
}
}
} else {
ret.push_back(downmax - eqmax);
}
} else {
if (upmax > -1e9) {
if (eqmax > upmax) {
ret.push_back(eqmax - upmax);
}
}
}
} else {
if (downmax > -1e9) {
if (upmax > -1e9) {
if (upmax < downmax) {
ret.push_back((downmax - upmax) / 2.0);
}
}
}
}
if (eqmin < 1e9) {
if (eqmin > upmin) {
if (downmin < 1e9) {
if (downmin > upmin) {
double mit = (downmin - upmin) / 2.0;
if (downmin - mit > eqmin) {
ret.push_back(eqmin - upmin);
ret.push_back(downmin - eqmin);
} else {
ret.push_back(mit);
}
}
} else {
ret.push_back(eqmin - upmin);
}
} else {
if (downmin < 1e9) {
if (eqmin < downmin) {
ret.push_back(downmin - eqmin);
}
}
}
} else {
if (upmin < 1e9) {
if (downmin < 1e9) {
if (upmin < downmin) {
ret.push_back((downmin - upmin) / 2.0);
}
}
}
}
return ret;
}
main() {
cin >> N;
vector<int> x, y;
vector<char> d;
for (int i = 0; i < N; i++) {
int a, b;
char c;
cin >> a >> b >> c;
x.push_back(a);
y.push_back(b);
d.push_back(c);
}
vector<int> E(N);
for (int i = 0; i < N; i++) {
E[i] = d[i] == 'L' ? -1 : d[i] == 'R' ? 1 : 0;
}
vector<double> A = calc(x, E);
for (int i = 0; i < N; i++) {
E[i] = d[i] == 'D' ? -1 : d[i] == 'U' ? 1 : 0;
}
vector<double> B = calc(y, E);
vector<double> T;
for (double p : A)
T.push_back(p);
for (double p : B)
T.push_back(p);
double ans = 1e150;
for (double nowt : T) {
double xm = 1e150, xM = -1e150, ym = 1e150, yM = -1e150;
for (int i = 0; i < N; i++) {
xm = min(xm, nowt * (d[i] == 'L' ? -1 : d[i] == 'R' ? 1 : 0) + x[i]);
xM = max(xM, nowt * (d[i] == 'L' ? -1 : d[i] == 'R' ? 1 : 0) + x[i]);
ym = min(ym, nowt * (d[i] == 'D' ? -1 : d[i] == 'U' ? 1 : 0) + y[i]);
yM = max(yM, nowt * (d[i] == 'D' ? -1 : d[i] == 'U' ? 1 : 0) + y[i]);
}
ans = min(ans, (xM - xm) * (yM - ym));
}
cout << fixed << setprecision(9) << ans << endl;
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int N;
vector<double> calc(vector<int> x, vector<int> d) {
int eqmax = -1e9, eqmin = 1e9, upmax = -1e9, upmin = 1e9, downmax = -1e9,
downmin = 1e9;
for (int i = 0; i < N; i++) {
if (d[i] == 0) {
eqmax = max(eqmax, x[i]);
eqmin = min(eqmin, x[i]);
} else if (d[i] == 1) {
upmax = max(upmax, x[i]);
upmin = min(upmin, x[i]);
} else {
downmax = max(downmax, x[i]);
downmin = min(downmin, x[i]);
}
}
vector<double> ret;
ret.push_back(0);
if (eqmax > -1e9) {
if (eqmax < downmax) {
if (upmax > -1e9) {
if (upmax < downmax) {
double mit = (downmax - upmax) / 2.0;
if (downmax - mit < eqmax) {
ret.push_back(downmax - eqmax);
ret.push_back(eqmax - upmax);
} else {
ret.push_back(mit);
}
}
} else {
ret.push_back(downmax - eqmax);
}
} else {
if (upmax > -1e9) {
if (eqmax > upmax) {
ret.push_back(eqmax - upmax);
}
}
}
} else {
if (downmax > -1e9) {
if (upmax > -1e9) {
if (upmax < downmax) {
ret.push_back((downmax - upmax) / 2.0);
}
}
}
}
if (eqmin < 1e9) {
if (eqmin > upmin) {
if (downmin < 1e9) {
if (downmin > upmin) {
double mit = (downmin - upmin) / 2.0;
if (downmin - mit > eqmin) {
ret.push_back(eqmin - upmin);
ret.push_back(downmin - eqmin);
} else {
ret.push_back(mit);
}
}
} else {
ret.push_back(eqmin - upmin);
}
} else {
if (downmin < 1e9) {
if (eqmin < downmin) {
ret.push_back(downmin - eqmin);
}
}
}
} else {
if (upmin < 1e9) {
if (downmin < 1e9) {
if (upmin < downmin) {
ret.push_back((downmin - upmin) / 2.0);
}
}
}
}
return ret;
}
main() {
cin >> N;
vector<int> x, y;
vector<char> d;
for (int i = 0; i < N; i++) {
int a, b;
char c;
cin >> a >> b >> c;
x.push_back(a);
y.push_back(b);
d.push_back(c);
}
vector<int> E(N);
for (int i = 0; i < N; i++) {
E[i] = d[i] == 'L' ? -1 : d[i] == 'R' ? 1 : 0;
}
vector<double> A = calc(x, E);
for (int i = 0; i < N; i++) {
E[i] = d[i] == 'D' ? -1 : d[i] == 'U' ? 1 : 0;
}
vector<double> B = calc(y, E);
vector<double> T;
for (double p : A)
T.push_back(p);
for (double p : B)
T.push_back(p);
double ans = 1e150;
for (double nowt : T) {
double xm = 1e150, xM = -1e150, ym = 1e150, yM = -1e150;
for (int i = 0; i < N; i++) {
xm = min(xm, nowt * (d[i] == 'L' ? -1 : d[i] == 'R' ? 1 : 0) + x[i]);
xM = max(xM, nowt * (d[i] == 'L' ? -1 : d[i] == 'R' ? 1 : 0) + x[i]);
ym = min(ym, nowt * (d[i] == 'D' ? -1 : d[i] == 'U' ? 1 : 0) + y[i]);
yM = max(yM, nowt * (d[i] == 'D' ? -1 : d[i] == 'U' ? 1 : 0) + y[i]);
}
ans = min(ans, (xM - xm) * (yM - ym));
}
cout << fixed << setprecision(9) << ans << endl;
}
| [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 820,061 | 820,060 | u657913472 | cpp |
p03004 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;
template <class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;
int main() {
int n;
cin >> n;
vector<int> x(n), y(n);
vector<char> d(n);
for (int i = 0; i < n; ++i) {
cin >> x[i] >> y[i] >> d[i];
}
double l = -INF<int>, r = INF<int>;
double xmax = INF<ll>, xmin = -INF<ll>, ymax = INF<ll>, ymin = -INF<ll>;
double xmax2 = INF<ll>, xmin2 = -INF<ll>, ymax2 = INF<ll>, ymin2 = -INF<ll>;
for (int i = 0; i < 300; ++i) {
double lb = (l * 2 + r) / 3, ub = (l + 2 * r) / 3;
xmax = -INF<ll>, xmin = INF<ll>, ymax = -INF<ll>, ymin = INF<ll>;
xmax2 = -INF<ll>, xmin2 = INF<ll>, ymax2 = -INF<ll>, ymin2 = INF<ll>;
for (int j = 0; j < n; ++j) {
double X1 = x[j], Y1 = y[j], X2 = x[j], Y2 = y[j];
if (d[j] == 'R')
X1 += lb, X2 += ub;
if (d[j] == 'L')
X1 -= lb, X2 -= ub;
if (d[j] == 'U')
Y1 += lb, Y2 += ub;
if (d[j] == 'D')
Y1 -= lb, Y2 -= ub;
xmax = max(xmax, X1);
xmin = min(xmin, X1);
ymax = max(ymax, Y1);
ymin = min(ymin, Y1);
xmax2 = max(xmax2, X2);
xmin2 = min(xmin2, X2);
ymax2 = max(ymax2, Y2);
ymin2 = min(ymin2, Y2);
}
if ((xmax - xmin) * (ymax - ymin) < (xmax2 - xmin2) * (ymax2 - ymin2))
r = ub;
else
l = lb;
}
cout << setprecision(15) << (xmax - xmin) * (ymax - ymin) << "\n";
return 0;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;
template <class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;
int main() {
int n;
cin >> n;
vector<int> x(n), y(n);
vector<char> d(n);
for (int i = 0; i < n; ++i) {
cin >> x[i] >> y[i] >> d[i];
}
double l = 0, r = INF<int>;
double xmax = INF<ll>, xmin = -INF<ll>, ymax = INF<ll>, ymin = -INF<ll>;
double xmax2 = INF<ll>, xmin2 = -INF<ll>, ymax2 = INF<ll>, ymin2 = -INF<ll>;
for (int i = 0; i < 300; ++i) {
double lb = (l * 2 + r) / 3, ub = (l + 2 * r) / 3;
xmax = -INF<ll>, xmin = INF<ll>, ymax = -INF<ll>, ymin = INF<ll>;
xmax2 = -INF<ll>, xmin2 = INF<ll>, ymax2 = -INF<ll>, ymin2 = INF<ll>;
for (int j = 0; j < n; ++j) {
double X1 = x[j], Y1 = y[j], X2 = x[j], Y2 = y[j];
if (d[j] == 'R')
X1 += lb, X2 += ub;
if (d[j] == 'L')
X1 -= lb, X2 -= ub;
if (d[j] == 'U')
Y1 += lb, Y2 += ub;
if (d[j] == 'D')
Y1 -= lb, Y2 -= ub;
xmax = max(xmax, X1);
xmin = min(xmin, X1);
ymax = max(ymax, Y1);
ymin = min(ymin, Y1);
xmax2 = max(xmax2, X2);
xmin2 = min(xmin2, X2);
ymax2 = max(ymax2, Y2);
ymin2 = min(ymin2, Y2);
}
if ((xmax - xmin) * (ymax - ymin) < (xmax2 - xmin2) * (ymax2 - ymin2))
r = ub;
else
l = lb;
}
cout << setprecision(15) << (xmax - xmin) * (ymax - ymin) << "\n";
return 0;
} | [
"variable_declaration.value.change"
] | 820,101 | 820,102 | u915020369 | cpp |
p03004 | #include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
vector<char> c;
vector<long long int> x, y;
long long int n;
long double kansu(long double t) {
// cout << " t = " << t << endl;
if (t < 0)
return 1145141919191919191919191919.00L;
long double xmax = x[0];
long double xmin = x[0];
long double ymax = y[0];
long double ymin = y[0];
if (c[0] == 'U') {
ymax += t;
ymin += t;
} else if (c[0] == 'D') {
ymax -= t;
ymin -= t;
} else if (c[0] == 'R') {
xmax += t;
xmin += t;
} else if (c[0] == 'L') {
xmax -= t;
xmin -= t;
}
for (long long int i = 0; i < n; i++) {
long double xx = x[i];
long double yy = y[i];
if (c[i] == 'U') {
yy += t;
} else if (c[i] == 'D') {
yy -= t;
} else if (c[i] == 'R') {
xx += t;
} else if (c[i] == 'L') {
xx -= t;
}
xmax = max(xmax, xx);
xmin = min(xmin, xx);
ymax = max(ymax, yy);
ymin = min(ymin, yy);
}
return (xmax - xmin) * (ymax - ymin);
}
int main() {
cin >> n;
// uxmax uxmin uymax uymin
long long int mm[16] = {};
// U D R L
bool f[256] = {};
for (long long int i = 0; i < n; i++) {
long long int xx, yy;
char cc;
cin >> xx >> yy >> cc;
x.push_back(xx);
y.push_back(yy);
c.push_back(cc);
if (cc == 'U') {
if (f[0] == false) {
f[0] = true;
mm[0] = xx;
mm[1] = xx;
mm[2] = yy;
mm[3] = yy;
} else {
mm[0] = max(mm[0], xx);
mm[1] = min(mm[1], xx);
mm[2] = max(mm[2], yy);
mm[3] = min(mm[3], yy);
}
} else if (cc == 'D') {
if (f[1] == false) {
f[1] = true;
mm[4] = xx;
mm[5] = xx;
mm[6] = yy;
mm[7] = yy;
} else {
mm[4] = max(mm[4], xx);
mm[5] = min(mm[5], xx);
mm[6] = max(mm[6], yy);
mm[7] = min(mm[7], yy);
}
} else if (cc == 'R') {
if (f[2] == false) {
f[2] = true;
mm[8] = xx;
mm[9] = xx;
mm[10] = yy;
mm[11] = yy;
} else {
mm[8] = max(mm[8], xx);
mm[9] = min(mm[9], xx);
mm[10] = max(mm[10], yy);
mm[11] = min(mm[11], yy);
}
} else if (cc == 'L') {
if (f[3] == false) {
f[3] = true;
mm[12] = xx;
mm[13] = xx;
mm[14] = yy;
mm[15] = yy;
} else {
mm[12] = max(mm[12], xx);
mm[13] = min(mm[13], xx);
mm[14] = max(mm[14], yy);
mm[15] = min(mm[15], yy);
}
}
}
long double ans = kansu(0);
if (f[0] == true) {
if (f[1] == true) {
ans = min(ans, kansu(0.50L * (mm[6] - mm[2])));
ans = min(ans, kansu(0.50L * (mm[6] - mm[3])));
ans = min(ans, kansu(0.50L * (mm[7] - mm[2])));
ans = min(ans, kansu(0.50L * (mm[7] - mm[3])));
}
if (f[2] == true) {
ans = min(ans, kansu(mm[10] - mm[2]));
ans = min(ans, kansu(mm[10] - mm[3]));
ans = min(ans, kansu(mm[11] - mm[2]));
ans = min(ans, kansu(mm[11] - mm[3]));
}
if (f[3] == true) {
ans = min(ans, kansu(mm[14] - mm[2]));
ans = min(ans, kansu(mm[14] - mm[3]));
ans = min(ans, kansu(mm[15] - mm[2]));
ans = min(ans, kansu(mm[15] - mm[3]));
}
} else if (f[1] == true) {
if (f[2] == true) {
ans = min(ans, kansu(mm[6] - mm[10]));
ans = min(ans, kansu(mm[6] - mm[11]));
ans = min(ans, kansu(mm[7] - mm[10]));
ans = min(ans, kansu(mm[7] - mm[11]));
}
if (f[3] == true) {
ans = min(ans, kansu(mm[6] - mm[14]));
ans = min(ans, kansu(mm[6] - mm[15]));
ans = min(ans, kansu(mm[7] - mm[14]));
ans = min(ans, kansu(mm[7] - mm[15]));
}
} else if (f[2] == true) {
if (f[0] == true) {
ans = min(ans, kansu(mm[0] - mm[8]));
ans = min(ans, kansu(mm[0] - mm[9]));
ans = min(ans, kansu(mm[1] - mm[8]));
ans = min(ans, kansu(mm[1] - mm[9]));
}
if (f[1] == true) {
ans = min(ans, kansu(mm[4] - mm[8]));
ans = min(ans, kansu(mm[4] - mm[9]));
ans = min(ans, kansu(mm[5] - mm[8]));
ans = min(ans, kansu(mm[5] - mm[9]));
}
if (f[3] == true) {
ans = min(ans, kansu(0.50L * (mm[12] - mm[8])));
ans = min(ans, kansu(0.50L * (mm[12] - mm[9])));
ans = min(ans, kansu(0.50L * (mm[13] - mm[8])));
ans = min(ans, kansu(0.50L * (mm[13] - mm[9])));
}
} else if (f[3] == true) {
if (f[0] == true) {
ans = min(ans, kansu(mm[12] - mm[0]));
ans = min(ans, kansu(mm[12] - mm[1]));
ans = min(ans, kansu(mm[13] - mm[0]));
ans = min(ans, kansu(mm[13] - mm[1]));
}
if (f[1] == true) {
ans = min(ans, kansu(mm[12] - mm[4]));
ans = min(ans, kansu(mm[12] - mm[5]));
ans = min(ans, kansu(mm[13] - mm[4]));
ans = min(ans, kansu(mm[13] - mm[5]));
}
}
cout << fixed << setprecision(2) << ans << endl;
return 0;
}
| #include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
vector<char> c;
vector<long long int> x, y;
long long int n;
long double kansu(long double t) {
// cout << " t = " << t << endl;
if (t < 0)
return 1145141919191919191919191919.00L;
long double xmax = x[0];
long double xmin = x[0];
long double ymax = y[0];
long double ymin = y[0];
if (c[0] == 'U') {
ymax += t;
ymin += t;
} else if (c[0] == 'D') {
ymax -= t;
ymin -= t;
} else if (c[0] == 'R') {
xmax += t;
xmin += t;
} else if (c[0] == 'L') {
xmax -= t;
xmin -= t;
}
for (long long int i = 0; i < n; i++) {
long double xx = x[i];
long double yy = y[i];
if (c[i] == 'U') {
yy += t;
} else if (c[i] == 'D') {
yy -= t;
} else if (c[i] == 'R') {
xx += t;
} else if (c[i] == 'L') {
xx -= t;
}
xmax = max(xmax, xx);
xmin = min(xmin, xx);
ymax = max(ymax, yy);
ymin = min(ymin, yy);
}
return (xmax - xmin) * (ymax - ymin);
}
int main() {
cin >> n;
// uxmax uxmin uymax uymin
long long int mm[16] = {};
// U D R L
bool f[256] = {};
for (long long int i = 0; i < n; i++) {
long long int xx, yy;
char cc;
cin >> xx >> yy >> cc;
x.push_back(xx);
y.push_back(yy);
c.push_back(cc);
if (cc == 'U') {
if (f[0] == false) {
f[0] = true;
mm[0] = xx;
mm[1] = xx;
mm[2] = yy;
mm[3] = yy;
} else {
mm[0] = max(mm[0], xx);
mm[1] = min(mm[1], xx);
mm[2] = max(mm[2], yy);
mm[3] = min(mm[3], yy);
}
} else if (cc == 'D') {
if (f[1] == false) {
f[1] = true;
mm[4] = xx;
mm[5] = xx;
mm[6] = yy;
mm[7] = yy;
} else {
mm[4] = max(mm[4], xx);
mm[5] = min(mm[5], xx);
mm[6] = max(mm[6], yy);
mm[7] = min(mm[7], yy);
}
} else if (cc == 'R') {
if (f[2] == false) {
f[2] = true;
mm[8] = xx;
mm[9] = xx;
mm[10] = yy;
mm[11] = yy;
} else {
mm[8] = max(mm[8], xx);
mm[9] = min(mm[9], xx);
mm[10] = max(mm[10], yy);
mm[11] = min(mm[11], yy);
}
} else if (cc == 'L') {
if (f[3] == false) {
f[3] = true;
mm[12] = xx;
mm[13] = xx;
mm[14] = yy;
mm[15] = yy;
} else {
mm[12] = max(mm[12], xx);
mm[13] = min(mm[13], xx);
mm[14] = max(mm[14], yy);
mm[15] = min(mm[15], yy);
}
}
}
long double ans = kansu(0);
if (f[0] == true) {
if (f[1] == true) {
ans = min(ans, kansu(0.50L * (mm[6] - mm[2])));
ans = min(ans, kansu(0.50L * (mm[6] - mm[3])));
ans = min(ans, kansu(0.50L * (mm[7] - mm[2])));
ans = min(ans, kansu(0.50L * (mm[7] - mm[3])));
}
if (f[2] == true) {
ans = min(ans, kansu(mm[10] - mm[2]));
ans = min(ans, kansu(mm[10] - mm[3]));
ans = min(ans, kansu(mm[11] - mm[2]));
ans = min(ans, kansu(mm[11] - mm[3]));
}
if (f[3] == true) {
ans = min(ans, kansu(mm[14] - mm[2]));
ans = min(ans, kansu(mm[14] - mm[3]));
ans = min(ans, kansu(mm[15] - mm[2]));
ans = min(ans, kansu(mm[15] - mm[3]));
}
}
if (f[1] == true) {
if (f[2] == true) {
ans = min(ans, kansu(mm[6] - mm[10]));
ans = min(ans, kansu(mm[6] - mm[11]));
ans = min(ans, kansu(mm[7] - mm[10]));
ans = min(ans, kansu(mm[7] - mm[11]));
}
if (f[3] == true) {
ans = min(ans, kansu(mm[6] - mm[14]));
ans = min(ans, kansu(mm[6] - mm[15]));
ans = min(ans, kansu(mm[7] - mm[14]));
ans = min(ans, kansu(mm[7] - mm[15]));
}
}
if (f[2] == true) {
if (f[0] == true) {
ans = min(ans, kansu(mm[0] - mm[8]));
ans = min(ans, kansu(mm[0] - mm[9]));
ans = min(ans, kansu(mm[1] - mm[8]));
ans = min(ans, kansu(mm[1] - mm[9]));
}
if (f[1] == true) {
ans = min(ans, kansu(mm[4] - mm[8]));
ans = min(ans, kansu(mm[4] - mm[9]));
ans = min(ans, kansu(mm[5] - mm[8]));
ans = min(ans, kansu(mm[5] - mm[9]));
}
if (f[3] == true) {
ans = min(ans, kansu(0.50L * (mm[12] - mm[8])));
ans = min(ans, kansu(0.50L * (mm[12] - mm[9])));
ans = min(ans, kansu(0.50L * (mm[13] - mm[8])));
ans = min(ans, kansu(0.50L * (mm[13] - mm[9])));
}
}
if (f[3] == true) {
if (f[0] == true) {
ans = min(ans, kansu(mm[12] - mm[0]));
ans = min(ans, kansu(mm[12] - mm[1]));
ans = min(ans, kansu(mm[13] - mm[0]));
ans = min(ans, kansu(mm[13] - mm[1]));
}
if (f[1] == true) {
ans = min(ans, kansu(mm[12] - mm[4]));
ans = min(ans, kansu(mm[12] - mm[5]));
ans = min(ans, kansu(mm[13] - mm[4]));
ans = min(ans, kansu(mm[13] - mm[5]));
}
}
cout << fixed << setprecision(2) << ans << endl;
return 0;
}
| [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 820,103 | 820,104 | u676042970 | cpp |
p03004 |
#include <bits/stdc++.h>
using namespace std;
// types - only for stuff used a lot
using ll = long long;
using ld = long double;
#define vv vector
#define Pp pair
// IO
#define get(x) scanf("%d", &x)
#define getl(x) scanf("%lld", &x);
// Operations
#define pb push_back
#define pob pop_back
#define sz(a) int(a.size())
#define re(a, b) a = max(a, b) // relax
#define ri(a, b) a = min(a, b) // relaxi
// Debugging
#ifndef LOCAL
#define cerr \
if (0) \
cerr
#else
#define cerr cout
#endif
#define print(arr, n) \
{ \
for (int _ = 0; _ < n; _++) \
cerr << arr[_] << " "; \
cerr << endl; \
}
#define printv(vec) \
{ \
for (int _ : vec) \
cerr << _ << " "; \
cerr << endl; \
}
const int mod = 1e9 + 7, oo = 1e9;
const ll loo = 1e18;
// Functions
ll modpow(ll a, ll b) {
ll ans = 1; // faster modpow than recursive
for (; b; b /= 2, a = a * a % mod)
if (b & 1)
ans = (ans * a) % mod;
return ans;
}
ll gcd(ll a, ll b) {
while (a)
b %= a, swap(a, b);
return b;
}
#define bitcount __builtin_popcountll
#define f(i, a, b) for (int i = a; i < b; i++)
#define fr(i, a, b) for (int i = b - 1; i >= a; i--)
/*
ALRIGHT HACKERS, THIS IS WHERE THE ACTUAL CODE BEGINS
*/
const bool DEBUG = 1;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifdef LOCAL
if (DEBUG)
freopen("input.txt", "r", stdin);
if (DEBUG)
freopen("output.txt", "w", stdout);
clock_t start = clock();
#endif
int n;
cin >> n;
int x[n], y[n];
int dx[n], dy[n];
f(i, 0, n) {
cin >> x[i] >> y[i];
string s;
cin >> s;
dx[i] = dy[i] = 0;
if (s == "U")
dy[i] = 1;
if (s == "D")
dy[i] = -1;
if (s == "L")
dx[i] = -1;
if (s == "R")
dx[i] = 1;
}
auto eval = [&](ld t) {
ld x_min = loo, x_max = -loo, y_min = loo, y_max = -loo;
f(i, 0, n) {
ri(x_min, x[i] + dx[i] * t);
re(x_max, x[i] + dx[i] * t);
ri(y_min, y[i] + dy[i] * t);
re(y_max, y[i] + dy[i] * t);
}
return (x_max - x_min) * (y_max - y_min);
};
ld lo = 0, hi = 2e8;
f(_, 0, 100) {
ld mid1 = lo + (hi - lo) / 3;
ld mid2 = hi - (hi - lo) / 3;
ld a = eval(mid1), b = eval(mid2);
if (a < b)
hi = mid2;
else
lo = mid1;
}
printf("%.20Lf\n", eval(lo));
#ifdef LOCAL
cout << setprecision(12) << (long double)(clock() - start) / CLOCKS_PER_SEC
<< endl;
#endif
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
// types - only for stuff used a lot
using ll = long long;
using ld = long double;
#define vv vector
#define Pp pair
// IO
#define get(x) scanf("%d", &x)
#define getl(x) scanf("%lld", &x);
// Operations
#define pb push_back
#define pob pop_back
#define sz(a) int(a.size())
#define re(a, b) a = max(a, b) // relax
#define ri(a, b) a = min(a, b) // relaxi
// Debugging
#ifndef LOCAL
#define cerr \
if (0) \
cerr
#else
#define cerr cout
#endif
#define print(arr, n) \
{ \
for (int _ = 0; _ < n; _++) \
cerr << arr[_] << " "; \
cerr << endl; \
}
#define printv(vec) \
{ \
for (int _ : vec) \
cerr << _ << " "; \
cerr << endl; \
}
const int mod = 1e9 + 7, oo = 1e9;
const ll loo = 1e18;
// Functions
ll modpow(ll a, ll b) {
ll ans = 1; // faster modpow than recursive
for (; b; b /= 2, a = a * a % mod)
if (b & 1)
ans = (ans * a) % mod;
return ans;
}
ll gcd(ll a, ll b) {
while (a)
b %= a, swap(a, b);
return b;
}
#define bitcount __builtin_popcountll
#define f(i, a, b) for (int i = a; i < b; i++)
#define fr(i, a, b) for (int i = b - 1; i >= a; i--)
/*
ALRIGHT HACKERS, THIS IS WHERE THE ACTUAL CODE BEGINS
*/
const bool DEBUG = 1;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifdef LOCAL
if (DEBUG)
freopen("input.txt", "r", stdin);
if (DEBUG)
freopen("output.txt", "w", stdout);
clock_t start = clock();
#endif
int n;
cin >> n;
int x[n], y[n];
int dx[n], dy[n];
f(i, 0, n) {
cin >> x[i] >> y[i];
string s;
cin >> s;
dx[i] = dy[i] = 0;
if (s == "U")
dy[i] = 1;
if (s == "D")
dy[i] = -1;
if (s == "L")
dx[i] = -1;
if (s == "R")
dx[i] = 1;
}
auto eval = [&](ld t) {
ld x_min = loo, x_max = -loo, y_min = loo, y_max = -loo;
f(i, 0, n) {
ri(x_min, x[i] + dx[i] * t);
re(x_max, x[i] + dx[i] * t);
ri(y_min, y[i] + dy[i] * t);
re(y_max, y[i] + dy[i] * t);
}
return (x_max - x_min) * (y_max - y_min);
};
ld lo = 0, hi = 1e10;
f(_, 0, 300) {
ld mid1 = lo + (hi - lo) / 3;
ld mid2 = hi - (hi - lo) / 3;
ld a = eval(mid1), b = eval(mid2);
if (a < b)
hi = mid2;
else
lo = mid1;
}
printf("%.30Lf\n", eval(lo));
#ifdef LOCAL
cout << setprecision(12) << (long double)(clock() - start) / CLOCKS_PER_SEC
<< endl;
#endif
return 0;
}
| [
"literal.number.change",
"variable_declaration.value.change",
"call.arguments.change",
"literal.string.change",
"io.output.change"
] | 820,107 | 820,108 | u027091475 | cpp |
p03004 | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x, to) for (x = 0; x < (to); x++)
#define FORR(x, arr) for (auto &x : arr)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define ALL(a) (a.begin()), (a.end())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
//-------------------------------------------------------
int N;
vector<ll> R, L, U, D, X, Y;
vector<ll> cand;
ll ret;
void hoge(vector<ll> &V) {
if (V.size()) {
sort(ALL(V));
int x = V[0];
int y = V.back();
V.clear();
V = {x, y};
}
}
void hogev(vector<ll> &A, vector<ll> &B, int d) {
if (A.size() && B.size()) {
cand.push_back(abs(A[0] - B[0]) / d);
cand.push_back(abs(A[0] - B[1]) / d);
cand.push_back(abs(A[1] - B[0]) / d);
cand.push_back(abs(A[1] - B[1]) / d);
}
}
void test(pair<ll, ll> X, pair<ll, ll> Y) {
if (X.first <= Y.first && X.second <= Y.second)
return;
if (X.first >= Y.first && X.second >= Y.second)
return;
if (X.first > Y.first)
swap(X, Y);
ll d1 = Y.first - X.first;
ll d2 = Y.second - X.second;
}
void solve() {
int i, j, k, l, r, x, y;
string s;
cin >> N;
FOR(i, N) {
cin >> x >> y >> s;
x *= 2;
y *= 2;
if (s == "L") {
L.push_back(x);
Y.push_back(y);
}
if (s == "R") {
R.push_back(x);
Y.push_back(y);
}
if (s == "U") {
U.push_back(y);
X.push_back(x);
}
if (s == "D") {
D.push_back(y);
X.push_back(x);
}
}
hoge(L);
hoge(R);
hoge(U);
hoge(D);
hoge(X);
hoge(Y);
cand.push_back(0);
cand.push_back(1 << 30);
hogev(L, X, 1);
hogev(R, X, 1);
hogev(L, R, 2);
hogev(U, Y, 1);
hogev(D, Y, 1);
hogev(U, D, 2);
sort(ALL(cand));
vector<pair<ll, ll>> V;
ret = 1LL << 60;
FORR(c, cand) {
ll x1 = 1LL << 40, x2 = -1LL << 40;
ll y1 = 1LL << 40, y2 = -1LL << 40;
if (L.size())
x1 = min(x1, L[0] - c), x2 = max(x2, L[1] - c);
if (R.size())
x1 = min(x1, R[0] + c), x2 = max(x2, R[1] + c);
if (X.size())
x1 = min(x1, X[0] + 0), x2 = max(x2, X[1] + 0);
if (U.size())
y1 = min(y1, U[0] + c), y2 = max(y2, U[1] + c);
if (D.size())
y1 = min(y1, D[0] - c), y2 = max(y2, D[1] - c);
if (Y.size())
y1 = min(y1, Y[0] + 0), y2 = max(y2, U[1] + 0);
V.push_back({x2 - x1, y2 - y1});
ret = min(ret, (x2 - x1) * (y2 - y1));
}
FOR(i, V.size() - 1) test(V[i], V[i + 1]);
_P("%.12lf\n", ret / 4.0);
}
int main(int argc, char **argv) {
string s;
int i;
if (argc == 1)
ios::sync_with_stdio(false), cin.tie(0);
FOR(i, argc - 1) s += argv[i + 1], s += '\n';
FOR(i, s.size()) ungetc(s[s.size() - 1 - i], stdin);
cout.tie(0);
solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x, to) for (x = 0; x < (to); x++)
#define FORR(x, arr) for (auto &x : arr)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define ALL(a) (a.begin()), (a.end())
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
//-------------------------------------------------------
int N;
vector<ll> R, L, U, D, X, Y;
vector<ll> cand;
ll ret;
void hoge(vector<ll> &V) {
if (V.size()) {
sort(ALL(V));
int x = V[0];
int y = V.back();
V.clear();
V = {x, y};
}
}
void hogev(vector<ll> &A, vector<ll> &B, int d) {
if (A.size() && B.size()) {
cand.push_back(abs(A[0] - B[0]) / d);
cand.push_back(abs(A[0] - B[1]) / d);
cand.push_back(abs(A[1] - B[0]) / d);
cand.push_back(abs(A[1] - B[1]) / d);
}
}
void test(pair<ll, ll> X, pair<ll, ll> Y) {
if (X.first <= Y.first && X.second <= Y.second)
return;
if (X.first >= Y.first && X.second >= Y.second)
return;
if (X.first > Y.first)
swap(X, Y);
ll d1 = Y.first - X.first;
ll d2 = Y.second - X.second;
}
void solve() {
int i, j, k, l, r, x, y;
string s;
cin >> N;
FOR(i, N) {
cin >> x >> y >> s;
x *= 2;
y *= 2;
if (s == "L") {
L.push_back(x);
Y.push_back(y);
}
if (s == "R") {
R.push_back(x);
Y.push_back(y);
}
if (s == "U") {
U.push_back(y);
X.push_back(x);
}
if (s == "D") {
D.push_back(y);
X.push_back(x);
}
}
hoge(L);
hoge(R);
hoge(U);
hoge(D);
hoge(X);
hoge(Y);
cand.push_back(0);
cand.push_back(1 << 30);
hogev(L, X, 1);
hogev(R, X, 1);
hogev(L, R, 2);
hogev(U, Y, 1);
hogev(D, Y, 1);
hogev(U, D, 2);
sort(ALL(cand));
vector<pair<ll, ll>> V;
ret = 1LL << 60;
FORR(c, cand) {
ll x1 = 1LL << 40, x2 = -1LL << 40;
ll y1 = 1LL << 40, y2 = -1LL << 40;
if (L.size())
x1 = min(x1, L[0] - c), x2 = max(x2, L[1] - c);
if (R.size())
x1 = min(x1, R[0] + c), x2 = max(x2, R[1] + c);
if (X.size())
x1 = min(x1, X[0] + 0), x2 = max(x2, X[1] + 0);
if (U.size())
y1 = min(y1, U[0] + c), y2 = max(y2, U[1] + c);
if (D.size())
y1 = min(y1, D[0] - c), y2 = max(y2, D[1] - c);
if (Y.size())
y1 = min(y1, Y[0] + 0), y2 = max(y2, Y[1] + 0);
V.push_back({x2 - x1, y2 - y1});
ret = min(ret, (x2 - x1) * (y2 - y1));
}
FOR(i, V.size() - 1) test(V[i], V[i + 1]);
_P("%.12lf\n", ret / 4.0);
}
int main(int argc, char **argv) {
string s;
int i;
if (argc == 1)
ios::sync_with_stdio(false), cin.tie(0);
FOR(i, argc - 1) s += argv[i + 1], s += '\n';
FOR(i, s.size()) ungetc(s[s.size() - 1 - i], stdin);
cout.tie(0);
solve();
return 0;
}
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 820,109 | 820,110 | u452725238 | cpp |
p03005 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
if (k == 1)
cout << 1 << endl;
else
cout << n - k << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
if (k == 1)
cout << 0 << endl;
else
cout << n - k << endl;
return 0;
} | [
"literal.number.change",
"io.output.change"
] | 820,115 | 820,116 | u221391729 | cpp |
p03005 | #include <iostream>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
if (y = 1)
cout << "0";
else
cout << x - y;
} | #include <iostream>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
if (y == 1)
cout << "0";
else
cout << x - y;
} | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 820,119 | 820,120 | u083006500 | cpp |
p03003 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define rrep(i, n) RREP(i, n - 1, 0)
#define all(v) v.begin(), v.end()
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<int> S(n), T(m);
rep(i, n) cin >> S[i];
map<int, vector<int>> mp;
rep(i, m) {
cin >> T[i];
mp[T[i]].push_back(i);
}
vector<vector<ll>> dp(n + 1, vector<ll>(m + 1));
dp[0][0] = 1;
rep(i, n) {
rep(j, m + 1) {
(dp[i + 1][j] += dp[i][j]) %= mod;
auto itr = lower_bound(all(mp[S[i]]), j);
if (itr != mp[S[i]].end())
(dp[i + 1][*itr + 1] += dp[i][j]) %= mod;
}
for (auto &ele : mp) {
rep(j, ele.second.size()) {
if (j)
(dp[i + 1][ele.second[j] + 1] +=
(dp[i + 1][ele.second[j - 1] + 1] - dp[i][ele.second[j - 1] + 1])) %=
mod;
}
}
}
ll ans = 0;
rep(i, m + 1)(ans += dp[n][i]) %= mod;
cout << ans << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define rrep(i, n) RREP(i, n - 1, 0)
#define all(v) v.begin(), v.end()
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<int> S(n), T(m);
rep(i, n) cin >> S[i];
map<int, vector<int>> mp;
rep(i, m) {
cin >> T[i];
mp[T[i]].push_back(i);
}
vector<vector<ll>> dp(n + 1, vector<ll>(m + 1));
dp[0][0] = 1;
rep(i, n) {
rep(j, m + 1) {
(dp[i + 1][j] += dp[i][j]) %= mod;
auto itr = lower_bound(all(mp[S[i]]), j);
if (itr != mp[S[i]].end())
(dp[i + 1][*itr + 1] += dp[i][j]) %= mod;
}
for (auto &ele : mp) {
rep(j, ele.second.size()) {
if (j)
(dp[i + 1][ele.second[j] + 1] +=
(mod + dp[i + 1][ele.second[j - 1] + 1] -
dp[i][ele.second[j - 1] + 1]) %
mod) %= mod;
}
}
}
ll ans = 0;
rep(i, m + 1)(ans += dp[n][i]) %= mod;
cout << ans << "\n";
return 0;
}
| [
"assignment.change"
] | 820,129 | 820,130 | u137747137 | cpp |
p03003 | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const long long INF = 1e15;
#include <math.h>
#define PI 3.14159265358979323846264338327950L
bool isPrime(long long x) {
if (x == 1)
return true;
for (long long i = 2; i * i <= x; i++) {
if (x % i == 0)
return false;
}
return true;
}
long long gcd(long long a, long long b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
vector<long long> common_divisors(long long a, long long b) {
long long n = gcd(a, b);
vector<long long> ans;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
if (n / i == i) {
ans.push_back(i);
} else {
ans.push_back(n / i);
ans.push_back(i);
}
}
}
return ans;
}
vector<int> get_divisors(long long n) {
vector<int> ans;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
if (i == n / i) {
ans.push_back(i);
} else {
ans.push_back(n / i);
ans.push_back(i);
}
}
}
sort(ans.rbegin(), ans.rend());
return ans;
}
bool is_sorted(vector<int> a) {
int n = a.size();
for (int i = 0; i < n - 1; i++) {
if (a[i + 1] < a[i])
return false;
}
return true;
}
const int N = 2000, M = 2000;
int dp[N + 1][M + 1];
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n);
vector<int> b(m);
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < m; i++)
cin >> b[i];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= m; j++) {
if (i == 0 && j == 0) {
dp[i][j] = 1;
} else {
long long x = 0;
if (i > 0) {
x += dp[i - 1][j];
x %= MOD;
}
if (j > 0) {
x += dp[i][j - 1];
x %= MOD;
}
if (i > 0 && j > 0 && a[i - 1] != b[j - 1]) {
x = (x - dp[i - 1][j - 1]);
}
dp[i][j] = x;
}
}
}
int ans = dp[n][m];
if (ans < 0)
ans += MOD;
cout << ans << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const long long INF = 1e15;
#include <math.h>
#define PI 3.14159265358979323846264338327950L
bool isPrime(long long x) {
if (x == 1)
return true;
for (long long i = 2; i * i <= x; i++) {
if (x % i == 0)
return false;
}
return true;
}
long long gcd(long long a, long long b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
vector<long long> common_divisors(long long a, long long b) {
long long n = gcd(a, b);
vector<long long> ans;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
if (n / i == i) {
ans.push_back(i);
} else {
ans.push_back(n / i);
ans.push_back(i);
}
}
}
return ans;
}
vector<int> get_divisors(long long n) {
vector<int> ans;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
if (i == n / i) {
ans.push_back(i);
} else {
ans.push_back(n / i);
ans.push_back(i);
}
}
}
sort(ans.rbegin(), ans.rend());
return ans;
}
bool is_sorted(vector<int> a) {
int n = a.size();
for (int i = 0; i < n - 1; i++) {
if (a[i + 1] < a[i])
return false;
}
return true;
}
const int N = 2000, M = 2000;
int dp[N + 1][M + 1];
int main() {
int n, m;
cin >> n >> m;
vector<int> a(n);
vector<int> b(m);
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < m; i++)
cin >> b[i];
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= m; j++) {
if (i == 0 && j == 0) {
dp[i][j] = 1;
} else {
long long x = 0;
if (i > 0) {
x += dp[i - 1][j];
x %= MOD;
}
if (j > 0) {
x += dp[i][j - 1];
x %= MOD;
}
if (i > 0 && j > 0 && a[i - 1] != b[j - 1]) {
x = (x - dp[i - 1][j - 1]) % MOD;
}
dp[i][j] = x;
}
}
}
int ans = dp[n][m];
if (ans < 0)
ans += MOD;
cout << ans << '\n';
return 0;
} | [
"assignment.change"
] | 820,131 | 820,132 | u221780420 | cpp |
p03003 | #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0); \
cout << fixed; \
cout << setprecision(12);
#define randomINT \
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout << "\n"
#define DISP(as) \
for (auto it : as) \
cout << it << " "; \
newl;
#define all(x) (x).begin(), (x).end()
#define mset(x, val) memset(x, val, sizeof(x))
#define newl cout << "\n"
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define dline cerr << "///REACHED///\n";
#define deb1(x) cerr << #x << " = " << x << '\n';
#define deb2(x, y) \
cerr << '[' << #x << ',' << #y << "] = " << '[' << x << ',' << y << ']' \
<< '\n';
#define deb3(x, y, z) \
cerr << '[' << #x << ',' << #y << ',' << #z << "] = " << '[' << x << ',' \
<< y << ',' << z << ']' << '\n';
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pld;
typedef unordered_map<ll, ll> um;
typedef vector<pll> vpll;
const ll MAX5 = 1e+5 + 7;
const ll MAX7 = 1e+7 + 7;
const ll MAXN = 4 * MAX5;
const ll INF = 0x7f7f7f7f7f7f7f7f;
const int INFi = 0x7f7f7f7f;
const ll MOD = 1e+9 + 7;
const int N = 1e4;
ll vis[N];
vll adj[N];
// <------------- Declare Variables Here ------------> //
ll t = 1;
ll n, m, s, cnt = 1, u, v, k;
// <------------- Implement Functions Here ----------> //
ll dp[3000][3000];
ll add(ll a, ll b, ll c) { return ((a + b) % MOD + c) % MOD; }
// <------------- Start of main() -------------------> //
void MAIN() {
cin >> n >> m;
vll a(n), b(m);
for (ll i = 0; i < n; i++)
cin >> a[i];
for (ll i = 0; i < m; i++)
cin >> b[i];
// sort(all(a));
// sort(all(b));
for (ll i = 1; i <= n; i++) {
for (ll j = 1; j <= m; j++) {
if (a[i - 1] == b[j - 1]) {
dp[i][j] = add(dp[i - 1][j], dp[i][j - 1], 1);
} else {
dp[i][j] = add(dp[i - 1][j], dp[i][j - 1], -dp[i - 1][j - 1]);
}
}
}
/*for(ll i=0;i<=n;i++) {
for(ll j=0;j<=m;j++) {
cout<<dp[i][j]<<" ";
}
newl;
}
newl;*/
cout << (dp[n][m] + 1) % MOD;
}
int main() {
fastio;
randomINT;
// cin >> t;
while (t--) {
MAIN();
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define fastio \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0); \
cout << fixed; \
cout << setprecision(12);
#define randomINT \
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
#define newl cout << "\n"
#define DISP(as) \
for (auto it : as) \
cout << it << " "; \
newl;
#define all(x) (x).begin(), (x).end()
#define mset(x, val) memset(x, val, sizeof(x))
#define newl cout << "\n"
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define dline cerr << "///REACHED///\n";
#define deb1(x) cerr << #x << " = " << x << '\n';
#define deb2(x, y) \
cerr << '[' << #x << ',' << #y << "] = " << '[' << x << ',' << y << ']' \
<< '\n';
#define deb3(x, y, z) \
cerr << '[' << #x << ',' << #y << ',' << #z << "] = " << '[' << x << ',' \
<< y << ',' << z << ']' << '\n';
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pld;
typedef unordered_map<ll, ll> um;
typedef vector<pll> vpll;
const ll MAX5 = 1e+5 + 7;
const ll MAX7 = 1e+7 + 7;
const ll MAXN = 4 * MAX5;
const ll INF = 0x7f7f7f7f7f7f7f7f;
const int INFi = 0x7f7f7f7f;
const ll MOD = 1e+9 + 7;
const int N = 1e4;
ll vis[N];
vll adj[N];
// <------------- Declare Variables Here ------------> //
ll t = 1;
ll n, m, s, cnt = 1, u, v, k;
// <------------- Implement Functions Here ----------> //
ll dp[3000][3000];
ll add(ll a, ll b, ll c) { return ((a + b) % MOD + c) % MOD; }
// <------------- Start of main() -------------------> //
void MAIN() {
cin >> n >> m;
vll a(n), b(m);
for (ll i = 0; i < n; i++)
cin >> a[i];
for (ll i = 0; i < m; i++)
cin >> b[i];
// sort(all(a));
// sort(all(b));
for (ll i = 1; i <= n; i++) {
for (ll j = 1; j <= m; j++) {
if (a[i - 1] == b[j - 1]) {
dp[i][j] = add(dp[i - 1][j], dp[i][j - 1], 1);
} else {
dp[i][j] = add(dp[i - 1][j], dp[i][j - 1], -dp[i - 1][j - 1] + MOD);
}
}
}
/*for(ll i=0;i<=n;i++) {
for(ll j=0;j<=m;j++) {
cout<<dp[i][j]<<" ";
}
newl;
}
newl;*/
cout << (dp[n][m] + 1) % MOD;
}
int main() {
fastio;
randomINT;
// cin >> t;
while (t--) {
MAIN();
}
return 0;
}
| [
"assignment.change"
] | 820,137 | 820,138 | u126859973 | cpp |
p03003 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
/*
#include<algorithm>
#include<array>
#include<cassert>
#include<cmath>
#include<cstdlib>
#include<functional>
#include<iomanip>
#include<iostream>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<typeinfo>
#include<utility>
#include<vector>
*/
#define int long long int
#define double long double
using namespace std;
#define MOD 1000000007
#define INF 1000000000000000007
const int MAX_N = 1 << 17;
#define rep(i, n) for (int(i) = 0, i##_len = (n); (i) < i##_len; (i)++)
#define reps(i, x) for (int(i) = 1; (i) <= (int)(x); (i)++)
#define rrep(i, x) for (int(i) = ((int)(x)-1); (i) >= 0; (i)--)
#define rreps(i, x) for (int(i) = ((int)(x)); (i) > 0; (i)--)
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define pb push_back
#define mp make_pair
#define bit(n) ((int)(1) << (n))
#define all(x) (x).begin(), (x).end()
#define debug(x) std::cout << #x << ": " << (x) << std::endl
#define nint int
using namespace std;
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
typedef pair<int, int> pii;
typedef pair<double, double> dop;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
} aaaaaaa;
int n, m, s[2001], t[2001], sumarray[2001], temp = {0};
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> s[i];
}
for (int i = 0; i < m; i++) {
cin >> t[i];
}
int out = 1;
for (int i = 0; i < m; i++) {
temp = 0;
for (int j = 0; j < n; j++) {
if (j == 0) {
temp += sumarray[j];
if (t[i] == s[j]) {
sumarray[j] += 1;
}
} else {
if (t[i] == s[j]) {
int prev = temp + sumarray[j];
sumarray[j] += (temp + 1) % MOD;
temp = prev;
} else {
temp += sumarray[j];
}
}
}
}
for (int i = 0; i < n; i++) {
out += sumarray[i];
out %= MOD;
}
cout << out << "/n";
return 0;
}
| #pragma GCC optimize("O3")
#include <bits/stdc++.h>
/*
#include<algorithm>
#include<array>
#include<cassert>
#include<cmath>
#include<cstdlib>
#include<functional>
#include<iomanip>
#include<iostream>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<string>
#include<typeinfo>
#include<utility>
#include<vector>
*/
#define int long long int
#define double long double
using namespace std;
#define MOD 1000000007
#define INF 1000000000000000007
const int MAX_N = 1 << 17;
#define rep(i, n) for (int(i) = 0, i##_len = (n); (i) < i##_len; (i)++)
#define reps(i, x) for (int(i) = 1; (i) <= (int)(x); (i)++)
#define rrep(i, x) for (int(i) = ((int)(x)-1); (i) >= 0; (i)--)
#define rreps(i, x) for (int(i) = ((int)(x)); (i) > 0; (i)--)
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define pb push_back
#define mp make_pair
#define bit(n) ((int)(1) << (n))
#define all(x) (x).begin(), (x).end()
#define debug(x) std::cout << #x << ": " << (x) << std::endl
#define nint int
using namespace std;
int dy[] = {0, 0, 1, -1, 0};
int dx[] = {1, -1, 0, 0, 0};
typedef pair<int, int> pii;
typedef pair<double, double> dop;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
struct aaa {
aaa() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
};
} aaaaaaa;
int n, m, s[2001], t[2001], sumarray[2001] = {0};
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> s[i];
}
for (int i = 0; i < m; i++) {
cin >> t[i];
}
int out = 1;
for (int i = 0; i < m; i++) {
int temp = 0;
for (int j = 0; j < n; j++) {
if (j == 0) {
temp += sumarray[j];
if (t[i] == s[j]) {
sumarray[j] += 1;
}
} else {
if (t[i] == s[j]) {
int prev = temp + sumarray[j];
sumarray[j] += (temp + 1) % MOD;
temp = prev;
} else {
temp += sumarray[j];
}
}
}
}
for (int i = 0; i < n; i++) {
out += sumarray[i];
out %= MOD;
}
cout << out << endl;
return 0;
}
| [
"variable_declaration.remove",
"io.output.change"
] | 820,141 | 820,142 | u989345508 | cpp |
p03003 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll, ll> pll;
const ll mod = 1e9 + 7;
// const ll mod=998244353;
const ll inf = 1LL << 61;
int main() {
ll n, m;
cin >> n >> m;
vec s(n), t(m);
for (ll i = 0; i < n; i++)
cin >> s[i];
for (ll i = 0; i < m; i++)
cin >> t[i];
mat sum(n + 1, vec(m + 1));
mat dp(n + 1, vec(m + 1));
dp[0][0] = 1;
for (ll i = 0; i < n; i++) {
for (ll j = 0; j < m; j++) {
if (s[i] == t[j]) {
dp[i + 1][j + 1] = (dp[i][j] + 1) % mod;
}
sum[i + 1][j + 1] =
(sum[i + 1][j] + sum[i][j + 1] - sum[i][j] + dp[i + 1][j + 1] + mod) %
mod;
}
}
cout << (sum[n][m] + 1) % mod << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef pair<ll, ll> pll;
const ll mod = 1e9 + 7;
// const ll mod=998244353;
const ll inf = 1LL << 61;
int main() {
ll n, m;
cin >> n >> m;
vec s(n), t(m);
for (ll i = 0; i < n; i++)
cin >> s[i];
for (ll i = 0; i < m; i++)
cin >> t[i];
mat sum(n + 1, vec(m + 1, 0));
mat dp(n + 1, vec(m + 1, 0));
dp[0][0] = 1;
for (ll i = 0; i < n; i++) {
for (ll j = 0; j < m; j++) {
if (s[i] == t[j]) {
dp[i + 1][j + 1] = (sum[i][j] + 1) % mod;
}
sum[i + 1][j + 1] =
(sum[i + 1][j] + sum[i][j + 1] - sum[i][j] + dp[i + 1][j + 1] + mod) %
mod;
}
}
cout << (sum[n][m] + 1) % mod << endl;
} | [
"call.arguments.add",
"assignment.value.change",
"expression.operation.binary.change"
] | 820,149 | 820,150 | u718758485 | cpp |
p03003 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf 10e17
#define rep(i, n) for (long long i = 0; i < n; i++)
#define repr(i, n, m) for (long long i = m; i < n; i++)
#define mod 1000000007
#define sorti(x) sort(x.begin(), x.end())
#define sortd(x) sort(x.begin(), x.end(), std::greater<long long>())
#define debug(x) std::cerr << (x) << std::endl;
#define roll(x) \
for (auto &&itr : x) { \
cerr << (itr) << " "; \
}
template <class T> inline void chmax(T &ans, T t) {
if (t > ans)
ans = t;
}
template <class T> inline void chmin(T &ans, T t) {
if (t < ans)
ans = t;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<int> s(n), t(m);
repr(i, n, 0) cin >> s[i];
repr(i, m, 0) cin >> t[i];
vector<vector<int>> sum(n + 1, vector<int>(m + 1, 0));
vector<vector<int>> dp(n + 1, vector<int>(m + 1, 0));
// 空集合
dp[0][0] = 0;
sum[0][0] = 0;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
if (s[i] == t[j]) {
dp[i + 1][j + 1] = sum[i][j] + 1;
dp[i + 1][j + 1] %= mod;
} else {
dp[i + 1][j + 1] = 0;
}
sum[i + 1][j + 1] =
(sum[i + 1][j] + sum[i][j + 1] + dp[i + 1][j + 1]) % mod;
sum[i + 1][j + 1] = (sum[i + 1][j + 1] + mod - sum[i][j]) % mod;
sum[i + 1][j + 1] %= mod;
}
}
ll ans = 1;
for (int i = 0; i < n + 1; ++i) {
for (int j = 0; j < m + 1; ++j) {
ans += dp[i][j];
ans %= mod;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define inf 10e17
#define rep(i, n) for (long long i = 0; i < n; i++)
#define repr(i, n, m) for (long long i = m; i < n; i++)
#define mod 1000000007
#define sorti(x) sort(x.begin(), x.end())
#define sortd(x) sort(x.begin(), x.end(), std::greater<long long>())
#define debug(x) std::cerr << (x) << std::endl;
#define roll(x) \
for (auto &&itr : x) { \
cerr << (itr) << " "; \
}
template <class T> inline void chmax(T &ans, T t) {
if (t > ans)
ans = t;
}
template <class T> inline void chmin(T &ans, T t) {
if (t < ans)
ans = t;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, m;
cin >> n >> m;
vector<ll> s(n), t(m);
repr(i, n, 0) cin >> s[i];
repr(i, m, 0) cin >> t[i];
vector<vector<ll>> sum(n + 1, vector<ll>(m + 1, 0));
vector<vector<ll>> dp(n + 1, vector<ll>(m + 1, 0));
// 空集合
dp[0][0] = 0;
sum[0][0] = 0;
for (int i = 0; i < n; ++i) {
for (int j = 0; j < m; ++j) {
if (s[i] == t[j]) {
dp[i + 1][j + 1] = sum[i][j] + 1;
dp[i + 1][j + 1] %= mod;
} else {
dp[i + 1][j + 1] = 0;
}
sum[i + 1][j + 1] =
(sum[i + 1][j] + sum[i][j + 1] + dp[i + 1][j + 1]) % mod;
sum[i + 1][j + 1] = (sum[i + 1][j + 1] + mod - sum[i][j]) % mod;
sum[i + 1][j + 1] %= mod;
}
}
ll ans = 1;
for (int i = 0; i < n + 1; ++i) {
for (int j = 0; j < m + 1; ++j) {
ans += dp[i][j];
ans %= mod;
}
}
cout << ans << endl;
} | [
"variable_declaration.type.change",
"call.arguments.change"
] | 820,151 | 820,152 | u898749314 | cpp |
p03003 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define bit(n, k) (((ll)n >> (ll)k) & 1) /*nのk bit目*/
#define pb push_back
const long long INF = 1e+18 + 1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
const ll MOD = 1000000007LL;
// const ll MOD=998244353LL;
// const ll MOD=1777777777LL;
// const ll MAX_V=114514LL;
// const ll MAX = 500010LL;
string abc = "abcdefghijklmnopqrstuvwxyz";
string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
vl dx = {0, 0, 1, -1};
vl dy = {1, -1, 0, 0};
// ll sum[2010][2010];
int main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
cout << fixed << setprecision(10);
/*--------------------------------*/
vvl sum(2010, vl(2010));
ll n, m;
cin >> n >> m;
vl s(n);
rep(i, n) cin >> s[i];
vl t(m);
rep(i, m) cin >> t[i];
rep(i, n) {
rep(j, m) {
if (i != 0)
sum[i][j] += sum[i - 1][j];
sum[i][j] %= MOD;
if (j != 0)
sum[i][j] += sum[i][j - 1];
sum[i][j] %= MOD;
if (i != 0 && j != 0)
sum[i][j] += MOD - sum[i - 1][j - 1];
sum[i][j] %= MOD;
if (s[i] == t[j] && i != 0 && j != 0) {
sum[i][j] += sum[i - 1][j - 1];
sum[i][j] %= MOD;
}
if (s[i] == t[j]) {
sum[i][j]++;
sum[i][j] %= MOD;
}
}
}
// rep(i,n){
// rep(j,m)cout<<sum[i][j]<<" ";
// cout<<endl;
// }
cout << sum[n - 1][m - 1] << endl;
}
| //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define bit(n, k) (((ll)n >> (ll)k) & 1) /*nのk bit目*/
#define pb push_back
const long long INF = 1e+18 + 1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
const ll MOD = 1000000007LL;
// const ll MOD=998244353LL;
// const ll MOD=1777777777LL;
// const ll MAX_V=114514LL;
// const ll MAX = 500010LL;
string abc = "abcdefghijklmnopqrstuvwxyz";
string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
vl dx = {0, 0, 1, -1};
vl dy = {1, -1, 0, 0};
// ll sum[2010][2010];
int main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
cout << fixed << setprecision(10);
/*--------------------------------*/
vvl sum(2010, vl(2010));
ll n, m;
cin >> n >> m;
vl s(n);
rep(i, n) cin >> s[i];
vl t(m);
rep(i, m) cin >> t[i];
rep(i, n) {
rep(j, m) {
if (i != 0)
sum[i][j] += sum[i - 1][j];
sum[i][j] %= MOD;
if (j != 0)
sum[i][j] += sum[i][j - 1];
sum[i][j] %= MOD;
if (i != 0 && j != 0)
sum[i][j] += MOD - sum[i - 1][j - 1];
sum[i][j] %= MOD;
if (s[i] == t[j] && i != 0 && j != 0) {
sum[i][j] += sum[i - 1][j - 1];
sum[i][j] %= MOD;
}
if (s[i] == t[j]) {
sum[i][j]++;
sum[i][j] %= MOD;
}
}
}
// rep(i,n){
// rep(j,m)cout<<sum[i][j]<<" ";
// cout<<endl;
// }
cout << (sum[n - 1][m - 1] + 1) % MOD << endl;
}
| [
"expression.operation.binary.add"
] | 820,155 | 820,156 | u614128939 | cpp |
p03003 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (long long i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FOR(i, 1, n + 1)
#define RFOR(i, l, r) for (long long i = (l); i >= (r); --i)
#define RREP(i, n) RFOR(i, n - 1, 0)
#define RREPS(i, n) RFOR(i, n, 1)
#define int long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int INF = 1e18;
template <typename T> T pow(T a, long long n, T e = 1) {
T ret = e;
while (n) {
if (n & 1)
ret *= a;
a *= a;
n >>= 1;
}
return ret;
}
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(long long x_) {
if ((x = x_ % mod + mod) >= mod)
x -= mod;
}
ModInt &operator+=(ModInt rhs) {
if ((x += rhs.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator-=(ModInt rhs) {
if ((x -= rhs.x) < 0)
x += mod;
return *this;
}
ModInt &operator*=(ModInt rhs) {
x = (unsigned long long)x * rhs.x % mod;
return *this;
}
ModInt &operator/=(ModInt rhs) {
x = (unsigned long long)x * rhs.inv().x % mod;
return *this;
}
ModInt operator-() const { return -x < 0 ? mod - x : -x; }
ModInt operator+(ModInt rhs) const { return ModInt(*this) += rhs; }
ModInt operator-(ModInt rhs) const { return ModInt(*this) -= rhs; }
ModInt operator*(ModInt rhs) const { return ModInt(*this) *= rhs; }
ModInt operator/(ModInt rhs) const { return ModInt(*this) /= rhs; }
bool operator==(ModInt rhs) const { return x == rhs.x; }
bool operator!=(ModInt rhs) const { return x != rhs.x; }
ModInt inv() const { return pow(*this, mod - 2); }
friend ostream &operator<<(ostream &s, ModInt<mod> a) {
s << a.x;
return s;
}
friend istream &operator>>(istream &s, ModInt<mod> &a) {
s >> a.x;
return s;
}
};
using mint = ModInt<1000000007>;
mint dp[2001][2001];
signed main() {
int n, m;
cin >> n >> m;
int s[n], t[m];
REP(i, n) cin >> s[i];
REP(i, m) cin >> t[i];
dp[0][0] = 1;
REP(i, n + 1) REP(j, m + 1) {
if (i > 0)
dp[i][j] += dp[i - 1][j];
if (j > 0)
dp[i][j] += dp[i][j - 1];
if (i > 0 and j > 0 and s[i - 1] != s[j - 1])
dp[i][j] -= dp[i - 1][j - 1];
}
cout << dp[n][m] << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (long long i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FOR(i, 1, n + 1)
#define RFOR(i, l, r) for (long long i = (l); i >= (r); --i)
#define RREP(i, n) RFOR(i, n - 1, 0)
#define RREPS(i, n) RFOR(i, n, 1)
#define int long long
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int INF = 1e18;
template <typename T> T pow(T a, long long n, T e = 1) {
T ret = e;
while (n) {
if (n & 1)
ret *= a;
a *= a;
n >>= 1;
}
return ret;
}
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(long long x_) {
if ((x = x_ % mod + mod) >= mod)
x -= mod;
}
ModInt &operator+=(ModInt rhs) {
if ((x += rhs.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator-=(ModInt rhs) {
if ((x -= rhs.x) < 0)
x += mod;
return *this;
}
ModInt &operator*=(ModInt rhs) {
x = (unsigned long long)x * rhs.x % mod;
return *this;
}
ModInt &operator/=(ModInt rhs) {
x = (unsigned long long)x * rhs.inv().x % mod;
return *this;
}
ModInt operator-() const { return -x < 0 ? mod - x : -x; }
ModInt operator+(ModInt rhs) const { return ModInt(*this) += rhs; }
ModInt operator-(ModInt rhs) const { return ModInt(*this) -= rhs; }
ModInt operator*(ModInt rhs) const { return ModInt(*this) *= rhs; }
ModInt operator/(ModInt rhs) const { return ModInt(*this) /= rhs; }
bool operator==(ModInt rhs) const { return x == rhs.x; }
bool operator!=(ModInt rhs) const { return x != rhs.x; }
ModInt inv() const { return pow(*this, mod - 2); }
friend ostream &operator<<(ostream &s, ModInt<mod> a) {
s << a.x;
return s;
}
friend istream &operator>>(istream &s, ModInt<mod> &a) {
s >> a.x;
return s;
}
};
using mint = ModInt<1000000007>;
mint dp[2001][2001];
signed main() {
int n, m;
cin >> n >> m;
int s[n], t[m];
REP(i, n) cin >> s[i];
REP(i, m) cin >> t[i];
dp[0][0] = 1;
REP(i, n + 1) REP(j, m + 1) {
if (i > 0)
dp[i][j] += dp[i - 1][j];
if (j > 0)
dp[i][j] += dp[i][j - 1];
if (i > 0 and j > 0 and s[i - 1] != t[j - 1])
dp[i][j] -= dp[i - 1][j - 1];
}
cout << dp[n][m] << endl;
} | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 820,161 | 820,162 | u342075214 | cpp |
p03003 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
typedef long long int Int;
constexpr Int TEN(int n) { return n == 0 ? 1 : 10 * TEN(n - 1); }
const int max_n = 3000;
Int dp[max_n][max_n];
Int S[max_n];
Int T[max_n];
int main(void) {
int N, M;
cin >> N >> M;
dp[0][0] = 1;
for (int i = 1; i <= N; i++) {
dp[0][i] = 1;
cin >> S[i];
}
for (int i = 1; i <= M; i++) {
dp[i][0] = 1;
cin >> T[i];
}
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= M; j++) {
if (S[i] == T[j]) {
dp[i][j] = (dp[i - 1][j] + dp[i][j - 1]) % MOD;
} else {
dp[i][j] = (MOD + dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1]) % MOD;
}
}
}
cout << dp[N][M] << endl;
return 0;
}
| #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define MOD (1000000007)
using namespace std;
typedef long long int Int;
constexpr Int TEN(int n) { return n == 0 ? 1 : 10 * TEN(n - 1); }
const int max_n = 3000;
Int dp[max_n][max_n];
Int S[max_n];
Int T[max_n];
int main(void) {
int N, M;
cin >> N >> M;
dp[0][0] = 1;
for (int i = 1; i <= N; i++) {
dp[i][0] = 1;
cin >> S[i];
}
for (int i = 1; i <= M; i++) {
dp[0][i] = 1;
cin >> T[i];
}
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= M; j++) {
if (S[i] == T[j]) {
dp[i][j] = (dp[i - 1][j] + dp[i][j - 1]) % MOD;
} else {
dp[i][j] = (MOD + dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1]) % MOD;
}
}
}
cout << dp[N][M] << endl;
return 0;
}
| [
"assignment.variable.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"identifier.replace.remove",
"literal.replace.add"
] | 820,235 | 820,236 | u498141549 | cpp |
p03003 | #include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long int res_map[2005][2005] = {};
int main() {
const long long int mod = 1000000007;
map<long long int, long long int> mp;
// cout << fixed << setprecision(10);
long double big, small, wa;
long long int n, m, k, x, res = 0, cou = 1, mi = 999999999, ma = -9999999999,
tmp[2005];
long long int max_id, min_id, L[200000], w, h, y, a[200001], sum[200001] = {};
long long int s[2005], t[2005];
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> s[i];
}
for (int i = 0; i < m; i++) {
cin >> t[i];
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
if (s[j] == t[i]) {
res_map[i][j] = 1 + sum[j];
res_map[i][j] %= mod;
}
}
tmp[0] = 0;
for (int j = 1; j <= n; j++) {
tmp[j] = res_map[i][j - 1] + tmp[j - 1];
}
for (int j = 1; j <= n; j++) {
sum[j] = sum[j] + tmp[j];
sum[i] = mod;
}
cout << endl;
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
res += res_map[i][j];
}
cout << endl;
}
cout << (res + 1) % mod;
}
| #include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long int res_map[2005][2005] = {};
int main() {
const long long int mod = 1000000007;
map<long long int, long long int> mp;
// cout << fixed << setprecision(10);
long double big, small, wa;
long long int n, m, k, x, res = 0, cou = 1, mi = 999999999, ma = -9999999999,
tmp[2005];
long long int max_id, min_id, L[200000], w, h, y, a[200001], sum[200001] = {};
long long int s[2005], t[2005];
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> s[i];
}
for (int i = 0; i < m; i++) {
cin >> t[i];
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
if (s[j] == t[i]) {
res_map[i][j] = 1 + sum[j];
res_map[i][j] %= mod;
}
}
tmp[0] = 0;
for (int j = 1; j <= n; j++) {
tmp[j] = res_map[i][j - 1] + tmp[j - 1];
}
for (int j = 1; j <= n; j++) {
sum[j] = sum[j] + tmp[j];
sum[i] %= mod;
}
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
res += res_map[i][j];
}
cout << endl;
}
cout << (res + 1) % mod;
}
| [
"assignment.value.change"
] | 820,256 | 820,257 | u018872912 | cpp |
p03003 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef int64_t Int;
Int MOD = 1e9 + 7;
//---------- べき乗 ----------
Int power(Int a, Int n) {
if (a == 0)
return 0;
if (n == 0)
return 1;
Int res = 1;
while (n > 0) {
if (n % 2 == 1)
res = res * a % MOD;
a = a * a % MOD;
n /= 2;
}
return res;
}
//---------- 逆元 ----------
Int inv(Int a) { return power(a, MOD - 2); }
int main() {
int N, M;
cin >> N >> M;
vector<int> S(2010, 0), T(2010, 0);
rep1(i, N) cin >> S[i];
rep1(i, M) cin >> T[i];
// dp[i][j]: S[i],T[j]までで，かつこれらをペアにする共通部分列の個数
vector<vector<Int>> dp(2010, vector<Int>(2010, 0));
vector<vector<Int>> sum(2010, vector<Int>(2010, 1));
dp[0][0] = 1;
rep1(i, N) {
rep1(j, M) {
if (S[i] == T[j])
dp[i][j] = (sum[i - 1][j - 1] + 1) % MOD;
sum[i][j] =
(sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + dp[i][j]) % MOD;
}
}
cout << (sum[N][M] - 1) * inv(2) % MOD + 1 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef int64_t Int;
Int MOD = 1e9 + 7;
//---------- べき乗 ----------
Int power(Int a, Int n) {
if (a == 0)
return 0;
if (n == 0)
return 1;
Int res = 1;
while (n > 0) {
if (n % 2 == 1)
res = res * a % MOD;
a = a * a % MOD;
n /= 2;
}
return res;
}
//---------- 逆元 ----------
Int inv(Int a) { return power(a, MOD - 2); }
int main() {
int N, M;
cin >> N >> M;
vector<int> S(2010, 0), T(2010, 0);
rep1(i, N) cin >> S[i];
rep1(i, M) cin >> T[i];
// dp[i][j]: S[i],T[j]までで，かつこれらをペアにする共通部分列の個数
vector<vector<Int>> dp(2010, vector<Int>(2010, 0));
vector<vector<Int>> sum(2010, vector<Int>(2010, 1));
dp[0][0] = 1;
rep1(i, N) {
rep1(j, M) {
if (S[i] == T[j])
dp[i][j] = (sum[i - 1][j - 1] + 1) % MOD;
sum[i][j] =
(sum[i - 1][j] + sum[i][j - 1] + MOD - sum[i - 1][j - 1] + dp[i][j]) %
MOD;
}
}
cout << (sum[N][M] - 1) * inv(2) % MOD + 1 << endl;
}
| [
"assignment.change"
] | 820,279 | 820,280 | u285358283 | cpp |
p03003 | #include <algorithm>
#include <cstdio>
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, a) repi(i, 0, a)
#define all(a) (a).begin(), (a).end()
using ll = long long;
constexpr ll mod = 1000000007;
ll N, M;
ll S[2010], T[2010];
ll dp[2010][2010], sum[2010][2010];
int main() {
scanf("%lld%lld", &N, &M);
rep(i, N) scanf("%lld", S + i);
rep(i, M) scanf("%lld", T + i);
rep(i, N) rep(j, M) {
if (S[i] == T[j])
dp[i + 1][j + 1] = (sum[i][j] + 1) % mod;
sum[i + 1][j + 1] =
(((sum[i + 1][j] + sum[i][j + 1]) % mod - sum[i][j]) % mod +
dp[i + 1][j + 1]) %
mod;
}
printf("%lld\n", (sum[N][M] + 1) % mod);
return 0;
} | #include <algorithm>
#include <cstdio>
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, a) repi(i, 0, a)
#define all(a) (a).begin(), (a).end()
using ll = long long;
constexpr ll mod = 1000000007;
ll N, M;
ll S[2010], T[2010];
ll dp[2010][2010], sum[2010][2010];
int main() {
scanf("%lld%lld", &N, &M);
rep(i, N) scanf("%lld", S + i);
rep(i, M) scanf("%lld", T + i);
rep(i, N) rep(j, M) {
if (S[i] == T[j])
dp[i + 1][j + 1] = (sum[i][j] + 1) % mod;
sum[i + 1][j + 1] =
(((sum[i + 1][j] + sum[i][j + 1]) % mod - sum[i][j] + mod) % mod +
dp[i + 1][j + 1]) %
mod;
}
printf("%lld\n", (sum[N][M] + 1) % mod);
return 0;
} | [
"assignment.change"
] | 820,281 | 820,282 | u265250376 | cpp |
p03003 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
struct mint {
ll x;
mint(ll x = 0) : x(x % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
};
mint dp0[2005][2005];
mint dp1[2005][2005];
int main() {
int n, m;
cin >> n >> m;
vector<int> s(n + 1), t(m + 1);
for (int i = 0; i < n; i++)
scanf("%d", &s[i]);
for (int i = 0; i < m; i++)
scanf("%d", &t[i]);
dp0[0][0] = 1;
for (int i = 0; i < n + 1; i++)
for (int j = 0; j < m + 1; j++) {
dp0[i + 1][j] += dp0[i][j];
dp1[i][j] += dp0[i][j];
dp1[i][j + 1] += dp0[i][j];
if (s[i] == t[j]) {
dp0[i + 1][j + 1] += dp1[i][j];
}
}
cout << dp1[n][m].x << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
struct mint {
ll x;
mint(ll x = 0) : x(x % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
};
mint dp0[2005][2005];
mint dp1[2005][2005];
int main() {
int n, m;
cin >> n >> m;
vector<int> s(n + 1), t(m + 1);
for (int i = 0; i < n; i++)
scanf("%d", &s[i]);
for (int i = 0; i < m; i++)
scanf("%d", &t[i]);
dp0[0][0] = 1;
for (int i = 0; i < n + 1; i++)
for (int j = 0; j < m + 1; j++) {
dp0[i + 1][j] += dp0[i][j];
dp1[i][j] += dp0[i][j];
dp1[i][j + 1] += dp1[i][j];
if (s[i] == t[j]) {
dp0[i + 1][j + 1] += dp1[i][j];
}
}
cout << dp1[n][m].x << endl;
return 0;
} | [
"assignment.value.change",
"identifier.change"
] | 820,302 | 820,303 | u633402865 | cpp |
p03006 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long x[n];
long y[n];
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i];
}
int ans = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i == j)
continue;
long p = x[i] - x[j];
long q = y[i] - y[j];
int sum = 0;
for (int k = 0; k < n; k++) {
for (int l = 0; l < n; l++) {
if ((p == x[k] - x[l]) && (q == y[k] - y[l])) {
sum++;
}
}
}
ans = min(ans, n - sum);
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long x[n];
long y[n];
for (int i = 0; i < n; i++) {
cin >> x[i] >> y[i];
}
int ans = n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i == j)
continue;
long p = x[i] - x[j];
long q = y[i] - y[j];
int sum = 0;
for (int k = 0; k < n; k++) {
for (int l = 0; l < n; l++) {
if ((p == x[k] - x[l]) && (q == y[k] - y[l])) {
sum++;
}
}
}
ans = min(ans, n - sum);
}
}
cout << ans << endl;
return 0;
}
| [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 820,326 | 820,327 | u993967581 | cpp |
p03006 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD 1e9 + 7
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<ll> x(N), y(N);
rep(i, N) { cin >> x[i] >> y[i]; }
int res = 0;
rep(i, N) {
rep(j, N) {
if (i == j)
continue;
ll p = x[i] - x[j];
ll q = y[i] - y[j];
int cnt = 0;
rep(k, N) {
rep(l, N) {
if (k == l)
continue;
if (x[l] - x[k] == p && y[l] - y[k] == q) {
cnt++;
}
}
}
res = min(res, N - cnt);
}
}
if (N == 1) {
cout << "1";
} else {
cout << res;
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define MOD 1e9 + 7
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<ll> x(N), y(N);
rep(i, N) { cin >> x[i] >> y[i]; }
int res = N;
rep(i, N) {
rep(j, N) {
if (i == j)
continue;
ll p = x[i] - x[j];
ll q = y[i] - y[j];
int cnt = 0;
rep(k, N) {
rep(l, N) {
if (k == l)
continue;
if (x[l] - x[k] == p && y[l] - y[k] == q) {
cnt++;
}
}
}
res = min(res, N - cnt);
}
}
if (N == 1) {
cout << "1";
} else {
cout << res;
}
} | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 820,344 | 820,345 | u710135612 | cpp |
p03006 | #include <bits/stdc++.h>
#define maxn 55
using namespace std;
int n, num, a[maxn], b[maxn];
map<int, map<int, int>> mp;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d%d", a[i], b[i]);
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
if (i != j)
num = max(num, ++mp[a[i] - a[j]][b[i] - b[j]]);
printf("%d\n", n - num);
return 0;
}
| #include <bits/stdc++.h>
#define maxn 55
using namespace std;
int n, num, a[maxn], b[maxn];
map<int, map<int, int>> mp;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d%d", a + i, b + i);
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j)
if (i != j)
num = max(num, ++mp[a[i] - a[j]][b[i] - b[j]]);
printf("%d\n", n - num);
return 0;
}
| [
"call.arguments.change"
] | 820,352 | 820,353 | u786712982 | cpp |
p03006 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
void solve() {
ll N;
cin >> N;
vector<pair<ll, ll>> pos(N);
for (ll i = 0; i < N; i++) {
ll x, y;
cin >> x >> y;
pos.push_back({x, y});
}
map<pair<ll, ll>, ll> freq;
for (ll i = 0; i < N; i++) {
for (ll j = 0; j < N; j++) {
if (i != j) {
freq[make_pair(pos[i].first - pos[j].first,
pos[i].second - pos[j].second)]++;
}
}
}
ll maxval = 0;
for (auto itr = freq.begin(); itr != freq.end(); itr++) {
if (maxval < itr->second) {
maxval = itr->second;
}
}
cout << N - maxval << endl;
return;
}
int main(int argc, char const *argv[]) {
solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
void solve() {
ll N;
cin >> N;
vector<pair<ll, ll>> pos;
for (ll i = 0; i < N; i++) {
ll x, y;
cin >> x >> y;
pos.push_back({x, y});
}
map<pair<ll, ll>, ll> freq;
for (ll i = 0; i < N; i++) {
for (ll j = 0; j < N; j++) {
if (i != j) {
freq[make_pair(pos[i].first - pos[j].first,
pos[i].second - pos[j].second)]++;
}
}
}
ll maxval = 0;
for (auto itr = freq.begin(); itr != freq.end(); itr++) {
if (maxval < itr->second) {
maxval = itr->second;
}
}
cout << N - maxval << endl;
return;
}
int main(int argc, char const *argv[]) {
solve();
return 0;
}
| [] | 820,354 | 820,355 | u796269639 | cpp |
p03006 | #include <bits/stdc++.h>
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i;
ris;
} eni(==) ris << range(begin(i), end(i));
}
sim, class b dor(pair<b, c> d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c &) { ris; }
#endif
}
;
#define name(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
const int N = (int)1e6 + 7;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
map<pii, int> haps;
vector<vi> a(n, vi(2));
for (int i = 0; i < n; i++)
for (int j = 0; j < 2; j++) {
cin >> a[i][j];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i == j)
continue;
int x = a[i][0] - a[j][0], y = a[i][1] - a[j][1];
haps[pii(x, y)]++;
}
}
int ans = 0;
for (auto c : haps) {
ans = max(ans, c.second);
}
cout << ans << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i;
ris;
} eni(==) ris << range(begin(i), end(i));
}
sim, class b dor(pair<b, c> d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c &) { ris; }
#endif
}
;
#define name(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
const int N = (int)1e6 + 7;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
map<pii, int> haps;
vector<vi> a(n, vi(2));
for (int i = 0; i < n; i++)
for (int j = 0; j < 2; j++) {
cin >> a[i][j];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
if (i == j)
continue;
int x = a[i][0] - a[j][0], y = a[i][1] - a[j][1];
haps[pii(x, y)]++;
}
}
int ans = 0;
for (auto c : haps) {
ans = max(ans, c.second);
}
cout << n - ans << '\n';
return 0;
}
| [
"expression.operation.binary.add"
] | 820,433 | 820,434 | u320367606 | cpp |
p03006 | #include <bits/stdc++.h>
#define int long long
using namespace std;
// typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef vector<bool> VB;
typedef vector<PII> VP;
// REPEAT
//------------------------------------------
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define RFOR(i, m, n) for (int i = m; i > n; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, m) RFOR(i, m, 0)
// container util
//------------------------------------------
#define pb(a) push_back(a)
#define fst first
#define snd second
#define SORT(V) sort((V).begin(), (V).end())
#define REV(V) reverse((V).begin(), (V).end())
// constant
//------------------------------------------
const int MOD = 1000000007;
const int INF = 1061109567;
const double EPS = 1e-10;
const double PI = acos(-1.0);
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
// grobal variable
//------------------------------------------
// def function, class
//------------------------------------------
// main
//------------------------------------------
signed main() {
int N;
cin >> N;
VP points(N + 10);
REP(i, N) cin >> points[i].fst >> points[i].snd;
map<PII, int> pointCost;
int ans = 0;
SORT(points);
REP(i, N) {
FOR(j, i + 1, N) {
int p, q; // 2点の差
p = points[i].fst - points[j].fst;
q = points[i].snd - points[j].snd;
pointCost[{p, q}]++;
ans = max(ans, pointCost[{p, q}]);
}
}
cout << N - ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define int long long
using namespace std;
// typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef vector<bool> VB;
typedef vector<PII> VP;
// REPEAT
//------------------------------------------
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define RFOR(i, m, n) for (int i = m; i > n; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, m) RFOR(i, m, 0)
// container util
//------------------------------------------
#define pb(a) push_back(a)
#define fst first
#define snd second
#define SORT(V) sort((V).begin(), (V).end())
#define REV(V) reverse((V).begin(), (V).end())
// constant
//------------------------------------------
const int MOD = 1000000007;
const int INF = 1061109567;
const double EPS = 1e-10;
const double PI = acos(-1.0);
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
// grobal variable
//------------------------------------------
// def function, class
//------------------------------------------
// main
//------------------------------------------
signed main() {
int N;
cin >> N;
VP points(N);
REP(i, N) cin >> points[i].fst >> points[i].snd;
map<PII, int> pointCost;
int ans = 0;
SORT(points);
REP(i, N) {
FOR(j, i + 1, N) {
int p, q; // 2点の差
p = points[i].fst - points[j].fst;
q = points[i].snd - points[j].snd;
pointCost[{p, q}]++;
ans = max(ans, pointCost[{p, q}]);
}
}
cout << N - ans << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 820,450 | 820,451 | u055131803 | cpp |
p03006 | #include <bits/stdc++.h>
using namespace std;
#define N 50
int a[N + 1], b[N + 1];
int main() {
int n, mn = n, i;
scanf("%d", &n);
for (i = 1; i <= n; i++)
scanf("%d%d", a + i, b + i);
for (i = 1; i <= n; i++)
for (int j = i + 1; j <= n; j++) {
int x = a[i] - a[j], y = b[i] - b[j], ans = n;
for (int k = 1; k <= n; k++)
for (int o = 1; o <= n; o++)
if (a[k] - a[o] == x && b[k] - b[o] == y)
ans--;
mn = min(mn, ans);
}
printf("%d\n", mn);
return 0;
}
/*1
2
1 1
2 2
*/
/*2
3
1 4
4 6
7 8
*/
/*3
4
1 1
1 2
2 1
2 2
*/ | #include <bits/stdc++.h>
using namespace std;
#define N 50
int a[N + 1], b[N + 1];
int main() {
int n, mn, i;
scanf("%d", &n);
mn = n;
for (i = 1; i <= n; i++)
scanf("%d%d", a + i, b + i);
for (i = 1; i <= n; i++)
for (int j = i + 1; j <= n; j++) {
int x = a[i] - a[j], y = b[i] - b[j], ans = n;
for (int k = 1; k <= n; k++)
for (int o = 1; o <= n; o++)
if (a[k] - a[o] == x && b[k] - b[o] == y)
ans--;
mn = min(mn, ans);
}
printf("%d\n", mn);
return 0;
}
/*1
2
1 1
2 2
*/
/*2
3
1 4
4 6
7 8
*/
/*3
4
1 1
1 2
2 1
2 2
*/ | [
"assignment.add"
] | 820,460 | 820,461 | u058625538 | cpp |
p03006 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
map<pair<ll, ll>, ll> mp;
vector<pair<ll, ll>> v;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, k;
cin >> n;
ll mx = 0;
for (ll i = 1; i <= n; ++i) {
ll a, b;
cin >> a >> b;
v.emplace_back(a, b);
}
for (ll i = 0; i < n; ++i) {
ll a = v[i].first;
ll b = v[i].second;
for (ll j = 0; j < n; ++j) {
if (j == i)
continue;
pair<ll, ll> tmp;
if (a > v[j].first) {
tmp.first = a - v[j].first;
tmp.second = b - v[j].second;
} else
continue;
mp[tmp]++;
if (mp[tmp] > mx) {
mx = mp[tmp];
}
}
}
cout << n - mx << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
map<pair<ll, ll>, ll> mp;
vector<pair<ll, ll>> v;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, k;
cin >> n;
ll mx = 0;
for (ll i = 1; i <= n; ++i) {
ll a, b;
cin >> a >> b;
v.emplace_back(a, b);
}
for (ll i = 0; i < n; ++i) {
ll a = v[i].first;
ll b = v[i].second;
for (ll j = 0; j < n; ++j) {
if (j == i)
continue;
pair<ll, ll> tmp;
if (a >= v[j].first) {
tmp.first = a - v[j].first;
tmp.second = b - v[j].second;
} else
continue;
mp[tmp]++;
if (mp[tmp] > mx) {
mx = mp[tmp];
}
}
}
cout << n - mx << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 820,462 | 820,463 | u976418120 | cpp |
p03006 | #include <iostream>
#include <map>
#include <tuple>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> x(N), y(N);
for (int i = 0; i < N; ++i) {
cin >> x[i] >> y[i];
}
map<tuple<int, int>, int> r;
for (int i = 0; i < N; ++i) {
for (int j = i + 1; j < N; ++j) {
int dx = x[i] - x[j], dy = y[i] - y[j];
auto add = [&](int dx, int dy) {
auto const key = make_tuple(dx, dy);
auto it = r.find(key);
if (it != r.end()) {
it->second += 1;
} else {
r.emplace(key, 1);
}
};
add(dx, dy);
add(-dx, -dy);
}
}
int m = 0;
for (auto it = r.cbegin(); it != r.cend(); ++it) {
if (m < it->second) {
m = it->second;
}
}
cout << N - m + 1 << endl;
}
| #include <iostream>
#include <map>
#include <tuple>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> x(N), y(N);
for (int i = 0; i < N; ++i) {
cin >> x[i] >> y[i];
}
map<tuple<int, int>, int> r;
for (int i = 0; i < N; ++i) {
for (int j = i + 1; j < N; ++j) {
int dx = x[i] - x[j], dy = y[i] - y[j];
auto add = [&](int dx, int dy) {
auto const key = make_tuple(dx, dy);
auto const it = r.find(key);
if (it != r.end()) {
it->second += 1;
} else {
r.emplace(key, 1);
}
};
add(dx, dy);
add(-dx, -dy);
}
}
int m = 0;
for (auto it = r.cbegin(); it != r.cend(); ++it) {
if (m < it->second) {
m = it->second;
}
}
cout << N - m << endl;
}
| [
"expression.operation.binary.remove"
] | 820,470 | 820,471 | u898335619 | cpp |
p03006 | #include <bits/stdc++.h>
using namespace std;
int x[51], y[51];
int main() {
int cnt, i, j, n, m, k, l, ans = INT_MAX, cx, cy;
scanf("%d", &n);
for (i = 0; i < n; i++)
printf("%d%d", &x[i], &y[i]);
if (n == 1) {
printf("1");
return 0;
}
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
if (i == j)
continue;
cx = x[j] - x[i];
cy = y[j] - y[i];
cnt = 0;
for (k = 0; k < n; k++)
for (l = 0; l < n; l++)
if (cx == x[l] - x[k] && cy == y[l] - y[k])
cnt++;
ans = min(ans, n - cnt);
}
}
printf("%d", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int x[51], y[51];
int main() {
int cnt, i, j, n, m, k, l, ans = INT_MAX, cx, cy;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d%d", &x[i], &y[i]);
if (n == 1) {
printf("1");
return 0;
}
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
if (i == j)
continue;
cx = x[j] - x[i];
cy = y[j] - y[i];
cnt = 0;
for (k = 0; k < n; k++)
for (l = 0; l < n; l++)
if (cx == x[l] - x[k] && cy == y[l] - y[k])
cnt++;
ans = min(ans, n - cnt);
}
}
printf("%d", ans);
return 0;
} | [
"identifier.change",
"call.function.change",
"io.output.change"
] | 820,488 | 820,489 | u314499126 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.