problem_id stringlengths 6 6 | language stringclasses 2 values | original_status stringclasses 3 values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3 values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270 values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03018 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define ra return a;
#define pb push_back
#define sti stack<ll>
#define spi stack<pair<ll, ll>>
#define S second
#define msi map<string, ll>
#define msi map<string, ll>
#define mii map<ll, ll>
#define dbg(x) \
{ cerr << #x << ": " << x << endl; }
#define dbg2(x, y) \
{ cerr << #x << ": " << x << " , " << #y << ": " << y << endl; }
#define dbg3(x, y, z) \
{ \
cerr << #x << ": " << x << " , " << #y << ": " << y << " , " << #z << ": " \
<< z << endl; \
}
#define mis map<ll, string>
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define mpi map<pair<ll, ll>, ll>
#define pii pair<ll, ll>
#define ppb pop_back
#define F first
#define vi vector<ll>
#define vii vector<pair<ll, ll>>
#define si set<ll>
#define vs vector<string>
#define all(a) (a).begin(), (a).end()
#define sz(x) (ll) x.size()
#define hell 1000000007
#define bs binary_search
#define mp make_pair
#define qi queue<ll>
#define qs queue<string>
#define qpi queue<pair<ll, ll>>
#define qps queue<pair<ll, string>>
#define endl '\n'
#define itr(a, it) \
for (typeof(a.begin()) it = a.begin(); it != a.end(); \
it++) // This will produce const_iterator for const object and normal
// iterator for non-const object
#define ss set<string>
using namespace std;
#define N 300005
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll t = 1;
// cin>>t;
while (t--) {
string s;
cin >> s;
ll n = sz(s), ans = 0, j;
rep(i, 0, n - 2) {
if (s[i] == 'A') {
if (s[i + 1] == 'B') {
if (s[i + 2] == 'C') {
s[i + 1] = 'C', s[i + 2] = 'A', s[i] = 'B', ans++;
j = i - 1;
while (j > -1) {
if (s[j] == 'A') {
if (s[j + 1] == 'B') {
if (s[j + 2] == 'C') {
s[j + 1] = 'C', s[j + 2] = 'A', s[j] = 'B', ans++;
j -= 1;
} else
break;
} else
break;
} else
break;
}
}
}
}
}
cout << ans;
}
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define ra return a;
#define pb push_back
#define sti stack<ll>
#define spi stack<pair<ll, ll>>
#define S second
#define msi map<string, ll>
#define msi map<string, ll>
#define mii map<ll, ll>
#define dbg(x) \
{ cerr << #x << ": " << x << endl; }
#define dbg2(x, y) \
{ cerr << #x << ": " << x << " , " << #y << ": " << y << endl; }
#define dbg3(x, y, z) \
{ \
cerr << #x << ": " << x << " , " << #y << ": " << y << " , " << #z << ": " \
<< z << endl; \
}
#define mis map<ll, string>
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define mpi map<pair<ll, ll>, ll>
#define pii pair<ll, ll>
#define ppb pop_back
#define F first
#define vi vector<ll>
#define vii vector<pair<ll, ll>>
#define si set<ll>
#define vs vector<string>
#define all(a) (a).begin(), (a).end()
#define sz(x) (ll) x.size()
#define hell 1000000007
#define bs binary_search
#define mp make_pair
#define qi queue<ll>
#define qs queue<string>
#define qpi queue<pair<ll, ll>>
#define qps queue<pair<ll, string>>
#define endl '\n'
#define itr(a, it) \
for (typeof(a.begin()) it = a.begin(); it != a.end(); \
it++) // This will produce const_iterator for const object and normal
// iterator for non-const object
#define ss set<string>
using namespace std;
#define N 300005
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll t = 1;
// cin>>t;
while (t--) {
string s;
cin >> s;
ll n = sz(s), ans = 0, j;
ll cnt = 0;
rep(i, 0, n - 1) {
if (s[i] == 'A')
cnt++;
else if (s[i] == 'B') {
if (s[i + 1] == 'C') {
ans += cnt;
i += 1;
} else
cnt = 0;
} else
cnt = 0;
// dbg2(i,cnt);
}
cout << ans;
}
return 0;
}
| replace | 56 | 78 | 56 | 69 | TLE | |
p03018 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// const ll mod = 1000000007;
int main() {
// cout.precision(10);
cin.tie(0);
ios::sync_with_stdio(false);
string S;
cin >> S;
S = "###" + S + "###";
int ans = 0;
queue<int> que;
for (int i = 0; i < S.size(); i++) {
if (S.substr(i, 3) == "ABC")
que.push(i);
}
while (!que.empty()) {
int now = que.front();
que.pop();
ans++;
S[now] = 'B';
S[now + 1] = 'C';
S[now + 2] = 'A';
if (S.substr(now - 1, 3) == "ABC")
que.push(now - 1);
if (S.substr(now + 2, 3) == "ABC")
que.push(now + 2);
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// const ll mod = 1000000007;
int main() {
// cout.precision(10);
cin.tie(0);
ios::sync_with_stdio(false);
string S;
cin >> S;
S = S + "###";
ll ans = 0;
ll nowa = 0;
for (ll i = 0; i < S.size(); i++) {
if (S[i] == 'A') {
nowa++;
continue;
}
if (S[i] == 'B' && S.substr(i, 2) == "BC") {
ans += nowa;
i++;
continue;
}
nowa = 0;
}
cout << ans << endl;
return 0;
} | replace | 32 | 50 | 32 | 46 | TLE | |
p03018 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
int ans = 0;
for (int i = N - 3; i >= 0; i--) {
if (S[i] == 'A' && S[i + 1] == 'B' && S[i + 2] == 'C') {
ans++;
S[i] = 'B';
S[i + 1] = 'C';
S[i + 2] = 'A';
int ii = i + 2;
while (ii + 2 < N && S[ii] == 'A' && S[ii + 1] == 'B' &&
S[ii + 2] == 'C') {
ans++;
S[ii] = 'B';
S[ii + 1] = 'C';
S[ii + 2] = 'A';
ii += 2;
}
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int N = S.size();
string s;
for (int i = 0; i < N; i++) {
if (i + 1 < N && S[i] == 'B' && S[i + 1] == 'C') {
s += 'D';
i++;
} else
s += S[i];
}
int n = s.size();
int a = 0;
long long ans = 0;
for (int i = 0; i < n; i++) {
if (s[i] == 'A')
a++;
else if (s[i] == 'D')
ans += a;
else
a = 0;
}
cout << ans << endl;
}
| replace | 8 | 25 | 8 | 26 | TLE | |
p03018 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <stack>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
string s;
getline(cin, s);
vector<char> SS;
for (auto i = 0; i < s.size() - 1; i++) {
if (s[i] == 'A') {
SS.push_back('A');
} else {
if (s[i] == 'B' && s[i + 1] == 'C') {
SS.push_back('D');
i++;
} else {
if (SS.back() != '|')
SS.push_back('|');
}
}
}
stack<int> mys;
SS.push_back('|');
long long cc = 0;
for (auto i = 0; i < SS.size(); i++) {
auto c = SS[i];
if (c == '|') {
auto j = i - 1;
while (!mys.empty()) {
auto t = mys.top();
cc += (j - t);
mys.pop();
j--;
}
continue;
}
if (c == 'A')
mys.push(i);
}
cout << cc << endl;
return 0;
} | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <stack>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
string s;
getline(cin, s);
vector<char> SS;
for (auto i = 0; i < s.size() - 1; i++) {
if (s[i] == 'A') {
SS.push_back('A');
} else {
if (s[i] == 'B' && s[i + 1] == 'C') {
SS.push_back('D');
i++;
} else {
if (SS.size() >= 1) {
if (SS.back() != '|')
SS.push_back('|');
}
}
}
}
stack<int> mys;
SS.push_back('|');
long long cc = 0;
for (auto i = 0; i < SS.size(); i++) {
auto c = SS[i];
if (c == '|') {
auto j = i - 1;
while (!mys.empty()) {
auto t = mys.top();
cc += (j - t);
mys.pop();
j--;
}
continue;
}
if (c == 'A')
mys.push(i);
}
cout << cc << endl;
return 0;
} | replace | 22 | 24 | 22 | 26 | 0 | |
p03018 | Python | Time Limit Exceeded | def li():
return list(map(int, input().split()))
if __name__ == "__main__":
s = input()
ope_num = 0
index = 0
a_stock = 0
b_stock = 0
s = list(s)
while index < len(s):
# print(s)
# print(index)
# print(ope_num)
# print()
si = s[index]
if si == "A":
if b_stock > 0:
a_stock = 1
else:
a_stock = a_stock + 1
b_stock = 0
elif a_stock > 0:
if b_stock == 0:
if si == "B":
b_stock = 1
else:
a_stock = 0
b_stock = 0
elif si == "C":
ope_num = ope_num + a_stock
# s[index - 2 - a_stock + 1] = "B"
# s[index - 1 - a_stock + 1] = "C"
for i in range(a_stock - 1, -1, -1):
s[index - i] = "A"
index = index - a_stock
a_stock = 0
b_stock = 0
else:
a_stock = 0
b_stock = 0
else:
a_stock = 0
b_stock = 0
index = index + 1
print(ope_num)
# ABCの数
# ABCの前にあるAの分だけ追加で操作できる
# ABCの後にある(BC)の分だけ追加で操作できる
# Aがあれば覚えておく
# ABCと来たら、それより前側に隣接しているAの回数だけ追加で操作できる
# 見つかったABCをBCAに置き換える
# BCAのAから走査を継続する
| def li():
return list(map(int, input().split()))
if __name__ == "__main__":
s = input()
ope_num = 0
index = 0
a_stock = 0
b_stock = 0
s = list(s)
while index < len(s):
# print(s)
# print(index)
# print(ope_num)
# print()
si = s[index]
if si == "A":
if b_stock > 0:
a_stock = 1
else:
a_stock = a_stock + 1
b_stock = 0
elif a_stock > 0:
if b_stock == 0:
if si == "B":
b_stock = 1
else:
a_stock = 0
b_stock = 0
elif si == "C":
ope_num = ope_num + a_stock
# s[index - 2 - a_stock + 1] = "B"
# s[index - 1 - a_stock + 1] = "C"
# s[index] = "A"
# index = index - 1
a_stock = a_stock
b_stock = 0
else:
a_stock = 0
b_stock = 0
else:
a_stock = 0
b_stock = 0
index = index + 1
print(ope_num)
# ABCの数
# ABCの前にあるAの分だけ追加で操作できる
# ABCの後にある(BC)の分だけ追加で操作できる
# Aがあれば覚えておく
# ABCと来たら、それより前側に隣接しているAの回数だけ追加で操作できる
# 見つかったABCをBCAに置き換える
# BCAのAから走査を継続する
| replace | 34 | 38 | 34 | 37 | TLE | |
p03018 | Python | Time Limit Exceeded | s = input()
ans = 0
cntA = 0
for i in range(0, len(s) - 1):
if s[i] == "A":
cntA += 1
elif s[i : i + 2] == "BC":
cntANext = 0
for j in range(0, cntA):
ans += 1
cntANext += 1
cntA = cntANext
elif i > 0 and s[i - 1 : i + 1] == "BC":
continue
else:
cntA = 0
print(ans)
# print(*data, sep='\n')
| s = input()
ans = 0
cntA = 0
for i in range(0, len(s) - 1):
if s[i] == "A":
cntA += 1
elif s[i : i + 2] == "BC":
ans += cntA
elif i > 0 and s[i - 1 : i + 1] == "BC":
continue
else:
cntA = 0
print(ans)
# print(*data, sep='\n')
| replace | 7 | 12 | 7 | 8 | TLE | |
p03018 | C++ | Runtime Error | /////////////////////////////////////////////////
///// Give me AC!!!! /////
/////////////////////////////////////////////////
// ↑これじゃ気合いが足りない！
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////
/////
///お願いしますACをくださいそうじゃないと僕泣きますお願いしますACをくださいJudge様....
////////
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, N) for (int i = 0; i < (N); i++)
#define erep(i, N) for (int i = N - 1; i >= 0; i--)
const ll MOD = 1000000007;
const ld PI = (acos(-1));
using Graph = vector<vector<int>>;
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;
}
typedef pair<int, int> P;
typedef pair<ll, ll> PLL;
ld rad(ld a) { return a * 180 / PI; }
const int dx[4] = {1, 0, -1, 0}; // 2次元グリッド上のx軸方向
const int dy[4] = {0, 1, 0, -1}; // 2次元グリッド上のy軸方向
template <int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
if (val < 0)
val += MOD;
}
constexpr int getmod() { return MOD; }
constexpr Fp operator-() const noexcept { return val ? MOD - val : 0; }
constexpr Fp operator+(const Fp &r) const noexcept { return Fp(*this) += r; }
constexpr Fp operator-(const Fp &r) const noexcept { return Fp(*this) -= r; }
constexpr Fp operator*(const Fp &r) const noexcept { return Fp(*this) *= r; }
constexpr Fp operator/(const Fp &r) const noexcept { return Fp(*this) /= r; }
constexpr Fp &operator+=(const Fp &r) noexcept {
val += r.val;
if (val >= MOD)
val -= MOD;
return *this;
}
constexpr Fp &operator-=(const Fp &r) noexcept {
val -= r.val;
if (val < 0)
val += MOD;
return *this;
}
constexpr Fp &operator*=(const Fp &r) noexcept {
val = val * r.val % MOD;
return *this;
}
constexpr Fp &operator/=(const Fp &r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % MOD;
if (val < 0)
val += MOD;
return *this;
}
constexpr bool operator==(const Fp &r) const noexcept {
return this->val == r.val;
}
constexpr bool operator!=(const Fp &r) const noexcept {
return this->val != r.val;
}
friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept {
return os << x.val;
}
friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
using mint = Fp<MOD>;
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n, -1) {}
int root(int x) {
if (par[x] < 0)
return x;
else
return par[x] = root(par[x]);
}
bool same(int x, int y) { return root(x) == root(y); }
bool merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (par[x] > par[y])
swap(x, y); // merge technique
par[x] += par[y];
par[y] = x;
return true;
}
int size(int x) { return -par[root(x)]; }
};
vector<pair<ll, ll>> prime_factorize(ll N) {
vector<pair<ll, ll>> res;
for (ll a = 2; a * a <= N; ++a) {
if (N % a != 0)
continue;
ll ex = 0; // 指数
// 割れる限り割り続ける
while (N % a == 0) {
++ex;
N /= a;
}
// その結果を push
res.push_back({a, ex});
}
// 最後に残った数について
if (N != 1)
res.push_back({N, 1});
return res;
}
// dpTable
// int dp[200050];
int main() {
string S;
cin >> S;
int N = S.size();
vector<int> sum(N + 1, 0);
for (int i = 0; i < N; i++) {
if (S.at(i) == 'A') {
sum.at(i + 1) = sum.at(i) + 1;
} else if (i != 0 && i != N - 1) {
if ((S.at(i) == 'B' && S.at(i + 1) == 'C') ||
(S.at(i - 1) == 'B' && S.at(i) == 'C')) {
sum.at(i + 1) = sum.at(i);
}
} else if (i == N - 1) {
if (S.at(i - 1) == 'B' && S.at(i) == 'C') {
sum.at(i + 1) = sum.at(i);
}
}
}
ll ans = 0;
for (int i = 0; i < N; i++) {
if (S.at(i) == 'B')
ans += sum.at(i + 1);
}
cout << ans << endl;
return 0;
} | /////////////////////////////////////////////////
///// Give me AC!!!! /////
/////////////////////////////////////////////////
// ↑これじゃ気合いが足りない！
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////
/////
///お願いしますACをくださいそうじゃないと僕泣きますお願いしますACをくださいJudge様....
////////
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, N) for (int i = 0; i < (N); i++)
#define erep(i, N) for (int i = N - 1; i >= 0; i--)
const ll MOD = 1000000007;
const ld PI = (acos(-1));
using Graph = vector<vector<int>>;
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;
}
typedef pair<int, int> P;
typedef pair<ll, ll> PLL;
ld rad(ld a) { return a * 180 / PI; }
const int dx[4] = {1, 0, -1, 0}; // 2次元グリッド上のx軸方向
const int dy[4] = {0, 1, 0, -1}; // 2次元グリッド上のy軸方向
template <int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
if (val < 0)
val += MOD;
}
constexpr int getmod() { return MOD; }
constexpr Fp operator-() const noexcept { return val ? MOD - val : 0; }
constexpr Fp operator+(const Fp &r) const noexcept { return Fp(*this) += r; }
constexpr Fp operator-(const Fp &r) const noexcept { return Fp(*this) -= r; }
constexpr Fp operator*(const Fp &r) const noexcept { return Fp(*this) *= r; }
constexpr Fp operator/(const Fp &r) const noexcept { return Fp(*this) /= r; }
constexpr Fp &operator+=(const Fp &r) noexcept {
val += r.val;
if (val >= MOD)
val -= MOD;
return *this;
}
constexpr Fp &operator-=(const Fp &r) noexcept {
val -= r.val;
if (val < 0)
val += MOD;
return *this;
}
constexpr Fp &operator*=(const Fp &r) noexcept {
val = val * r.val % MOD;
return *this;
}
constexpr Fp &operator/=(const Fp &r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % MOD;
if (val < 0)
val += MOD;
return *this;
}
constexpr bool operator==(const Fp &r) const noexcept {
return this->val == r.val;
}
constexpr bool operator!=(const Fp &r) const noexcept {
return this->val != r.val;
}
friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept {
return os << x.val;
}
friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
using mint = Fp<MOD>;
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n, -1) {}
int root(int x) {
if (par[x] < 0)
return x;
else
return par[x] = root(par[x]);
}
bool same(int x, int y) { return root(x) == root(y); }
bool merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (par[x] > par[y])
swap(x, y); // merge technique
par[x] += par[y];
par[y] = x;
return true;
}
int size(int x) { return -par[root(x)]; }
};
vector<pair<ll, ll>> prime_factorize(ll N) {
vector<pair<ll, ll>> res;
for (ll a = 2; a * a <= N; ++a) {
if (N % a != 0)
continue;
ll ex = 0; // 指数
// 割れる限り割り続ける
while (N % a == 0) {
++ex;
N /= a;
}
// その結果を push
res.push_back({a, ex});
}
// 最後に残った数について
if (N != 1)
res.push_back({N, 1});
return res;
}
// dpTable
// int dp[200050];
int main() {
string S;
cin >> S;
int N = S.size();
if (N == 1) {
cout << 0 << endl;
return 0;
}
vector<int> sum(N + 1, 0);
for (int i = 0; i < N; i++) {
if (S.at(i) == 'A') {
sum.at(i + 1) = sum.at(i) + 1;
} else if (i != 0 && i != N - 1) {
if ((S.at(i) == 'B' && S.at(i + 1) == 'C') ||
(S.at(i - 1) == 'B' && S.at(i) == 'C')) {
sum.at(i + 1) = sum.at(i);
}
} else if (i == N - 1) {
if (S.at(i - 1) == 'B' && S.at(i) == 'C') {
sum.at(i + 1) = sum.at(i);
}
}
}
ll ans = 0;
for (int i = 0; i < N; i++) {
if (S.at(i) == 'B')
ans += sum.at(i + 1);
}
cout << ans << endl;
return 0;
} | insert | 159 | 159 | 159 | 163 | 0 | |
p03018 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int sum = 0;
while (true) {
if (s.find("ABC") == std::string::npos)
break;
else {
int a = s.find("ABC");
s.replace(a, 3, "BCA");
sum += 1;
}
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
long sum = 0;
long litsum = 0;
for (int i = 0; i < s.length(); i++) {
if (s[i] == 'A')
litsum += 1;
else if (s[i] == 'B') {
if (i == s.length() - 1)
break;
else if (s[i + 1] == 'C') {
sum += litsum;
} else if (s[i + 1] == 'A') {
litsum = 0;
} else
litsum = 0;
} else if (s[i] == 'C') {
if (i == 0)
continue;
else if (s[i - 1] == 'B')
continue;
else
litsum = 0;
}
}
cout << sum << endl;
} | replace | 6 | 14 | 6 | 27 | TLE | |
p03018 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define str string
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define vc vector<char>
#define vvc vector<vc>
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define vvll vector<vll>
#define vvvll vector<vvll>
#define vs vector<str>
#define vvs vector<vs>
#define vpii vector<pii>
#define vvpii vector<vpii>
#define vpll vector<pll>
#define vvpll vector<vpll>
#define vb vector<bool>
#define vvb vector<vb>
#define rep(i, a, b) for (int i = (a); i < int(b); i++)
#define repi(i, a, b) for (int i = (a); i <= int(b); i++)
using namespace std;
ll INF = LONG_LONG_MAX;
ll mod = 1000000000 + 7;
template <typename T, typename L>
void read(vector<T> &_data, L &_size, bool _shift) {
_data.resize(_size + (ll)_shift);
for (ll i = (ll)_shift; i < _size + (ll)_shift; i++)
cin >> _data[i];
}
template <typename T, typename L>
void read(vector<vector<T>> &_data, L &_rows, L &_cols, bool _shiftRows,
bool _shiftCols) {
_data.resize(_rows + (ll)_shiftRows);
for (ll i = 0; i < _rows + (ll)_shiftRows; i++)
_data[i].resize(_cols + (ll)_shiftCols);
for (ll i = (ll)_shiftRows; i < _rows + (ll)_shiftRows; i++)
for (ll j = (ll)_shiftCols; j < _cols + (ll)_shiftCols; j++)
cin >> _data[i][j];
}
template <typename T> void write(vector<T> &_data, bool _shift) {
for (ll i = (ll)_shift; i < _data.size(); i++)
cout << _data[i] << " ";
cout << endl;
}
// TODO: SOLUTION
void solve() {
str s;
cin >> s;
ll ans = 0;
for (int i = s.size() - 3; i >= 0; i--) {
for (int j = i; j < s.size() - 2; j++) {
if (s.substr(j, 3) == "ABC") {
ans++;
s[j] = 'B';
s[j + 1] = 'C';
s[j + 2] = 'A';
}
}
}
cout << ans << endl;
}
int main() {
// TODO: Set value of this variable manually
bool _multipleTestCases = false;
if (_multipleTestCases) {
ll t;
cin >> t;
while (t--)
solve();
} else {
solve();
}
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define str string
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define vc vector<char>
#define vvc vector<vc>
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define vvll vector<vll>
#define vvvll vector<vvll>
#define vs vector<str>
#define vvs vector<vs>
#define vpii vector<pii>
#define vvpii vector<vpii>
#define vpll vector<pll>
#define vvpll vector<vpll>
#define vb vector<bool>
#define vvb vector<vb>
#define rep(i, a, b) for (int i = (a); i < int(b); i++)
#define repi(i, a, b) for (int i = (a); i <= int(b); i++)
using namespace std;
ll INF = LONG_LONG_MAX;
ll mod = 1000000000 + 7;
template <typename T, typename L>
void read(vector<T> &_data, L &_size, bool _shift) {
_data.resize(_size + (ll)_shift);
for (ll i = (ll)_shift; i < _size + (ll)_shift; i++)
cin >> _data[i];
}
template <typename T, typename L>
void read(vector<vector<T>> &_data, L &_rows, L &_cols, bool _shiftRows,
bool _shiftCols) {
_data.resize(_rows + (ll)_shiftRows);
for (ll i = 0; i < _rows + (ll)_shiftRows; i++)
_data[i].resize(_cols + (ll)_shiftCols);
for (ll i = (ll)_shiftRows; i < _rows + (ll)_shiftRows; i++)
for (ll j = (ll)_shiftCols; j < _cols + (ll)_shiftCols; j++)
cin >> _data[i][j];
}
template <typename T> void write(vector<T> &_data, bool _shift) {
for (ll i = (ll)_shift; i < _data.size(); i++)
cout << _data[i] << " ";
cout << endl;
}
// TODO: SOLUTION
void solve() {
str s;
cin >> s;
ll ans = 0;
ll bcsuf = 0;
for (int i = s.size() - 2; i >= 0; i--) {
str sub;
sub.resize(2);
sub[0] = s[i];
sub[1] = s[i + 1];
if (sub == "BC")
bcsuf++;
else if (sub == "BA" || sub == "BB" || sub == "CC" || sub == "AC")
bcsuf = 0;
else if (sub == "AB" || sub == "AA")
ans += bcsuf;
}
cout << ans << endl;
}
int main() {
// TODO: Set value of this variable manually
bool _multipleTestCases = false;
if (_multipleTestCases) {
ll t;
cin >> t;
while (t--)
solve();
} else {
solve();
}
return 0;
} | replace | 61 | 70 | 61 | 73 | TLE | |
p03018 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
// #define MOD 998244353
#define INF 1145141919810893364
typedef pair<int, int> PP;
typedef long long ll;
#define int ll
#define setdouble setprecision
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define RREP(i, n) for (int i = (n)-1; i >= 0; --i)
#define GOODBYE \
cout << -1 << endl; \
return 0
#define Endl endl
signed main(void) {
string S;
cin >> S;
int Ans = 0;
int N = S.size();
vector<pair<char, int>> E;
int r = 0;
int M = N;
REP(i, N) {
if (S[i] == 'A') {
r++;
} else {
if (r != 0) {
M -= (r - 1);
E.push_back({'A', r});
}
r = 0;
E.push_back({S[i], 1});
}
}
/*cout << M << endl;
REP(i,M){cout << E[i].first <<" ";}cout << endl;
REP(i,M){cout << E[i].second <<" ";}cout << endl;
*/
pair<char, int> T;
REP(i, M - 2) {
if (E[i].first == 'A' && E[i + 1].first == 'B' && E[i + 2].first == 'C') {
T = E[i];
E[i] = E[i + 1];
E[i + 1] = E[i + 2];
E[i + 2] = T;
Ans += T.second;
i = max(i - 1, 0LL);
i = max(i - 1, 0LL);
}
}
cout << Ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
// #define MOD 998244353
#define INF 1145141919810893364
typedef pair<int, int> PP;
typedef long long ll;
#define int ll
#define setdouble setprecision
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define RREP(i, n) for (int i = (n)-1; i >= 0; --i)
#define GOODBYE \
cout << -1 << endl; \
return 0
#define Endl endl
signed main(void) {
string S;
cin >> S;
int Ans = 0;
int N = S.size();
vector<pair<char, int>> E;
int r = 0;
int M = N;
REP(i, N) {
if (S[i] == 'A') {
r++;
} else {
if (r != 0) {
M -= (r - 1);
E.push_back({'A', r});
}
r = 0;
E.push_back({S[i], 1});
}
}
if (r != 0) {
M -= (r - 1);
E.push_back({'A', r});
}
/*
cout << M << endl;
cout << E.size() << endl;
REP(i,M){cout << E[i].first <<" ";}cout << endl;
REP(i,M){cout << E[i].second <<" ";}cout << endl;
*/
pair<char, int> T;
REP(i, M - 2) {
if (E[i].first == 'A' && E[i + 1].first == 'B' && E[i + 2].first == 'C') {
T = E[i];
E[i] = E[i + 1];
E[i + 1] = E[i + 2];
E[i + 2] = T;
Ans += T.second;
i = max(i - 1, 0LL);
i = max(i - 1, 0LL);
}
}
cout << Ans << endl;
return 0;
}
| replace | 37 | 38 | 37 | 44 | 0 | |
p03018 | C++ | Time Limit Exceeded | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ███████████
// ██╬╬╬╬╬████╬╬████╬╬╬╬╬██
// █████████╬╬╬╬╬████████████╬╬╬╬╬██╬╬╬╬╬╬███╬╬╬╬╬██
// ████████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████████╬╬╬╬╬╬██╬╬╬╬╬╬╬██
// ████╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████████╬╬╬╬╬╬╬╬╬╬╬██
// ███╬╬╬█╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬███╬╬╬╬╬╬╬█████
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬████████╬╬╬╬╬██
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬██
// ████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████╬╬╬╬╬████
// █████████████╬╬╬╬╬╬╬╬██╬╬╬╬╬████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬██████
// ████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬██████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██████╬╬╬╬╬╬╬███████████╬╬╬╬╬╬╬╬██╬╬╬██╬╬╬██
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████╬╬╬╬╬╬╬╬╬╬╬█╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬██
// ██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬▓▓▓▓▓▓╬╬╬████╬╬████╬╬╬╬╬╬╬▓▓▓▓▓▓▓▓██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬███
// ██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██████▓▓▓▓▓▓▓╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬▓▓▓▓▓▓▓██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬█████
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████████
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██
// ██████████████
// ████╬╬╬╬╬╬███████████████████████████╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████
// ███████ █████
// ███████████████████
#include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
// #define MOD 998244353
const double EPS = 1e-9;
#define INF (1LL << 60)
#define D double
#define fs first
#define sc second
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b - 1); i >= (a); i--)
#define REP(i, n) FOR(i, 0, (n))
#define RREP(i, n) RFOR(i, 0, (n))
#define ITR(itr, mp) for (auto itr = (mp).begin(); itr != (mp).end(); ++itr)
#define RITR(itr, mp) for (auto itr = (mp).rbegin(); itr != (mp).rend(); ++itr)
#define range(i, a, b) ((a) <= (i) && (i) < (b))
#define debug(x) cout << #x << " = " << (x) << endl;
#define SP << " " <<
typedef pair<int, int> P;
typedef vector<vector<P>> Graph;
typedef vector<int> vec;
typedef vector<vector<int>> mat;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
int n = s.size();
int ans = 0;
REP(i, n - 2) {
if (i < 0)
continue;
if (s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C') {
ans++;
s[i] = 'B';
s[i + 1] = 'C';
s[i + 2] = 'A';
i -= 2;
}
// debug(i);
}
cout << ans << endl;
return 0;
} | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ███████████
// ██╬╬╬╬╬████╬╬████╬╬╬╬╬██
// █████████╬╬╬╬╬████████████╬╬╬╬╬██╬╬╬╬╬╬███╬╬╬╬╬██
// ████████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████████╬╬╬╬╬╬██╬╬╬╬╬╬╬██
// ████╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████████╬╬╬╬╬╬╬╬╬╬╬██
// ███╬╬╬█╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬███╬╬╬╬╬╬╬█████
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬████████╬╬╬╬╬██
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬██
// ████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████╬╬╬╬╬████
// █████████████╬╬╬╬╬╬╬╬██╬╬╬╬╬████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬██████
// ████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬██████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██████╬╬╬╬╬╬╬███████████╬╬╬╬╬╬╬╬██╬╬╬██╬╬╬██
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████╬╬╬╬╬╬╬╬╬╬╬█╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬██
// ██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬▓▓▓▓▓▓╬╬╬████╬╬████╬╬╬╬╬╬╬▓▓▓▓▓▓▓▓██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬███
// ██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██████▓▓▓▓▓▓▓╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬▓▓▓▓▓▓▓██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬█████
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████████
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██
// ██████████████
// ████╬╬╬╬╬╬███████████████████████████╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████
// ███████ █████
// ███████████████████
#include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
// #define MOD 998244353
const double EPS = 1e-9;
#define INF (1LL << 60)
#define D double
#define fs first
#define sc second
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b - 1); i >= (a); i--)
#define REP(i, n) FOR(i, 0, (n))
#define RREP(i, n) RFOR(i, 0, (n))
#define ITR(itr, mp) for (auto itr = (mp).begin(); itr != (mp).end(); ++itr)
#define RITR(itr, mp) for (auto itr = (mp).rbegin(); itr != (mp).rend(); ++itr)
#define range(i, a, b) ((a) <= (i) && (i) < (b))
#define debug(x) cout << #x << " = " << (x) << endl;
#define SP << " " <<
typedef pair<int, int> P;
typedef vector<vector<P>> Graph;
typedef vector<int> vec;
typedef vector<vector<int>> mat;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
int n = s.size();
int ans = 0, cur = 0;
REP(i, n - 1) {
if (s[i] == 'A')
cur++;
else if (s[i] == 'B' && s[i + 1] == 'C')
ans += cur, i++;
else
cur = 0;
}
cout << ans << endl;
return 0;
} | replace | 58 | 70 | 58 | 66 | TLE | |
p03018 | C++ | Time Limit Exceeded | // Doing Some Optimization
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
using namespace std;
#define int long long
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define FF first
#define SS second
#define sz(x) (int)x.size()
#define endl '\n'
// #define hell 1000000007
#define rep(i, a, b) for (int i = a; i < b; i++)
// mp::cpp_int
const int hell = 1000000009;
int power(int a, int b) {
if (b == 0)
return 1;
if (b == 1)
return a;
int t = power(a, b / 2);
t %= hell;
t *= t;
t %= hell;
if (b % 2)
return (t * a) % hell;
else
return t;
}
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b - a % b, a % b);
}
int digitsum(int x) {
while (x > 9) {
int ans = 0;
while (x != 0) {
ans += x % 10;
x /= 10;
}
x = ans;
}
return x;
}
int pw(int a, int b) {
int x = a;
rep(i, 1, b) { a = a * x; }
return a;
}
int solve() {
string s;
cin >> s;
int n = s.size();
int count = 0;
int ans = 0;
for (int i = 0; i < n - 2; i++) {
if (s[i] == 'A')
count++;
else
count = 0;
if (s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C') {
ans += count;
s[i - count + 1] = 'B';
s[i - count + 2] = 'C';
int x = count;
for (int j = i + 3 - count; x-- && j < n; j++)
s[j] = 'A';
// cout<<s<<endl;
i -= count;
count = 0;
}
}
cout << ans;
return 0;
}
signed main() {
int t = 1;
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin.exceptions(cin.failbit);
clock_t time_req;
// Without using pow function
// cin>>t;
int k = 1;
while (t--) {
// cout<<"case #"<<k<<":"<<" ";k++;
solve();
}
time_req = clock() - time_req;
// cout <<endl<< "Processor time taken is "
//<< (double)time_req/CLOCKS_PER_SEC << " seconds" << endl;
return 0;
}
| // Doing Some Optimization
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
using namespace std;
#define int long long
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define FF first
#define SS second
#define sz(x) (int)x.size()
#define endl '\n'
// #define hell 1000000007
#define rep(i, a, b) for (int i = a; i < b; i++)
// mp::cpp_int
const int hell = 1000000009;
int power(int a, int b) {
if (b == 0)
return 1;
if (b == 1)
return a;
int t = power(a, b / 2);
t %= hell;
t *= t;
t %= hell;
if (b % 2)
return (t * a) % hell;
else
return t;
}
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b - a % b, a % b);
}
int digitsum(int x) {
while (x > 9) {
int ans = 0;
while (x != 0) {
ans += x % 10;
x /= 10;
}
x = ans;
}
return x;
}
int pw(int a, int b) {
int x = a;
rep(i, 1, b) { a = a * x; }
return a;
}
int solve() {
string s;
cin >> s;
int n = s.size();
int count = 0;
int ans = 0;
for (int i = 0; i < n - 2; i++) {
if (s[i] == 'A')
count++;
else
count = 0;
if (s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C') {
ans += count;
s[i + 2] = 'A';
// cout<<s<<" "<<count<<endl;
i += 1;
count--;
}
}
cout << ans;
return 0;
}
signed main() {
int t = 1;
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin.exceptions(cin.failbit);
clock_t time_req;
// Without using pow function
// cin>>t;
int k = 1;
while (t--) {
// cout<<"case #"<<k<<":"<<" ";k++;
solve();
}
time_req = clock() - time_req;
// cout <<endl<< "Processor time taken is "
//<< (double)time_req/CLOCKS_PER_SEC << " seconds" << endl;
return 0;
}
| replace | 115 | 124 | 115 | 119 | TLE | |
p03018 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repn(i, n) for (int i = 0; i <= (int)(n); i++)
#define srep(i, l, n) for (int i = l; i < (int)(n); i++)
#define srepn(i, l, n) for (int i = l; i <= (int)(n); i++)
#define pb push_back
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;
}
const int MOD = 1000000007;
const int INF = 1e9;
#define PI 3.14159265369;
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
int ddx[8] = {1, 1, 1, -1, -1, -1, 0, 0};
int ddy[8] = {0, 1, -1, 0, 1, -1, 1, -1};
int main() {
string s;
cin >> s;
int ans = 0;
rep(i, s.length() - 2) {
if (s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C') {
ans++;
if (i - 1 >= 0 && s[i - 1] == 'A') {
s[i] = 'B';
s[i + 1] = 'C';
s[i + 2] = 'A';
i -= 2;
} else {
s[i + 2] = 'A';
i++;
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repn(i, n) for (int i = 0; i <= (int)(n); i++)
#define srep(i, l, n) for (int i = l; i < (int)(n); i++)
#define srepn(i, l, n) for (int i = l; i <= (int)(n); i++)
#define pb push_back
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;
}
const int MOD = 1000000007;
const int INF = 1e9;
#define PI 3.14159265369;
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
int ddx[8] = {1, 1, 1, -1, -1, -1, 0, 0};
int ddy[8] = {0, 1, -1, 0, 1, -1, 1, -1};
int main() {
string s;
cin >> s;
int nowA = 0;
ll ans = 0;
rep(i, s.length()) {
if (s[i] == 'A')
nowA++;
else if (s.substr(i, 2) == "BC") {
ans += nowA;
i++;
} else
nowA = 0;
}
cout << ans << endl;
} | replace | 37 | 51 | 37 | 47 | TLE | |
p03018 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#if DEBUG && !ONLINE_JUDGE
#include "debug.h"
#else
#define debug(...)
#endif
using namespace std;
/******* All Required define Pre-Processors and typedef Constants *******/
#define mem(a, b) memset(a, (b), sizeof(a))
#define repd(i, k) for (int i = k; i >= 0; i--)
#define rep(i, k) for (int i = 0; i < k; i++)
#define repn(i, k1, k2) for (ll i = k1; i < k2; i++)
#define sz(x) (ll)(x).size()
#define ff first
#define ss second
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define INF (int)1e9
#define EPS 1e-9
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
#define ee6 (ll)1000001
#define ee5 (ll)100001
#define trav(a, v) for (auto &a : v)
#define tt \
ll t; \
cin >> t; \
while (t--)
typedef long long int ll;
typedef pair<ll, ll> pr;
typedef vector<ll> vi;
typedef vector<string> vs;
typedef vector<pr> vpr;
typedef vector<vpr> vvpr;
typedef vector<vi> vvi;
//*X.find_by_order(2) element at index=2
// X.order_of_key(1) how many elements strictly less than 1
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ll powmod(ll x, ll y) {
ll res = 1;
x = x % MOD;
while (y > 0) {
if (y & 1)
res = (res * x) % MOD;
y = y >> 1; // y = y/2
x = (x * x) % MOD;
}
return res;
}
string s;
ll rigt[2 * ee5];
ll bc[2 * ee5], a[2 * ee5];
int main() {
#if !ONLINE_JUDGE
freopen("in.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> s;
ll n = s.size();
for (ll i = n - 1; i >= 0; i--) {
if (i + 1 < n and s[i + 1] == 'A')
rigt[i] = rigt[i + 1];
else if (s[i] == 'A')
rigt[i] = i;
}
for (ll i = n - 2; i >= 0; i--) {
if (s[i] == 'B' and s[i + 1] == 'C')
bc[i] = 1 + bc[i + 2];
}
for (ll i = 0; i < n; i++) {
if (s[i] == 'A')
a[i] = (i ? a[i - 1] : 0) + 1;
}
ll ans = 0;
for (ll i = 0; i + 2 < n; i++) {
if (s[i] == 'A' and s[i + 1] == 'B' and s[i + 2] == 'C') {
ans += (a[i] * bc[i + 1]);
if (i + 1 + 2 * bc[i + 1] < n and s[i + 1 + 2 * bc[i + 1]] == 'A')
a[rigt[i + 1 + 2 * bc[i + 1]]] += a[i];
}
}
cout << ans;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#if DEBUG && !ONLINE_JUDGE
#include "debug.h"
#else
#define debug(...)
#endif
using namespace std;
/******* All Required define Pre-Processors and typedef Constants *******/
#define mem(a, b) memset(a, (b), sizeof(a))
#define repd(i, k) for (int i = k; i >= 0; i--)
#define rep(i, k) for (int i = 0; i < k; i++)
#define repn(i, k1, k2) for (ll i = k1; i < k2; i++)
#define sz(x) (ll)(x).size()
#define ff first
#define ss second
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define INF (int)1e9
#define EPS 1e-9
#define PI 3.1415926535897932384626433832795
#define MOD 1000000007
#define ee6 (ll)1000001
#define ee5 (ll)100001
#define trav(a, v) for (auto &a : v)
#define tt \
ll t; \
cin >> t; \
while (t--)
typedef long long int ll;
typedef pair<ll, ll> pr;
typedef vector<ll> vi;
typedef vector<string> vs;
typedef vector<pr> vpr;
typedef vector<vpr> vvpr;
typedef vector<vi> vvi;
//*X.find_by_order(2) element at index=2
// X.order_of_key(1) how many elements strictly less than 1
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ll powmod(ll x, ll y) {
ll res = 1;
x = x % MOD;
while (y > 0) {
if (y & 1)
res = (res * x) % MOD;
y = y >> 1; // y = y/2
x = (x * x) % MOD;
}
return res;
}
string s;
ll rigt[2 * ee5];
ll bc[2 * ee5], a[2 * ee5];
int main() {
#if !ONLINE_JUDGE
// freopen("in.txt","r",stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> s;
ll n = s.size();
for (ll i = n - 1; i >= 0; i--) {
if (i + 1 < n and s[i + 1] == 'A')
rigt[i] = rigt[i + 1];
else if (s[i] == 'A')
rigt[i] = i;
}
for (ll i = n - 2; i >= 0; i--) {
if (s[i] == 'B' and s[i + 1] == 'C')
bc[i] = 1 + bc[i + 2];
}
for (ll i = 0; i < n; i++) {
if (s[i] == 'A')
a[i] = (i ? a[i - 1] : 0) + 1;
}
ll ans = 0;
for (ll i = 0; i + 2 < n; i++) {
if (s[i] == 'A' and s[i + 1] == 'B' and s[i + 2] == 'C') {
ans += (a[i] * bc[i + 1]);
if (i + 1 + 2 * bc[i + 1] < n and s[i + 1 + 2 * bc[i + 1]] == 'A')
a[rigt[i + 1 + 2 * bc[i + 1]]] += a[i];
}
}
cout << ans;
} | replace | 74 | 75 | 74 | 75 | 0 | |
p03018 | C++ | Runtime Error | // RAY
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD = 1000000007;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
ll count = 0, temp = 0;
ll n = s.size(), x = 0;
ll acount = 0;
for (ll i = 0; i < n - 1; i++) {
if (s[i] == 'A')
acount++;
else if (s[i] == 'B' && s[i + 1] == 'C') {
count += acount;
i++;
} else
acount = 0;
}
cout << count;
return 0;
}
| // RAY
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll MOD = 1000000007;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string s;
cin >> s;
ll count = 0, temp = 0;
ll n = s.size(), x = 0;
ll acount = 0;
for (ll i = 0; i < n - 1; i++) {
if (s[i] == 'A')
acount++;
else if (s[i] == 'B' && s[i + 1] == 'C') {
count += acount;
i++;
} else
acount = 0;
}
cout << count;
return 0;
}
| delete | 7 | 11 | 7 | 7 | 0 | |
p03018 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep1(i, n) for (ll i = 1; i <= n; ++i)
bool judge_bc(string s, int k, int len) {
if (k == len)
return false;
return s[k] == 'B' && s[k + 1] == 'C';
}
int main() {
string s;
cin >> s;
int n = (int)s.length();
ll ans = 0;
int sum_a = 0;
rep(i, n) {
if (s[i] == 'A')
sum_a++;
else if (judge_bc(s, i, n - 1)) {
ans += sum_a;
i++;
} else {
sum_a = 0;
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep1(i, n) for (ll i = 1; i <= n; ++i)
bool judge_bc(string s, int k, int len) {
if (k == len)
return false;
return s[k] == 'B' && s[k + 1] == 'C';
}
int main() {
string s;
cin >> s;
int n = (int)s.length();
ll ans = 0;
int sum_a = 0;
rep(i, n) {
if (s[i] == 'A')
sum_a++;
else if (s[i] == 'B' && s[i + 1] == 'C') {
if (i < n - 1) {
ans += sum_a;
i++;
}
} else {
sum_a = 0;
}
}
cout << ans << endl;
return 0;
}
| replace | 22 | 25 | 22 | 27 | TLE | |
p03018 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using pint = pair<int, int>;
using ll = long long;
using pll = pair<ll, ll>;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FI first
#define SE second
#define endl "\n"
#define ciosup \
cin.tie(0); \
ios::sync_with_stdio(false);
#define eb emplace_back
constexpr ll INF = 1e9 + 7;
constexpr ll MOD = 1e9 + 7;
int main() {
ciosup;
string s[200'000];
int j = 0;
char moji, moji2;
while (cin >> moji) {
if (moji == 'A') {
s[j].append("X");
} else if (moji == 'B') {
if (cin >> moji2) {
// cout << "MOJI2 " << moji2 << endl;
if (moji2 == 'C') {
s[j].append("Y");
} else if (moji2 == 'A') {
j++;
s[j].append("X");
} else if (moji2 == 'B') {
j++;
}
}
} else if (moji == 'C') {
j++;
}
}
if (s[j].size() == 0)
j--;
ll ans = 0;
REP(i, j + 1) {
int ypos = 0;
REP(k, s[i].size()) {
if (s[i][k] == 'Y') {
ans += k - ypos;
ypos++;
}
}
}
// REP(i,j+1)
// cout << s[i] << endl;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using pint = pair<int, int>;
using ll = long long;
using pll = pair<ll, ll>;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define FI first
#define SE second
#define endl "\n"
#define ciosup \
cin.tie(0); \
ios::sync_with_stdio(false);
#define eb emplace_back
constexpr ll INF = 1e9 + 7;
constexpr ll MOD = 1e9 + 7;
int main() {
ciosup;
string s[400'000];
int j = 0;
char moji, moji2;
while (cin >> moji) {
if (moji == 'A') {
s[j].append("X");
} else if (moji == 'B') {
if (cin >> moji2) {
// cout << "MOJI2 " << moji2 << endl;
if (moji2 == 'C') {
s[j].append("Y");
} else if (moji2 == 'A') {
j++;
s[j].append("X");
} else if (moji2 == 'B') {
j++;
}
}
} else if (moji == 'C') {
j++;
}
}
if (s[j].size() == 0)
j--;
ll ans = 0;
REP(i, j + 1) {
int ypos = 0;
REP(k, s[i].size()) {
if (s[i][k] == 'Y') {
ans += k - ypos;
ypos++;
}
}
}
// REP(i,j+1)
// cout << s[i] << endl;
cout << ans << endl;
}
| replace | 23 | 24 | 23 | 24 | 0 | |
p03018 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
if (s.size() < 3) {
cout << 0 << endl;
return 0;
}
long long ans = 0LL;
for (int i = 0; i < s.size() - 2; i++) {
if (s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C') {
s[i] = 'B';
s[i + 1] = 'C';
s[i + 2] = 'A';
if (i >= 1) {
i -= 2;
}
ans++;
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
if (s.size() < 3) {
cout << 0 << endl;
return 0;
}
long long ans = 0LL;
int A_num = 0;
for (int i = 0; i < s.size() - 1; i++) {
if (s[i] == 'B' && s[i + 1] == 'C' && A_num > 0) {
ans += A_num;
i++;
} else if (s[i] == 'A') {
A_num++;
} else {
A_num = 0;
}
}
cout << ans << endl;
return 0;
} | replace | 16 | 25 | 16 | 26 | TLE | |
p03018 | C++ | Time Limit Exceeded | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define pb push_back
#define mp make_pair
typedef pair<int, int> pii;
typedef long long ll;
typedef double ld;
typedef vector<int> vi;
#define fi first
#define se second
#define fe first
#define FO(x) \
{ \
freopen(#x ".in", "r", stdin); \
freopen(#x ".out", "w", stdout); \
}
#define Edg \
int M = 0, fst[SZ], vb[SZ], nxt[SZ]; \
void ad_de(int a, int b) { \
++M; \
nxt[M] = fst[a]; \
fst[a] = M; \
vb[M] = b; \
} \
void adde(int a, int b) { \
ad_de(a, b); \
ad_de(b, a); \
}
#define Edgc \
int M = 0, fst[SZ], vb[SZ], nxt[SZ], vc[SZ]; \
void ad_de(int a, int b, int c) { \
++M; \
nxt[M] = fst[a]; \
fst[a] = M; \
vb[M] = b; \
vc[M] = c; \
} \
void adde(int a, int b, int c) { \
ad_de(a, b, c); \
ad_de(b, a, c); \
}
#define es(x, e) (int e = fst[x]; e; e = nxt[e])
#define esb(x, e, b) (int e = fst[x], b = vb[e]; e; e = nxt[e], b = vb[e])
set<int> oo;
char s[555555];
int n;
void upd(int t) {
bool u = (t >= 0) && (s[t] == 'A') && (s[t + 1] == 'B') && s[t + 2] == 'C';
if (u)
oo.insert(t);
else
oo.erase(t);
}
int main() {
scanf("%s", s);
n = strlen(s);
for (int i = 0; i < n; ++i)
upd(i);
int ans = 0;
while (!oo.empty()) {
int x = *oo.begin();
++ans;
oo.erase(oo.begin());
s[x] = 'B';
s[x + 1] = 'C';
s[x + 2] = 'A';
upd(x + 2);
upd(x - 1);
}
cout << ans << "\n";
}
| #include <algorithm>
#include <assert.h>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define pb push_back
#define mp make_pair
typedef pair<int, int> pii;
typedef long long ll;
typedef double ld;
typedef vector<int> vi;
#define fi first
#define se second
#define fe first
#define FO(x) \
{ \
freopen(#x ".in", "r", stdin); \
freopen(#x ".out", "w", stdout); \
}
#define Edg \
int M = 0, fst[SZ], vb[SZ], nxt[SZ]; \
void ad_de(int a, int b) { \
++M; \
nxt[M] = fst[a]; \
fst[a] = M; \
vb[M] = b; \
} \
void adde(int a, int b) { \
ad_de(a, b); \
ad_de(b, a); \
}
#define Edgc \
int M = 0, fst[SZ], vb[SZ], nxt[SZ], vc[SZ]; \
void ad_de(int a, int b, int c) { \
++M; \
nxt[M] = fst[a]; \
fst[a] = M; \
vb[M] = b; \
vc[M] = c; \
} \
void adde(int a, int b, int c) { \
ad_de(a, b, c); \
ad_de(b, a, c); \
}
#define es(x, e) (int e = fst[x]; e; e = nxt[e])
#define esb(x, e, b) (int e = fst[x], b = vb[e]; e; e = nxt[e], b = vb[e])
set<int> oo;
char s[555555];
int n;
void upd(int t) {
bool u = (t >= 0) && (s[t] == 'A') && (s[t + 1] == 'B') && s[t + 2] == 'C';
if (u)
oo.insert(t);
else
oo.erase(t);
}
int main() {
scanf("%s", s);
n = strlen(s);
vector<int> v;
for (int j = 0; j < n; ++j) {
if (s[j] == 'A')
v.pb(0);
else if (s[j] == 'B' && s[j + 1] == 'C')
v.pb(1), j += 1;
else
v.pb(2);
}
v.pb(2);
ll ans = 0, c = 0;
for (auto t : v) {
if (t == 0)
++c;
else if (t == 1)
ans += c;
else
c = 0;
}
cout << ans << "\n";
}
| replace | 72 | 84 | 72 | 90 | TLE | |
p03018 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll, int> plli;
typedef pair<int, pii> pipii;
typedef vector<vector<int>> mati;
typedef vector<vector<double>> matd;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vector<vector<bool>>> vvvb;
typedef vector<pll> vpll;
#define FOR(i, x, y) for (ll i = (ll)x; i < (ll)y; ++i)
#define REP(i, y) FOR(i, 0, y)
#define RFOR(i, x, y) for (ll i = (ll)x; i >= (ll)y; --i)
#define RREP(i, x) RFOR(i, x, 0)
#define ALL(a) a.begin(), a.end()
#define pb push_back
inline void IN(void) { return; }
template <typename First, typename... Rest>
void IN(First &first, Rest &...rest) {
cin >> first;
IN(rest...);
return;
}
inline void OUT(void) {
cout << "\n";
return;
}
template <typename First, typename... Rest>
void OUT(First first, Rest... rest) {
cout << first << " ";
OUT(rest...);
return;
}
template <typename T> void vec_print(vector<T> VEC) {
REP(i, VEC.size()) { cout << VEC[i] << " "; }
cout << "\n";
};
template <typename T>
void mat_print(vector<vector<T>> MAT){
REP(i, MAT.size()){REP(j, MAT[i].size()){cout << MAT[i][j] << " ";
}
cout << "\n";
}
}
;
template <typename CLASS1, typename CLASS2> class HOGE {
public:
CLASS1 key;
CLASS2 value;
HOGE(void) { return; };
HOGE(CLASS1 key, CLASS2 value) {
this->key = key;
this->value = value;
};
~HOGE(void) { return; };
void print(void) {
cout << "key : " << key << ", value : " << value << "\n";
return;
};
bool operator==(const HOGE &obj) { return (this->value == obj.value); };
bool operator<(const HOGE &obj) { return (this->value < obj.value); };
bool operator>(const HOGE &obj) { return (this->value > obj.value); };
};
template <typename CLASS1, typename CLASS2>
bool operator==(const HOGE<CLASS1, CLASS2> &hoge1,
const HOGE<CLASS1, CLASS2> &hoge2) {
return hoge1.value == hoge2.value;
};
template <typename CLASS1, typename CLASS2>
bool operator<(const HOGE<CLASS1, CLASS2> &hoge1,
const HOGE<CLASS1, CLASS2> &hoge2) {
return hoge1.value < hoge2.value;
};
template <typename CLASS1, typename CLASS2>
bool operator>(const HOGE<CLASS1, CLASS2> &hoge1,
const HOGE<CLASS1, CLASS2> &hoge2) {
return hoge1.value > hoge2.value;
};
constexpr int INF = (1 << 30);
constexpr ll INFLL = 1LL << 62;
constexpr long double EPS = 1e-12;
constexpr ll MOD = (ll)((1E+9) + 7);
int main() {
cin.tie(0); // cut the cin and cout (default, std::flush is performed after
// std::cin)
ios::sync_with_stdio(
false); // cut the iostream and stdio (DON'T endl; BUT "\n";)
string s;
IN(s);
string s_copy = "";
for (int i = 0; i < s.size(); ++i) {
if (i == s.size() - 1) {
s_copy += s[i];
} else {
if (s[i] == 'B' && s[i + 1] == 'C') {
s_copy += 'D';
i++;
} else {
s_copy += s[i];
}
}
}
ll ans = 0;
for (int i = 0; i < s_copy.size() - 1; ++i) {
if (s_copy[i] == 'A' && s_copy[i + 1] == 'D') {
swap(s_copy[i], s_copy[i + 1]);
ans++;
i -= 2;
}
if (i < -1)
i = -1;
}
OUT(ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll, int> plli;
typedef pair<int, pii> pipii;
typedef vector<vector<int>> mati;
typedef vector<vector<double>> matd;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vector<vector<bool>>> vvvb;
typedef vector<pll> vpll;
#define FOR(i, x, y) for (ll i = (ll)x; i < (ll)y; ++i)
#define REP(i, y) FOR(i, 0, y)
#define RFOR(i, x, y) for (ll i = (ll)x; i >= (ll)y; --i)
#define RREP(i, x) RFOR(i, x, 0)
#define ALL(a) a.begin(), a.end()
#define pb push_back
inline void IN(void) { return; }
template <typename First, typename... Rest>
void IN(First &first, Rest &...rest) {
cin >> first;
IN(rest...);
return;
}
inline void OUT(void) {
cout << "\n";
return;
}
template <typename First, typename... Rest>
void OUT(First first, Rest... rest) {
cout << first << " ";
OUT(rest...);
return;
}
template <typename T> void vec_print(vector<T> VEC) {
REP(i, VEC.size()) { cout << VEC[i] << " "; }
cout << "\n";
};
template <typename T>
void mat_print(vector<vector<T>> MAT){
REP(i, MAT.size()){REP(j, MAT[i].size()){cout << MAT[i][j] << " ";
}
cout << "\n";
}
}
;
template <typename CLASS1, typename CLASS2> class HOGE {
public:
CLASS1 key;
CLASS2 value;
HOGE(void) { return; };
HOGE(CLASS1 key, CLASS2 value) {
this->key = key;
this->value = value;
};
~HOGE(void) { return; };
void print(void) {
cout << "key : " << key << ", value : " << value << "\n";
return;
};
bool operator==(const HOGE &obj) { return (this->value == obj.value); };
bool operator<(const HOGE &obj) { return (this->value < obj.value); };
bool operator>(const HOGE &obj) { return (this->value > obj.value); };
};
template <typename CLASS1, typename CLASS2>
bool operator==(const HOGE<CLASS1, CLASS2> &hoge1,
const HOGE<CLASS1, CLASS2> &hoge2) {
return hoge1.value == hoge2.value;
};
template <typename CLASS1, typename CLASS2>
bool operator<(const HOGE<CLASS1, CLASS2> &hoge1,
const HOGE<CLASS1, CLASS2> &hoge2) {
return hoge1.value < hoge2.value;
};
template <typename CLASS1, typename CLASS2>
bool operator>(const HOGE<CLASS1, CLASS2> &hoge1,
const HOGE<CLASS1, CLASS2> &hoge2) {
return hoge1.value > hoge2.value;
};
constexpr int INF = (1 << 30);
constexpr ll INFLL = 1LL << 62;
constexpr long double EPS = 1e-12;
constexpr ll MOD = (ll)((1E+9) + 7);
int main() {
cin.tie(0); // cut the cin and cout (default, std::flush is performed after
// std::cin)
ios::sync_with_stdio(
false); // cut the iostream and stdio (DON'T endl; BUT "\n";)
string s;
IN(s);
string s_copy = "";
for (int i = 0; i < s.size(); ++i) {
if (i == s.size() - 1) {
s_copy += s[i];
} else {
if (s[i] == 'B' && s[i + 1] == 'C') {
s_copy += 'D';
i++;
} else {
s_copy += s[i];
}
}
}
ll ans = 0;
ll A_num = 0;
for (int i = 0; i < s_copy.size(); ++i) {
if (s_copy[i] == 'A')
A_num++;
else if (s_copy[i] == 'D')
ans += A_num;
else
A_num = 0;
}
OUT(ans);
return 0;
} | replace | 130 | 138 | 130 | 138 | TLE | |
p03018 | C++ | Time Limit Exceeded | /**
* Author: "Robin Singh" !!
* rob_in_1
**/
#include <bits/stdc++.h>
using namespace std;
#define dbg(args...) \
{ \
vector<string> _v = split(#args, ','); \
err(_v.begin(), args); \
cerr << '\n'; \
}
vector<string> split(const string &s, char c) {
vector<string> v;
stringstream ss(s);
string x;
while (getline(ss, x, c))
v.emplace_back(x);
return move(v);
}
void err(vector<string>::iterator it) {}
template <typename T, typename... Args>
void err(vector<string>::iterator it, T a, Args... args) {
cerr << it->substr((*it)[0] == ' ', it->length()) << " = " << a << '\t';
err(++it, args...);
}
#define int long long
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define ff first
#define ss second
#define MP make_pair
#define szz(v) ((int)(v).size())
#define fr(i, j, k) for (int i = j; i < k; i++)
#define bk(i, j, k) for (int i = j - 1; i >= k; i--)
#define mem(ptr, val) memset(ptr, val, sizeof ptr)
#define sbit(n) __builtin_popcount(n)
#define nl "\n"
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int>> vpii;
const long double eps = 1e-9;
const int mod = 1e9 + 7;
pii dir[8] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1},
{1, 1}, {-1, -1}, {-1, 1}, {1, -1}};
//*********************************!Template Ends
//Here!**********************************//
const int nn = 2e5 + 5;
void robin() {
string s;
cin >> s;
int ans = 0, n = szz(s);
for (int i = n - 3; i >= 0; i--) {
if (s[i] == 'A' and s[i + 1] == 'B' and s[i + 2] == 'C') {
ans++;
s[i] = 'B';
s[i + 1] = 'C';
s[i + 2] = 'A';
i = i + 3;
}
}
cout << ans;
}
int32_t main() {
// freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int T = 1;
// cin >> T;
for (int tc = 1; tc <= T; tc++) {
// cout << "Case #" << tc << ": ";
robin();
}
return 0;
} | /**
* Author: "Robin Singh" !!
* rob_in_1
**/
#include <bits/stdc++.h>
using namespace std;
#define dbg(args...) \
{ \
vector<string> _v = split(#args, ','); \
err(_v.begin(), args); \
cerr << '\n'; \
}
vector<string> split(const string &s, char c) {
vector<string> v;
stringstream ss(s);
string x;
while (getline(ss, x, c))
v.emplace_back(x);
return move(v);
}
void err(vector<string>::iterator it) {}
template <typename T, typename... Args>
void err(vector<string>::iterator it, T a, Args... args) {
cerr << it->substr((*it)[0] == ' ', it->length()) << " = " << a << '\t';
err(++it, args...);
}
#define int long long
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define ff first
#define ss second
#define MP make_pair
#define szz(v) ((int)(v).size())
#define fr(i, j, k) for (int i = j; i < k; i++)
#define bk(i, j, k) for (int i = j - 1; i >= k; i--)
#define mem(ptr, val) memset(ptr, val, sizeof ptr)
#define sbit(n) __builtin_popcount(n)
#define nl "\n"
typedef long double ld;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pair<int, int>> vpii;
const long double eps = 1e-9;
const int mod = 1e9 + 7;
pii dir[8] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1},
{1, 1}, {-1, -1}, {-1, 1}, {1, -1}};
//*********************************!Template Ends
//Here!**********************************//
const int nn = 2e5 + 5;
void robin() {
string s;
cin >> s;
int ans = 0, n = szz(s);
int cnt = 0;
for (int i = n - 1; i >= 0; i--) {
if (i - 1 >= 0 and s[i] == 'C' and s[i - 1] == 'B') {
cnt++;
i--;
} else if (cnt and s[i] == 'A') {
ans += cnt;
} else
cnt = 0;
}
cout << ans;
}
int32_t main() {
// freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int T = 1;
// cin >> T;
for (int tc = 1; tc <= T; tc++) {
// cout << "Case #" << tc << ": ";
robin();
}
return 0;
} | replace | 62 | 71 | 62 | 71 | TLE | |
p03018 | C++ | Time Limit Exceeded | #pragma GCC optimize( \
"O3,Ofast,inline,fast-math,unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0);
using namespace std;
#define int int64_t
#define double long double
#define MAXC numeric_limits<C>::max()
#define MINC numeric_limits<C>::min()
const int MAX = numeric_limits<int>::max();
const int MIN = numeric_limits<int>::min();
const double EPS = 1e-7;
const int MOD = 1e9 + 7;
// typedef
#define vdef(t, T) \
typedef vector<t> V##T; \
typedef vector<V##T> VV##T; \
typedef vector<VV##T> VVV##T;
#define pdef(t1, t2, T) \
typedef pair<t1, t2> P##T; \
vdef(P##T, P##T)
vdef(int, I) vdef(double, D) vdef(char, C) vdef(string, S) pdef(int, int, II)
pdef(int, PII, III) pdef(string, PII, SII)
// template
#define TCC template <class C>
#define TCC12 template <class C1, class C2>
#define TCC12C template <class C1, class C2, class CC>
#define TCCC template <class C, class CC>
#define VCL vector<C>
#define VVCL vector<VCL>
#define PCC pair<C1, C2>
#define PCI pair<C, int>
#define GC graph<C>
// define use frequently
#define emb emplace_back
#define pub push_back
#define pob pop_back
#define mp make_pair
#define mp3(a, b, c) mp(a, mp(b, c))
#define fi first
#define se second
#define fir fi
#define sec se.fi
#define thi se.se
#define fou(i, a, n) for (int i = a; i < n; i++)
#define fod(i, a, n) for (int i = n - 1; i >= a; i--)
#define rep(n) fou(_, 0, n)
#define tra(a, x) for (auto &a : x)
#define elif(c) else if (c)
#define si(vec) ((int)(vec).size())
#define all(vec) vec.begin(), vec.end()
#define lla(vec) vec.rbegin(), vec.rend()
#define range(vec, x, y) vec.begin() + x, vec.begin() + y
// make_pair,vector calculation
#define opall(calc) \
calc(+) calc(-) calc(*) calc(/) calc(%) calc(<<) calc(>>) calc(&) calc(|) \
calc(^)
#define p1c(op) \
TCC12C PCC operator op(const PCC &l, const CC &r) { \
return mp(l.fi op r, l.se op r); \
}
#define p2c(op) \
TCC12 PCC operator op(const PCC l, const PCC &r) { \
return mp(l.fi op r.fi, l.se op r.se); \
}
#define v1c(op) \
TCCC VCL operator op(VCL l, const CC &r) { \
tra(le, l) le = le op r; \
return l; \
}
#define v2c(op) \
TCC VCL operator op(VCL l, const VCL &r) { \
fou(i, 0, min(si(l), si(r))) l[i] = l[i] op r[i]; \
return l; \
}
#define opeq(op) \
TCC12 C1 operator op##=(C1 &l, const C2 &r) { return l = l op r; }
opall(p1c) opall(p2c) opall(v1c) opall(v2c) opall(opeq)
// iostream
#define in(T, ...) \
T __VA_ARGS__; \
_in(__VA_ARGS__)
void _in() {
}
template <class Head, class... Tail> void _in(Head &head, Tail &&...tail) {
cin >> head;
_in(forward<Tail>(tail)...);
}
template <class Head> void out(const Head &head) { cout << head << endl; }
template <class Head, class... Tail> void out(const Head &head, Tail... tail) {
cout << head << " ";
out(forward<Tail>(tail)...);
}
TCC void vout(const VCL &vec) { tra(v, vec) out(v); }
TCC12 istream &operator>>(istream &is, PCC &p) { return is >> p.fi >> p.se; }
TCC istream &operator>>(istream &is, VCL &vec) {
tra(v, vec) is >> v;
return is;
}
TCC12 ostream &operator<<(ostream &os, const PCC &p) {
os << p.fi << " " << p.se;
return os;
}
TCC ostream &operator<<(ostream &os, const VCL &vec) {
if (vec.empty())
return os;
;
fou(i, 0, si(vec) - 1) os << vec[i] << " ";
os << vec[si(vec) - 1];
return os;
}
// math
TCC C sign(C a) { return (a > 0) - (a < 0); }
int gcds(const int &a, const int &b) { return b ? gcds(b, a % b) : a; }
int gcd(const int &a, const int &b) { return gcds(max(a, b), min(a, b)); }
int lcm(const int &a, const int &b) { return a / gcd(a, b) * b; }
int fact(const int &n, const int &prod) {
return (n == 0) ? prod : fact(n - 1, n * prod);
}
int fact(const int &n) { return fact(n, 1); }
PII comb(const int &m, const int &n, const PII &nd) {
return (n == 0) ? nd : comb(m - 1, n - 1, mp(m, n) * nd);
}
int comb(const int &m, const int &n) {
PII p = comb(m, min(n, m - n), mp((int)1, (int)1));
return p.fi / p.se;
}
// mod
int modnum(const int &a) { return a % MOD + (a < 0 ? MOD : 0); }
int modinv(int a) {
a = modnum(a);
int b = MOD, u = 0, v = 1;
while (a > 1) {
u -= b / a * v;
b %= a;
swap(a, b);
swap(u, v);
}
return modnum(v);
}
#define modcalc(opstr, op) \
int mod##opstr(const int &a, const int &b) { \
return modnum(modnum(a) op modnum(b)); \
}
modcalc(add, +) modcalc(sub, -)
modcalc(mul, *) int moddiv(const int &a, const int &b) {
return modmul(a, modinv(b));
}
int modpow(int a, int b) {
int r = 1;
while (b > 0) {
if (b & 1)
r = modmul(r, a);
a = modmul(a, a);
b >>= 1;
}
return r;
}
// vector,matrix
TCC C vecsum(const VCL &vec, const int &l, const int &r) {
C sum = 0;
fou(i, l, r) sum += vec[i];
return sum;
}
TCC C dot(const VCL &vec1, const VCL &vec2) {
int sum = 0;
fou(i, 0, min(si(vec1), si(vec2))) sum += vec1[i] * vec2[i];
return sum;
}
TCC VVCL dot(const VVCL &mat1, const VVCL &mat2) {
int h = si(mat1), w = si(mat2[0]);
VVCL mat(h, VI(w));
fou(i, 0, h) fou(j, 0, w) fou(k, 0, min(si(mat1[0]), si(mat2))) mat[i][j] +=
mat1[i][k] * mat2[k][j];
return mat;
}
VVI eye(const int &n) {
VVI e(n, VI(n));
fou(i, 0, n) e[i][i] = 1;
return e;
}
TCC VVCL matpow(VVCL mat, int n) {
int s = si(mat);
VVCL r = eye(s);
while (n > 0) {
if (n & 1)
r = dot(r, mat);
mat = dot(mat, mat);
n >>= 1;
}
return r;
}
TCC void sortup(VCL &vec) { sort(all(vec)); }
TCC void sortdown(VCL &vec) { sort(lla(vec)); }
TCC void erase_unique(VCL &vec) { vec.erase(unique(all(vec)), vec.end()); }
TCC void rotateleft(VCL &vec, const int &n) {
rotate(vec.begin(), vec.begin() + n, vec.end());
}
TCC void rotateright(VCL &vec, const int &n) {
rotate(vec.rbegin(), vec.rbegin() + n, vec.rend());
}
TCC void mini(C &a, const C &b) { a = min(a, b); }
TCC void maxi(C &a, const C &b) { a = max(a, b); }
TCC int mine(VCL &vec) {
C m = 0;
fou(i, 1, si(vec)) if (vec[i] < vec[m]) m = i;
return m;
}
TCC int maxe(VCL &vec) {
C m = 0;
fou(i, 1, si(vec)) if (vec[i] > vec[m]) m = i;
return m;
}
// cumulated sum
TCC void cumsum(VCL &vec) { fou(i, 1, si(vec)) vec[i] += vec[i - 1]; }
TCC void cumsum(VVCL &vec) {
fou(i, 1, si(vec)) vec[i] += vec[i - 1];
fou(i, 0, si(vec)) cumsum(vec[i]);
}
TCC C partsum(VCL &vec, const int &l, const int &r) {
return (l == 0) ? vec[r - 1] : vec[r - 1] - vec[l - 1];
}
TCC C partsum(VVCL &vec, const int &l1, const int &r1, const int &l2,
const int &r2) {
return (vec[r1 - 1][r2 - 1]) - ((l1 == 0) ? 0 : vec[l1 - 1][r2 - 1]) -
((l2 == 0) ? 0 : vec[r1 - 1][l2 - 1]) +
((l1 == 0 || l2 == 0) ? 0 : vec[l1 - 1][l2 - 1]);
}
TCC void decumsum(VCL &vec) {
int s = si(vec);
fod(i, 1, s) vec[i] -= vec[i - 1];
}
TCC void decumsum(VVCL &vec) {
fod(i, 1, si(vec)) vec[i] -= vec[i - 1];
fod(i, 0, si(vec)) decumsum(vec[i]);
}
// string
int leven(string str1, string str2, int insert = 1, int erase = 1,
int replace = 1) {
int s1 = si(str1), s2 = si(str2);
VVI d(s1 + 1, VI(s2 + 1));
fou(i, 0, s1 + 1) d[i][0] = i * insert;
fou(j, 0, s2 + 1) d[0][j] = j * erase;
fou(i, 1, s1 + 1) fou(j, 1, s2 + 1) {
int diff = ((str1[i - 1] == str2[j - 1]) ? 0 : 1);
d[i][j] = min({d[i - 1][j] + insert, d[i][j - 1] + erase,
d[i - 1][j - 1] + replace * diff});
}
return d[s1][s2];
}
int lcs(string str1, string str2) {
int s1 = si(str1), s2 = si(str2);
VVI dp(s1 + 1, VI(s2 + 1));
fou(i, 0, s1) fou(j, 0, s2) {
if (str1[i] == str2[j])
dp[i + 1][j + 1] = dp[i][j] + 1;
else
dp[i + 1][j + 1] = max(dp[i][j + 1], dp[i + 1][j]);
}
return dp[s1][s2];
}
// algorithm
TCC class BIT {
VCL tree;
int n;
public:
BIT(int _n) : n(_n) { tree.resize(n); }
void add(int x, C v) {
while (x < n) {
tree[x] += v;
x |= (x + 1);
}
}
C sum(int x) {
C v = 0;
while (x >= 0) {
v += tree[x];
x = (x & (x + 1)) - 1;
}
return v;
}
C part(int x, int y) { return sum(y - 1) - sum(x - 1); }
C get(int x) { return part(x, x + 1); }
void set(int x, int y) { add(x, -get(x) + y); }
};
TCC class unionfind {
VI par;
VCL wei;
int n;
public:
unionfind(int _n) : n(_n) {
par.resize(n);
iota(all(par), 1);
wei.resize(n);
}
int get(const int &x) {
if (par[x] == (x + 1))
return x + 1;
else {
int parent = sign(par[x]) * get(abs(par[x]) - 1);
wei[x] += wei[abs(par[x]) - 1];
return par[x] = parent;
}
}
void get(int &x, int &y) {
x = get(x);
y = get(y);
}
int weight(int x) {
get(x);
return wei[x];
}
void unite(int x, int y, C w) {
w += weight(x) - weight(y);
get(x, y);
if (abs(x) != abs(y)) {
par[abs(y) - 1] = x * sign(y);
wei[abs(y) - 1] = w;
}
}
void separate(int x, int y, C w) {
w += weight(x) - weight(y);
get(x, y);
if (abs(x) != abs(y)) {
par[abs(y) - 1] = -x * sign(y);
wei[abs(y) - 1] = w;
}
}
int same(int x, int y) {
get(x, y);
return (x == y) - (x == -y);
}
C diff(int x, int y) { return weight(y) - weight(x); }
};
TCC int binarysearch(const VCL &vec, const C &n, const char &c) {
int left = -1;
int right = si(vec);
bool outleft = (c == 'd' || c == 'U');
int getmin = (c == 'u' || c == 'd') ? 1 : -1;
while (right - left > 1) {
int mid = left + (right - left) / 2;
bool OK = vec[mid] * getmin >= n * getmin;
if (outleft == OK)
left = mid;
else
right = mid;
}
return outleft ? left : right;
}
TCC class graph {
public:
struct edge {
int from, to;
C cost;
};
int n;
vector<edge> edges;
VVI g;
function<bool(int)> ignore;
graph(int _n) : n(_n) {
g.resize(n);
ignore = nullptr;
}
virtual int add(int from, int to, C cost) = 0;
virtual void set_ignore_edge_rule(const function<bool(int)> &f) {
ignore = f;
}
virtual void reset_ignore_edge_rule() { ignore = nullptr; }
};
TCC class undigraph : public GC {
public:
using GC::edges;
using GC::g;
using GC::n;
undigraph(int n) : GC(n) {}
int add(int from, int to, C cost = 1) {
int id = si(edges);
g[from].emb(id);
g[to].emb(id);
edges.pub({from, to, cost});
return id;
}
};
TCC class digraph : public GC {
public:
using GC::edges;
using GC::g;
using GC::ignore;
using GC::n;
digraph(int _n) : GC(_n) {}
int add(int from, int to, C cost = 1) {
int id = si(edges);
g[from].emb(id);
edges.pub({from, to, cost});
return id;
}
digraph<C> reverse() const {
digraph<C> rev(n);
tra(e, edges) rev.add(e.to, e.from, e.cost);
if (ignore != nullptr) {
rev.set_ignore_edge_rule([&](int id) { return ignore(id); });
}
return rev;
}
};
TCC VCL dijkstra(const GC &g, const int &start) {
VCL d(g.n, MAXC);
priority_queue<PCI, vector<PCI>, greater<PCI>> s;
d[start] = 0;
s.emplace(d[start], start);
while (!s.empty()) {
int expected = s.top().fi, from = s.top().se;
s.pop();
if (d[from] != expected)
continue;
tra(id, g.g[from]) {
auto e = g.edges[id];
int to = e.from ^ e.to ^ from;
if (d[from] + e.cost < d[to]) {
d[to] = d[from] + e.cost;
s.emplace(d[to], to);
}
}
}
return d;
}
TCC VCL bellman(const GC &g, const int &start) {
VCL d(g.n, MAXC);
d[start] = 0;
bool nl = false;
VI upd_b(1, start);
int i = 0;
while (!upd_b.empty() && i < g.n) {
VI upd;
tra(from, upd_b) {
tra(id, g.g[from]) {
auto e = g.edges[id];
int to = e.from ^ e.to ^ from;
if (d[to] > d[from] + e.cost) {
d[to] = d[from] + e.cost;
upd.emb(to);
if (i == g.n - 1) {
d[to] = MINC;
nl = true;
}
}
}
}
upd_b = upd;
i++;
}
if (nl) {
i = 0;
while (!upd_b.empty() && i < g.n - 1) {
VI upd;
tra(from, upd_b) {
tra(id, g.g[from]) {
auto e = g.edges[id];
int to = e.from ^ e.to ^ from;
if (d[to] != MINC) {
d[to] = MINC;
upd.emb(to);
}
}
}
upd_b = upd;
i++;
}
}
return d;
}
class time_measure {
chrono::system_clock::time_point start;
public:
time_measure() : start(chrono::system_clock::now()) {}
void time() {
out(chrono::duration_cast<chrono::milliseconds>(
chrono::system_clock::now() - start)
.count(),
"ms");
}
};
// todo
// graph行列表現
// ２部グラフ
// フローグラフ
// kruskal
// 文字列抜き出し
// TCC VVCL warshall(const GC&g){
// VVCL mat(g.n,VCL(g.n,MAXC));
// fou(i,0,g.n)mat[i][i]=0;
// fou(from,0,si(g.n)){
// tra(id,g.g[from]){
// auto e=g.edges[id];int to=e.from^e.to^from;
// }
// }
// return mat;
// }
signed main() {
IOS;
in(string, s);
string ss;
fou(i, 0, si(s)) {
if (s[i] == 'A')
ss.pub('A');
if (i + 1 != si(s))
if (s[i] == 'B' && s[i + 1] == 'C') {
ss.pub('X');
i++;
continue;
}
if (s[i] == 'B')
ss.pub('B');
if (s[i] == 'C')
ss.pub('C');
}
if (si(ss) < 2) {
out(0);
return 0;
}
VI before(si(ss) - 1);
int ans = 0;
fou(i, 1, si(ss)) {
if (ss[i] == 'X') {
fod(j, 0, i) {
if (ss[j] == 'A') {
ss[j] = 'X';
ss[j + 1] = 'A';
ans++;
} else
break;
}
}
}
out(ans);
} | #pragma GCC optimize( \
"O3,Ofast,inline,fast-math,unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0);
using namespace std;
#define int int64_t
#define double long double
#define MAXC numeric_limits<C>::max()
#define MINC numeric_limits<C>::min()
const int MAX = numeric_limits<int>::max();
const int MIN = numeric_limits<int>::min();
const double EPS = 1e-7;
const int MOD = 1e9 + 7;
// typedef
#define vdef(t, T) \
typedef vector<t> V##T; \
typedef vector<V##T> VV##T; \
typedef vector<VV##T> VVV##T;
#define pdef(t1, t2, T) \
typedef pair<t1, t2> P##T; \
vdef(P##T, P##T)
vdef(int, I) vdef(double, D) vdef(char, C) vdef(string, S) pdef(int, int, II)
pdef(int, PII, III) pdef(string, PII, SII)
// template
#define TCC template <class C>
#define TCC12 template <class C1, class C2>
#define TCC12C template <class C1, class C2, class CC>
#define TCCC template <class C, class CC>
#define VCL vector<C>
#define VVCL vector<VCL>
#define PCC pair<C1, C2>
#define PCI pair<C, int>
#define GC graph<C>
// define use frequently
#define emb emplace_back
#define pub push_back
#define pob pop_back
#define mp make_pair
#define mp3(a, b, c) mp(a, mp(b, c))
#define fi first
#define se second
#define fir fi
#define sec se.fi
#define thi se.se
#define fou(i, a, n) for (int i = a; i < n; i++)
#define fod(i, a, n) for (int i = n - 1; i >= a; i--)
#define rep(n) fou(_, 0, n)
#define tra(a, x) for (auto &a : x)
#define elif(c) else if (c)
#define si(vec) ((int)(vec).size())
#define all(vec) vec.begin(), vec.end()
#define lla(vec) vec.rbegin(), vec.rend()
#define range(vec, x, y) vec.begin() + x, vec.begin() + y
// make_pair,vector calculation
#define opall(calc) \
calc(+) calc(-) calc(*) calc(/) calc(%) calc(<<) calc(>>) calc(&) calc(|) \
calc(^)
#define p1c(op) \
TCC12C PCC operator op(const PCC &l, const CC &r) { \
return mp(l.fi op r, l.se op r); \
}
#define p2c(op) \
TCC12 PCC operator op(const PCC l, const PCC &r) { \
return mp(l.fi op r.fi, l.se op r.se); \
}
#define v1c(op) \
TCCC VCL operator op(VCL l, const CC &r) { \
tra(le, l) le = le op r; \
return l; \
}
#define v2c(op) \
TCC VCL operator op(VCL l, const VCL &r) { \
fou(i, 0, min(si(l), si(r))) l[i] = l[i] op r[i]; \
return l; \
}
#define opeq(op) \
TCC12 C1 operator op##=(C1 &l, const C2 &r) { return l = l op r; }
opall(p1c) opall(p2c) opall(v1c) opall(v2c) opall(opeq)
// iostream
#define in(T, ...) \
T __VA_ARGS__; \
_in(__VA_ARGS__)
void _in() {
}
template <class Head, class... Tail> void _in(Head &head, Tail &&...tail) {
cin >> head;
_in(forward<Tail>(tail)...);
}
template <class Head> void out(const Head &head) { cout << head << endl; }
template <class Head, class... Tail> void out(const Head &head, Tail... tail) {
cout << head << " ";
out(forward<Tail>(tail)...);
}
TCC void vout(const VCL &vec) { tra(v, vec) out(v); }
TCC12 istream &operator>>(istream &is, PCC &p) { return is >> p.fi >> p.se; }
TCC istream &operator>>(istream &is, VCL &vec) {
tra(v, vec) is >> v;
return is;
}
TCC12 ostream &operator<<(ostream &os, const PCC &p) {
os << p.fi << " " << p.se;
return os;
}
TCC ostream &operator<<(ostream &os, const VCL &vec) {
if (vec.empty())
return os;
;
fou(i, 0, si(vec) - 1) os << vec[i] << " ";
os << vec[si(vec) - 1];
return os;
}
// math
TCC C sign(C a) { return (a > 0) - (a < 0); }
int gcds(const int &a, const int &b) { return b ? gcds(b, a % b) : a; }
int gcd(const int &a, const int &b) { return gcds(max(a, b), min(a, b)); }
int lcm(const int &a, const int &b) { return a / gcd(a, b) * b; }
int fact(const int &n, const int &prod) {
return (n == 0) ? prod : fact(n - 1, n * prod);
}
int fact(const int &n) { return fact(n, 1); }
PII comb(const int &m, const int &n, const PII &nd) {
return (n == 0) ? nd : comb(m - 1, n - 1, mp(m, n) * nd);
}
int comb(const int &m, const int &n) {
PII p = comb(m, min(n, m - n), mp((int)1, (int)1));
return p.fi / p.se;
}
// mod
int modnum(const int &a) { return a % MOD + (a < 0 ? MOD : 0); }
int modinv(int a) {
a = modnum(a);
int b = MOD, u = 0, v = 1;
while (a > 1) {
u -= b / a * v;
b %= a;
swap(a, b);
swap(u, v);
}
return modnum(v);
}
#define modcalc(opstr, op) \
int mod##opstr(const int &a, const int &b) { \
return modnum(modnum(a) op modnum(b)); \
}
modcalc(add, +) modcalc(sub, -)
modcalc(mul, *) int moddiv(const int &a, const int &b) {
return modmul(a, modinv(b));
}
int modpow(int a, int b) {
int r = 1;
while (b > 0) {
if (b & 1)
r = modmul(r, a);
a = modmul(a, a);
b >>= 1;
}
return r;
}
// vector,matrix
TCC C vecsum(const VCL &vec, const int &l, const int &r) {
C sum = 0;
fou(i, l, r) sum += vec[i];
return sum;
}
TCC C dot(const VCL &vec1, const VCL &vec2) {
int sum = 0;
fou(i, 0, min(si(vec1), si(vec2))) sum += vec1[i] * vec2[i];
return sum;
}
TCC VVCL dot(const VVCL &mat1, const VVCL &mat2) {
int h = si(mat1), w = si(mat2[0]);
VVCL mat(h, VI(w));
fou(i, 0, h) fou(j, 0, w) fou(k, 0, min(si(mat1[0]), si(mat2))) mat[i][j] +=
mat1[i][k] * mat2[k][j];
return mat;
}
VVI eye(const int &n) {
VVI e(n, VI(n));
fou(i, 0, n) e[i][i] = 1;
return e;
}
TCC VVCL matpow(VVCL mat, int n) {
int s = si(mat);
VVCL r = eye(s);
while (n > 0) {
if (n & 1)
r = dot(r, mat);
mat = dot(mat, mat);
n >>= 1;
}
return r;
}
TCC void sortup(VCL &vec) { sort(all(vec)); }
TCC void sortdown(VCL &vec) { sort(lla(vec)); }
TCC void erase_unique(VCL &vec) { vec.erase(unique(all(vec)), vec.end()); }
TCC void rotateleft(VCL &vec, const int &n) {
rotate(vec.begin(), vec.begin() + n, vec.end());
}
TCC void rotateright(VCL &vec, const int &n) {
rotate(vec.rbegin(), vec.rbegin() + n, vec.rend());
}
TCC void mini(C &a, const C &b) { a = min(a, b); }
TCC void maxi(C &a, const C &b) { a = max(a, b); }
TCC int mine(VCL &vec) {
C m = 0;
fou(i, 1, si(vec)) if (vec[i] < vec[m]) m = i;
return m;
}
TCC int maxe(VCL &vec) {
C m = 0;
fou(i, 1, si(vec)) if (vec[i] > vec[m]) m = i;
return m;
}
// cumulated sum
TCC void cumsum(VCL &vec) { fou(i, 1, si(vec)) vec[i] += vec[i - 1]; }
TCC void cumsum(VVCL &vec) {
fou(i, 1, si(vec)) vec[i] += vec[i - 1];
fou(i, 0, si(vec)) cumsum(vec[i]);
}
TCC C partsum(VCL &vec, const int &l, const int &r) {
return (l == 0) ? vec[r - 1] : vec[r - 1] - vec[l - 1];
}
TCC C partsum(VVCL &vec, const int &l1, const int &r1, const int &l2,
const int &r2) {
return (vec[r1 - 1][r2 - 1]) - ((l1 == 0) ? 0 : vec[l1 - 1][r2 - 1]) -
((l2 == 0) ? 0 : vec[r1 - 1][l2 - 1]) +
((l1 == 0 || l2 == 0) ? 0 : vec[l1 - 1][l2 - 1]);
}
TCC void decumsum(VCL &vec) {
int s = si(vec);
fod(i, 1, s) vec[i] -= vec[i - 1];
}
TCC void decumsum(VVCL &vec) {
fod(i, 1, si(vec)) vec[i] -= vec[i - 1];
fod(i, 0, si(vec)) decumsum(vec[i]);
}
// string
int leven(string str1, string str2, int insert = 1, int erase = 1,
int replace = 1) {
int s1 = si(str1), s2 = si(str2);
VVI d(s1 + 1, VI(s2 + 1));
fou(i, 0, s1 + 1) d[i][0] = i * insert;
fou(j, 0, s2 + 1) d[0][j] = j * erase;
fou(i, 1, s1 + 1) fou(j, 1, s2 + 1) {
int diff = ((str1[i - 1] == str2[j - 1]) ? 0 : 1);
d[i][j] = min({d[i - 1][j] + insert, d[i][j - 1] + erase,
d[i - 1][j - 1] + replace * diff});
}
return d[s1][s2];
}
int lcs(string str1, string str2) {
int s1 = si(str1), s2 = si(str2);
VVI dp(s1 + 1, VI(s2 + 1));
fou(i, 0, s1) fou(j, 0, s2) {
if (str1[i] == str2[j])
dp[i + 1][j + 1] = dp[i][j] + 1;
else
dp[i + 1][j + 1] = max(dp[i][j + 1], dp[i + 1][j]);
}
return dp[s1][s2];
}
// algorithm
TCC class BIT {
VCL tree;
int n;
public:
BIT(int _n) : n(_n) { tree.resize(n); }
void add(int x, C v) {
while (x < n) {
tree[x] += v;
x |= (x + 1);
}
}
C sum(int x) {
C v = 0;
while (x >= 0) {
v += tree[x];
x = (x & (x + 1)) - 1;
}
return v;
}
C part(int x, int y) { return sum(y - 1) - sum(x - 1); }
C get(int x) { return part(x, x + 1); }
void set(int x, int y) { add(x, -get(x) + y); }
};
TCC class unionfind {
VI par;
VCL wei;
int n;
public:
unionfind(int _n) : n(_n) {
par.resize(n);
iota(all(par), 1);
wei.resize(n);
}
int get(const int &x) {
if (par[x] == (x + 1))
return x + 1;
else {
int parent = sign(par[x]) * get(abs(par[x]) - 1);
wei[x] += wei[abs(par[x]) - 1];
return par[x] = parent;
}
}
void get(int &x, int &y) {
x = get(x);
y = get(y);
}
int weight(int x) {
get(x);
return wei[x];
}
void unite(int x, int y, C w) {
w += weight(x) - weight(y);
get(x, y);
if (abs(x) != abs(y)) {
par[abs(y) - 1] = x * sign(y);
wei[abs(y) - 1] = w;
}
}
void separate(int x, int y, C w) {
w += weight(x) - weight(y);
get(x, y);
if (abs(x) != abs(y)) {
par[abs(y) - 1] = -x * sign(y);
wei[abs(y) - 1] = w;
}
}
int same(int x, int y) {
get(x, y);
return (x == y) - (x == -y);
}
C diff(int x, int y) { return weight(y) - weight(x); }
};
TCC int binarysearch(const VCL &vec, const C &n, const char &c) {
int left = -1;
int right = si(vec);
bool outleft = (c == 'd' || c == 'U');
int getmin = (c == 'u' || c == 'd') ? 1 : -1;
while (right - left > 1) {
int mid = left + (right - left) / 2;
bool OK = vec[mid] * getmin >= n * getmin;
if (outleft == OK)
left = mid;
else
right = mid;
}
return outleft ? left : right;
}
TCC class graph {
public:
struct edge {
int from, to;
C cost;
};
int n;
vector<edge> edges;
VVI g;
function<bool(int)> ignore;
graph(int _n) : n(_n) {
g.resize(n);
ignore = nullptr;
}
virtual int add(int from, int to, C cost) = 0;
virtual void set_ignore_edge_rule(const function<bool(int)> &f) {
ignore = f;
}
virtual void reset_ignore_edge_rule() { ignore = nullptr; }
};
TCC class undigraph : public GC {
public:
using GC::edges;
using GC::g;
using GC::n;
undigraph(int n) : GC(n) {}
int add(int from, int to, C cost = 1) {
int id = si(edges);
g[from].emb(id);
g[to].emb(id);
edges.pub({from, to, cost});
return id;
}
};
TCC class digraph : public GC {
public:
using GC::edges;
using GC::g;
using GC::ignore;
using GC::n;
digraph(int _n) : GC(_n) {}
int add(int from, int to, C cost = 1) {
int id = si(edges);
g[from].emb(id);
edges.pub({from, to, cost});
return id;
}
digraph<C> reverse() const {
digraph<C> rev(n);
tra(e, edges) rev.add(e.to, e.from, e.cost);
if (ignore != nullptr) {
rev.set_ignore_edge_rule([&](int id) { return ignore(id); });
}
return rev;
}
};
TCC VCL dijkstra(const GC &g, const int &start) {
VCL d(g.n, MAXC);
priority_queue<PCI, vector<PCI>, greater<PCI>> s;
d[start] = 0;
s.emplace(d[start], start);
while (!s.empty()) {
int expected = s.top().fi, from = s.top().se;
s.pop();
if (d[from] != expected)
continue;
tra(id, g.g[from]) {
auto e = g.edges[id];
int to = e.from ^ e.to ^ from;
if (d[from] + e.cost < d[to]) {
d[to] = d[from] + e.cost;
s.emplace(d[to], to);
}
}
}
return d;
}
TCC VCL bellman(const GC &g, const int &start) {
VCL d(g.n, MAXC);
d[start] = 0;
bool nl = false;
VI upd_b(1, start);
int i = 0;
while (!upd_b.empty() && i < g.n) {
VI upd;
tra(from, upd_b) {
tra(id, g.g[from]) {
auto e = g.edges[id];
int to = e.from ^ e.to ^ from;
if (d[to] > d[from] + e.cost) {
d[to] = d[from] + e.cost;
upd.emb(to);
if (i == g.n - 1) {
d[to] = MINC;
nl = true;
}
}
}
}
upd_b = upd;
i++;
}
if (nl) {
i = 0;
while (!upd_b.empty() && i < g.n - 1) {
VI upd;
tra(from, upd_b) {
tra(id, g.g[from]) {
auto e = g.edges[id];
int to = e.from ^ e.to ^ from;
if (d[to] != MINC) {
d[to] = MINC;
upd.emb(to);
}
}
}
upd_b = upd;
i++;
}
}
return d;
}
class time_measure {
chrono::system_clock::time_point start;
public:
time_measure() : start(chrono::system_clock::now()) {}
void time() {
out(chrono::duration_cast<chrono::milliseconds>(
chrono::system_clock::now() - start)
.count(),
"ms");
}
};
// todo
// graph行列表現
// ２部グラフ
// フローグラフ
// kruskal
// 文字列抜き出し
// TCC VVCL warshall(const GC&g){
// VVCL mat(g.n,VCL(g.n,MAXC));
// fou(i,0,g.n)mat[i][i]=0;
// fou(from,0,si(g.n)){
// tra(id,g.g[from]){
// auto e=g.edges[id];int to=e.from^e.to^from;
// }
// }
// return mat;
// }
signed main() {
IOS;
in(string, s);
string ss;
fou(i, 0, si(s)) {
if (s[i] == 'A')
ss.pub('A');
if (i + 1 != si(s))
if (s[i] == 'B' && s[i + 1] == 'C') {
ss.pub('X');
i++;
continue;
}
if (s[i] == 'B')
ss.pub('B');
if (s[i] == 'C')
ss.pub('C');
}
if (si(ss) < 2) {
out(0);
return 0;
}
VI before(si(ss) - 1);
int ans = 0;
int cuma = 0;
fou(i, 0, si(ss)) {
if (ss[i] == 'A')
cuma++;
if (ss[i] == 'B')
cuma = 0;
if (ss[i] == 'C')
cuma = 0;
if (ss[i] == 'X')
ans += cuma;
}
out(ans);
} | replace | 537 | 548 | 537 | 547 | TLE | |
p03018 | C++ | Time Limit Exceeded | #include <algorithm>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define int long long
#define ll long long
#define eps LDBL_EPSILON
#define moder 1000000007
#define double long double
#define INF LLONG_MAX / 10000
#define P pair<int, int>
#define prique priority_queue
using namespace std;
string s;
int ans = 0;
signed main() {
cin >> s;
for (int i = (int)s.size() - 3; i >= 0; i--) {
if (s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C') {
int p = i;
kaage:;
s[p] = 'B';
s[p + 1] = 'C';
s[p + 2] = 'A';
ans++;
if (p + 4 < (int)s.size() && s[p + 2] == 'A' && s[p + 3] == 'B' &&
s[p + 4] == 'C') {
p += 2;
goto kaage;
}
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define int long long
#define ll long long
#define eps LDBL_EPSILON
#define moder 1000000007
#define double long double
#define INF LLONG_MAX / 10000
#define P pair<int, int>
#define prique priority_queue
using namespace std;
string s;
int ans = 0;
signed main() {
cin >> s;
int cnt = 0;
rep(i, s.size()) {
if (s[i] == 'A')
cnt++;
else if (i != s.size() - 1 && s[i] == 'B' && s[i + 1] == 'C') {
ans += cnt;
i++;
} else
cnt = 0;
}
cout << ans << endl;
return 0;
} | replace | 30 | 44 | 30 | 39 | TLE | |
p03018 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef pair<ll, ll> P;
typedef vector<P> vp;
#define rep(i, a, b) for (ll i = (a); i < (b); ++i)
#define drep(i, a, b) for (ll i = (a); i >= (b); --i)
#define SIZE(a) ll((a).size())
#define out(a) cout << (a) << endl;
const ll inf = 1e9;
const int MAX = 510000;
const ll MOD = 998244353;
inline ll mod(ll a, ll m) { return (a % m + m) % m; }
int main() {
string s;
cin >> s;
ll n = s.size(), ans = 0;
rep(i, 0, n - 2) {
if (s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C') {
ll l = 0;
while (s[i - l] == 'A' && i - l >= 0) {
l++;
}
s[i - l + 1] = 'B';
s[i - l + 2] = 'C';
rep(j, i - l + 3, i + 3) { s[j] = 'A'; }
ans += l;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef pair<ll, ll> P;
typedef vector<P> vp;
#define rep(i, a, b) for (ll i = (a); i < (b); ++i)
#define drep(i, a, b) for (ll i = (a); i >= (b); --i)
#define SIZE(a) ll((a).size())
#define out(a) cout << (a) << endl;
const ll inf = 1e9;
const int MAX = 510000;
const ll MOD = 998244353;
inline ll mod(ll a, ll m) { return (a % m + m) % m; }
int main() {
string s;
cin >> s;
ll n = s.size(), ans = 0;
string t = "";
if (n < 3) {
cout << 0 << endl;
return 0;
}
rep(i, 0, n - 1) {
if (s[i] == 'B' && s[i + 1] == 'C') {
t += "Z";
i++;
} else
t += s[i];
}
ll m = t.size();
ll cnt = 0;
rep(i, 0, m) {
if (t[i] == 'Z')
ans += cnt;
else if (t[i] == 'A')
cnt++;
else
cnt = 0;
}
cout << ans << endl;
}
| replace | 25 | 39 | 25 | 46 | TLE | |
p03018 | C++ | Runtime Error | /* ****GT_18**** */
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define endl '\n'
#define pii pair<ll int, ll int>
#define vi vector<ll int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define sz(x) (ll int)x.size()
#define hell 1000000007
#define rep(i, a, b) for (ll int i = a; i < b; i++)
#define lbnd lower_bound
#define ubnd upper_bound
#define bs binary_search
#define mp make_pair
using namespace std;
#define N 100005
ll ans = 0, n;
string s;
void solve(ll x, ll d) {
if (x >= n - 2 || x < 0)
return;
if (d == 1) {
for (ll i = x; i < n - 2; i++) {
if (s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C') {
ans++;
s[i] = 'B';
s[i + 1] = 'C';
s[i + 2] = 'A';
solve(i - 1, 1);
}
}
}
return;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int TESTS = 1;
// cin>>TESTS;
while (TESTS--) {
ll i, j, k, l, m;
cin >> s;
n = s.size();
solve(0, 1);
cout << ans;
}
return 0;
} | /* ****GT_18**** */
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define endl '\n'
#define pii pair<ll int, ll int>
#define vi vector<ll int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define sz(x) (ll int)x.size()
#define hell 1000000007
#define rep(i, a, b) for (ll int i = a; i < b; i++)
#define lbnd lower_bound
#define ubnd upper_bound
#define bs binary_search
#define mp make_pair
using namespace std;
#define N 100005
ll ans = 0, n;
string s;
void solve(ll x, ll d) {
if (x >= n - 2 || x < 0)
return;
ll sum = 0;
for (ll i = 0; i < n - 1; i++) {
if (s[i] == 'B' && s[i + 1] == 'C') {
ans += sum;
i += 1;
} else {
if (s[i] == 'A')
sum++;
else {
sum = 0;
}
}
}
return;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int TESTS = 1;
// cin>>TESTS;
while (TESTS--) {
ll i, j, k, l, m;
cin >> s;
n = s.size();
solve(0, 1);
cout << ans;
}
return 0;
} | replace | 26 | 34 | 26 | 36 | 0 | |
p03018 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int countab = 0;
ll tot = 0, c1;
vector<int> cnt[205];
string s;
cin >> s;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == 'A') {
cnt[countab].push_back(1);
} else if (s[i] == 'B' && i != s.size() - 1 && s[i + 1] == 'C') {
cnt[countab].push_back(0);
i++;
} else {
countab++;
}
}
for (int i = 0; i <= countab; ++i) {
c1 = 0;
for (int j = 0; j < cnt[i].size(); ++j) {
if (cnt[i][j] == 1) {
c1++;
} else {
tot += c1;
}
}
}
cout << tot << '\n';
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int countab = 0;
ll tot = 0, c1;
vector<int> cnt[200005];
string s;
cin >> s;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == 'A') {
cnt[countab].push_back(1);
} else if (s[i] == 'B' && i != s.size() - 1 && s[i + 1] == 'C') {
cnt[countab].push_back(0);
i++;
} else {
countab++;
}
}
for (int i = 0; i <= countab; ++i) {
c1 = 0;
for (int j = 0; j < cnt[i].size(); ++j) {
if (cnt[i][j] == 1) {
c1++;
} else {
tot += c1;
}
}
}
cout << tot << '\n';
}
| replace | 11 | 12 | 11 | 12 | 0 | |
p03018 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define fo(i, n) for (int i = 1; i <= n; ++i)
typedef long long ll;
#define pb push_back
const int N = 250000;
int n, a, b, c, d;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
int ans = 0;
for (int i = 0; i + 2 < s.length(); ++i) {
if (s[i] == 'A' && s[i + 1] == 'B' && s[i + 2] == 'C') {
s[i] = 'B';
s[i + 1] = 'C';
s[i + 2] = 'A';
ans++;
i -= 2;
}
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fo(i, n) for (int i = 1; i <= n; ++i)
typedef long long ll;
#define pb push_back
const int N = 250000;
int n, a, b, c, d;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
string s;
cin >> s;
ll ans = 0, cnta = 0;
for (int i = 0; i + 1 < s.length(); ++i) {
if (s[i] == 'A')
cnta++;
else if (s[i] == 'B' && s[i + 1] == 'C') {
ans += cnta;
i++;
} else
cnta = 0;
}
cout << ans;
return 0;
} | replace | 18 | 27 | 18 | 28 | TLE | |
p03018 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
vector<string> a;
int begin = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A') {
} else if (s[i] == 'B' && s[i + 1] == 'C')
i++;
else {
a.push_back(s.substr(begin, i - begin));
begin = i + 1;
}
}
// cout << 1 << endl;
// cout << begin << endl;
if (s.size() - 1 > begin)
a.push_back(s.substr(begin, s.size() - begin + 1));
ll res = 0;
cout << a[0].size() << endl;
// cout << 2 << endl;
// cout << a[1] << endl;
for (int i = 0; i < a.size(); i++) {
ll count = 0;
string sub;
sub = a[i];
// cout << "sub " << sub << endl;
for (int j = sub.size() - 1; j >= 0; j--) {
// cout << sub[j] << endl;
if (sub[j] == 'C') {
count++;
j--;
}
if (sub[j] == 'A')
res += count;
}
}
cout << res << endl;
return 0;
} | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
string s;
cin >> s;
vector<string> a;
int begin = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A') {
} else if (s[i] == 'B' && s[i + 1] == 'C')
i++;
else {
a.push_back(s.substr(begin, i - begin));
begin = i + 1;
}
}
// cout << 1 << endl;
// cout << begin << endl;
if (s.size() - 1 > begin)
a.push_back(s.substr(begin, s.size() - begin + 1));
ll res = 0;
// cout << a[0].size() << endl;
// cout << 2 << endl;
// cout << a[1] << endl;
for (int i = 0; i < a.size(); i++) {
ll count = 0;
string sub;
sub = a[i];
// cout << "sub " << sub << endl;
for (int j = sub.size() - 1; j >= 0; j--) {
// cout << sub[j] << endl;
if (sub[j] == 'C') {
count++;
j--;
}
if (sub[j] == 'A')
res += count;
}
}
cout << res << endl;
return 0;
} | replace | 29 | 30 | 29 | 30 | 0 | |
p03019 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define int long long
#define double long double
#define mod 1000003
#define F first
#define S second
#define P pair<long long, long long>
#define all(a) a.begin(), a.end()
#define INF 10000000000000000
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;
}
using namespace std;
// AGC034
signed main(void) {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int n, x;
cin >> n >> x;
vector<int> b(n), l(n), u(n), val(n);
rep(i, n) {
cin >> b[i] >> l[i] >> u[i];
val[i] = b[i] * l[i] + (x - b[i]) * u[i];
}
vector<int> num(n);
iota(all(num), 0);
sort(all(num), [&](int s, int t) { return val[s] >= val[t]; });
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define int long long
#define double long double
#define mod 1000003
#define F first
#define S second
#define P pair<long long, long long>
#define all(a) a.begin(), a.end()
#define INF 10000000000000000
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;
}
using namespace std;
// AGC034
signed main(void) {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int n, x;
cin >> n >> x;
vector<int> b(n), l(n), u(n), val(n);
rep(i, n) {
cin >> b[i] >> l[i] >> u[i];
val[i] = b[i] * l[i] + (x - b[i]) * u[i];
}
vector<int> num(n);
iota(all(num), 0);
sort(all(num), [&](int s, int t) { return val[s] > val[t]; });
vector<int> sums(n + 1);
sums[0] = 0;
rep(i, n) {
int j = num[i];
sums[i + 1] = sums[i] + val[j];
}
int score = 0;
rep(i, n) score += b[i] * l[i];
int left = -1, right = n * x + 1;
while (right - left > 1) {
int mid = (right + left) / 2;
int take_all = mid / x;
int incmp = mid - take_all * x;
int final_sum = 0;
rep(i, n) {
int j = num[i];
int tmp_sum;
if (i < take_all and take_all < n)
tmp_sum = sums[take_all + 1] - val[j];
else
tmp_sum = sums[take_all];
tmp_sum +=
max<int>(0, incmp - b[j]) * u[j] + min<int>(incmp, b[j]) * l[j];
chmax(final_sum, tmp_sum);
}
if (final_sum >= score)
right = mid;
else
left = mid;
}
cout << right << endl;
return 0;
} | replace | 42 | 43 | 42 | 81 | 0 | |
p03019 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <chrono>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
const int MAXN = 100000;
int x;
struct Exam {
int b;
int l;
int u;
long long total() const { return 1LL * b * l + 1LL * (x - b) * u; }
long long partial(long long a) {
if (a <= b)
return 1LL * a * l;
else
return 1LL * b * l + 1LL * (a - b) * u;
}
bool operator<(const Exam &other) const { return total() >= other.total(); }
};
Exam v[1 + MAXN];
long long sum[1 + MAXN];
priority_queue<pair<int, int>> upHeap;
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>>
downHeap;
bool check(int n, long long limit, long long taken) {
if (1LL * n * x == taken)
return sum[n] >= limit;
long long r = taken % x, c = taken / x;
bool found = false;
for (int i = 1; i <= n; i++)
if (i <= c)
found |= sum[c + 1] - v[i].total() + v[i].partial(r) >= limit;
else
found |= sum[c] + v[i].partial(r) >= limit;
return found;
}
int main() {
// ifstream cin("input.in");
int n;
cin >> n >> x;
long long limit = 0;
for (int i = 1; i <= n; i++) {
cin >> v[i].b >> v[i].l >> v[i].u;
limit += 1LL * v[i].b * v[i].l;
}
sort(v + 1, v + n + 1);
for (int i = 1; i <= n; i++)
sum[i] = sum[i - 1] + v[i].total();
long long left = 0, right = 1LL * n * x, answer = 1LL * n * x;
while (left <= right) {
long long middle = (left + right) / 2;
if (check(n, limit, middle)) {
answer = middle;
right = middle - 1;
} else
left = middle + 1;
}
cout << answer << "\n";
return 0;
}
| #include <algorithm>
#include <cassert>
#include <chrono>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
const int MAXN = 100000;
int x;
struct Exam {
int b;
int l;
int u;
long long total() const { return 1LL * b * l + 1LL * (x - b) * u; }
long long partial(long long a) {
if (a <= b)
return 1LL * a * l;
else
return 1LL * b * l + 1LL * (a - b) * u;
}
bool operator<(const Exam &other) const { return total() > other.total(); }
};
Exam v[1 + MAXN];
long long sum[1 + MAXN];
priority_queue<pair<int, int>> upHeap;
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>>
downHeap;
bool check(int n, long long limit, long long taken) {
if (1LL * n * x == taken)
return sum[n] >= limit;
long long r = taken % x, c = taken / x;
bool found = false;
for (int i = 1; i <= n; i++)
if (i <= c)
found |= sum[c + 1] - v[i].total() + v[i].partial(r) >= limit;
else
found |= sum[c] + v[i].partial(r) >= limit;
return found;
}
int main() {
// ifstream cin("input.in");
int n;
cin >> n >> x;
long long limit = 0;
for (int i = 1; i <= n; i++) {
cin >> v[i].b >> v[i].l >> v[i].u;
limit += 1LL * v[i].b * v[i].l;
}
sort(v + 1, v + n + 1);
for (int i = 1; i <= n; i++)
sum[i] = sum[i - 1] + v[i].total();
long long left = 0, right = 1LL * n * x, answer = 1LL * n * x;
while (left <= right) {
long long middle = (left + right) / 2;
if (check(n, limit, middle)) {
answer = middle;
right = middle - 1;
} else
left = middle + 1;
}
cout << answer << "\n";
return 0;
}
| replace | 34 | 35 | 34 | 35 | 0 | |
p03019 | C++ | Runtime Error | #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 ll INF = 1LL << 60;
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;
}
template <class C> void print(const C &c, std::ostream &os = std::cout) {
std::copy(std::begin(c), std::end(c),
std::ostream_iterator<typename C::value_type>(os, " "));
os << std::endl;
}
int main() {
int n, x;
cin >> n >> x;
struct test {
ll b, l, u, maxx;
ll operator()(ll x) {
if (x <= b)
return l * x;
else
return l * b + u * (x - b);
}
bool operator<(const test &rhs) const { return maxx > rhs.maxx; };
};
vector<test> tests;
ll sumb = 0;
for (int i = 0; i < n; ++i) {
ll b, l, u;
cin >> b >> l >> u;
sumb -= b * l;
ll maxx = l * b + u * (x - b);
test t = {b, l, u, maxx};
tests.push_back(t);
}
if (sumb == 0) {
cout << 0 << "\n";
return 0;
}
sort(tests.begin(), tests.end());
vl cumsum(n, 0);
cumsum[0] = tests[0].maxx;
for (int i = 1; i < n; ++i) {
cumsum[i] = cumsum[i - 1] + tests[i].maxx;
}
auto check = [&](ll mid) {
for (int i = 0; i < n; ++i) {
ll fullmark = mid / x;
if (fullmark >= n) {
return true;
}
ll score = sumb + tests[i](mid % x);
if (fullmark != 0)
score += cumsum[fullmark - 1];
if (fullmark - 1 >= i) {
score -= tests[i].maxx;
score += tests[fullmark].maxx;
}
if (score >= 0)
return true;
}
return false;
};
ll ok = n * x;
ll ng = 0;
while (abs(ok - ng) != 1) {
ll mid = (ng + ok) / 2;
if (check(mid))
ok = mid;
else
ng = mid;
}
cout << ok << "\n";
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 ll INF = 1LL << 60;
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;
}
template <class C> void print(const C &c, std::ostream &os = std::cout) {
std::copy(std::begin(c), std::end(c),
std::ostream_iterator<typename C::value_type>(os, " "));
os << std::endl;
}
int main() {
ll n, x;
cin >> n >> x;
struct test {
ll b, l, u, maxx;
ll operator()(ll x) {
if (x <= b)
return l * x;
else
return l * b + u * (x - b);
}
bool operator<(const test &rhs) const { return maxx > rhs.maxx; };
};
vector<test> tests;
ll sumb = 0;
for (int i = 0; i < n; ++i) {
ll b, l, u;
cin >> b >> l >> u;
sumb -= b * l;
ll maxx = l * b + u * (x - b);
test t = {b, l, u, maxx};
tests.push_back(t);
}
if (sumb == 0) {
cout << 0 << "\n";
return 0;
}
sort(tests.begin(), tests.end());
vl cumsum(n, 0);
cumsum[0] = tests[0].maxx;
for (int i = 1; i < n; ++i) {
cumsum[i] = cumsum[i - 1] + tests[i].maxx;
}
auto check = [&](ll mid) {
for (int i = 0; i < n; ++i) {
ll fullmark = mid / x;
if (fullmark >= n) {
return true;
}
ll score = sumb + tests[i](mid % x);
if (fullmark != 0)
score += cumsum[fullmark - 1];
if (fullmark - 1 >= i) {
score -= tests[i].maxx;
score += tests[fullmark].maxx;
}
if (score >= 0)
return true;
}
return false;
};
ll ok = n * x;
ll ng = 0;
while (abs(ok - ng) != 1) {
ll mid = (ng + ok) / 2;
if (check(mid))
ok = mid;
else
ng = mid;
}
cout << ok << "\n";
return 0;
} | replace | 24 | 25 | 24 | 25 | 0 | |
p03019 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
#define INF 1e15
ll N, X, b[101010];
ll l[101010], u[101010];
vector<pll> mxv;
ll mk[101010];
ll i, j, k, aa, bb, dd, bs, ans;
int main() {
scanf("%lld%lld", &N, &X);
bs = 0;
fornum(i, 0, N) {
scanf("%lld%lld%lld", &b[i], &l[i], &u[i]);
bs += l[i] * b[i];
mxv.push_back({u[i] * (X - b[i]) + l[i] * b[i], i});
}
sort(mxv.begin(), mxv.end(), greater<pll>());
// printf("%lld\n", bs);
while (bb < N && aa < bs) {
aa += mxv[bb].first;
ll a = mxv[bb].second;
mk[a] = 1;
dd += X;
// printf("%lld %lld\n", mxv[i].second, bs);
bb++;
}
bb--;
ans = INF;
fornum(i, 0, bb) {
ll cc = bs - (aa - mxv[i].first);
ll ii = mxv[i].second;
ll a = dd - X;
if (cc <= b[ii] * l[ii]) {
a += (cc - 1) / l[ii] + 1;
} else {
a += (cc - b[ii] * l[ii] - 1) / u[ii] + 1 + b[ii];
}
if (a < ans) {
ans = a;
}
// printf("%llda\n", ans);
}
fornum(i, bb, N) {
ll cc = bs - (aa - mxv[bb].first);
ll ii = mxv[i].second;
ll a = dd - X;
if (cc <= b[ii] * l[ii]) {
a += (cc - 1) / l[ii] + 1;
} else {
a += (cc - b[ii] * l[ii] - 1) / u[ii] + 1 + b[ii];
}
if (a < ans) {
ans = a;
}
// printf("%lld\n", ans);
}
printf("%lld", ans);
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
#define INF 1e15
ll N, X, b[101010];
ll l[101010], u[101010];
vector<pll> mxv;
ll mk[101010];
ll i, j, k, aa, bb, dd, bs, ans;
int main() {
scanf("%lld%lld", &N, &X);
bs = 0;
fornum(i, 0, N) {
scanf("%lld%lld%lld", &b[i], &l[i], &u[i]);
bs += l[i] * b[i];
mxv.push_back({u[i] * (X - b[i]) + l[i] * b[i], i});
}
sort(mxv.begin(), mxv.end(), greater<pll>());
// printf("%lld\n", bs);
if (bs == 0) {
printf("0");
return 0;
}
while (bb < N && aa < bs) {
aa += mxv[bb].first;
ll a = mxv[bb].second;
mk[a] = 1;
dd += X;
// printf("%lld %lld\n", mxv[i].second, bs);
bb++;
}
bb--;
ans = INF;
fornum(i, 0, bb) {
ll cc = bs - (aa - mxv[i].first);
ll ii = mxv[i].second;
ll a = dd - X;
if (cc <= b[ii] * l[ii]) {
a += (cc - 1) / l[ii] + 1;
} else {
a += (cc - b[ii] * l[ii] - 1) / u[ii] + 1 + b[ii];
}
if (a < ans) {
ans = a;
}
// printf("%llda\n", ans);
}
fornum(i, bb, N) {
ll cc = bs - (aa - mxv[bb].first);
ll ii = mxv[i].second;
ll a = dd - X;
if (cc <= b[ii] * l[ii]) {
a += (cc - 1) / l[ii] + 1;
} else {
a += (cc - b[ii] * l[ii] - 1) / u[ii] + 1 + b[ii];
}
if (a < ans) {
ans = a;
}
// printf("%lld\n", ans);
}
printf("%lld", ans);
return 0;
} | insert | 27 | 27 | 27 | 31 | 0 | |
p03019 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#ifdef ENABLE_DEBUG
#define dump(a) cerr << #a << "=" << a << endl
#define dumparr(a, n) cerr << #a << "[" << n << "]=" << a[n] << endl
#else
#define dump(a)
#define dumparr(a, n)
#endif
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define For(i, a) FOR(i, 0, a)
#define REV(i, a, b) for (int i = b - 1; i >= a; i--)
#define Rev(i, a) REV(i, 0, a)
#define REP(a) For(i, a)
typedef long long int ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> ppll;
typedef vector<ll> vll;
const ll INF = (1LL << 50);
template <class S, class T>
std::ostream &operator<<(std::ostream &os, pair<S, T> a) {
os << "(" << a.first << "," << a.second << ")";
return os;
}
template <class T> std::ostream &operator<<(std::ostream &os, vector<T> a) {
os << "[ ";
REP(a.size()) { os << a[i] << " "; }
os << " ]";
return os;
}
void solve(long long N, long long X, std::vector<long long> b,
std::vector<long long> l, std::vector<long long> u) {
ll lf = -1, rt = accumulate(b.begin(), b.end(), 0) * 10;
vector<pll> p;
REP(N) { p.push_back(pll(l[i] * b[i] + u[i] * (X - b[i]), i)); }
sort(p.begin(), p.end(), greater<pll>());
vector<ll> sump;
sump.push_back(0);
REP(N) { sump.push_back(sump.back() + p[i].first); }
dump(p);
dump(sump);
ll bsum = 0;
REP(N) { bsum += b[i] * l[i]; }
while (lf + 1 < rt) {
ll mid = (lf + rt) / 2;
ll ans = 0;
if (mid % X)
REP(N) {
ll sum = 0;
if (i < mid / X) {
sum = sump[mid / X + 1] - p[i].first;
} else {
sum = sump[mid / X];
}
ll idx = p[i].second;
if (mid % X < b[idx]) {
sum += (mid % X) * l[idx];
} else {
sum += (mid % X - b[idx]) * u[idx] + b[idx] * l[idx];
}
ans = max(ans, sum);
if (ans >= bsum)
break;
}
else {
ans = sump[mid / X];
}
if (ans >= bsum) {
rt = mid;
} else {
lf = mid;
}
}
cout << rt << endl;
}
int main() {
long long N;
scanf("%lld", &N);
long long X;
scanf("%lld", &X);
std::vector<long long> b(N);
std::vector<long long> l(N);
std::vector<long long> u(N);
for (int i = 0; i < N; i++) {
scanf("%lld", &b[i]);
scanf("%lld", &l[i]);
scanf("%lld", &u[i]);
}
solve(N, X, std::move(b), std::move(l), std::move(u));
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#ifdef ENABLE_DEBUG
#define dump(a) cerr << #a << "=" << a << endl
#define dumparr(a, n) cerr << #a << "[" << n << "]=" << a[n] << endl
#else
#define dump(a)
#define dumparr(a, n)
#endif
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define For(i, a) FOR(i, 0, a)
#define REV(i, a, b) for (int i = b - 1; i >= a; i--)
#define Rev(i, a) REV(i, 0, a)
#define REP(a) For(i, a)
typedef long long int ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> ppll;
typedef vector<ll> vll;
const ll INF = (1LL << 50);
template <class S, class T>
std::ostream &operator<<(std::ostream &os, pair<S, T> a) {
os << "(" << a.first << "," << a.second << ")";
return os;
}
template <class T> std::ostream &operator<<(std::ostream &os, vector<T> a) {
os << "[ ";
REP(a.size()) { os << a[i] << " "; }
os << " ]";
return os;
}
void solve(long long N, long long X, std::vector<long long> b,
std::vector<long long> l, std::vector<long long> u) {
ll lf = -1, rt = accumulate(b.begin(), b.end(), 0LL);
vector<pll> p;
REP(N) { p.push_back(pll(l[i] * b[i] + u[i] * (X - b[i]), i)); }
sort(p.begin(), p.end(), greater<pll>());
vector<ll> sump;
sump.push_back(0);
REP(N) { sump.push_back(sump.back() + p[i].first); }
dump(p);
dump(sump);
ll bsum = 0;
REP(N) { bsum += b[i] * l[i]; }
while (lf + 1 < rt) {
ll mid = (lf + rt) / 2;
ll ans = 0;
if (mid % X)
REP(N) {
ll sum = 0;
if (i < mid / X) {
sum = sump[mid / X + 1] - p[i].first;
} else {
sum = sump[mid / X];
}
ll idx = p[i].second;
if (mid % X < b[idx]) {
sum += (mid % X) * l[idx];
} else {
sum += (mid % X - b[idx]) * u[idx] + b[idx] * l[idx];
}
ans = max(ans, sum);
if (ans >= bsum)
break;
}
else {
ans = sump[mid / X];
}
if (ans >= bsum) {
rt = mid;
} else {
lf = mid;
}
}
cout << rt << endl;
}
int main() {
long long N;
scanf("%lld", &N);
long long X;
scanf("%lld", &X);
std::vector<long long> b(N);
std::vector<long long> l(N);
std::vector<long long> u(N);
for (int i = 0; i < N; i++) {
scanf("%lld", &b[i]);
scanf("%lld", &l[i]);
scanf("%lld", &u[i]);
}
solve(N, X, std::move(b), std::move(l), std::move(u));
return 0;
}
| replace | 38 | 39 | 38 | 39 | 0 | |
p03019 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
/*
REMEMBER:
1.Think TWICE, code ONCE!
Are there any counterexamples to your algo?
2.Be careful about the BOUNDARIES in your algo!
N=1? P=1? Is P a prime? Something about 0?
3.Never make STUPID MISTAKES!
Integer overflow? Array size? Time complexity? Memory usage? Precition error?
*/
const int _ = 1e5 + 7;
struct test {
long long B, L, R, benefit;
friend bool operator<(test p, test q) { return p.benefit > q.benefit; }
} now[_];
long long N, X, cost;
bool check(long long mid) {
int t = mid / X + 1;
long long lft = mid % X;
long long sum = 0, mx = 0;
for (int i = 1; i <= t; ++i)
sum += now[i].benefit;
for (int i = 1; i <= N; ++i)
mx = max(mx, sum - now[min(i, t)].benefit + min(now[i].B, lft) * now[i].L +
max(0ll, lft - now[i].B) * now[i].R);
return mx >= cost;
}
int main() {
cin >> N >> X;
for (int i = 1; i <= N; ++i) {
cin >> now[i].B >> now[i].L >> now[i].R;
cost += now[i].B * now[i].L;
now[i].benefit = now[i].L * now[i].B + now[i].R * (X - now[i].B);
}
sort(now + 1, now + N + 1);
long long L = 0, R = N * X;
while (L < R) {
int mid = (L + R) >> 1;
check(mid) ? R = mid : L = mid + 1;
}
cout << L;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
/*
REMEMBER:
1.Think TWICE, code ONCE!
Are there any counterexamples to your algo?
2.Be careful about the BOUNDARIES in your algo!
N=1? P=1? Is P a prime? Something about 0?
3.Never make STUPID MISTAKES!
Integer overflow? Array size? Time complexity? Memory usage? Precition error?
*/
const int _ = 1e5 + 7;
struct test {
long long B, L, R, benefit;
friend bool operator<(test p, test q) { return p.benefit > q.benefit; }
} now[_];
long long N, X, cost;
bool check(long long mid) {
int t = mid / X + 1;
long long lft = mid % X;
long long sum = 0, mx = 0;
for (int i = 1; i <= t; ++i)
sum += now[i].benefit;
for (int i = 1; i <= N; ++i)
mx = max(mx, sum - now[min(i, t)].benefit + min(now[i].B, lft) * now[i].L +
max(0ll, lft - now[i].B) * now[i].R);
return mx >= cost;
}
int main() {
cin >> N >> X;
for (int i = 1; i <= N; ++i) {
cin >> now[i].B >> now[i].L >> now[i].R;
cost += now[i].B * now[i].L;
now[i].benefit = now[i].L * now[i].B + now[i].R * (X - now[i].B);
}
sort(now + 1, now + N + 1);
long long L = 0, R = N * X;
while (L < R) {
long long mid = (L + R) >> 1;
check(mid) ? R = mid : L = mid + 1;
}
cout << L;
return 0;
} | replace | 44 | 45 | 44 | 45 | 0 | |
p03019 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long int n, x;
struct test {
long long int b, l, u;
bool operator<(const test &rhs) const {
return l * b + u * (x - b) > rhs.l * rhs.b + rhs.u * (x - rhs.b);
}
} T[100000];
int now = 0;
bool check(long long int s, long long int t) {
long long int res = 0;
for (int i = now; i < n; i++) {
long long int tmp;
if (s > T[i].b)
tmp = T[i].l * T[i].b + (s - T[i].b) * T[i].u;
else
tmp = s * T[i].l;
res = max(res, tmp);
}
return res >= t;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> x;
for (int i = 0; i < n; i++)
cin >> T[i].b >> T[i].l >> T[i].u;
long long int target = 0;
for (int i = 0; i < n; i++)
target += T[i].l * T[i].b;
sort(T, T + n);
while (target - ((T[now].l * T[now].b) + T[now].u * (x - T[now].b)) >= 0) {
target -= ((T[now].l * T[now].b) + T[now].u * (x - T[now].b));
now++;
}
if (now == n) {
cout << n * x << endl;
return 0;
}
long long int ans = n * x;
int here = now - 1;
for (int i = n - 1; i >= 0; i--) {
long long int res = 0;
if (i <= here) {
target += ((T[i].l * T[i].b) + T[i].u * (x - T[i].b));
if (i != here)
target -= ((T[i + 1].l * T[i + 1].b) + T[i + 1].u * (x - T[i + 1].b));
}
while (target - ((T[now].l * T[now].b) + T[now].u * (x - T[now].b)) >= 0) {
target -= ((T[now].l * T[now].b) + T[now].u * (x - T[now].b));
now++;
}
if (i <= here)
res = x * (now - 1);
else
res = x * now;
long long int tmp = target;
if (target <= T[i].l * T[i].b)
res += target / T[i].l + ((target % T[i].l) ? 1 : 0);
else {
res += T[i].b;
tmp -= T[i].l * T[i].b;
res += tmp / T[i].u + ((tmp % T[i].u) ? 1 : 0);
}
ans = min(ans, res);
}
cout << ans << endl;
/*while(now>0&&!(T[now]<T[now-1])&&!(T[now-1]<T[now]))
now--;
long long int L=0,R=x;
while(L<R){
long long int mid=(L+R)/2;
if(check(mid,target))
R=mid;
else
L=mid+1;
}
cout<<ans+L<<endl;*/
}
| #include <bits/stdc++.h>
using namespace std;
long long int n, x;
struct test {
long long int b, l, u;
bool operator<(const test &rhs) const {
return l * b + u * (x - b) > rhs.l * rhs.b + rhs.u * (x - rhs.b);
}
} T[100000];
int now = 0;
bool check(long long int s, long long int t) {
long long int res = 0;
for (int i = now; i < n; i++) {
long long int tmp;
if (s > T[i].b)
tmp = T[i].l * T[i].b + (s - T[i].b) * T[i].u;
else
tmp = s * T[i].l;
res = max(res, tmp);
}
return res >= t;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> x;
for (int i = 0; i < n; i++)
cin >> T[i].b >> T[i].l >> T[i].u;
long long int target = 0;
for (int i = 0; i < n; i++)
target += T[i].l * T[i].b;
sort(T, T + n);
while (target - ((T[now].l * T[now].b) + T[now].u * (x - T[now].b)) >= 0) {
target -= ((T[now].l * T[now].b) + T[now].u * (x - T[now].b));
now++;
}
if (now == n) {
cout << n * x << endl;
return 0;
}
long long int ans = n * x;
int here = now - 1;
for (int i = n - 1; i >= 0; i--) {
long long int res = 0;
if (i <= here) {
target += ((T[i].l * T[i].b) + T[i].u * (x - T[i].b));
if (i != here)
target -= ((T[i + 1].l * T[i + 1].b) + T[i + 1].u * (x - T[i + 1].b));
}
while (now < n &&
target - ((T[now].l * T[now].b) + T[now].u * (x - T[now].b)) >= 0) {
target -= ((T[now].l * T[now].b) + T[now].u * (x - T[now].b));
now++;
}
if (i <= here)
res = x * (now - 1);
else
res = x * now;
long long int tmp = target;
if (target <= T[i].l * T[i].b)
res += target / T[i].l + ((target % T[i].l) ? 1 : 0);
else {
res += T[i].b;
tmp -= T[i].l * T[i].b;
res += tmp / T[i].u + ((tmp % T[i].u) ? 1 : 0);
}
ans = min(ans, res);
}
cout << ans << endl;
/*while(now>0&&!(T[now]<T[now-1])&&!(T[now-1]<T[now]))
now--;
long long int L=0,R=x;
while(L<R){
long long int mid=(L+R)/2;
if(check(mid,target))
R=mid;
else
L=mid+1;
}
cout<<ans+L<<endl;*/
}
| replace | 52 | 53 | 52 | 54 | -11 | |
p03019 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <tuple>
#include <unordered_map>
#include <vector>
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
#define pb push_back
using namespace std;
typedef long long ll;
typedef double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef unsigned int uint;
typedef unsigned long long ull;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
// default_random_engine generator;
// mt19937 rnd(1);
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int n;
ll x;
cin >> n >> x;
vector<ll> b(n), l(n), r(n);
for (int i = 0; i < n; ++i) {
cin >> b[i] >> l[i] >> r[i];
}
vector<pll> score(n);
ll init = 0;
for (int i = 0; i < n; ++i) {
// cout << b[i] * l[i] + (x - b[i]) * r[i] << endl;
score[i] = {b[i] * l[i] + (x - b[i]) * r[i], i};
init += b[i] * l[i];
}
sort(all(score));
reverse(all(score));
// for (int i = 0; i < n; ++i) {
// cout << score[i].first << " " << score[i].second << endl;
// }
ll lf = -1, rg = x * n;
while (rg - lf > 1) {
int mid = (lf + rg) / 2;
vector<int> used(n);
ll cnt = mid / x;
ll rem = mid % x;
ll res = 0;
for (int i = 0; i <= cnt; ++i) {
used[score[i].second] = 1;
res += score[i].first;
}
bool ok = false;
for (int i = 0; i < n; ++i) {
ll cur = min(rem, b[i]) * l[i] + max(rem - b[i], 0ll) * r[i];
// cout << cur << endl;
cur += res;
// cout << cur << endl;
// cout << cnt << " " << rem << endl;
if (used[i]) {
cur -= b[i] * l[i] + (x - b[i]) * r[i];
} else {
int j = score[cnt].second;
cur -= b[j] * l[j] + (x - b[j]) * r[j];
}
if (cur >= init) {
ok = true;
}
// cout << cur << " " << init << endl;
}
if (ok) {
rg = mid;
} else {
lf = mid;
}
}
cout << rg << endl;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <tuple>
#include <unordered_map>
#include <vector>
#define all(a) (a).begin(), (a).end()
#define sz(a) (int)(a).size()
#define pb push_back
using namespace std;
typedef long long ll;
typedef double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef unsigned int uint;
typedef unsigned long long ull;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
// default_random_engine generator;
// mt19937 rnd(1);
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
int n;
ll x;
cin >> n >> x;
vector<ll> b(n), l(n), r(n);
for (int i = 0; i < n; ++i) {
cin >> b[i] >> l[i] >> r[i];
}
vector<pll> score(n);
ll init = 0;
for (int i = 0; i < n; ++i) {
// cout << b[i] * l[i] + (x - b[i]) * r[i] << endl;
score[i] = {b[i] * l[i] + (x - b[i]) * r[i], i};
init += b[i] * l[i];
}
sort(all(score));
reverse(all(score));
// for (int i = 0; i < n; ++i) {
// cout << score[i].first << " " << score[i].second << endl;
// }
ll lf = -1, rg = x * n;
while (rg - lf > 1) {
ll mid = (lf + rg) / 2;
vector<int> used(n);
ll cnt = mid / x;
ll rem = mid % x;
ll res = 0;
for (int i = 0; i <= cnt; ++i) {
used[score[i].second] = 1;
res += score[i].first;
}
bool ok = false;
for (int i = 0; i < n; ++i) {
ll cur = min(rem, b[i]) * l[i] + max(rem - b[i], 0ll) * r[i];
// cout << cur << endl;
cur += res;
// cout << cur << endl;
// cout << cnt << " " << rem << endl;
if (used[i]) {
cur -= b[i] * l[i] + (x - b[i]) * r[i];
} else {
int j = score[cnt].second;
cur -= b[j] * l[j] + (x - b[j]) * r[j];
}
if (cur >= init) {
ok = true;
}
// cout << cur << " " << init << endl;
}
if (ok) {
rg = mid;
} else {
lf = mid;
}
}
cout << rg << endl;
}
| replace | 77 | 78 | 77 | 78 | 0 | |
p03019 | C++ | Runtime Error | ///////////////////////////////////////////////////////////////////////////////
#include <bits/stdc++.h>
#include <sys/time.h>
#include <time.h>
#include <unistd.h>
using namespace std;
///////////////////////////////////////////////////////////////////////////////
#define DEBUG 0
#define pb push_back
#define V vector
#define M unordered_map
#define S static
#define rep(i, n) for (ll i = 0LL; i < n; ++i)
#define srep(i, s, n) for (ll i = s; i < n; ++i)
#define rrep(i, n) for (ll i = n - 1LL; i >= 0LL; --i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define CIN(x) \
do { \
assert(!cin.eof()); \
cin >> x; \
assert(!cin.fail()); \
} while (0);
#if DEBUG
#define debug_print(...) _debug_print(__VA_ARGS__)
#define debug_printf(...) printf(__VA_ARGS__)
#define debug_print_time _debug_print_time
#else // DEBUG
#define debug_print(...)
#define debug_printf(...)
#define debug_print_time
#endif // DEBUG
typedef long long ll;
typedef unsigned long long ull;
typedef tuple<ll, ll> t2;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
template <typename T>
using priority_queue_incr = priority_queue<T, V<T>, greater<T>>;
///////////////////////////////////////////////////////////////////////////////
template <typename TT, typename T> T get_m(M<TT, T> &m, TT k, T default_value) {
if (m.find(k) == m.end())
return m[k] = default_value;
return m[k];
}
template <typename TT, typename T> void incr_m(M<TT, T> &m, TT k) {
if (m.find(k) == m.end())
m[k] = 0;
m[k]++;
}
template <typename TT, typename T> void incr_m(map<TT, T> &m, TT k) {
if (m.find(k) == m.end())
m[k] = 0;
m[k]++;
}
void llin(ll &a) { CIN(a); }
void llinl1(V<ll> &v, ll count) {
for (ll i = 0LL; i < count; ++i) {
ll a;
CIN(a);
v.push_back(a);
}
}
void llinl2(V<t2> &v, ll count) {
for (ll i = 0LL; i < count; ++i) {
ll a, b;
CIN(a >> b);
v.push_back(t2(a, b));
}
}
void llinl3(V<t3> &v, ll count) {
for (ll i = 0LL; i < count; ++i) {
ll a, b, c;
CIN(a >> b >> c);
v.push_back(t3(a, b, c));
}
}
void llinl4(V<t4> &v, ll count) {
for (ll i = 0LL; i < count; ++i) {
ll a, b, c, d;
CIN(a >> b >> c >> d);
v.push_back(t4(a, b, c, d));
}
}
void llina(V<ll> &v, ll count) { llinl1(v, count); }
template <typename T> void sort(V<T> &v) { sort(v.begin(), v.end()); }
template <typename T> void sort_reverse(V<T> &v) {
sort(v.begin(), v.end(), greater<T>());
}
template <typename T> void _debug_print(T x) { cout << x << endl; }
void _debug_print(const t2 &x) {
ll x1 = get<0>(x);
ll x2 = get<1>(x);
cout << "-- " << x1 << " -- " << x2 << endl;
}
void _debug_print(const t3 &x) {
ll x1 = get<0>(x);
ll x2 = get<1>(x);
ll x3 = get<2>(x);
cout << "-- " << x1 << " -- " << x2 << " -- " << x3 << endl;
}
void _debug_print(const t4 &x) {
ll x1 = get<0>(x);
ll x2 = get<1>(x);
ll x3 = get<2>(x);
ll x4 = get<3>(x);
cout << "-- " << x1 << " -- " << x2 << " -- " << x3 << " -- " << x4 << endl;
}
template <typename T> void _debug_print(T xarray[], ll n) {
rep(i, n) _debug_print(xarray[i]);
}
template <typename T> void _debug_print(const V<T> &xlist) {
for (auto x : xlist) {
cout << "-- ";
_debug_print(x);
}
}
template <typename T> void _debug_print(const set<T> &xset) {
for (auto x : xset) {
cout << "-- ";
_debug_print(x);
}
}
template <typename TT, typename T> void _debug_print(const M<TT, T> &xlist) {
for (auto x : xlist) {
TT k = x.first;
T v = x.second;
cout << "====" << endl;
cout << "K=";
_debug_print(k);
cout << "V=";
_debug_print(v);
}
}
template <typename TT, typename T> void _debug_print(const map<TT, T> &xlist) {
for (auto x : xlist) {
TT k = x.first;
T v = x.second;
cout << "====" << endl;
cout << "K=";
_debug_print(k);
cout << "V=";
_debug_print(v);
}
}
void _debug_print_time(const char *prefix) {
struct timeval tv;
gettimeofday(&tv, NULL);
#if DEBUG
struct tm *tm = localtime(&tv.tv_sec);
#endif
debug_printf("-- %s %02d:%02d:%02d.%06ld\n", prefix, tm->tm_hour, tm->tm_min,
tm->tm_sec, tv.tv_usec);
}
///////////////////////////////////////////////////////////////////////////////
void _main();
int main() {
cout << setprecision(12);
#if !DEBUG
ios::sync_with_stdio(false);
cin.tie(0);
#endif
_main();
return 0;
}
void _main() {
ll n;
llin(n);
ll max_a;
llin(max_a);
V<t3> blulist;
llinl3(blulist, n);
bool allmax = true;
for (auto blu : blulist) {
ll b = get<0>(blu);
if (b < max_a)
allmax = false;
}
if (allmax) {
cout << max_a * n << endl;
return;
}
ll aim = 0;
for (auto blu : blulist) {
ll b = get<0>(blu);
ll left = get<1>(blu);
ll right = get<2>(blu);
aim += b * left;
}
debug_printf("---- aim = %lld\n", aim);
V<t4> incr_blulist;
rep(i, n) {
ll b = get<0>(blulist[i]);
ll left = get<1>(blulist[i]);
ll right = get<2>(blulist[i]);
incr_blulist.pb(t4(b * left + (max_a - b) * right, b, left, right));
}
sort_reverse(incr_blulist);
ll base = 0;
ll end = 0;
for (auto item : incr_blulist) {
ll incr = get<0>(item);
ll b = get<1>(item);
ll left = get<2>(item);
ll right = get<3>(item);
debug_printf("--- base=%lld incr=%lld b=%lld left=%lld right=%lld\n", base,
incr, b, left, right);
if (base + incr <= aim) {
base += incr;
end++;
} else
break;
}
ll min_append = max_a;
rep(i, n) {
ll lbase = base;
if (i < end) {
lbase -= get<0>(incr_blulist[i]);
lbase += get<0>(incr_blulist[end]);
}
ll incr = get<0>(incr_blulist[i]);
ll b = get<1>(incr_blulist[i]);
ll left = get<2>(incr_blulist[i]);
ll right = get<3>(incr_blulist[i]);
ll laim = aim - lbase;
assert(laim > 0);
ll floor = 0;
ll ceil = max_a;
ll nowpos = (floor + ceil) / 2LL;
ll append = max_a;
for (; floor <= ceil; nowpos = (floor + ceil) / 2LL) {
ll lincr = left * min(nowpos, b);
lincr += right * max(0LL, nowpos - b);
if (lincr < laim) {
floor = nowpos + 1LL;
} else {
ceil = nowpos - 1LL;
append = min(append, nowpos);
}
}
min_append = min(min_append, append);
}
debug_printf("---- ans\n");
cout << end * max_a + min_append << endl;
}
///////////////////////////////////////////////////////////////////////////////
| ///////////////////////////////////////////////////////////////////////////////
#include <bits/stdc++.h>
#include <sys/time.h>
#include <time.h>
#include <unistd.h>
using namespace std;
///////////////////////////////////////////////////////////////////////////////
#define DEBUG 0
#define pb push_back
#define V vector
#define M unordered_map
#define S static
#define rep(i, n) for (ll i = 0LL; i < n; ++i)
#define srep(i, s, n) for (ll i = s; i < n; ++i)
#define rrep(i, n) for (ll i = n - 1LL; i >= 0LL; --i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define CIN(x) \
do { \
assert(!cin.eof()); \
cin >> x; \
assert(!cin.fail()); \
} while (0);
#if DEBUG
#define debug_print(...) _debug_print(__VA_ARGS__)
#define debug_printf(...) printf(__VA_ARGS__)
#define debug_print_time _debug_print_time
#else // DEBUG
#define debug_print(...)
#define debug_printf(...)
#define debug_print_time
#endif // DEBUG
typedef long long ll;
typedef unsigned long long ull;
typedef tuple<ll, ll> t2;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
template <typename T>
using priority_queue_incr = priority_queue<T, V<T>, greater<T>>;
///////////////////////////////////////////////////////////////////////////////
template <typename TT, typename T> T get_m(M<TT, T> &m, TT k, T default_value) {
if (m.find(k) == m.end())
return m[k] = default_value;
return m[k];
}
template <typename TT, typename T> void incr_m(M<TT, T> &m, TT k) {
if (m.find(k) == m.end())
m[k] = 0;
m[k]++;
}
template <typename TT, typename T> void incr_m(map<TT, T> &m, TT k) {
if (m.find(k) == m.end())
m[k] = 0;
m[k]++;
}
void llin(ll &a) { CIN(a); }
void llinl1(V<ll> &v, ll count) {
for (ll i = 0LL; i < count; ++i) {
ll a;
CIN(a);
v.push_back(a);
}
}
void llinl2(V<t2> &v, ll count) {
for (ll i = 0LL; i < count; ++i) {
ll a, b;
CIN(a >> b);
v.push_back(t2(a, b));
}
}
void llinl3(V<t3> &v, ll count) {
for (ll i = 0LL; i < count; ++i) {
ll a, b, c;
CIN(a >> b >> c);
v.push_back(t3(a, b, c));
}
}
void llinl4(V<t4> &v, ll count) {
for (ll i = 0LL; i < count; ++i) {
ll a, b, c, d;
CIN(a >> b >> c >> d);
v.push_back(t4(a, b, c, d));
}
}
void llina(V<ll> &v, ll count) { llinl1(v, count); }
template <typename T> void sort(V<T> &v) { sort(v.begin(), v.end()); }
template <typename T> void sort_reverse(V<T> &v) {
sort(v.begin(), v.end(), greater<T>());
}
template <typename T> void _debug_print(T x) { cout << x << endl; }
void _debug_print(const t2 &x) {
ll x1 = get<0>(x);
ll x2 = get<1>(x);
cout << "-- " << x1 << " -- " << x2 << endl;
}
void _debug_print(const t3 &x) {
ll x1 = get<0>(x);
ll x2 = get<1>(x);
ll x3 = get<2>(x);
cout << "-- " << x1 << " -- " << x2 << " -- " << x3 << endl;
}
void _debug_print(const t4 &x) {
ll x1 = get<0>(x);
ll x2 = get<1>(x);
ll x3 = get<2>(x);
ll x4 = get<3>(x);
cout << "-- " << x1 << " -- " << x2 << " -- " << x3 << " -- " << x4 << endl;
}
template <typename T> void _debug_print(T xarray[], ll n) {
rep(i, n) _debug_print(xarray[i]);
}
template <typename T> void _debug_print(const V<T> &xlist) {
for (auto x : xlist) {
cout << "-- ";
_debug_print(x);
}
}
template <typename T> void _debug_print(const set<T> &xset) {
for (auto x : xset) {
cout << "-- ";
_debug_print(x);
}
}
template <typename TT, typename T> void _debug_print(const M<TT, T> &xlist) {
for (auto x : xlist) {
TT k = x.first;
T v = x.second;
cout << "====" << endl;
cout << "K=";
_debug_print(k);
cout << "V=";
_debug_print(v);
}
}
template <typename TT, typename T> void _debug_print(const map<TT, T> &xlist) {
for (auto x : xlist) {
TT k = x.first;
T v = x.second;
cout << "====" << endl;
cout << "K=";
_debug_print(k);
cout << "V=";
_debug_print(v);
}
}
void _debug_print_time(const char *prefix) {
struct timeval tv;
gettimeofday(&tv, NULL);
#if DEBUG
struct tm *tm = localtime(&tv.tv_sec);
#endif
debug_printf("-- %s %02d:%02d:%02d.%06ld\n", prefix, tm->tm_hour, tm->tm_min,
tm->tm_sec, tv.tv_usec);
}
///////////////////////////////////////////////////////////////////////////////
void _main();
int main() {
cout << setprecision(12);
#if !DEBUG
ios::sync_with_stdio(false);
cin.tie(0);
#endif
_main();
return 0;
}
void _main() {
ll n;
llin(n);
ll max_a;
llin(max_a);
V<t3> blulist;
llinl3(blulist, n);
bool allmax = true;
for (auto blu : blulist) {
ll b = get<0>(blu);
if (b < max_a)
allmax = false;
}
if (allmax) {
cout << max_a * n << endl;
return;
}
ll aim = 0;
for (auto blu : blulist) {
ll b = get<0>(blu);
ll left = get<1>(blu);
ll right = get<2>(blu);
aim += b * left;
}
debug_printf("---- aim = %lld\n", aim);
V<t4> incr_blulist;
rep(i, n) {
ll b = get<0>(blulist[i]);
ll left = get<1>(blulist[i]);
ll right = get<2>(blulist[i]);
incr_blulist.pb(t4(b * left + (max_a - b) * right, b, left, right));
}
sort_reverse(incr_blulist);
ll base = 0;
ll end = 0;
for (auto item : incr_blulist) {
ll incr = get<0>(item);
ll b = get<1>(item);
ll left = get<2>(item);
ll right = get<3>(item);
debug_printf("--- base=%lld incr=%lld b=%lld left=%lld right=%lld\n", base,
incr, b, left, right);
if (base + incr <= aim) {
base += incr;
end++;
} else
break;
}
ll min_append = max_a;
rep(i, n) {
ll lbase = base;
if (i < end) {
lbase -= get<0>(incr_blulist[i]);
lbase += get<0>(incr_blulist[end]);
}
ll incr = get<0>(incr_blulist[i]);
ll b = get<1>(incr_blulist[i]);
ll left = get<2>(incr_blulist[i]);
ll right = get<3>(incr_blulist[i]);
ll laim = aim - lbase;
assert(laim >= 0);
ll floor = 0;
ll ceil = max_a;
ll nowpos = (floor + ceil) / 2LL;
ll append = max_a;
for (; floor <= ceil; nowpos = (floor + ceil) / 2LL) {
ll lincr = left * min(nowpos, b);
lincr += right * max(0LL, nowpos - b);
if (lincr < laim) {
floor = nowpos + 1LL;
} else {
ceil = nowpos - 1LL;
append = min(append, nowpos);
}
}
min_append = min(min_append, append);
}
debug_printf("---- ans\n");
cout << end * max_a + min_append << endl;
}
///////////////////////////////////////////////////////////////////////////////
| replace | 268 | 269 | 268 | 269 | 0 | |
p03019 | C++ | Runtime Error | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <unordered_map>
#include <vector>
using namespace std;
long long N, X;
long long L[1 < 20], R[1 << 20], B[1 << 20];
long long min_score = 0;
vector<pair<long long, int>> v;
vector<long long> csum(1 << 20);
bool possible(long long num_study_hrs) {
if (num_study_hrs == 0)
return (min_score >= 0);
int num_complete = num_study_hrs / X;
int partial = num_study_hrs % X;
if (partial == 0)
return ((csum[num_complete - 1] + min_score) >= 0);
for (int i = 0; i < N; i++) {
long long tsr = 0;
if (partial <= B[v[i].second])
tsr = partial * 1LL * L[v[i].second];
else
tsr = B[v[i].second] * 1LL * L[v[i].second] +
(partial - B[v[i].second]) * 1LL * R[v[i].second];
if (num_complete != 0) {
if (i <= (num_complete - 1))
tsr = csum[num_complete] - v[i].first + tsr;
else
tsr = csum[num_complete - 1] + tsr;
}
if ((tsr + min_score) >= 0)
return true;
}
return false;
}
int main() {
// freopen("input.in","r",stdin);
// freopen("output.out","w",stdout);
cin >> N >> X;
for (int i = 0; i < N; i++) {
cin >> B[i] >> L[i] >> R[i];
min_score += -(1LL * B[i]) * L[i];
v.push_back({B[i] * 1LL * L[i] + (X - B[i]) * 1LL * R[i], i});
}
sort(v.begin(), v.end(), greater<>());
csum[0] = v[0].first;
for (int i = 1; i < N; i++) {
csum[i] = csum[i - 1] + v[i].first;
}
long long lo = 0, hi = (1LL * N) * X, mid = 0;
while (lo < hi) {
mid = (lo + hi) / 2;
if (possible(mid)) {
hi = mid;
} // cout<<mid<<endl;}
else
lo = mid + 1;
}
cout << lo; // << v[0].first <<" "<<v[1].first<<endl;
return 0;
}
| #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <unordered_map>
#include <vector>
using namespace std;
int N, X;
int L[1 << 20], R[1 << 20], B[1 << 20];
long long min_score = 0;
vector<pair<long long, int>> v;
vector<long long> csum(1 << 20);
bool possible(long long num_study_hrs) {
if (num_study_hrs == 0)
return (min_score >= 0);
int num_complete = num_study_hrs / X;
int partial = num_study_hrs % X;
if (partial == 0)
return ((csum[num_complete - 1] + min_score) >= 0);
for (int i = 0; i < N; i++) {
long long tsr = 0;
if (partial <= B[v[i].second])
tsr = partial * 1LL * L[v[i].second];
else
tsr = B[v[i].second] * 1LL * L[v[i].second] +
(partial - B[v[i].second]) * 1LL * R[v[i].second];
if (num_complete != 0) {
if (i <= (num_complete - 1))
tsr = csum[num_complete] - v[i].first + tsr;
else
tsr = csum[num_complete - 1] + tsr;
}
if ((tsr + min_score) >= 0)
return true;
}
return false;
}
int main() {
// freopen("input.in","r",stdin);
// freopen("output.out","w",stdout);
cin >> N >> X;
for (int i = 0; i < N; i++) {
cin >> B[i] >> L[i] >> R[i];
min_score += -(1LL * B[i]) * L[i];
v.push_back({B[i] * 1LL * L[i] + (X - B[i]) * 1LL * R[i], i});
}
sort(v.begin(), v.end(), greater<>());
csum[0] = v[0].first;
for (int i = 1; i < N; i++) {
csum[i] = csum[i - 1] + v[i].first;
}
long long lo = 0, hi = (1LL * N) * X, mid = 0;
while (lo < hi) {
mid = (lo + hi) / 2;
if (possible(mid)) {
hi = mid;
} // cout<<mid<<endl;}
else
lo = mid + 1;
}
cout << lo; // << v[0].first <<" "<<v[1].first<<endl;
return 0;
}
| replace | 20 | 22 | 20 | 22 | 0 | |
p03019 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int mx = 15;
long long n, x, mid, l = -1, r, d, ac[mx];
struct Test {
long long b, l, u;
long long s(long long t = x) { return t < b ? t * l : b * l + (t - b) * u; }
} t[mx];
int main() {
scanf("%lld%lld", &n, &x);
for (int i = 0; i < n; i++) {
scanf("%lld%lld%lld", &t[i].b, &t[i].l, &t[i].u);
d += t[i].b * t[i].l;
}
sort(t, t + n, [](Test a, Test b) { return a.s() > b.s(); });
for (int i = 0; i < n; i++)
ac[i + 1] = ac[i] + t[i].s();
r = x * n;
while (l + 1 < r) {
mid = (r + l) / 2;
long long xx = mid / x, yy = mid % x;
bool ok = false;
for (int i = 0; i < n; i++) {
if (d <= (i < xx ? ac[xx + 1] - t[i].s() : ac[xx]) + t[i].s(yy)) {
ok = true;
break;
}
}
(ok ? r : l) = mid;
}
printf("%lld\n", r);
} | #include <bits/stdc++.h>
using namespace std;
const int mx = 100005;
long long n, x, mid, l = -1, r, d, ac[mx];
struct Test {
long long b, l, u;
long long s(long long t = x) { return t < b ? t * l : b * l + (t - b) * u; }
} t[mx];
int main() {
scanf("%lld%lld", &n, &x);
for (int i = 0; i < n; i++) {
scanf("%lld%lld%lld", &t[i].b, &t[i].l, &t[i].u);
d += t[i].b * t[i].l;
}
sort(t, t + n, [](Test a, Test b) { return a.s() > b.s(); });
for (int i = 0; i < n; i++)
ac[i + 1] = ac[i] + t[i].s();
r = x * n;
while (l + 1 < r) {
mid = (r + l) / 2;
long long xx = mid / x, yy = mid % x;
bool ok = false;
for (int i = 0; i < n; i++) {
if (d <= (i < xx ? ac[xx + 1] - t[i].s() : ac[xx]) + t[i].s(yy)) {
ok = true;
break;
}
}
(ok ? r : l) = mid;
}
printf("%lld\n", r);
} | replace | 2 | 3 | 2 | 3 | 0 | |
p03019 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
int N, X;
long long l[300010], r[300010], b[300010];
bool good(long long need) {
long long extra = need % X;
need /= X;
if (need >= N)
return true;
long long sum = 0;
vector<pair<long long, int>> v;
for (int i = 1; i <= N; i++) {
sum -= l[i] * b[i];
v.emplace_back(r[i] * (X - b[i]) + l[i] * b[i], i);
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
for (int i = 0; i < need; i++) {
sum += v[i].first;
}
if (extra == 0)
return sum >= 0;
long long ans = sum;
for (int i = need; i < N; i++) {
int id = v[i].second;
long long diff = extra - b[id];
ans = max(ans, sum + l[id] * diff + l[id] * b[id]);
ans = max(ans, sum + r[id] * diff + l[id] * b[id]);
}
sum += v[need].first;
for (int i = 0; i < need; i++) {
int id = v[i].second;
long long diff = extra - b[id];
ans = max(ans, sum - r[id] * (X - b[id]) + l[id] * diff);
ans = max(ans, sum - r[id] * (X - b[id]) + r[id] * diff);
}
return ans >= 0;
}
long long search(long long b, long long e) {
if (b == e) {
return b;
}
int mid = (b + e) >> 1;
if (good(mid)) {
return search(b, mid);
} else {
return search(mid + 1, e);
}
}
int main(int argc, char const *argv[]) {
scanf("%d %d", &N, &X);
for (int i = 1; i <= N; i++) {
scanf("%lld %lld %lld", &b[i], &l[i], &r[i]);
}
printf("%lld\n", search(0, 1LL * X * N));
return 0;
} | #include "bits/stdc++.h"
using namespace std;
int N, X;
long long l[300010], r[300010], b[300010];
bool good(long long need) {
long long extra = need % X;
need /= X;
if (need >= N)
return true;
long long sum = 0;
vector<pair<long long, int>> v;
for (int i = 1; i <= N; i++) {
sum -= l[i] * b[i];
v.emplace_back(r[i] * (X - b[i]) + l[i] * b[i], i);
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
for (int i = 0; i < need; i++) {
sum += v[i].first;
}
if (extra == 0)
return sum >= 0;
long long ans = sum;
for (int i = need; i < N; i++) {
int id = v[i].second;
long long diff = extra - b[id];
ans = max(ans, sum + l[id] * diff + l[id] * b[id]);
ans = max(ans, sum + r[id] * diff + l[id] * b[id]);
}
sum += v[need].first;
for (int i = 0; i < need; i++) {
int id = v[i].second;
long long diff = extra - b[id];
ans = max(ans, sum - r[id] * (X - b[id]) + l[id] * diff);
ans = max(ans, sum - r[id] * (X - b[id]) + r[id] * diff);
}
return ans >= 0;
}
long long search(long long b, long long e) {
if (b == e) {
return b;
}
long long mid = (b + e) >> 1;
if (good(mid)) {
return search(b, mid);
} else {
return search(mid + 1, e);
}
}
int main(int argc, char const *argv[]) {
scanf("%d %d", &N, &X);
for (int i = 1; i <= N; i++) {
scanf("%lld %lld %lld", &b[i], &l[i], &r[i]);
}
printf("%lld\n", search(0, 1LL * X * N));
return 0;
} | replace | 45 | 46 | 45 | 46 | 0 | |
p03019 | Python | Time Limit Exceeded | import os
import sys
import numpy as np
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(2147483647)
INF = float("inf")
def bisect_right_callable(fn, x, lo, hi):
"""
lo から hi-1 のうち、fn の結果が x 以下となる、最も右の値 + 1
bisect.bisect_right と同じ
https://docs.python.org/ja/3/library/bisect.html
:param callable fn:
:param x:
:param int lo: 最小値
:param int hi: 最大値 + 1
:return: lo <= ret <= hi
"""
while lo < hi:
mid = (lo + hi) // 2
if x < fn(mid):
hi = mid
else:
lo = mid + 1
return lo
N, X = list(map(int, sys.stdin.readline().split()))
B, L, U = list(zip(*[map(int, sys.stdin.readline().split()) for _ in range(N)]))
B = np.array(B, dtype=int)
L = np.array(L, dtype=int)
U = np.array(U, dtype=int)
# 全部 L で B 点とると仮定する
target = (B * L).sum()
# こうすれば target と比較できる
scores = B * L + (X - B) * U
scores_i = scores.argsort()
scores = scores[scores_i]
scores_cumsum = np.concatenate((scores[::-1].cumsum()[::-1], [0]))
B = B[scores_i]
L = L[scores_i]
U = U[scores_i]
def get_max_score(x):
# x 点とったときの最大のスコア
# 満点の数
perfects = x // X
# 途中まで頑張るやつは何点取ればいいか
half_x = x % X
max_score = 0
for i in range(N):
# i 番目のテストだけ途中まで頑張る
# 満点の合計
if i < N - perfects:
score = scores_cumsum[N - perfects]
else:
score = scores_cumsum[N - perfects - 1] - scores[i]
score += min(half_x, B[i]) * L[i] + (max(B[i], half_x) - B[i]) * U[i]
max_score = max(max_score, score)
return max_score
ans = bisect_right_callable(get_max_score, target - 1, 0, B.sum())
print(ans)
| import os
import sys
import numpy as np
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(2147483647)
INF = float("inf")
def bisect_right_callable(fn, x, lo, hi):
"""
lo から hi-1 のうち、fn の結果が x 以下となる、最も右の値 + 1
bisect.bisect_right と同じ
https://docs.python.org/ja/3/library/bisect.html
:param callable fn:
:param x:
:param int lo: 最小値
:param int hi: 最大値 + 1
:return: lo <= ret <= hi
"""
while lo < hi:
mid = (lo + hi) // 2
if x < fn(mid):
hi = mid
else:
lo = mid + 1
return lo
N, X = list(map(int, sys.stdin.readline().split()))
B, L, U = list(zip(*[map(int, sys.stdin.readline().split()) for _ in range(N)]))
B = np.array(B, dtype=int)
L = np.array(L, dtype=int)
U = np.array(U, dtype=int)
# 全部 L で B 点とると仮定する
target = (B * L).sum()
# こうすれば target と比較できる
scores = B * L + (X - B) * U
scores_i = scores.argsort()
scores = scores[scores_i]
scores_cumsum = np.concatenate((scores[::-1].cumsum()[::-1], [0]))
B = B[scores_i]
L = L[scores_i]
U = U[scores_i]
def get_max_score(x):
# x 点とったときの最大のスコア
# 満点の数
perfects = x // X
# 途中まで頑張るやつは何点取ればいいか
half_x = x % X
border = N - perfects
ret = []
if len(B[:border]) > 0:
# 途中まで頑張るやつを 0 点エリアから選択
ret.append(
max(
scores_cumsum[border]
+ np.minimum(half_x, B[:border]) * L[:border]
+ np.maximum(0, half_x - B[:border]) * U[:border]
)
)
if len(B[border:]) > 0:
# 途中まで頑張るやつを満点エリアから選択
ret.append(
max(
scores_cumsum[border - 1]
- scores[border:]
+ np.minimum(half_x, B[border:]) * L[border:]
+ np.maximum(0, half_x - B[border:]) * U[border:]
)
)
return max(0, *ret)
ans = bisect_right_callable(get_max_score, target - 1, 0, B.sum())
print(ans)
| replace | 61 | 72 | 61 | 83 | TLE | |
p03019 | C++ | Runtime Error | #include <bits/stdc++.h>
#define WHOLE(v) (v).begin(), (v).end()
#define REV_WHOLE(v) (v).rbegin(), (v).rend()
using i64 = int64_t;
using namespace std;
template <class F> auto recursive(F f) {
return [f](auto... a) { return f(f, a...); };
}
template <class T>
using rev_priority_queue = priority_queue<T, vector<T>, greater<T>>;
template <class T> using vector2d = vector<vector<T>>;
struct fixprec {
int p;
fixprec(int p) : p(p) {}
};
ostream &operator<<(ostream &o, fixprec f) {
return o << fixed << setprecision(f.p);
}
/*!* [binsearch] *!*/
/*+* 二分探索 *+*/
// judge を満たすような(l,r]内の下限を求める
// l:[X] 定義域の下限
// r:[X] 定義域の上限
// judge:[F = X -> bool] 値 X を評価する関数
// lower:[bool] false にすると代わりに[l,r)内の上限を求める
// eps:[X] 終了距離
template <typename X, typename F>
X BinSearch(X l, X r, F judge, bool lower = true, X eps = 1) {
while (r - l > eps) {
X m = (r + l) / 2;
if (judge(m) == lower) {
r = m;
} else {
l = m;
}
}
return lower ? r : l;
}
struct Data {
i64 b, l, u;
bool operator<(const Data &x) const { return true; }
};
int main() {
const i64 INF = 1e14;
i64 N, X;
cin >> N >> X;
vector<pair<i64, Data>> data(N);
i64 S_N = 0;
for (int i = 0; i < N; i++) {
i64 b, l, u;
cin >> b >> l >> u;
data[i] = {u * (X - b) + l * b, {b, l, u}};
S_N += l * b;
}
// O(N log N)
sort(REV_WHOLE(data));
vector<i64> S(N);
for (int i = 0; i < N; i++) {
S[i] = data[i].first + (i ? S[i - 1] : 0);
}
// O(N log NX)
i64 ans = BinSearch<i64>(-1, N * X, [&](i64 A) -> bool {
// O(N)
// (sum of a_i) <= A ?
i64 m = A / X;
i64 r = A - m * X;
for (int j = 0; j < N; j++) {
i64 e = 0;
i64 x;
Data d;
tie(x, d) = data[j];
e += max(d.l * (r - d.b), d.u * (r - d.b)) + d.l * d.b;
if (m > 0) {
e += j < m ? S[m] - x : S[m - 1];
}
e -= S_N;
if (e >= 0)
return true;
}
return false;
});
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define WHOLE(v) (v).begin(), (v).end()
#define REV_WHOLE(v) (v).rbegin(), (v).rend()
using i64 = int64_t;
using namespace std;
template <class F> auto recursive(F f) {
return [f](auto... a) { return f(f, a...); };
}
template <class T>
using rev_priority_queue = priority_queue<T, vector<T>, greater<T>>;
template <class T> using vector2d = vector<vector<T>>;
struct fixprec {
int p;
fixprec(int p) : p(p) {}
};
ostream &operator<<(ostream &o, fixprec f) {
return o << fixed << setprecision(f.p);
}
/*!* [binsearch] *!*/
/*+* 二分探索 *+*/
// judge を満たすような(l,r]内の下限を求める
// l:[X] 定義域の下限
// r:[X] 定義域の上限
// judge:[F = X -> bool] 値 X を評価する関数
// lower:[bool] false にすると代わりに[l,r)内の上限を求める
// eps:[X] 終了距離
template <typename X, typename F>
X BinSearch(X l, X r, F judge, bool lower = true, X eps = 1) {
while (r - l > eps) {
X m = (r + l) / 2;
if (judge(m) == lower) {
r = m;
} else {
l = m;
}
}
return lower ? r : l;
}
struct Data {
i64 b, l, u;
bool operator<(const Data &x) const {
return make_tuple(b, l, u) < make_tuple(x.b, x.l, x.u);
}
};
int main() {
const i64 INF = 1e14;
i64 N, X;
cin >> N >> X;
vector<pair<i64, Data>> data(N);
i64 S_N = 0;
for (int i = 0; i < N; i++) {
i64 b, l, u;
cin >> b >> l >> u;
data[i] = {u * (X - b) + l * b, {b, l, u}};
S_N += l * b;
}
// O(N log N)
sort(REV_WHOLE(data));
vector<i64> S(N);
for (int i = 0; i < N; i++) {
S[i] = data[i].first + (i ? S[i - 1] : 0);
}
// O(N log NX)
i64 ans = BinSearch<i64>(-1, N * X, [&](i64 A) -> bool {
// O(N)
// (sum of a_i) <= A ?
i64 m = A / X;
i64 r = A - m * X;
for (int j = 0; j < N; j++) {
i64 e = 0;
i64 x;
Data d;
tie(x, d) = data[j];
e += max(d.l * (r - d.b), d.u * (r - d.b)) + d.l * d.b;
if (m > 0) {
e += j < m ? S[m] - x : S[m - 1];
}
e -= S_N;
if (e >= 0)
return true;
}
return false;
});
cout << ans << endl;
return 0;
} | replace | 43 | 44 | 43 | 46 | 0 | |
p03019 | C++ | Runtime Error | // High above the clouds there is a rainbow...
#include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
#define sz(s) int((s).size())
#define bit(n, k) (((n) >> (k)) & 1)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int maxn = 2010, mod = 1e9 + 7;
const ll inf = 1e18;
pair<int, pii> p[maxn];
ll sm[maxn];
ll f(pair<int, pii> p, int x) {
if (x <= p.F)
return 1ll * x * p.S.F;
return 1ll * p.F * p.S.F + 1ll * (x - p.F) * p.S.S;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, x;
cin >> n >> x;
ll SM = 0;
for (int i = 0; i < n; i++) {
cin >> p[i].F >> p[i].S.F >> p[i].S.S;
SM += 1ll * p[i].S.F * p[i].F;
}
sort(p, p + n,
[&](pair<int, pii> a, pair<int, pii> b) { return f(a, x) > f(b, x); });
for (int i = 1; i <= n; i++) {
sm[i] = sm[i - 1] + f(p[i - 1], x);
}
ll l = -1, r = 1ll * n * x;
while (r - l > 1) {
ll mid = (l + r) >> 1;
ll num = 0;
int cnt = mid / x, rem = mid % x;
for (int i = 0; i < cnt; i++) {
num = max(num, sm[cnt + 1] - f(p[i], x) + f(p[i], rem));
}
for (int i = cnt; i < n; i++) {
num = max(num, sm[cnt] + f(p[i], rem));
}
if (num >= SM)
r = mid;
else
l = mid;
}
return cout << r << endl, 0;
}
// Deathly mistakes:
// * Read the problem curfully.
// * Check maxn.
// * Overflows.
| // High above the clouds there is a rainbow...
#include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
#define sz(s) int((s).size())
#define bit(n, k) (((n) >> (k)) & 1)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int maxn = 1e5 + 10, mod = 1e9 + 7;
const ll inf = 1e18;
pair<int, pii> p[maxn];
ll sm[maxn];
ll f(pair<int, pii> p, int x) {
if (x <= p.F)
return 1ll * x * p.S.F;
return 1ll * p.F * p.S.F + 1ll * (x - p.F) * p.S.S;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, x;
cin >> n >> x;
ll SM = 0;
for (int i = 0; i < n; i++) {
cin >> p[i].F >> p[i].S.F >> p[i].S.S;
SM += 1ll * p[i].S.F * p[i].F;
}
sort(p, p + n,
[&](pair<int, pii> a, pair<int, pii> b) { return f(a, x) > f(b, x); });
for (int i = 1; i <= n; i++) {
sm[i] = sm[i - 1] + f(p[i - 1], x);
}
ll l = -1, r = 1ll * n * x;
while (r - l > 1) {
ll mid = (l + r) >> 1;
ll num = 0;
int cnt = mid / x, rem = mid % x;
for (int i = 0; i < cnt; i++) {
num = max(num, sm[cnt + 1] - f(p[i], x) + f(p[i], rem));
}
for (int i = cnt; i < n; i++) {
num = max(num, sm[cnt] + f(p[i], rem));
}
if (num >= SM)
r = mid;
else
l = mid;
}
return cout << r << endl, 0;
}
// Deathly mistakes:
// * Read the problem curfully.
// * Check maxn.
// * Overflows.
| replace | 16 | 17 | 16 | 17 | 0 | |
p03019 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
using ld = long double;
int main() {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n, x;
cin >> n >> x;
vector<ll> b(n), l(n), r(n);
ll res = 0;
vector<pair<ll, ll>> a(n);
rep(i, n) {
cin >> b[i] >> l[i] >> r[i];
res += b[i] * l[i];
a[i].first = (x - b[i]) * r[i] + b[i] * l[i];
a[i].second = i;
}
if (res == 0) {
cout << 0;
return 0;
}
sort(rall(a));
vector<ll> ps(n + 1);
rep(i, n) ps[i + 1] = ps[i] + a[i].first;
int mc = 0;
while (ps[mc] <= res)
mc++;
ll ans = mc * x;
rep(i, n) {
int j = a[i].second;
ll cs = (mc - 1 <= i ? ps[mc - 1] : ps[mc] - a[i].first);
if (cs + b[j] * l[j] >= res)
ans = min(ans, (res - cs + l[j] - 1) / l[j] + (mc - 1) * x);
else if (cs + b[j] * l[j] + (x - b[j]) * r[j] >= res) {
ans = min(ans, (res - cs - b[j] * l[j] + b[j] * r[j] + r[j] - 1) / r[j] +
(mc - 1) * x);
}
}
cout << ans;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
using ld = long double;
int main() {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(0);
cin.tie(0);
ll n, x;
cin >> n >> x;
vector<ll> b(n), l(n), r(n);
ll res = 0;
vector<pair<ll, ll>> a(n);
rep(i, n) {
cin >> b[i] >> l[i] >> r[i];
res += b[i] * l[i];
a[i].first = (x - b[i]) * r[i] + b[i] * l[i];
a[i].second = i;
}
if (res == 0) {
cout << 0;
return 0;
}
sort(rall(a));
vector<ll> ps(n + 1);
rep(i, n) ps[i + 1] = ps[i] + a[i].first;
int mc = 0;
while (ps[mc] < res)
mc++;
ll ans = mc * x;
rep(i, n) {
int j = a[i].second;
ll cs = (mc - 1 <= i ? ps[mc - 1] : ps[mc] - a[i].first);
if (cs + b[j] * l[j] >= res)
ans = min(ans, (res - cs + l[j] - 1) / l[j] + (mc - 1) * x);
else if (cs + b[j] * l[j] + (x - b[j]) * r[j] >= res) {
ans = min(ans, (res - cs - b[j] * l[j] + b[j] * r[j] + r[j] - 1) / r[j] +
(mc - 1) * x);
}
}
cout << ans;
} | replace | 51 | 52 | 51 | 52 | 0 | |
p03019 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
#define int long long
#define inf 1000000007
#define pa pair<int, int>
#define ll long long
#define pal pair<double, double>
#define ppap pair<pa, int>
#define PI 3.14159265358979323846
#define paa pair<int, char>
#define mp make_pair
#define pb push_back
#define EPS (1e-10)
int dx[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int dy[8] = {1, 0, -1, 0, -1, 1, 1, -1};
using namespace std;
class pa3 {
public:
int x;
int y, z;
pa3(int x = 0, int y = 0, int z = 0) : x(x), y(y), z(z) {}
bool operator<(const pa3 &p) const {
if (x != p.x)
return x < p.x;
if (y != p.y)
return y < p.y;
return z < p.z;
// return x != p.x ? x<p.x: y<p.y;
}
bool operator>(const pa3 &p) const {
if (x != p.x)
return x > p.x;
if (y != p.y)
return y > p.y;
return z > p.z;
// return x != p.x ? x<p.x: y<p.y;
}
bool operator==(const pa3 &p) const {
return x == p.x && y == p.y && z == p.z;
}
bool operator!=(const pa3 &p) const {
return !(x == p.x && y == p.y && z == p.z);
}
};
class pa4 {
public:
int x;
int y, z, w;
pa4(int x = 0, int y = 0, int z = 0, int w = 0) : x(x), y(y), z(z), w(w) {}
bool operator<(const pa4 &p) const {
if (x != p.x)
return x < p.x;
if (y != p.y)
return y < p.y;
if (z != p.z)
return z < p.z;
return w < p.w;
// return x != p.x ? x<p.x: y<p.y;
}
bool operator>(const pa4 &p) const {
if (x != p.x)
return x > p.x;
if (y != p.y)
return y > p.y;
if (z != p.z)
return z > p.z;
return w > p.w;
// return x != p.x ? x<p.x: y<p.y;
}
bool operator==(const pa4 &p) const {
return x == p.x && y == p.y && z == p.z && w == p.w;
}
};
class pa2 {
public:
int x, y;
pa2(int x = 0, int y = 0) : x(x), y(y) {}
pa2 operator+(pa2 p) { return pa2(x + p.x, y + p.y); }
pa2 operator-(pa2 p) { return pa2(x - p.x, y - p.y); }
bool operator<(const pa2 &p) const { return y != p.y ? y < p.y : x < p.x; }
bool operator>(const pa2 &p) const { return x != p.x ? x < p.x : y < p.y; }
bool operator==(const pa2 &p) const {
return abs(x - p.x) == 0 && abs(y - p.y) == 0;
}
bool operator!=(const pa2 &p) const {
return !(abs(x - p.x) == 0 && abs(y - p.y) == 0);
}
};
string itos(int i) {
ostringstream s;
s << i;
return s.str();
}
int gcd(int v, int b) {
if (v > b)
return gcd(b, v);
if (v == b)
return b;
if (b % v == 0)
return v;
return gcd(v, b % v);
}
int mod;
int extgcd(int a, int b, int &x, int &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
int d = extgcd(b, a % b, y, x);
y -= a / b * x;
return d;
}
pa operator+(const pa &l, const pa &r) {
return {l.first + r.first, l.second + r.second};
}
pa operator-(const pa &l, const pa &r) {
return {l.first - r.first, l.second - r.second};
}
int pr[1200010];
int inv[1200010];
int beki(int wa, int rr, int warukazu) {
if (rr == 0)
return 1 % warukazu;
if (rr == 1)
return wa % warukazu;
wa %= warukazu;
if (rr % 2 == 1)
return ((ll)beki(wa, rr - 1, warukazu) * (ll)wa) % warukazu;
ll zx = beki(wa, rr / 2, warukazu);
return (zx * zx) % warukazu;
}
int comb(int nn, int rr) {
if (rr < 0 || rr > nn || nn < 0)
return 0;
int r = pr[nn] * inv[rr];
r %= mod;
r *= inv[nn - rr];
r %= mod;
return r;
}
void gya(int ert) {
pr[0] = 1;
for (int i = 1; i <= ert; i++) {
pr[i] = (pr[i - 1] * i) % mod;
}
inv[ert] = beki(pr[ert], mod - 2, mod);
for (int i = ert - 1; i >= 0; i--) {
inv[i] = inv[i + 1] * (i + 1) % mod;
}
}
// cin.tie(0);
// ios::sync_with_stdio(false);
// priority_queue<pa3,vector<pa3>,greater<pa3>> pq;
// sort(ve.begin(),ve.end(),greater<int>());
// mt19937(clock_per_sec);
// mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()) ;
//----------------kokomade tenpure------------
int p[100020], q[100020];
int l[100020], r[100020];
int n, X;
int b[100020];
bool hikaku(pa3 x, pa3 y) {
return x.z * (X - x.x) + x.y * x.x >= y.z * (X - y.x) + y.y * y.x;
}
bool ch(int d) {
if (d == 0)
return 0;
if (d == n * X)
return 1;
int wa = 0;
if (d % X == 0) {
for (int i = 0; i < d / X; i++) {
wa += p[i];
}
for (int i = d / X; i < n; i++) {
wa += q[i];
}
return wa >= 0;
}
int defo = 0;
int pp = d / X;
int qq = n - 1 - pp;
for (int i = 0; i <= pp; i++)
defo += p[i];
for (int i = n - 1; i >= n - (qq + 1); i--)
defo += q[i];
int sa = d % X;
for (int i = 0; i < n; i++) {
int wa = 0;
if (sa > b[i])
wa = r[i] * (sa - b[i]);
else
wa = l[i] * (sa - b[i]);
wa += defo;
if (i <= pp) {
wa -= p[i];
wa -= q[pp];
} else {
wa -= p[pp];
wa -= q[i];
}
if (wa >= 0)
return 1;
}
return 0;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> X;
vector<pa3> ve;
for (int i = 0; i < n; i++) {
int y, yy, yyy;
cin >> y >> yy >> yyy;
ve.pb({y, yy, yyy});
}
sort(ve.begin(), ve.end(), hikaku);
int bwa = 0;
for (int i = 0; i < n; i++) {
b[i] = ve[i].x;
l[i] = ve[i].y;
r[i] = ve[i].z;
p[i] = r[i] * (X - b[i]);
q[i] = -l[i] * b[i];
bwa += b[i];
}
if (bwa == 0) {
cout << 0 << endl;
return 0;
}
if (bwa == n * X) {
cout << n * X << endl;
return 0;
}
int sita = 0, ue = n * X, me;
while (ue - sita > 1) {
me = (ue + sita) / 2;
if (ch(me)) {
ue = me;
} else
sita = me;
}
cout << ue << endl;
return 0;
}
| #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
#define int long long
#define inf 1000000007
#define pa pair<int, int>
#define ll long long
#define pal pair<double, double>
#define ppap pair<pa, int>
#define PI 3.14159265358979323846
#define paa pair<int, char>
#define mp make_pair
#define pb push_back
#define EPS (1e-10)
int dx[8] = {0, 1, 0, -1, 1, 1, -1, -1};
int dy[8] = {1, 0, -1, 0, -1, 1, 1, -1};
using namespace std;
class pa3 {
public:
int x;
int y, z;
pa3(int x = 0, int y = 0, int z = 0) : x(x), y(y), z(z) {}
bool operator<(const pa3 &p) const {
if (x != p.x)
return x < p.x;
if (y != p.y)
return y < p.y;
return z < p.z;
// return x != p.x ? x<p.x: y<p.y;
}
bool operator>(const pa3 &p) const {
if (x != p.x)
return x > p.x;
if (y != p.y)
return y > p.y;
return z > p.z;
// return x != p.x ? x<p.x: y<p.y;
}
bool operator==(const pa3 &p) const {
return x == p.x && y == p.y && z == p.z;
}
bool operator!=(const pa3 &p) const {
return !(x == p.x && y == p.y && z == p.z);
}
};
class pa4 {
public:
int x;
int y, z, w;
pa4(int x = 0, int y = 0, int z = 0, int w = 0) : x(x), y(y), z(z), w(w) {}
bool operator<(const pa4 &p) const {
if (x != p.x)
return x < p.x;
if (y != p.y)
return y < p.y;
if (z != p.z)
return z < p.z;
return w < p.w;
// return x != p.x ? x<p.x: y<p.y;
}
bool operator>(const pa4 &p) const {
if (x != p.x)
return x > p.x;
if (y != p.y)
return y > p.y;
if (z != p.z)
return z > p.z;
return w > p.w;
// return x != p.x ? x<p.x: y<p.y;
}
bool operator==(const pa4 &p) const {
return x == p.x && y == p.y && z == p.z && w == p.w;
}
};
class pa2 {
public:
int x, y;
pa2(int x = 0, int y = 0) : x(x), y(y) {}
pa2 operator+(pa2 p) { return pa2(x + p.x, y + p.y); }
pa2 operator-(pa2 p) { return pa2(x - p.x, y - p.y); }
bool operator<(const pa2 &p) const { return y != p.y ? y < p.y : x < p.x; }
bool operator>(const pa2 &p) const { return x != p.x ? x < p.x : y < p.y; }
bool operator==(const pa2 &p) const {
return abs(x - p.x) == 0 && abs(y - p.y) == 0;
}
bool operator!=(const pa2 &p) const {
return !(abs(x - p.x) == 0 && abs(y - p.y) == 0);
}
};
string itos(int i) {
ostringstream s;
s << i;
return s.str();
}
int gcd(int v, int b) {
if (v > b)
return gcd(b, v);
if (v == b)
return b;
if (b % v == 0)
return v;
return gcd(v, b % v);
}
int mod;
int extgcd(int a, int b, int &x, int &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
int d = extgcd(b, a % b, y, x);
y -= a / b * x;
return d;
}
pa operator+(const pa &l, const pa &r) {
return {l.first + r.first, l.second + r.second};
}
pa operator-(const pa &l, const pa &r) {
return {l.first - r.first, l.second - r.second};
}
int pr[1200010];
int inv[1200010];
int beki(int wa, int rr, int warukazu) {
if (rr == 0)
return 1 % warukazu;
if (rr == 1)
return wa % warukazu;
wa %= warukazu;
if (rr % 2 == 1)
return ((ll)beki(wa, rr - 1, warukazu) * (ll)wa) % warukazu;
ll zx = beki(wa, rr / 2, warukazu);
return (zx * zx) % warukazu;
}
int comb(int nn, int rr) {
if (rr < 0 || rr > nn || nn < 0)
return 0;
int r = pr[nn] * inv[rr];
r %= mod;
r *= inv[nn - rr];
r %= mod;
return r;
}
void gya(int ert) {
pr[0] = 1;
for (int i = 1; i <= ert; i++) {
pr[i] = (pr[i - 1] * i) % mod;
}
inv[ert] = beki(pr[ert], mod - 2, mod);
for (int i = ert - 1; i >= 0; i--) {
inv[i] = inv[i + 1] * (i + 1) % mod;
}
}
// cin.tie(0);
// ios::sync_with_stdio(false);
// priority_queue<pa3,vector<pa3>,greater<pa3>> pq;
// sort(ve.begin(),ve.end(),greater<int>());
// mt19937(clock_per_sec);
// mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()) ;
//----------------kokomade tenpure------------
int p[100020], q[100020];
int l[100020], r[100020];
int n, X;
int b[100020];
bool hikaku(pa3 x, pa3 y) {
return x.z * (X - x.x) + x.y * x.x > y.z * (X - y.x) + y.y * y.x;
}
bool ch(int d) {
if (d == 0)
return 0;
if (d == n * X)
return 1;
int wa = 0;
if (d % X == 0) {
for (int i = 0; i < d / X; i++) {
wa += p[i];
}
for (int i = d / X; i < n; i++) {
wa += q[i];
}
return wa >= 0;
}
int defo = 0;
int pp = d / X;
int qq = n - 1 - pp;
for (int i = 0; i <= pp; i++)
defo += p[i];
for (int i = n - 1; i >= n - (qq + 1); i--)
defo += q[i];
int sa = d % X;
for (int i = 0; i < n; i++) {
int wa = 0;
if (sa > b[i])
wa = r[i] * (sa - b[i]);
else
wa = l[i] * (sa - b[i]);
wa += defo;
if (i <= pp) {
wa -= p[i];
wa -= q[pp];
} else {
wa -= p[pp];
wa -= q[i];
}
if (wa >= 0)
return 1;
}
return 0;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> X;
vector<pa3> ve;
for (int i = 0; i < n; i++) {
int y, yy, yyy;
cin >> y >> yy >> yyy;
ve.pb({y, yy, yyy});
}
sort(ve.begin(), ve.end(), hikaku);
int bwa = 0;
for (int i = 0; i < n; i++) {
b[i] = ve[i].x;
l[i] = ve[i].y;
r[i] = ve[i].z;
p[i] = r[i] * (X - b[i]);
q[i] = -l[i] * b[i];
bwa += b[i];
}
if (bwa == 0) {
cout << 0 << endl;
return 0;
}
if (bwa == n * X) {
cout << n * X << endl;
return 0;
}
int sita = 0, ue = n * X, me;
while (ue - sita > 1) {
me = (ue + sita) / 2;
if (ch(me)) {
ue = me;
} else
sita = me;
}
cout << ue << endl;
return 0;
}
| replace | 177 | 178 | 177 | 178 | 0 | |
p03019 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define LOCAL
using std::to_string;
auto to_string(std::string s) -> std::string { return '"' + s + '"'; }
auto to_string(char c) -> std::string { return "'" + std::string{c} + "'"; }
auto to_string(const char *s) -> std::string {
return to_string((std::string)s);
}
auto to_string(bool b) -> std::string { return (b ? "true" : "false"); }
template <typename T, typename U>
auto to_string(std::pair<T, U> p) -> std::string {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <size_t N> auto to_string(std::bitset<N> bs) -> std::string {
std::string res{};
for (size_t i = 0; i < N; i++)
res.insert(res.begin(), bs.test(i) ? '1' : '0');
return res;
}
template <typename T> auto to_string(T v) -> std::string {
bool flg = false;
std::string res = "{";
for (auto const &x : v) {
if (flg)
res += ", ";
else
flg = true;
res += to_string(x);
}
res += "}";
return res;
}
void debug_out() { std::cerr << std::endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
std::cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) \
std::cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
int main() {
std::cin.tie(0);
std::cin.sync_with_stdio(false);
size_t n;
long long X;
std::cin >> n >> X;
std::vector<long long> b(n), l(n), u(n), full(n);
for (size_t i = 0; i < n; i++) {
std::cin >> b.at(i) >> l.at(i) >> u.at(i);
full.at(i) = b.at(i) * l.at(i) + (X - b.at(i)) * u.at(i);
}
std::vector<size_t> ord(n);
std::iota(ord.begin(), ord.end(), 0);
std::sort(ord.begin(), ord.end(),
[&](auto i, auto j) { return full.at(i) > full.at(j); });
auto cal = [&](size_t i, long long x) {
assert(i < n);
assert(0 <= x && x <= X);
auto j = ord.at(i);
if (x <= b.at(j))
return -(b.at(j) - x) * l.at(j);
else
return (x - b.at(j)) * u.at(j);
};
auto diff = [&](size_t i, long long x, long long y) {
return cal(i, y) - cal(i, x);
};
auto check = [&](long long time) {
if (time > X * (long long)n)
return true;
size_t q = time / X;
long long r = time % X;
assert(q <= n);
assert(0LL <= r && r < X);
long long base = 0;
for (size_t i = 0; i < q; i++) {
base += cal(i, X);
}
for (size_t i = q; i < n; i++) {
base += cal(i, 0);
}
for (size_t i = 0; i < n; i++) {
auto score = base;
if (i < q) {
auto a = diff(i, X, r);
auto b = diff(q, 0, X);
score += a + b;
} else {
auto c = diff(i, 0, r);
score += c;
}
if (score >= 0)
return true;
debug(i, score);
}
return false;
};
long long ok = X * (long long)n, ng = -1, md;
while (abs(ok - ng) > 1) {
md = (ok + ng) >> 1;
if (check(md))
ok = md;
else
ng = md;
}
std::cout << ok << std::endl;
return 0;
} | #include <bits/stdc++.h>
#define LOCAL
using std::to_string;
auto to_string(std::string s) -> std::string { return '"' + s + '"'; }
auto to_string(char c) -> std::string { return "'" + std::string{c} + "'"; }
auto to_string(const char *s) -> std::string {
return to_string((std::string)s);
}
auto to_string(bool b) -> std::string { return (b ? "true" : "false"); }
template <typename T, typename U>
auto to_string(std::pair<T, U> p) -> std::string {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <size_t N> auto to_string(std::bitset<N> bs) -> std::string {
std::string res{};
for (size_t i = 0; i < N; i++)
res.insert(res.begin(), bs.test(i) ? '1' : '0');
return res;
}
template <typename T> auto to_string(T v) -> std::string {
bool flg = false;
std::string res = "{";
for (auto const &x : v) {
if (flg)
res += ", ";
else
flg = true;
res += to_string(x);
}
res += "}";
return res;
}
void debug_out() { std::cerr << std::endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
std::cerr << " " << to_string(H);
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) \
std::cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
int main() {
std::cin.tie(0);
std::cin.sync_with_stdio(false);
size_t n;
long long X;
std::cin >> n >> X;
std::vector<long long> b(n), l(n), u(n), full(n);
for (size_t i = 0; i < n; i++) {
std::cin >> b.at(i) >> l.at(i) >> u.at(i);
full.at(i) = b.at(i) * l.at(i) + (X - b.at(i)) * u.at(i);
}
std::vector<size_t> ord(n);
std::iota(ord.begin(), ord.end(), 0);
std::sort(ord.begin(), ord.end(),
[&](auto i, auto j) { return full.at(i) > full.at(j); });
auto cal = [&](size_t i, long long x) {
assert(i < n);
assert(0 <= x && x <= X);
auto j = ord.at(i);
if (x <= b.at(j))
return -(b.at(j) - x) * l.at(j);
else
return (x - b.at(j)) * u.at(j);
};
auto diff = [&](size_t i, long long x, long long y) {
return cal(i, y) - cal(i, x);
};
auto check = [&](long long time) {
if (time > X * (long long)n)
return true;
size_t q = time / X;
long long r = time % X;
assert(q <= n);
assert(0LL <= r && r < X);
long long base = 0;
for (size_t i = 0; i < q; i++) {
base += cal(i, X);
}
for (size_t i = q; i < n; i++) {
base += cal(i, 0);
}
for (size_t i = 0; i < n; i++) {
auto score = base;
if (i < q) {
auto a = diff(i, X, r);
auto b = diff(q, 0, X);
score += a + b;
} else {
auto c = diff(i, 0, r);
score += c;
}
if (score >= 0)
return true;
}
return false;
};
long long ok = X * (long long)n, ng = -1, md;
while (abs(ok - ng) > 1) {
md = (ok + ng) >> 1;
if (check(md))
ok = md;
else
ng = md;
}
std::cout << ok << std::endl;
return 0;
} | delete | 96 | 97 | 96 | 96 | TLE | |
p03019 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 1000000010
#define N 100010
#define int long long
char getc() {
char c = getchar();
while ((c < 'A' || c > 'Z') && (c < 'a' || c > 'z') && (c < '0' || c > '9'))
c = getchar();
return c;
}
int gcd(int n, int m) { return m == 0 ? n : gcd(m, n % m); }
int read() {
int x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9')
x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
return x * f;
}
int n, m, pos;
ll ans, s[N], tot;
struct data {
int x, l, r;
bool operator<(const data &a) const {
return 1ll * (m - x) * r + 1ll * x * l >
1ll * (m - a.x) * a.r + 1ll * a.x * a.l;
}
} a[N];
ll mxval(int i) { return 1ll * (m - a[i].x) * a[i].r; }
ll val(int i, int k) {
if (k < a[i].x)
return 1ll * (k - a[i].x) * a[i].l;
else
return 1ll * (k - a[i].x) * a[i].r;
}
bool check(int k, ll tot) {
for (int i = 1; i < pos; i++)
if (tot - mxval(i) + val(i, k) >= 0)
return 1;
tot -= mxval(pos);
tot += val(pos, 0);
for (int i = pos; i <= n; i++)
if (tot - val(i, 0) + val(i, k) >= 0)
return 1;
return 0;
}
signed main() {
freopen("c.in", "r", stdin);
freopen("c.out", "w", stdout);
n = read(), m = read();
for (int i = 1; i <= n; i++)
a[i].x = read(), a[i].l = read(), a[i].r = read();
sort(a + 1, a + n + 1);
for (int i = n; i >= 1; i--)
s[i] = s[i + 1] - val(i, 0);
tot = 0;
pos = 0;
for (int i = 1; i <= n; i++) {
tot += mxval(i);
if (tot >= s[i + 1]) {
pos = i;
break;
}
}
if (pos == 0) {
cout << 0;
return 0;
}
tot -= s[pos + 1];
int l = 0, r = m;
while (l <= r) {
int mid = l + r >> 1;
if (check(mid, tot))
ans = mid, r = mid - 1;
else
l = mid + 1;
}
cout << ans + 1ll * (pos - 1) * m;
return 0;
// NOTICE LONG LONG!!!!!
}
// 当权值确定后，显然优先学权值大的
// 一门课学的比对方多就使重要性取max，否则取min
// 既然已经点的比对方多，不如学满
// 该门课学满的收益为(m-x)*r 不学的减益为x*l 总价值为(m-x)*r+x*l
// 按该价值排序依次选完
// 至多只有一门课是不学满(若优则设为r否则设为l)的，其他要么不学(设为l)要么学满（设为r)
// 考虑哪一门不学满 不学满后应二分答案考虑是否可行 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define inf 1000000010
#define N 100010
#define int long long
char getc() {
char c = getchar();
while ((c < 'A' || c > 'Z') && (c < 'a' || c > 'z') && (c < '0' || c > '9'))
c = getchar();
return c;
}
int gcd(int n, int m) { return m == 0 ? n : gcd(m, n % m); }
int read() {
int x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9')
x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
return x * f;
}
int n, m, pos;
ll ans, s[N], tot;
struct data {
int x, l, r;
bool operator<(const data &a) const {
return 1ll * (m - x) * r + 1ll * x * l >
1ll * (m - a.x) * a.r + 1ll * a.x * a.l;
}
} a[N];
ll mxval(int i) { return 1ll * (m - a[i].x) * a[i].r; }
ll val(int i, int k) {
if (k < a[i].x)
return 1ll * (k - a[i].x) * a[i].l;
else
return 1ll * (k - a[i].x) * a[i].r;
}
bool check(int k, ll tot) {
for (int i = 1; i < pos; i++)
if (tot - mxval(i) + val(i, k) >= 0)
return 1;
tot -= mxval(pos);
tot += val(pos, 0);
for (int i = pos; i <= n; i++)
if (tot - val(i, 0) + val(i, k) >= 0)
return 1;
return 0;
}
signed main() {
n = read(), m = read();
for (int i = 1; i <= n; i++)
a[i].x = read(), a[i].l = read(), a[i].r = read();
sort(a + 1, a + n + 1);
for (int i = n; i >= 1; i--)
s[i] = s[i + 1] - val(i, 0);
tot = 0;
pos = 0;
for (int i = 1; i <= n; i++) {
tot += mxval(i);
if (tot >= s[i + 1]) {
pos = i;
break;
}
}
if (pos == 0) {
cout << 0;
return 0;
}
tot -= s[pos + 1];
int l = 0, r = m;
while (l <= r) {
int mid = l + r >> 1;
if (check(mid, tot))
ans = mid, r = mid - 1;
else
l = mid + 1;
}
cout << ans + 1ll * (pos - 1) * m;
return 0;
// NOTICE LONG LONG!!!!!
}
// 当权值确定后，显然优先学权值大的
// 一门课学的比对方多就使重要性取max，否则取min
// 既然已经点的比对方多，不如学满
// 该门课学满的收益为(m-x)*r 不学的减益为x*l 总价值为(m-x)*r+x*l
// 按该价值排序依次选完
// 至多只有一门课是不学满(若优则设为r否则设为l)的，其他要么不学(设为l)要么学满（设为r)
// 考虑哪一门不学满 不学满后应二分答案考虑是否可行 | delete | 53 | 55 | 53 | 53 | TLE | |
p03019 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long lli;
typedef pair<int, int> pii;
const int maxn = 1e5 + 5;
int n, X;
int b[maxn], l[maxn], u[maxn];
lli empt[maxn], full[maxn], delta[maxn];
int order[maxn];
bool cmp(int i, int j) { return delta[i] > delta[j]; }
void ReadInput() {
cin >> n >> X;
for (int i = 0; i < n; ++i) {
cin >> b[i] >> l[i] >> u[i];
empt[i] = -1LL * b[i] * l[i];
full[i] = 1LL * (X - b[i]) * u[i];
delta[i] = full[i] - empt[i];
}
for (int i = 0; i < n; ++i)
order[i] = i;
sort(order, order + n, cmp);
}
lli score(int i, lli k) {
if (k >= b[i])
return 1LL * b[i] * l[i] + (k - b[i]) * u[i];
return k * l[i];
}
bool Check(lli k) {
int q = k / X, r = k % X;
lli tot = 0;
for (int i = 0; i < n; ++i)
tot += empt[i];
for (int i = 0; i < q; ++i)
tot += delta[order[i]];
for (int i = 0; i < n; ++i) {
lli ntot = tot;
if (i >= q)
ntot += score(order[i], r);
else {
ntot -= delta[order[i]];
ntot += delta[order[q]];
ntot += score(order[i], r);
}
if (ntot >= 0)
return true;
}
return false;
}
void Solve() {
lli low = 0, high = 1LL * X * n;
while (low <= high) {
int mid = (low + high) / 2;
if (Check(mid))
high = mid - 1;
else
low = mid + 1;
}
cout << low << '\n';
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
ReadInput();
Solve();
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long lli;
typedef pair<int, int> pii;
const int maxn = 1e5 + 5;
int n, X;
int b[maxn], l[maxn], u[maxn];
lli empt[maxn], full[maxn], delta[maxn];
int order[maxn];
bool cmp(int i, int j) { return delta[i] > delta[j]; }
void ReadInput() {
cin >> n >> X;
for (int i = 0; i < n; ++i) {
cin >> b[i] >> l[i] >> u[i];
empt[i] = -1LL * b[i] * l[i];
full[i] = 1LL * (X - b[i]) * u[i];
delta[i] = full[i] - empt[i];
}
for (int i = 0; i < n; ++i)
order[i] = i;
sort(order, order + n, cmp);
}
lli score(int i, lli k) {
if (k >= b[i])
return 1LL * b[i] * l[i] + (k - b[i]) * u[i];
return k * l[i];
}
bool Check(lli k) {
int q = k / X, r = k % X;
lli tot = 0;
for (int i = 0; i < n; ++i)
tot += empt[i];
for (int i = 0; i < q; ++i)
tot += delta[order[i]];
for (int i = 0; i < n; ++i) {
lli ntot = tot;
if (i >= q)
ntot += score(order[i], r);
else {
ntot -= delta[order[i]];
ntot += delta[order[q]];
ntot += score(order[i], r);
}
if (ntot >= 0)
return true;
}
return false;
}
void Solve() {
lli low = 0, high = 1LL * X * n;
while (low <= high) {
lli mid = (low + high) / 2;
if (Check(mid))
high = mid - 1;
else
low = mid + 1;
}
cout << low << '\n';
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
ReadInput();
Solve();
}
| replace | 65 | 66 | 65 | 66 | TLE | |
p03019 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, x;
int b[111111], l[111111], u[111111];
long long m;
struct P {
long long x, y;
};
P o[111111];
bool as(P a, P b) { return a.x > b.x; }
bool f(int a) {
long long t = 0, t2 = 0;
for (int t = 1; t <= n; t++)
o[t] = {(long long)(x - b[t]) * u[t] + (long long)b[t] * l[t], t};
sort(o + 1, o + n + 1, as);
for (int i = 1; i <= a / x + 1; i++) {
if (i < a / x + 1)
t += o[i].x;
t2 += o[i].x;
}
if (t + m >= 0)
return 1;
for (int i = 1; i <= a / x + 1; i++) {
long long z = t2 - o[i].x +
max((long long)(a % x - b[o[i].y]) * l[o[i].y],
(long long)(a % x - b[o[i].y]) * u[o[i].y]) +
(long long)b[o[i].y] * l[o[i].y];
if (z + m >= 0)
return 1;
}
for (int i = a / x + 2; i <= n; i++) {
long long z = t +
max((long long)(a % x - b[o[i].y]) * l[o[i].y],
(long long)(a % x - b[o[i].y]) * u[o[i].y]) +
(long long)b[o[i].y] * l[o[i].y];
if (z + m >= 0)
return 1;
}
return 0;
}
int main() {
scanf("%d %d", &n, &x);
for (int i = 1; i <= n; i++) {
scanf("%d %d %d", &b[i], &l[i], &u[i]);
m -= (long long)b[i] * l[i];
}
long long a = 0, b = (long long)x * n;
for (; a < b;) {
long long h = (a + b) / 2;
if (f(h))
b = h;
else
a = h + 1;
}
printf("%lld", a);
}
| #include <bits/stdc++.h>
using namespace std;
int n, x;
int b[111111], l[111111], u[111111];
long long m;
struct P {
long long x, y;
};
P o[111111];
bool as(P a, P b) { return a.x > b.x; }
bool f(long long a) {
long long t = 0, t2 = 0;
for (int t = 1; t <= n; t++)
o[t] = {(long long)(x - b[t]) * u[t] + (long long)b[t] * l[t], t};
sort(o + 1, o + n + 1, as);
for (int i = 1; i <= a / x + 1; i++) {
if (i < a / x + 1)
t += o[i].x;
t2 += o[i].x;
}
if (t + m >= 0)
return 1;
for (int i = 1; i <= a / x + 1; i++) {
long long z = t2 - o[i].x +
max((long long)(a % x - b[o[i].y]) * l[o[i].y],
(long long)(a % x - b[o[i].y]) * u[o[i].y]) +
(long long)b[o[i].y] * l[o[i].y];
if (z + m >= 0)
return 1;
}
for (int i = a / x + 2; i <= n; i++) {
long long z = t +
max((long long)(a % x - b[o[i].y]) * l[o[i].y],
(long long)(a % x - b[o[i].y]) * u[o[i].y]) +
(long long)b[o[i].y] * l[o[i].y];
if (z + m >= 0)
return 1;
}
return 0;
}
int main() {
scanf("%d %d", &n, &x);
for (int i = 1; i <= n; i++) {
scanf("%d %d %d", &b[i], &l[i], &u[i]);
m -= (long long)b[i] * l[i];
}
long long a = 0, b = (long long)x * n;
for (; a < b;) {
long long h = (a + b) / 2;
if (f(h))
b = h;
else
a = h + 1;
}
printf("%lld", a);
}
| replace | 13 | 14 | 13 | 14 | 0 | |
p03020 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
using namespace std;
int read() {
int x = 0;
bool f = 0;
char c = getchar();
while (c < '0' || c > '9')
f |= c == '-', c = getchar();
while (c >= '0' && c <= '9')
x = x * 10 + (c ^ 48), c = getchar();
return f ? -x : x;
}
#define MAXN 2010
#define MAXM 10000
#define INF 1ll << 60
#define LL long long
struct Edge {
LL w, c;
int v, Next;
} E[MAXM + 5];
int Adj[MAXN + 5], ecnt;
void AddEdge(int u, int v, LL Cap, LL Cost) {
E[ecnt].v = v, E[ecnt].w = Cap, E[ecnt].c = Cost, E[ecnt].Next = Adj[u],
Adj[u] = ecnt++;
E[ecnt].v = u, E[ecnt].w = 0, E[ecnt].c = -Cost, E[ecnt].Next = Adj[v],
Adj[v] = ecnt++;
}
int pre[MAXN + 5];
LL Dist[MAXN + 5];
bool vis[MAXN + 5];
int cnt[MAXN + 5];
bool SPFA(int S, int T, int N, LL &Flow, LL &Cost) {
for (int i = 0; i <= N; i++)
Dist[i] = INF, pre[i] = -1, vis[i] = 0, cnt[i] = 0;
queue<int> Q;
Q.push(S);
Dist[S] = 0, vis[S] = 1;
while (!Q.empty()) {
int u = Q.front();
Q.pop();
vis[u] = 0;
for (int i = Adj[u]; i != -1; i = E[i].Next) {
int v = E[i].v, c = E[i].c;
if (E[i].w && Dist[v] > Dist[u] + c) {
Dist[v] = Dist[u] + c;
pre[v] = i;
if (!vis[v]) {
++cnt[v];
vis[v] = 1, Q.push(v);
}
}
}
}
if (Dist[T] == INF)
return 0;
LL Min = INF;
for (int i = pre[T]; i != -1; i = pre[E[i ^ 1].v])
Min = min(Min, (LL)E[i].w);
for (int i = pre[T]; i != -1; i = pre[E[i ^ 1].v])
E[i].w -= Min, E[i ^ 1].w += Min, Cost += Min * E[i].c;
Flow += Min;
return 1;
}
pair<LL, LL> Dinic(int S, int T, int N) {
LL Flow = 0, Cost = 0;
while (1)
if (!SPFA(S, T, N, Flow, Cost))
break;
return make_pair(Flow, Cost);
}
#undef MAXN
#undef MAXM
#define MAXM 1000
int N, M, K;
int A[MAXM + 5];
int main() {
N = read();
ecnt = 0;
memset(Adj, -1, sizeof Adj);
for (int i = 1; i <= N; i++) {
int x = read(), y = read(), c = read();
AddEdge(1, i + 1, c, 0);
AddEdge(i + 1, N + 2, INF, x + y);
AddEdge(i + 1, N + 3, INF, -x + y);
AddEdge(i + 1, N + 4, INF, x - y);
AddEdge(i + 1, N + 5, INF, -x - y);
}
for (int i = 1; i <= N; i++) {
int x = read(), y = read(), c = read();
AddEdge(i + 5 + N, 2 * N + 6, c, 0);
AddEdge(N + 2, i + 5 + N, INF, -x - y);
AddEdge(N + 3, i + 5 + N, INF, x - y);
AddEdge(N + 4, i + 5 + N, INF, -x + y);
AddEdge(N + 5, i + 5 + N, INF, x + y);
}
printf("%lld", -Dinic(1, 2 * N + 6, 2 * N + 6).second);
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
using namespace std;
int read() {
int x = 0;
bool f = 0;
char c = getchar();
while (c < '0' || c > '9')
f |= c == '-', c = getchar();
while (c >= '0' && c <= '9')
x = x * 10 + (c ^ 48), c = getchar();
return f ? -x : x;
}
#define MAXN 2010
#define MAXM 50000
#define INF 1ll << 60
#define LL long long
struct Edge {
LL w, c;
int v, Next;
} E[MAXM + 5];
int Adj[MAXN + 5], ecnt;
void AddEdge(int u, int v, LL Cap, LL Cost) {
E[ecnt].v = v, E[ecnt].w = Cap, E[ecnt].c = Cost, E[ecnt].Next = Adj[u],
Adj[u] = ecnt++;
E[ecnt].v = u, E[ecnt].w = 0, E[ecnt].c = -Cost, E[ecnt].Next = Adj[v],
Adj[v] = ecnt++;
}
int pre[MAXN + 5];
LL Dist[MAXN + 5];
bool vis[MAXN + 5];
int cnt[MAXN + 5];
bool SPFA(int S, int T, int N, LL &Flow, LL &Cost) {
for (int i = 0; i <= N; i++)
Dist[i] = INF, pre[i] = -1, vis[i] = 0, cnt[i] = 0;
queue<int> Q;
Q.push(S);
Dist[S] = 0, vis[S] = 1;
while (!Q.empty()) {
int u = Q.front();
Q.pop();
vis[u] = 0;
for (int i = Adj[u]; i != -1; i = E[i].Next) {
int v = E[i].v, c = E[i].c;
if (E[i].w && Dist[v] > Dist[u] + c) {
Dist[v] = Dist[u] + c;
pre[v] = i;
if (!vis[v]) {
++cnt[v];
vis[v] = 1, Q.push(v);
}
}
}
}
if (Dist[T] == INF)
return 0;
LL Min = INF;
for (int i = pre[T]; i != -1; i = pre[E[i ^ 1].v])
Min = min(Min, (LL)E[i].w);
for (int i = pre[T]; i != -1; i = pre[E[i ^ 1].v])
E[i].w -= Min, E[i ^ 1].w += Min, Cost += Min * E[i].c;
Flow += Min;
return 1;
}
pair<LL, LL> Dinic(int S, int T, int N) {
LL Flow = 0, Cost = 0;
while (1)
if (!SPFA(S, T, N, Flow, Cost))
break;
return make_pair(Flow, Cost);
}
#undef MAXN
#undef MAXM
#define MAXM 1000
int N, M, K;
int A[MAXM + 5];
int main() {
N = read();
ecnt = 0;
memset(Adj, -1, sizeof Adj);
for (int i = 1; i <= N; i++) {
int x = read(), y = read(), c = read();
AddEdge(1, i + 1, c, 0);
AddEdge(i + 1, N + 2, INF, x + y);
AddEdge(i + 1, N + 3, INF, -x + y);
AddEdge(i + 1, N + 4, INF, x - y);
AddEdge(i + 1, N + 5, INF, -x - y);
}
for (int i = 1; i <= N; i++) {
int x = read(), y = read(), c = read();
AddEdge(i + 5 + N, 2 * N + 6, c, 0);
AddEdge(N + 2, i + 5 + N, INF, -x - y);
AddEdge(N + 3, i + 5 + N, INF, x - y);
AddEdge(N + 4, i + 5 + N, INF, -x + y);
AddEdge(N + 5, i + 5 + N, INF, x + y);
}
printf("%lld", -Dinic(1, 2 * N + 6, 2 * N + 6).second);
return 0;
}
| replace | 19 | 20 | 19 | 20 | 0 | |
p03020 | C++ | Runtime Error | #include <cassert>
#include <iostream>
#include <queue>
#include <vector>
#define SOURCE 0
#define SINK 1
#define INF 1000000000000000000LL
using namespace std;
long long n;
long long type[] = {2, 3, 4, 5};
struct edge {
long long cost, from, to, revid, flow, cap;
edge(long long fr, long long to, long long flo, long long cost, long long cap,
long long id)
: from(fr), to(to), cost(cost), flow(flo), cap(cap), revid(id) {}
bool operator<(edge *other) { return cost < other->cost; }
};
long long gennode(bool redorblue, long long ind) {
return 6 + redorblue * n + ind;
}
vector<edge *> edgelist;
vector<edge *> adjlist[2001];
long long pot[2001];
long long dist[2001];
edge *par[2001];
priority_queue<pair<long long, edge *>, vector<pair<long long, edge *>>,
greater<pair<long long, edge *>>>
pq;
bool find_aug_path() {
for (long long i = 0; i < 2 * n + 6; i++)
dist[i] = INF;
pq.push(make_pair(0, new edge(SOURCE, SOURCE, 0, 0, 0, 0)));
while (!pq.empty()) {
edge *prioredge = pq.top().second;
long long curdist = pq.top().first;
long long curnode = prioredge->to;
pq.pop();
if (dist[curnode] == INF) {
dist[curnode] = curdist;
par[curnode] = prioredge;
for (long long i = 0; i < adjlist[curnode].size(); i++) {
edge *cur = adjlist[curnode][i];
if (cur->cap - cur->flow > 0) {
assert(curdist + cur->cost + pot[cur->from] - pot[cur->to] >= 0);
pq.push(make_pair(curdist + cur->cost + pot[cur->from] - pot[cur->to],
cur));
}
}
}
}
/*cout << "OBTAINED POTENTIALS: ";
for (long long i = 0; i < 2 * n + 6; i++) {
cout << dist[i] << ' ';
}
cout << '\n';*/
return dist[SINK] != INF;
}
void bellmanford() {
for (long long i = 0; i < 2 * n + 6; i++)
pot[i] = INF;
pot[0] = 0;
for (long long i = 0; i < 2 * n + 5; i++) {
for (long long j = 0; j < edgelist.size(); j++) {
if (edgelist[j]->cap > 0)
pot[edgelist[j]->to] = min(pot[edgelist[j]->to],
pot[edgelist[j]->from] + edgelist[j]->cost);
}
}
/*cout << "POTENTIALS: ";
for (long long i = 0; i < 2 * n + 6; i++) {
cout << pot[i] << " ";
} cout << '\n';*/
}
long long mincostmaxflow() {
bellmanford();
for (long long i = 0; i < 2 * n + 6; i++)
par[i] = NULL;
long long mincost = 0;
long long maxflow = 0;
while (find_aug_path()) {
long long highestflow = INF;
long long v = SINK;
while (v != SOURCE) {
highestflow = min(par[v]->cap - par[v]->flow, highestflow);
v = par[v]->from;
}
v = SINK;
while (v != SOURCE) {
par[v]->flow += highestflow;
edgelist[par[v]->revid]->flow -= highestflow;
v = par[v]->from;
}
maxflow += highestflow;
mincost += highestflow * (pot[SINK] + dist[SINK]);
for (long long i = 0; i < 2 * n + 6; i++) {
pot[i] = min(pot[i] + dist[i], INF);
}
for (long long i = 0; i < 2 * n + 6; i++)
par[i] = NULL;
}
// assert(maxflow == n);
return mincost;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n;
for (long long i = 0; i < n; i++) {
long long x, y, am;
cin >> x >> y >> am;
edge *v =
new edge(SOURCE, gennode(false, i), 0, 0, am, edgelist.size() + 1);
edge *vrev = new edge(gennode(false, i), SOURCE, 0, 0, 0, edgelist.size());
adjlist[gennode(false, i)].push_back(vrev);
adjlist[SOURCE].push_back(v);
edgelist.push_back(v);
edgelist.push_back(vrev);
for (long long j = 0; j < 4; j++) {
edge *totypes = new edge(gennode(false, i), type[j], 0, -(x + y), am,
edgelist.size() + 1);
edge *totypesrev =
new edge(type[j], gennode(false, i), 0, (x + y), 0, edgelist.size());
edgelist.push_back(totypes);
edgelist.push_back(totypesrev);
adjlist[type[j]].push_back(totypesrev);
adjlist[gennode(false, i)].push_back(totypes);
x = -x;
if (j % 2)
y = -y;
}
}
for (long long i = 0; i < n; i++) {
long long x, y, am;
cin >> x >> y >> am;
edge *v = new edge(gennode(true, i), SINK, 0, 0, am, edgelist.size() + 1);
edge *vrev = new edge(SINK, gennode(true, i), 0, 0, 0, edgelist.size());
edgelist.push_back(v);
edgelist.push_back(vrev);
adjlist[gennode(true, i)].push_back(v);
adjlist[SINK].push_back(vrev);
y = -y;
for (long long j = 0; j < 4; j++) {
x = -x;
edge *totypes = new edge(type[j], gennode(true, i), 0, -(x + y), am,
edgelist.size() + 1);
edge *totypesrev =
new edge(gennode(true, i), type[j], 0, x + y, 0, edgelist.size());
edgelist.push_back(totypes);
edgelist.push_back(totypesrev);
adjlist[type[j]].push_back(totypes);
adjlist[gennode(true, i)].push_back(totypesrev);
if (j == 1)
y = -y;
}
}
/*for (long long i = 0; i < 2 * n + 6; i++) {
cout << i << " : ";
for (long long j = 0; j < adjlist[i].size(); j++) {
cout << adjlist[i][j]->from << ' ' << adjlist[i][j]->to << ' '
<< adjlist[i][j]->cost << ' ' << adjlist[i][j]->cap << ' ' <<
adjlist[i][j]->revid << " | ";
}
cout << '\n';
}*/
cout << -mincostmaxflow() << '\n';
} | #include <cassert>
#include <iostream>
#include <queue>
#include <vector>
#define SOURCE 0
#define SINK 1
#define INF 1000000000000000000LL
using namespace std;
long long n;
long long type[] = {2, 3, 4, 5};
struct edge {
long long cost, from, to, revid, flow, cap;
edge(long long fr, long long to, long long flo, long long cost, long long cap,
long long id)
: from(fr), to(to), cost(cost), flow(flo), cap(cap), revid(id) {}
bool operator<(edge *other) { return cost < other->cost; }
};
long long gennode(bool redorblue, long long ind) {
return 6 + redorblue * n + ind;
}
vector<edge *> edgelist;
vector<edge *> adjlist[2050];
long long pot[2050];
long long dist[2050];
edge *par[2050];
priority_queue<pair<long long, edge *>, vector<pair<long long, edge *>>,
greater<pair<long long, edge *>>>
pq;
bool find_aug_path() {
for (long long i = 0; i < 2 * n + 6; i++)
dist[i] = INF;
pq.push(make_pair(0, new edge(SOURCE, SOURCE, 0, 0, 0, 0)));
while (!pq.empty()) {
edge *prioredge = pq.top().second;
long long curdist = pq.top().first;
long long curnode = prioredge->to;
pq.pop();
if (dist[curnode] == INF) {
dist[curnode] = curdist;
par[curnode] = prioredge;
for (long long i = 0; i < adjlist[curnode].size(); i++) {
edge *cur = adjlist[curnode][i];
if (cur->cap - cur->flow > 0) {
assert(curdist + cur->cost + pot[cur->from] - pot[cur->to] >= 0);
pq.push(make_pair(curdist + cur->cost + pot[cur->from] - pot[cur->to],
cur));
}
}
}
}
/*cout << "OBTAINED POTENTIALS: ";
for (long long i = 0; i < 2 * n + 6; i++) {
cout << dist[i] << ' ';
}
cout << '\n';*/
return dist[SINK] != INF;
}
void bellmanford() {
for (long long i = 0; i < 2 * n + 6; i++)
pot[i] = INF;
pot[0] = 0;
for (long long i = 0; i < 2 * n + 5; i++) {
for (long long j = 0; j < edgelist.size(); j++) {
if (edgelist[j]->cap > 0)
pot[edgelist[j]->to] = min(pot[edgelist[j]->to],
pot[edgelist[j]->from] + edgelist[j]->cost);
}
}
/*cout << "POTENTIALS: ";
for (long long i = 0; i < 2 * n + 6; i++) {
cout << pot[i] << " ";
} cout << '\n';*/
}
long long mincostmaxflow() {
bellmanford();
for (long long i = 0; i < 2 * n + 6; i++)
par[i] = NULL;
long long mincost = 0;
long long maxflow = 0;
while (find_aug_path()) {
long long highestflow = INF;
long long v = SINK;
while (v != SOURCE) {
highestflow = min(par[v]->cap - par[v]->flow, highestflow);
v = par[v]->from;
}
v = SINK;
while (v != SOURCE) {
par[v]->flow += highestflow;
edgelist[par[v]->revid]->flow -= highestflow;
v = par[v]->from;
}
maxflow += highestflow;
mincost += highestflow * (pot[SINK] + dist[SINK]);
for (long long i = 0; i < 2 * n + 6; i++) {
pot[i] = min(pot[i] + dist[i], INF);
}
for (long long i = 0; i < 2 * n + 6; i++)
par[i] = NULL;
}
// assert(maxflow == n);
return mincost;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n;
for (long long i = 0; i < n; i++) {
long long x, y, am;
cin >> x >> y >> am;
edge *v =
new edge(SOURCE, gennode(false, i), 0, 0, am, edgelist.size() + 1);
edge *vrev = new edge(gennode(false, i), SOURCE, 0, 0, 0, edgelist.size());
adjlist[gennode(false, i)].push_back(vrev);
adjlist[SOURCE].push_back(v);
edgelist.push_back(v);
edgelist.push_back(vrev);
for (long long j = 0; j < 4; j++) {
edge *totypes = new edge(gennode(false, i), type[j], 0, -(x + y), am,
edgelist.size() + 1);
edge *totypesrev =
new edge(type[j], gennode(false, i), 0, (x + y), 0, edgelist.size());
edgelist.push_back(totypes);
edgelist.push_back(totypesrev);
adjlist[type[j]].push_back(totypesrev);
adjlist[gennode(false, i)].push_back(totypes);
x = -x;
if (j % 2)
y = -y;
}
}
for (long long i = 0; i < n; i++) {
long long x, y, am;
cin >> x >> y >> am;
edge *v = new edge(gennode(true, i), SINK, 0, 0, am, edgelist.size() + 1);
edge *vrev = new edge(SINK, gennode(true, i), 0, 0, 0, edgelist.size());
edgelist.push_back(v);
edgelist.push_back(vrev);
adjlist[gennode(true, i)].push_back(v);
adjlist[SINK].push_back(vrev);
y = -y;
for (long long j = 0; j < 4; j++) {
x = -x;
edge *totypes = new edge(type[j], gennode(true, i), 0, -(x + y), am,
edgelist.size() + 1);
edge *totypesrev =
new edge(gennode(true, i), type[j], 0, x + y, 0, edgelist.size());
edgelist.push_back(totypes);
edgelist.push_back(totypesrev);
adjlist[type[j]].push_back(totypes);
adjlist[gennode(true, i)].push_back(totypesrev);
if (j == 1)
y = -y;
}
}
/*for (long long i = 0; i < 2 * n + 6; i++) {
cout << i << " : ";
for (long long j = 0; j < adjlist[i].size(); j++) {
cout << adjlist[i][j]->from << ' ' << adjlist[i][j]->to << ' '
<< adjlist[i][j]->cost << ' ' << adjlist[i][j]->cap << ' ' <<
adjlist[i][j]->revid << " | ";
}
cout << '\n';
}*/
cout << -mincostmaxflow() << '\n';
} | replace | 22 | 26 | 22 | 26 | 0 | |
p03020 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1000;
const int maxm = 8e3;
const ll inf = 1e18;
const ll mx = 3e9;
struct edge {
int to;
ll c;
ll f;
ll w;
int nxt;
} e[maxm + 10];
int head[maxm + 10];
int tot;
int n;
int S, T;
void addedge(int u, int v, ll w, ll c) {
// cout<<u << v << w<< c<<endl;
e[tot].to = v;
e[tot].w = w;
e[tot].c = c;
e[tot].nxt = head[u];
head[u] = tot++;
e[tot].to = u;
e[tot].w = -w;
e[tot].c = 0;
e[tot].nxt = head[v];
head[v] = tot++;
}
ll dis[maxm + 10];
bool vis[maxm + 10];
int pre[maxm + 10];
bool spfa() {
for (int i = 0; i <= T; i++)
dis[i] = inf;
// memset(dis,inf,0,sizeof(dis));
memset(pre, -1, sizeof(pre));
memset(vis, false, sizeof(vis));
dis[S] = 0;
vis[S] = true;
queue<int> q;
q.push(S);
while (!q.empty()) {
int u = q.front();
q.pop();
vis[u] = false;
for (int i = head[u]; i != -1; i = e[i].nxt) {
int v = e[i].to;
if (e[i].c) {
if (dis[u] + e[i].w < dis[v]) {
dis[v] = dis[u] + e[i].w;
pre[v] = i;
if (!vis[v]) {
vis[v] = true;
q.push(v);
}
}
}
}
}
return dis[T] != inf;
}
ll MCMF() {
ll ret = 0;
while (spfa()) {
ll flow = inf;
for (int i = T; i != S; i = e[pre[i] ^ 1].to) {
flow = min(e[pre[i]].c, flow);
}
for (int i = T; i != S; i = e[pre[i] ^ 1].to) {
e[pre[i]].c -= flow;
e[pre[i] ^ 1].c += flow;
ret += e[pre[i]].w * flow;
}
}
return ret;
}
int main() {
while (~scanf("%d", &n)) {
tot = 0;
memset(head, -1, sizeof(head));
S = 1, T = S + 2 * n + 5;
for (int i = 1; i <= n; i++) {
int x, y, c;
scanf("%d%d%d", &x, &y, &c);
addedge(S, S + i, 0, c);
addedge(S + i, S + n + 1, x + y, c);
addedge(S + i, S + n + 2, x - y, c);
addedge(S + i, S + n + 3, -x + y, c);
addedge(S + i, S + n + 4, -x - y, c);
}
for (int i = 1; i <= n; i++) {
int x, y, c;
scanf("%d%d%d", &x, &y, &c);
addedge(S + n + 4 + i, T, 0, c);
addedge(S + n + 1, S + n + 4 + i, -x - y, c);
addedge(S + n + 2, S + n + 4 + i, -x + y, c);
addedge(S + n + 3, S + n + 4 + i, x - y, c);
addedge(S + n + 4, S + n + 4 + i, x + y, c);
}
printf("%lld\n", -MCMF());
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1000;
const int maxm = 8e3;
const ll inf = 1e18;
const ll mx = 3e9;
struct edge {
int to;
ll c;
ll f;
ll w;
int nxt;
} e[31000];
int head[maxm + 10];
int tot;
int n;
int S, T;
void addedge(int u, int v, ll w, ll c) {
// cout<<u << v << w<< c<<endl;
e[tot].to = v;
e[tot].w = w;
e[tot].c = c;
e[tot].nxt = head[u];
head[u] = tot++;
e[tot].to = u;
e[tot].w = -w;
e[tot].c = 0;
e[tot].nxt = head[v];
head[v] = tot++;
}
ll dis[maxm + 10];
bool vis[maxm + 10];
int pre[maxm + 10];
bool spfa() {
for (int i = 0; i <= T; i++)
dis[i] = inf;
// memset(dis,inf,0,sizeof(dis));
memset(pre, -1, sizeof(pre));
memset(vis, false, sizeof(vis));
dis[S] = 0;
vis[S] = true;
queue<int> q;
q.push(S);
while (!q.empty()) {
int u = q.front();
q.pop();
vis[u] = false;
for (int i = head[u]; i != -1; i = e[i].nxt) {
int v = e[i].to;
if (e[i].c) {
if (dis[u] + e[i].w < dis[v]) {
dis[v] = dis[u] + e[i].w;
pre[v] = i;
if (!vis[v]) {
vis[v] = true;
q.push(v);
}
}
}
}
}
return dis[T] != inf;
}
ll MCMF() {
ll ret = 0;
while (spfa()) {
ll flow = inf;
for (int i = T; i != S; i = e[pre[i] ^ 1].to) {
flow = min(e[pre[i]].c, flow);
}
for (int i = T; i != S; i = e[pre[i] ^ 1].to) {
e[pre[i]].c -= flow;
e[pre[i] ^ 1].c += flow;
ret += e[pre[i]].w * flow;
}
}
return ret;
}
int main() {
while (~scanf("%d", &n)) {
tot = 0;
memset(head, -1, sizeof(head));
S = 1, T = S + 2 * n + 5;
for (int i = 1; i <= n; i++) {
int x, y, c;
scanf("%d%d%d", &x, &y, &c);
addedge(S, S + i, 0, c);
addedge(S + i, S + n + 1, x + y, c);
addedge(S + i, S + n + 2, x - y, c);
addedge(S + i, S + n + 3, -x + y, c);
addedge(S + i, S + n + 4, -x - y, c);
}
for (int i = 1; i <= n; i++) {
int x, y, c;
scanf("%d%d%d", &x, &y, &c);
addedge(S + n + 4 + i, T, 0, c);
addedge(S + n + 1, S + n + 4 + i, -x - y, c);
addedge(S + n + 2, S + n + 4 + i, -x + y, c);
addedge(S + n + 3, S + n + 4 + i, x - y, c);
addedge(S + n + 4, S + n + 4 + i, x + y, c);
}
printf("%lld\n", -MCMF());
}
return 0;
}
| replace | 13 | 14 | 13 | 14 | 0 | |
p03020 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fo(i, l, r) for (int i = l; i <= r; i++)
#define of(i, l, r) for (int i = l; i >= r; i--)
#define fe(i, u) for (int i = head[u]; i; i = e[i].next)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
inline void open(const char *s) {
#ifndef ONLINE_JUDGE
char str[20];
sprintf(str, "%s.in", s);
freopen(str, "r", stdin);
// sprintf(str,"%s.out",s);
// freopen(str,"w",stdout);
#endif
}
inline int rd() {
static int x, f;
x = 0;
f = 1;
char ch = getchar();
for (; ch < '0' || ch > '9'; ch = getchar())
if (ch == '-')
f = -1;
for (; ch >= '0' && ch <= '9'; ch = getchar())
x = x * 10 + ch - '0';
return f > 0 ? x : -x;
}
const int N = 2010;
const int Inf = 1e9;
int n, tot = 1, head[N << 1], vs, vt;
struct edge {
int v, f, w, next;
} e[N << 3];
inline void add(int u, int v, int f, int w) {
e[++tot] = edge{v, f, w, head[u]};
head[u] = tot;
e[++tot] = edge{u, 0, -w, head[v]};
head[v] = tot;
}
int cur[N << 1];
ll d[N << 1];
bool inq[N << 1];
inline bool bfs() {
static queue<int> q;
while (!q.empty())
q.pop();
fo(i, 1, vt) d[i] = -1e16, cur[i] = inq[i] = 0;
q.push(vs);
d[vs] = 0;
cur[vs] = head[vs];
inq[vs] = 1;
while (!q.empty()) {
int u = q.front();
q.pop();
inq[u] = 0;
fe(i, u) {
int v = e[i].v;
if (e[i].f && d[v] < d[u] + e[i].w) {
d[v] = d[u] + e[i].w;
if (!inq[v]) {
cur[v] = head[v];
q.push(v), inq[v] = 1;
}
}
}
}
return d[vt] != -1e16;
}
int vis[N], tim = 0;
int dfs(int u, int a) {
if (u == vt || !a)
return a;
int ans = 0;
vis[u] = tim;
for (int &i = cur[u]; i; i = e[i].next) {
int v = e[i].v, f = e[i].f;
if (f && vis[v] != tim && d[v] == d[u] + e[i].w) {
f = dfs(v, min(f, a));
if (!f)
continue;
e[i].f -= f;
e[i ^ 1].f += f;
ans += f;
a -= f;
if (!a)
break;
}
}
return ans;
}
int main() {
n = rd();
vs = n + n + 5;
vt = vs + 1;
fo(i, 1, n) {
int x = rd(), y = rd(), z = rd();
add(vs, i, z, 0);
add(i, n + n + 1, Inf, x + y);
add(i, n + n + 2, Inf, x - y);
add(i, n + n + 3, Inf, y - x);
add(i, n + n + 4, Inf, -x - y);
}
fo(i, 1, n) {
int x = rd(), y = rd(), z = rd();
x = -x;
y = -y;
add(i + n, vt, z, 0);
add(n + n + 1, n + i, Inf, x + y);
add(n + n + 2, n + i, Inf, x - y);
add(n + n + 3, n + i, Inf, y - x);
add(n + n + 4, n + i, Inf, -x - y);
}
ll ans = 0;
while (bfs()) {
// while(1){
++tim;
int f = dfs(vs, Inf);
ans += d[vt] * f;
// if(!f)break;
// }
}
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
#define fo(i, l, r) for (int i = l; i <= r; i++)
#define of(i, l, r) for (int i = l; i >= r; i--)
#define fe(i, u) for (int i = head[u]; i; i = e[i].next)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
inline void open(const char *s) {
#ifndef ONLINE_JUDGE
char str[20];
sprintf(str, "%s.in", s);
freopen(str, "r", stdin);
// sprintf(str,"%s.out",s);
// freopen(str,"w",stdout);
#endif
}
inline int rd() {
static int x, f;
x = 0;
f = 1;
char ch = getchar();
for (; ch < '0' || ch > '9'; ch = getchar())
if (ch == '-')
f = -1;
for (; ch >= '0' && ch <= '9'; ch = getchar())
x = x * 10 + ch - '0';
return f > 0 ? x : -x;
}
const int N = 2010;
const int Inf = 1e9;
int n, tot = 1, head[N << 1], vs, vt;
struct edge {
int v, f, w, next;
} e[N * 20];
inline void add(int u, int v, int f, int w) {
e[++tot] = edge{v, f, w, head[u]};
head[u] = tot;
e[++tot] = edge{u, 0, -w, head[v]};
head[v] = tot;
}
int cur[N << 1];
ll d[N << 1];
bool inq[N << 1];
inline bool bfs() {
static queue<int> q;
while (!q.empty())
q.pop();
fo(i, 1, vt) d[i] = -1e16, cur[i] = inq[i] = 0;
q.push(vs);
d[vs] = 0;
cur[vs] = head[vs];
inq[vs] = 1;
while (!q.empty()) {
int u = q.front();
q.pop();
inq[u] = 0;
fe(i, u) {
int v = e[i].v;
if (e[i].f && d[v] < d[u] + e[i].w) {
d[v] = d[u] + e[i].w;
if (!inq[v]) {
cur[v] = head[v];
q.push(v), inq[v] = 1;
}
}
}
}
return d[vt] != -1e16;
}
int vis[N], tim = 0;
int dfs(int u, int a) {
if (u == vt || !a)
return a;
int ans = 0;
vis[u] = tim;
for (int &i = cur[u]; i; i = e[i].next) {
int v = e[i].v, f = e[i].f;
if (f && vis[v] != tim && d[v] == d[u] + e[i].w) {
f = dfs(v, min(f, a));
if (!f)
continue;
e[i].f -= f;
e[i ^ 1].f += f;
ans += f;
a -= f;
if (!a)
break;
}
}
return ans;
}
int main() {
n = rd();
vs = n + n + 5;
vt = vs + 1;
fo(i, 1, n) {
int x = rd(), y = rd(), z = rd();
add(vs, i, z, 0);
add(i, n + n + 1, Inf, x + y);
add(i, n + n + 2, Inf, x - y);
add(i, n + n + 3, Inf, y - x);
add(i, n + n + 4, Inf, -x - y);
}
fo(i, 1, n) {
int x = rd(), y = rd(), z = rd();
x = -x;
y = -y;
add(i + n, vt, z, 0);
add(n + n + 1, n + i, Inf, x + y);
add(n + n + 2, n + i, Inf, x - y);
add(n + n + 3, n + i, Inf, y - x);
add(n + n + 4, n + i, Inf, -x - y);
}
ll ans = 0;
while (bfs()) {
// while(1){
++tim;
int f = dfs(vs, Inf);
ans += d[vt] * f;
// if(!f)break;
// }
}
cout << ans;
return 0;
}
| replace | 33 | 34 | 33 | 34 | 0 | |
p03020 | C++ | Time Limit Exceeded | #include <cstdio>
#include <cstring>
#define M 20002
#define N 2019
int A[N], B[N], C[N], S, T, a[N], b[M], c[M], d[M], e[M], g[N], i, l, n, q[N],
r, t;
long long f[N];
bool h[N];
inline void add(int u, int v, int x, int y) {
b[++t] = a[u], c[a[u] = t] = v, d[t] = x, e[t] = y, b[++t] = a[v],
c[a[v] = t] = u, e[t] = -y;
}
int u, v, w;
long long x;
inline bool bfs() {
memset(f, 0x3f, T + 5 << 3), f[q[l = 0] = S] = 0, r = 1;
while (l != r)
for (h[u = q[l++]] = false, l = l == N ? 0 : l, i = a[u]; i; i = b[i])
if (d[i] && f[u] + e[i] < f[c[i]]) {
f[c[i]] = f[u] + e[i], g[c[i]] = i;
if (!h[c[i]])
h[q[r++] = c[i]] = true;
}
if (f[T] == 0x3f3f3f3f3f3f3f3fll)
return false;
for (u = 10, i = T; i != S; i = c[g[i] ^ 1])
u = d[g[i]] < u ? d[g[i]] : u;
for (x -= u * f[i = T]; i != S; i = c[g[i] ^ 1])
d[g[i]] -= u, d[g[i] ^ 1] += u;
return true;
}
int main() {
scanf("%d", &n), T = n << 1 | 1;
for (i = t = 1; i <= n; i++)
scanf("%d%d%d", &u, &v, &w), add(S, i, w, 0), add(i, T + 1, 10, u + v),
add(i, T + 2, 10, u - v), add(i, T + 3, 10, v - u),
add(i, T + 4, 10, -u - v);
for (i = n + 1; i < T; i++)
scanf("%d%d%d", &u, &v, &w), add(T + 1, i, 10, -u - v),
add(T + 2, i, 10, v - u), add(T + 3, i, 10, u - v),
add(T + 4, i, 10, u + v), add(i, T, w, 0);
while (bfs())
;
return 0 * printf("%lld\n", x);
} | #include <cstdio>
#include <cstring>
#define M 20002
#define N 2019
int A[N], B[N], C[N], S, T, a[N], b[M], c[M], d[M], e[M], g[N], i, l, n, q[N],
r, t;
long long f[N];
bool h[N];
inline void add(int u, int v, int x, int y) {
b[++t] = a[u], c[a[u] = t] = v, d[t] = x, e[t] = y, b[++t] = a[v],
c[a[v] = t] = u, e[t] = -y;
}
int u, v, w;
long long x;
inline bool bfs() {
memset(f, 0x3f, T + 5 << 3), f[q[l = 0] = S] = 0, r = 1;
while (l != r)
for (h[u = q[l++]] = false, l = l == N ? 0 : l, i = a[u]; i; i = b[i])
if (d[i] && f[u] + e[i] < f[c[i]]) {
f[c[i]] = f[u] + e[i], g[c[i]] = i;
if (!h[c[i]])
h[q[r++] = c[i]] = true, r = r == N ? 0 : r;
}
if (f[T] == 0x3f3f3f3f3f3f3f3fll)
return false;
for (u = 10, i = T; i != S; i = c[g[i] ^ 1])
u = d[g[i]] < u ? d[g[i]] : u;
for (x -= u * f[i = T]; i != S; i = c[g[i] ^ 1])
d[g[i]] -= u, d[g[i] ^ 1] += u;
return true;
}
int main() {
scanf("%d", &n), T = n << 1 | 1;
for (i = t = 1; i <= n; i++)
scanf("%d%d%d", &u, &v, &w), add(S, i, w, 0), add(i, T + 1, 10, u + v),
add(i, T + 2, 10, u - v), add(i, T + 3, 10, v - u),
add(i, T + 4, 10, -u - v);
for (i = n + 1; i < T; i++)
scanf("%d%d%d", &u, &v, &w), add(T + 1, i, 10, -u - v),
add(T + 2, i, 10, v - u), add(T + 3, i, 10, u - v),
add(T + 4, i, 10, u + v), add(i, T, w, 0);
while (bfs())
;
return 0 * printf("%lld\n", x);
} | replace | 21 | 22 | 21 | 22 | TLE | |
p03020 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define SZ(x) ((int)x.size())
#define L(i, u) for (register int i = head[u]; i; i = nxt[i])
#define rep(i, a, b) for (register int i = (a); i <= (b); i++)
#define per(i, a, b) for (register int i = (a); i >= (b); i--)
using namespace std;
typedef long long ll;
typedef unsigned int ui;
typedef pair<int, int> Pii;
typedef vector<int> Vi;
template <class T> inline void read(T &x) {
x = 0;
char c = getchar();
int f = 1;
while (!isdigit(c)) {
if (c == '-')
f = -1;
c = getchar();
}
while (isdigit(c)) {
x = x * 10 + c - '0';
c = getchar();
}
x *= f;
}
template <class T> inline void umin(T &x, T y) { x = x < y ? x : y; }
template <class T> inline void umax(T &x, T y) { x = x > y ? x : y; }
inline ui R() {
static ui seed = 416;
return seed ^= seed >> 5, seed ^= seed << 17, seed ^= seed >> 13;
}
const int N = 25555;
int n, a[4], tot;
const int M = 200000;
const ll inf = 1e16;
int S, T, edgenum = 1, head[N], cur[N], to[M], nxt[M], cap[M], val[M];
inline void addedge(int u, int v, int c, int w) {
to[++edgenum] = v;
cap[edgenum] = c;
val[edgenum] = w;
nxt[edgenum] = head[u];
head[u] = edgenum;
}
inline void add(int u, int v, int c, int w) {
assert(u <= T && v <= T && u && v);
w = -w;
addedge(u, v, c, w);
addedge(v, u, 0, -w);
}
int rec[N], q[N];
bool vis[N];
ll dis[N];
inline void inc(int &x) {
x++;
x = x == N ? 0 : x;
}
inline bool spfa() {
int f = 0, r = 1;
rep(i, 0, T) dis[i] = inf;
dis[T] = 0;
q[f] = T;
while (f != r) {
int u = q[f];
inc(f);
vis[u] = 0;
L(i, u) if (cap[i ^ 1] && dis[to[i]] > dis[u] + val[i ^ 1]) {
dis[to[i]] = dis[u] + val[i ^ 1];
rec[to[i]] = i;
if (!vis[to[i]]) {
if (dis[to[i]] >= dis[q[f]])
q[r] = to[i], inc(r);
else
f = f ? f - 1 : N - 1, q[f] = to[i];
vis[to[i]] = 1;
}
}
}
return dis[S] < inf;
}
bool incir[N];
inline int dfs(int u, int flow) {
if (u == T || !flow)
return flow;
assert(!incir[u]);
int tot = 0;
incir[u] = 1;
for (register int &i = cur[u]; i; i = nxt[i])
if (cap[i] && dis[u] == dis[to[i]] + val[i] && !incir[to[i]]) {
int tmp = dfs(to[i], min(flow, cap[i]));
cap[i] -= tmp;
cap[i ^ 1] += tmp;
tot += tmp;
flow -= tmp;
if (!flow)
break;
}
incir[u] = 0;
return tot;
}
inline ll solve() {
ll res = 0;
while (spfa()) {
memcpy(cur, head, 4 * (T + 2));
int qaq = dfs(S, 0x3f3f3f3f);
res += 1LL * qaq * dis[S];
}
return -res;
}
int main() {
read(n);
S = 2 * n + 11;
T = S + 1;
tot = 2 * n + 1;
rep(j, 0, 3) a[j] = tot + j;
rep(i, 1, n) {
int x, y, c;
read(x);
read(y);
read(c);
add(S, i, c, 0);
add(i, a[0], c, -x - y);
add(i, a[1], c, -x + y);
add(i, a[2], c, x - y);
add(i, a[3], c, x + y);
}
rep(i, 1, n) {
int x, y, c;
read(x);
read(y);
read(c);
add(n + i, T, c, 0);
add(a[0], n + i, c, x + y);
add(a[1], n + i, c, x - y);
add(a[2], n + i, c, -x + y);
add(a[3], n + i, c, -x - y);
}
cout << solve();
return 0;
}
| #include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define SZ(x) ((int)x.size())
#define L(i, u) for (register int i = head[u]; i; i = nxt[i])
#define rep(i, a, b) for (register int i = (a); i <= (b); i++)
#define per(i, a, b) for (register int i = (a); i >= (b); i--)
using namespace std;
typedef long long ll;
typedef unsigned int ui;
typedef pair<int, int> Pii;
typedef vector<int> Vi;
template <class T> inline void read(T &x) {
x = 0;
char c = getchar();
int f = 1;
while (!isdigit(c)) {
if (c == '-')
f = -1;
c = getchar();
}
while (isdigit(c)) {
x = x * 10 + c - '0';
c = getchar();
}
x *= f;
}
template <class T> inline void umin(T &x, T y) { x = x < y ? x : y; }
template <class T> inline void umax(T &x, T y) { x = x > y ? x : y; }
inline ui R() {
static ui seed = 416;
return seed ^= seed >> 5, seed ^= seed << 17, seed ^= seed >> 13;
}
const int N = 25555;
int n, a[4], tot;
const int M = 200000;
const ll inf = 1e16;
int S, T, edgenum = 1, head[N], cur[N], to[M], nxt[M], cap[M], val[M];
inline void addedge(int u, int v, int c, int w) {
to[++edgenum] = v;
cap[edgenum] = c;
val[edgenum] = w;
nxt[edgenum] = head[u];
head[u] = edgenum;
}
inline void add(int u, int v, int c, int w) {
assert(u <= T && v <= T && u && v);
w = -w;
addedge(u, v, c, w);
addedge(v, u, 0, -w);
}
int rec[N], q[N];
bool vis[N];
ll dis[N];
inline void inc(int &x) {
x++;
x = x == N ? 0 : x;
}
inline bool spfa() {
int f = 0, r = 1;
rep(i, 0, T) dis[i] = inf;
dis[T] = 0;
q[f] = T;
while (f != r) {
int u = q[f];
inc(f);
vis[u] = 0;
L(i, u) if (cap[i ^ 1] && dis[to[i]] > dis[u] + val[i ^ 1]) {
dis[to[i]] = dis[u] + val[i ^ 1];
rec[to[i]] = i;
if (!vis[to[i]]) {
q[r] = to[i], inc(r);
vis[to[i]] = 1;
}
}
}
return dis[S] < inf;
}
bool incir[N];
inline int dfs(int u, int flow) {
if (u == T || !flow)
return flow;
assert(!incir[u]);
int tot = 0;
incir[u] = 1;
for (register int &i = cur[u]; i; i = nxt[i])
if (cap[i] && dis[u] == dis[to[i]] + val[i] && !incir[to[i]]) {
int tmp = dfs(to[i], min(flow, cap[i]));
cap[i] -= tmp;
cap[i ^ 1] += tmp;
tot += tmp;
flow -= tmp;
if (!flow)
break;
}
incir[u] = 0;
return tot;
}
inline ll solve() {
ll res = 0;
while (spfa()) {
memcpy(cur, head, 4 * (T + 2));
int qaq = dfs(S, 0x3f3f3f3f);
res += 1LL * qaq * dis[S];
}
return -res;
}
int main() {
read(n);
S = 2 * n + 11;
T = S + 1;
tot = 2 * n + 1;
rep(j, 0, 3) a[j] = tot + j;
rep(i, 1, n) {
int x, y, c;
read(x);
read(y);
read(c);
add(S, i, c, 0);
add(i, a[0], c, -x - y);
add(i, a[1], c, -x + y);
add(i, a[2], c, x - y);
add(i, a[3], c, x + y);
}
rep(i, 1, n) {
int x, y, c;
read(x);
read(y);
read(c);
add(n + i, T, c, 0);
add(a[0], n + i, c, x + y);
add(a[1], n + i, c, x - y);
add(a[2], n + i, c, -x + y);
add(a[3], n + i, c, -x - y);
}
cout << solve();
return 0;
}
| replace | 72 | 76 | 72 | 73 | TLE | |
p03020 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define mp make_pair
#define pb push_back
#define pii pair<int, int>
#define pll pair<LL, LL>
#define x first
#define y second
#define N 131072
#define pi acos(-1)
#define sqr(x) ((x) * (x))
#define pdd pair<double, double>
#define MEMS(x) memset(x, -1, sizeof(x))
#define MEM(x) memset(x, 0, sizeof(x))
#define MXN 2005
#define MXN 2005
struct CostFlow {
struct Edge {
int v, r;
long long f, c;
Edge(int a, int b, int _c, int d) : v(a), r(b), f(_c), c(d) {}
};
int n, s, t, prv[MXN], prvL[MXN], inq[MXN];
LL dis[MXN], fl, cost;
vector<Edge> E[MXN];
void init(int _n, int _s, int _t) {
n = _n;
s = _s;
t = _t;
for (int i = 0; i < n; i++)
E[i].clear();
fl = cost = 0;
}
void add_edge(int u, int v, long long f, long long c) {
E[u].pb(Edge(v, E[v].size(), f, c));
E[v].pb(Edge(u, E[u].size() - 1, 0, -c));
}
void SPFA() {
fill(dis, dis + n + 1, -1e18);
fill(inq, inq + n + 1, 0);
dis[s] = 0;
queue<int> q;
q.push(s);
while (!q.empty()) {
int x = q.front();
q.pop();
inq[x] = 0;
int cnt = 0;
for (auto it : E[x]) {
if (it.f > 0 && dis[it.v] < dis[x] + it.c) {
prv[it.v] = x;
prvL[it.v] = cnt;
dis[it.v] = dis[x] + it.c;
if (!inq[it.v]) {
inq[it.v] = 1;
q.push(it.v);
}
}
cnt++;
}
}
}
pll flow() {
while (true) {
SPFA();
if (dis[t] == -1e18)
break;
long long tf = 1e18;
for (int v = t, u, l; v != s; v = u) {
u = prv[v];
l = prvL[v];
tf = min(tf, E[u][l].f);
}
for (int v = t, u, l; v != s; v = u) {
u = prv[v];
l = prvL[v];
E[u][l].f -= tf;
E[v][E[u][l].r].f += tf;
}
cost += tf * dis[t];
fl += tf;
}
return {fl, cost};
}
} flow;
int main() {
int n;
scanf("%d", &n);
flow.init(2 * n + 10, 0, 2 * n + 5);
pair<pii, int> r[1005], b[1005];
for (int i = 1; i <= n; i++) {
int x, y, c;
scanf("%d %d %d", &x, &y, &c);
r[i] = mp(mp(x, y), c);
flow.add_edge(0, i, c, 0);
flow.add_edge(i, n + 1, c, x + y);
flow.add_edge(i, n + 2, c, x - y);
flow.add_edge(i, n + 3, c, y - x);
flow.add_edge(i, n + 4, c, -y - x);
}
for (int i = 1; i <= n; i++) {
int x, y, c;
scanf("%d %d %d", &x, &y, &c);
b[i] = mp(mp(x, y), c);
flow.add_edge(n + i + 4, 2 * n + 5, c, 0);
flow.add_edge(n + 1, n + i + 4, c, -x - y);
flow.add_edge(n + 2, n + i + 4, c, y - x);
flow.add_edge(n + 3, n + i + 4, c, x - y);
flow.add_edge(n + 4, n + i + 4, c, y + x);
}
printf("%lld\n", flow.flow().y);
}
/*
230
0.5 0.5
0.5 0.25
0.25 0.125
0.25
*/ | #include <bits/stdc++.h>
using namespace std;
#define LL long long
#define mp make_pair
#define pb push_back
#define pii pair<int, int>
#define pll pair<LL, LL>
#define x first
#define y second
#define N 131072
#define pi acos(-1)
#define sqr(x) ((x) * (x))
#define pdd pair<double, double>
#define MEMS(x) memset(x, -1, sizeof(x))
#define MEM(x) memset(x, 0, sizeof(x))
#define MXN 3005
struct CostFlow {
struct Edge {
int v, r;
long long f, c;
Edge(int a, int b, int _c, int d) : v(a), r(b), f(_c), c(d) {}
};
int n, s, t, prv[MXN], prvL[MXN], inq[MXN];
LL dis[MXN], fl, cost;
vector<Edge> E[MXN];
void init(int _n, int _s, int _t) {
n = _n;
s = _s;
t = _t;
for (int i = 0; i < n; i++)
E[i].clear();
fl = cost = 0;
}
void add_edge(int u, int v, long long f, long long c) {
E[u].pb(Edge(v, E[v].size(), f, c));
E[v].pb(Edge(u, E[u].size() - 1, 0, -c));
}
void SPFA() {
fill(dis, dis + n + 1, -1e18);
fill(inq, inq + n + 1, 0);
dis[s] = 0;
queue<int> q;
q.push(s);
while (!q.empty()) {
int x = q.front();
q.pop();
inq[x] = 0;
int cnt = 0;
for (auto it : E[x]) {
if (it.f > 0 && dis[it.v] < dis[x] + it.c) {
prv[it.v] = x;
prvL[it.v] = cnt;
dis[it.v] = dis[x] + it.c;
if (!inq[it.v]) {
inq[it.v] = 1;
q.push(it.v);
}
}
cnt++;
}
}
}
pll flow() {
while (true) {
SPFA();
if (dis[t] == -1e18)
break;
long long tf = 1e18;
for (int v = t, u, l; v != s; v = u) {
u = prv[v];
l = prvL[v];
tf = min(tf, E[u][l].f);
}
for (int v = t, u, l; v != s; v = u) {
u = prv[v];
l = prvL[v];
E[u][l].f -= tf;
E[v][E[u][l].r].f += tf;
}
cost += tf * dis[t];
fl += tf;
}
return {fl, cost};
}
} flow;
int main() {
int n;
scanf("%d", &n);
flow.init(2 * n + 10, 0, 2 * n + 5);
pair<pii, int> r[1005], b[1005];
for (int i = 1; i <= n; i++) {
int x, y, c;
scanf("%d %d %d", &x, &y, &c);
r[i] = mp(mp(x, y), c);
flow.add_edge(0, i, c, 0);
flow.add_edge(i, n + 1, c, x + y);
flow.add_edge(i, n + 2, c, x - y);
flow.add_edge(i, n + 3, c, y - x);
flow.add_edge(i, n + 4, c, -y - x);
}
for (int i = 1; i <= n; i++) {
int x, y, c;
scanf("%d %d %d", &x, &y, &c);
b[i] = mp(mp(x, y), c);
flow.add_edge(n + i + 4, 2 * n + 5, c, 0);
flow.add_edge(n + 1, n + i + 4, c, -x - y);
flow.add_edge(n + 2, n + i + 4, c, y - x);
flow.add_edge(n + 3, n + i + 4, c, x - y);
flow.add_edge(n + 4, n + i + 4, c, y + x);
}
printf("%lld\n", flow.flow().y);
}
/*
230
0.5 0.5
0.5 0.25
0.25 0.125
0.25
*/ | replace | 15 | 17 | 15 | 16 | 0 | |
p03020 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
using ll = long long;
int lst[3005], to[10005], pre[10005], cap[10005], cost[10005], que[2000005],
tot;
ll dis[3005];
bool in[3005], vis[3005];
inline void add_edge(int u, int v, int _cap, int _cost) {
auto _add = [&](int x, int y, int ca, int co) {
to[tot] = y;
pre[tot] = lst[x];
cap[tot] = ca;
cost[tot] = co;
lst[x] = tot++;
};
_add(u, v, _cap, _cost);
_add(v, u, 0, -_cost);
}
int dfs(int u, int t, int rem) {
if (u == t)
return rem;
vis[u] = true;
int ans = 0;
for (int i = lst[u]; ~i; i = pre[i]) {
if (vis[to[i]] || !cap[i] || dis[to[i]] != dis[u] + cost[i])
continue;
int v = to[i], res = dfs(v, t, std::min(rem - ans, cap[i]));
cap[i] -= res;
cap[i ^ 1] += res;
ans += res;
if (ans == rem)
return ans;
}
return ans;
}
inline ll min_cost_max_flow(int s, int t) {
ll res = 0;
while (true) {
memset(dis, 0x3f, sizeof(dis));
memset(in, false, sizeof(in));
int he = 0, ta = 0;
que[ta++] = s;
dis[s] = 0;
in[s] = true;
auto update = [&]() {
if (he < ta && dis[que[he]] > dis[que[ta - 1]])
std::swap(que[he], que[ta - 1]);
};
while (he < ta) {
int u = que[he++];
in[u] = false;
update();
for (int i = lst[u]; ~i; i = pre[i]) {
if (cap[i] && dis[to[i]] > dis[u] + cost[i]) {
dis[to[i]] = dis[u] + cost[i];
if (!in[to[i]]) {
in[to[i]] = true;
que[ta++] = to[i];
update();
}
}
}
}
if (dis[t] >= 1e9)
break;
while (true) {
for (int i = 0; i < ta; i++)
vis[que[i]] = false;
int mn = dfs(s, t, 1e9);
if (!mn)
break;
res += (ll)mn * dis[t];
}
}
return res;
}
int main() {
// freopen("AGC034-D.in", "r", stdin);
memset(lst, -1, sizeof(lst));
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
int x, y, k;
scanf("%d%d%d", &x, &y, &k);
add_edge(0, i + 1, k, 0);
add_edge(i + 1, 2 * n + 1, k, x + y);
add_edge(i + 1, 2 * n + 2, k, -x + y);
add_edge(i + 1, 2 * n + 3, k, x - y);
add_edge(i + 1, 2 * n + 4, k, -x - y);
}
for (int i = 0; i < n; i++) {
int x, y, k;
scanf("%d%d%d", &x, &y, &k);
add_edge(n + i + 1, 2 * n + 5, k, 0);
add_edge(2 * n + 1, n + i + 1, k, -x - y);
add_edge(2 * n + 2, n + i + 1, k, x - y);
add_edge(2 * n + 3, n + i + 1, k, -x + y);
add_edge(2 * n + 4, n + i + 1, k, x + y);
}
printf("%lld\n", -min_cost_max_flow(0, 2 * n + 5));
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <cstring>
using ll = long long;
int lst[3005], to[20005], pre[20005], cap[20005], cost[20005], que[2000005],
tot;
ll dis[3005];
bool in[3005], vis[3005];
inline void add_edge(int u, int v, int _cap, int _cost) {
auto _add = [&](int x, int y, int ca, int co) {
to[tot] = y;
pre[tot] = lst[x];
cap[tot] = ca;
cost[tot] = co;
lst[x] = tot++;
};
_add(u, v, _cap, _cost);
_add(v, u, 0, -_cost);
}
int dfs(int u, int t, int rem) {
if (u == t)
return rem;
vis[u] = true;
int ans = 0;
for (int i = lst[u]; ~i; i = pre[i]) {
if (vis[to[i]] || !cap[i] || dis[to[i]] != dis[u] + cost[i])
continue;
int v = to[i], res = dfs(v, t, std::min(rem - ans, cap[i]));
cap[i] -= res;
cap[i ^ 1] += res;
ans += res;
if (ans == rem)
return ans;
}
return ans;
}
inline ll min_cost_max_flow(int s, int t) {
ll res = 0;
while (true) {
memset(dis, 0x3f, sizeof(dis));
memset(in, false, sizeof(in));
int he = 0, ta = 0;
que[ta++] = s;
dis[s] = 0;
in[s] = true;
auto update = [&]() {
if (he < ta && dis[que[he]] > dis[que[ta - 1]])
std::swap(que[he], que[ta - 1]);
};
while (he < ta) {
int u = que[he++];
in[u] = false;
update();
for (int i = lst[u]; ~i; i = pre[i]) {
if (cap[i] && dis[to[i]] > dis[u] + cost[i]) {
dis[to[i]] = dis[u] + cost[i];
if (!in[to[i]]) {
in[to[i]] = true;
que[ta++] = to[i];
update();
}
}
}
}
if (dis[t] >= 1e9)
break;
while (true) {
for (int i = 0; i < ta; i++)
vis[que[i]] = false;
int mn = dfs(s, t, 1e9);
if (!mn)
break;
res += (ll)mn * dis[t];
}
}
return res;
}
int main() {
// freopen("AGC034-D.in", "r", stdin);
memset(lst, -1, sizeof(lst));
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
int x, y, k;
scanf("%d%d%d", &x, &y, &k);
add_edge(0, i + 1, k, 0);
add_edge(i + 1, 2 * n + 1, k, x + y);
add_edge(i + 1, 2 * n + 2, k, -x + y);
add_edge(i + 1, 2 * n + 3, k, x - y);
add_edge(i + 1, 2 * n + 4, k, -x - y);
}
for (int i = 0; i < n; i++) {
int x, y, k;
scanf("%d%d%d", &x, &y, &k);
add_edge(n + i + 1, 2 * n + 5, k, 0);
add_edge(2 * n + 1, n + i + 1, k, -x - y);
add_edge(2 * n + 2, n + i + 1, k, x - y);
add_edge(2 * n + 3, n + i + 1, k, -x + y);
add_edge(2 * n + 4, n + i + 1, k, x + y);
}
printf("%lld\n", -min_cost_max_flow(0, 2 * n + 5));
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p03020 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <time.h>
#include <vector>
using namespace std;
#define REP(i, x, y) for (ll i = x; i <= y; i++)
#define rep(i, n) REP(i, 1, n)
#define rep0(i, n) REP(i, 0, n - 1)
#define repG(i, x) for (ll i = pos[x]; ~i; i = e[i].next)
#define ll long long
#define db double
const ll N = 3e3 + 7;
const ll INF = 1e15 + 7;
ll pos[N], dis[N], Qu[N * 90], cur[N];
bool vis[N];
struct edge {
ll v, next, c, f;
} e[N * 2];
ll n, num = 0, S, T, ans = 0;
void add(ll x, ll y, ll c, ll f) {
e[num] = (edge){y, pos[x], c, f};
pos[x] = num++;
e[num] = (edge){x, pos[y], 0, -f};
pos[y] = num++;
}
bool spfa() {
ll hd = 0, ti = 1;
Qu[1] = S;
rep(i, n + n + 10) {
dis[i] = INF;
vis[i] = 1;
cur[i] = pos[i];
}
dis[S] = 0;
while (hd != ti) {
ll t = Qu[++hd];
vis[t] = 1;
repG(i, t) {
if (dis[e[i].v] > dis[t] + e[i].f && e[i].c) {
dis[e[i].v] = dis[t] + e[i].f;
if (vis[e[i].v]) {
vis[e[i].v] = 0;
Qu[++ti] = e[i].v;
}
}
}
}
return dis[T] < INF;
}
ll dfs(ll x, ll f) {
if (x == T) {
ans += f * dis[T];
return f;
}
vis[x] = 0;
ll used = 0;
for (; ~cur[x]; cur[x] = e[cur[x]].next) {
ll i = cur[x];
if (e[i].c && dis[e[i].v] == dis[x] + e[i].f && vis[e[i].v]) {
ll k = dfs(e[i].v, min(e[i].c, f - used));
used += k;
e[i].c -= k;
e[i ^ 1].c += k;
}
if (used == f)
break;
}
if (used == f)
vis[x] = 1;
return used;
}
int main() {
memset(pos, -1, sizeof(pos));
scanf("%lld", &n);
S = 2 * n + 1;
T = 2 * n + 2;
REP(i, 2, 5) add(n + n + 2 * i - 1, n + n + 2 * i, INF, 0);
rep(i, n) {
ll c, x, y;
scanf("%lld%lld%lld", &x, &y, &c);
add(S, i, c, 0);
add(i, n + n + 3, c, -x - y);
add(i, n + n + 5, c, -x + y);
add(i, n + n + 7, c, x - y);
add(i, n + n + 9, c, x + y);
}
rep(i, n) {
ll c, x, y;
scanf("%lld%lld%lld", &x, &y, &c);
add(i + n, T, c, 0);
add(n + n + 4, i + n, c, x + y);
add(n + n + 6, i + n, c, x - y);
add(n + n + 8, i + n, c, -x + y);
add(n + n + 10, i + n, c, -x - y);
}
while (spfa())
dfs(S, INF);
printf("%lld\n", -ans);
return 0;
}
| #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <time.h>
#include <vector>
using namespace std;
#define REP(i, x, y) for (ll i = x; i <= y; i++)
#define rep(i, n) REP(i, 1, n)
#define rep0(i, n) REP(i, 0, n - 1)
#define repG(i, x) for (ll i = pos[x]; ~i; i = e[i].next)
#define ll long long
#define db double
const ll N = 1e4 + 7;
const ll INF = 1e15 + 7;
ll pos[N], dis[N], Qu[N * 90], cur[N];
bool vis[N];
struct edge {
ll v, next, c, f;
} e[N * 2];
ll n, num = 0, S, T, ans = 0;
void add(ll x, ll y, ll c, ll f) {
e[num] = (edge){y, pos[x], c, f};
pos[x] = num++;
e[num] = (edge){x, pos[y], 0, -f};
pos[y] = num++;
}
bool spfa() {
ll hd = 0, ti = 1;
Qu[1] = S;
rep(i, n + n + 10) {
dis[i] = INF;
vis[i] = 1;
cur[i] = pos[i];
}
dis[S] = 0;
while (hd != ti) {
ll t = Qu[++hd];
vis[t] = 1;
repG(i, t) {
if (dis[e[i].v] > dis[t] + e[i].f && e[i].c) {
dis[e[i].v] = dis[t] + e[i].f;
if (vis[e[i].v]) {
vis[e[i].v] = 0;
Qu[++ti] = e[i].v;
}
}
}
}
return dis[T] < INF;
}
ll dfs(ll x, ll f) {
if (x == T) {
ans += f * dis[T];
return f;
}
vis[x] = 0;
ll used = 0;
for (; ~cur[x]; cur[x] = e[cur[x]].next) {
ll i = cur[x];
if (e[i].c && dis[e[i].v] == dis[x] + e[i].f && vis[e[i].v]) {
ll k = dfs(e[i].v, min(e[i].c, f - used));
used += k;
e[i].c -= k;
e[i ^ 1].c += k;
}
if (used == f)
break;
}
if (used == f)
vis[x] = 1;
return used;
}
int main() {
memset(pos, -1, sizeof(pos));
scanf("%lld", &n);
S = 2 * n + 1;
T = 2 * n + 2;
REP(i, 2, 5) add(n + n + 2 * i - 1, n + n + 2 * i, INF, 0);
rep(i, n) {
ll c, x, y;
scanf("%lld%lld%lld", &x, &y, &c);
add(S, i, c, 0);
add(i, n + n + 3, c, -x - y);
add(i, n + n + 5, c, -x + y);
add(i, n + n + 7, c, x - y);
add(i, n + n + 9, c, x + y);
}
rep(i, n) {
ll c, x, y;
scanf("%lld%lld%lld", &x, &y, &c);
add(i + n, T, c, 0);
add(n + n + 4, i + n, c, x + y);
add(n + n + 6, i + n, c, x - y);
add(n + n + 8, i + n, c, -x + y);
add(n + n + 10, i + n, c, -x - y);
}
while (spfa())
dfs(S, INF);
printf("%lld\n", -ans);
return 0;
}
| replace | 19 | 20 | 19 | 20 | 0 | |
p03020 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
typedef long long LL;
const LL INF = 0x3f3f3f3f3f3f3f3f;
const LL LMAX = 100;
LL ec = 1, to[2000005], cap[2000005], w[2000005], nxt[2000005],
hed[1000005] = {0};
void add_edge(LL f, LL t, LL c, LL d) {
++ec;
to[ec] = t;
cap[ec] = c;
w[ec] = d;
nxt[ec] = hed[f];
hed[f] = ec;
++ec;
to[ec] = f;
cap[ec] = 0;
w[ec] = -d;
nxt[ec] = hed[t];
hed[t] = ec;
}
LL dis[1000005], inq[1000005], flw[1000005];
LL pre[1000005], prv[1000005];
queue<LL> q;
LL spfa(LL s, LL t) {
memset(dis, INF, sizeof(dis));
memset(inq, 0, sizeof(inq));
memset(flw, 0, sizeof(flw));
prv[t] = -1;
q.push(s);
inq[s] = 1;
dis[s] = 0;
flw[s] = INF;
while (!q.empty()) {
LL u = q.front();
q.pop();
inq[u] = 0;
for (LL i = hed[u]; i; i = nxt[i]) {
LL v = to[i];
if (dis[v] > dis[u] + w[i] && cap[i]) {
dis[v] = dis[u] + w[i];
prv[v] = u;
pre[v] = i;
flw[v] = min(flw[u], cap[i]);
if (!inq[v]) {
inq[v] = 1;
q.push(v);
}
}
}
}
return prv[t] != -1;
}
LL mxf = 0, mcf = 0;
void mcmf(LL s, LL t) {
while (spfa(s, t)) {
mxf += flw[t];
mcf += flw[t] * dis[t];
LL now = t;
while (now != s) {
cap[pre[now]] -= flw[t];
cap[pre[now] ^ 1] += flw[t];
now = prv[now];
}
}
}
int main() {
ios::sync_with_stdio(false);
LL n, x, y, w, S, T;
cin >> n;
S = n + n + 5;
T = S + 1;
for (LL i = 1; i <= n; i++) {
cin >> x >> y >> w;
add_edge(S, i, w, 0);
add_edge(i, n + n + 1, INF, +x + y);
add_edge(i, n + n + 2, INF, +x - y);
add_edge(i, n + n + 3, INF, -x + y);
add_edge(i, n + n + 4, INF, -x - y);
}
for (LL i = 1; i <= n; i++) {
cin >> x >> y >> w;
add_edge(i + n, T, w, 0);
add_edge(n + n + 1, i + n, INF, -x - y);
add_edge(n + n + 2, i + n, INF, -x + y);
add_edge(n + n + 3, i + n, INF, +x - y);
add_edge(n + n + 4, i + n, INF, +x + y);
}
mcmf(S, T);
cout << -mcf << endl;
return 0;
} | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
typedef long long LL;
const LL INF = 0x3f3f3f3f3f3f3f3f;
const LL LMAX = 100;
LL ec = 1, to[2000005], cap[2000005], w[2000005], nxt[2000005],
hed[1000005] = {0};
void add_edge(LL f, LL t, LL c, LL d) {
++ec;
to[ec] = t;
cap[ec] = c;
w[ec] = d;
nxt[ec] = hed[f];
hed[f] = ec;
++ec;
to[ec] = f;
cap[ec] = 0;
w[ec] = -d;
nxt[ec] = hed[t];
hed[t] = ec;
}
LL dis[4005], inq[4005], flw[4005];
LL pre[4005], prv[4005];
queue<LL> q;
LL spfa(LL s, LL t) {
memset(dis, INF, sizeof(dis));
memset(inq, 0, sizeof(inq));
memset(flw, 0, sizeof(flw));
prv[t] = -1;
q.push(s);
inq[s] = 1;
dis[s] = 0;
flw[s] = INF;
while (!q.empty()) {
LL u = q.front();
q.pop();
inq[u] = 0;
for (LL i = hed[u]; i; i = nxt[i]) {
LL v = to[i];
if (dis[v] > dis[u] + w[i] && cap[i]) {
dis[v] = dis[u] + w[i];
prv[v] = u;
pre[v] = i;
flw[v] = min(flw[u], cap[i]);
if (!inq[v]) {
inq[v] = 1;
q.push(v);
}
}
}
}
return prv[t] != -1;
}
LL mxf = 0, mcf = 0;
void mcmf(LL s, LL t) {
while (spfa(s, t)) {
mxf += flw[t];
mcf += flw[t] * dis[t];
LL now = t;
while (now != s) {
cap[pre[now]] -= flw[t];
cap[pre[now] ^ 1] += flw[t];
now = prv[now];
}
}
}
int main() {
ios::sync_with_stdio(false);
LL n, x, y, w, S, T;
cin >> n;
S = n + n + 5;
T = S + 1;
for (LL i = 1; i <= n; i++) {
cin >> x >> y >> w;
add_edge(S, i, w, 0);
add_edge(i, n + n + 1, INF, +x + y);
add_edge(i, n + n + 2, INF, +x - y);
add_edge(i, n + n + 3, INF, -x + y);
add_edge(i, n + n + 4, INF, -x - y);
}
for (LL i = 1; i <= n; i++) {
cin >> x >> y >> w;
add_edge(i + n, T, w, 0);
add_edge(n + n + 1, i + n, INF, -x - y);
add_edge(n + n + 2, i + n, INF, -x + y);
add_edge(n + n + 3, i + n, INF, +x - y);
add_edge(n + n + 4, i + n, INF, +x + y);
}
mcmf(S, T);
cout << -mcf << endl;
return 0;
} | replace | 27 | 29 | 27 | 29 | TLE | |
p03020 | C++ | Runtime Error | // Legends Never Die.
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int UI;
typedef pair<int, int> pii;
#define DEBUG(...) fprintf(stderr, __VA_ARGS__)
#define mp make_pair
#define fst first
#define snd second
#define SZ(u) ((int)(u).size())
#define ALL(u) (u).begin(), (u).end()
inline void proc_status() {
ifstream t("/proc/self/status");
cerr << string(istreambuf_iterator<char>(t), istreambuf_iterator<char>())
<< endl;
}
namespace fastIO {
const UI BUFFER_SIZE = (UI)1 << 15;
char buffer[BUFFER_SIZE], *cur, *ed;
inline char getc() {
return *(cur == ed ? ed = buffer + fread(buffer, 1, BUFFER_SIZE, stdin),
cur = buffer : cur)++;
}
} // namespace fastIO
using fastIO::getc;
template <typename T> inline T read() {
register T sum(0), fg(1);
register char ch(getc());
for (; !isdigit(ch); ch = getc())
if (ch == '-')
fg = -1;
for (; isdigit(ch); ch = getc())
sum = sum * 10 - '0' + ch;
return sum * fg;
}
template <typename T> inline int chkmin(T &a, const T &b) {
return b < a ? a = b, 1 : 0;
}
template <typename T> inline int chkmax(T &a, const T &b) {
return b > a ? a = b, 1 : 0;
}
// END tpl.
const int MAXN = (int)1e3;
struct ball {
int x, y, c;
ball() {}
ball(int _x, int _y, int _c) : x(_x), y(_y), c(_c) {}
};
int n;
ball R[MAXN + 5], B[MAXN + 5];
inline void input() {
n = read<int>();
for (int i = 1; i <= n; ++i)
R[i].x = read<int>(), R[i].y = read<int>(), R[i].c = read<int>();
for (int i = 1; i <= n; ++i)
B[i].x = read<int>(), B[i].y = read<int>(), B[i].c = read<int>();
}
const int INF = (int)1e9;
namespace FLOW {
const int MAX_NODE = MAXN * 10, MAX_EDGE = MAXN * 50;
struct edge {
int v, c, w, nxt;
edge() {}
edge(int _v, int _c, int _w, int _nxt) : v(_v), c(_c), w(_w), nxt(_nxt) {}
};
edge e[MAX_EDGE * 2 + 5];
int st[MAX_NODE + 5], edge_cnt;
int N;
inline void init() { memset(st, -1, sizeof st), edge_cnt = 0; }
inline int new_node() { return ++N; }
inline void add_edge(int u, int v, int c, int w, int type = 1) {
e[edge_cnt] = edge(v, c, w, st[u]), st[u] = edge_cnt++;
if (type)
add_edge(v, u, 0, -w, 0);
}
LL d[MAX_NODE + 5];
inline int SPFA(int S, int T) {
static const LL INFD = (LL)1e18;
static queue<int> q;
static int inq[MAXN + 5];
for (int i = 1; i <= N; ++i)
inq[i] = 0, d[i] = -INFD;
d[S] = 0, inq[S] = 1, q.push(S);
while (!q.empty()) {
int u = q.front();
inq[u] = 0, q.pop();
for (int i = st[u]; ~i; i = e[i].nxt) {
int v = e[i].v;
if (e[i].c > 0 && chkmax(d[v], d[u] + e[i].w) && !inq[v])
inq[v] = 1, q.push(v);
}
}
return d[T] > -INFD;
}
int vis[MAX_NODE + 5], cur[MAX_NODE + 5];
inline int dfs(int u, int low, int T) {
if (u == T)
return low;
vis[u] = 1;
int sum = 0;
for (int &i = cur[u]; ~i; i = e[i].nxt) {
int v = e[i].v, k;
if (!vis[v] && d[v] == d[u] + e[i].w && e[i].c > 0 &&
(k = dfs(v, min(e[i].c, low), T)) > 0) {
low -= k, sum += k;
e[i].c -= k, e[i ^ 1].c += k;
if (low == 0)
break;
}
}
vis[u] = 0;
return sum;
}
inline LL solve(int S, int T) {
LL ans = 0;
while (SPFA(S, T)) {
for (int i = 1; i <= N; ++i)
cur[i] = st[i];
ans += (LL)dfs(S, INF, T) * d[T];
}
return ans;
}
} // namespace FLOW
inline void solve() {
FLOW::init();
int S = FLOW::new_node(), T = FLOW::new_node();
static int id[2][2];
for (int i = 0; i < 2; ++i)
for (int j = 0; j < 2; ++j)
id[i][j] = FLOW::new_node();
for (int i = 1; i <= n; ++i) {
int u = FLOW::new_node();
FLOW::add_edge(S, u, R[i].c, 0);
for (int p = 0; p < 2; ++p)
for (int q = 0; q < 2; ++q)
FLOW::add_edge(u, id[p][q], INF,
(2 * p - 1) * R[i].x + (2 * q - 1) * R[i].y);
}
for (int i = 1; i <= n; ++i) {
int u = FLOW::new_node();
FLOW::add_edge(u, T, B[i].c, 0);
for (int p = 0; p < 2; ++p)
for (int q = 0; q < 2; ++q)
FLOW::add_edge(id[p][q], u, INF,
-(2 * p - 1) * B[i].x + -(2 * q - 1) * B[i].y);
}
printf("%lld\n", FLOW::solve(S, T));
}
int main() {
#ifdef K_ON // K-ON!
freopen("D.in", "r", stdin);
freopen("D.out", "w", stdout);
#endif
input();
solve();
return 0;
}
| // Legends Never Die.
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int UI;
typedef pair<int, int> pii;
#define DEBUG(...) fprintf(stderr, __VA_ARGS__)
#define mp make_pair
#define fst first
#define snd second
#define SZ(u) ((int)(u).size())
#define ALL(u) (u).begin(), (u).end()
inline void proc_status() {
ifstream t("/proc/self/status");
cerr << string(istreambuf_iterator<char>(t), istreambuf_iterator<char>())
<< endl;
}
namespace fastIO {
const UI BUFFER_SIZE = (UI)1 << 15;
char buffer[BUFFER_SIZE], *cur, *ed;
inline char getc() {
return *(cur == ed ? ed = buffer + fread(buffer, 1, BUFFER_SIZE, stdin),
cur = buffer : cur)++;
}
} // namespace fastIO
using fastIO::getc;
template <typename T> inline T read() {
register T sum(0), fg(1);
register char ch(getc());
for (; !isdigit(ch); ch = getc())
if (ch == '-')
fg = -1;
for (; isdigit(ch); ch = getc())
sum = sum * 10 - '0' + ch;
return sum * fg;
}
template <typename T> inline int chkmin(T &a, const T &b) {
return b < a ? a = b, 1 : 0;
}
template <typename T> inline int chkmax(T &a, const T &b) {
return b > a ? a = b, 1 : 0;
}
// END tpl.
const int MAXN = (int)1e3;
struct ball {
int x, y, c;
ball() {}
ball(int _x, int _y, int _c) : x(_x), y(_y), c(_c) {}
};
int n;
ball R[MAXN + 5], B[MAXN + 5];
inline void input() {
n = read<int>();
for (int i = 1; i <= n; ++i)
R[i].x = read<int>(), R[i].y = read<int>(), R[i].c = read<int>();
for (int i = 1; i <= n; ++i)
B[i].x = read<int>(), B[i].y = read<int>(), B[i].c = read<int>();
}
const int INF = (int)1e9;
namespace FLOW {
const int MAX_NODE = MAXN * 10, MAX_EDGE = MAXN * 50;
struct edge {
int v, c, w, nxt;
edge() {}
edge(int _v, int _c, int _w, int _nxt) : v(_v), c(_c), w(_w), nxt(_nxt) {}
};
edge e[MAX_EDGE * 2 + 5];
int st[MAX_NODE + 5], edge_cnt;
int N;
inline void init() { memset(st, -1, sizeof st), edge_cnt = 0; }
inline int new_node() { return ++N; }
inline void add_edge(int u, int v, int c, int w, int type = 1) {
e[edge_cnt] = edge(v, c, w, st[u]), st[u] = edge_cnt++;
if (type)
add_edge(v, u, 0, -w, 0);
}
LL d[MAX_NODE + 5];
inline int SPFA(int S, int T) {
static const LL INFD = (LL)1e18;
static queue<int> q;
static int inq[MAX_NODE + 5];
for (int i = 1; i <= N; ++i)
inq[i] = 0, d[i] = -INFD;
d[S] = 0, inq[S] = 1, q.push(S);
while (!q.empty()) {
int u = q.front();
inq[u] = 0, q.pop();
for (int i = st[u]; ~i; i = e[i].nxt) {
int v = e[i].v;
if (e[i].c > 0 && chkmax(d[v], d[u] + e[i].w) && !inq[v])
inq[v] = 1, q.push(v);
}
}
return d[T] > -INFD;
}
int vis[MAX_NODE + 5], cur[MAX_NODE + 5];
inline int dfs(int u, int low, int T) {
if (u == T)
return low;
vis[u] = 1;
int sum = 0;
for (int &i = cur[u]; ~i; i = e[i].nxt) {
int v = e[i].v, k;
if (!vis[v] && d[v] == d[u] + e[i].w && e[i].c > 0 &&
(k = dfs(v, min(e[i].c, low), T)) > 0) {
low -= k, sum += k;
e[i].c -= k, e[i ^ 1].c += k;
if (low == 0)
break;
}
}
vis[u] = 0;
return sum;
}
inline LL solve(int S, int T) {
LL ans = 0;
while (SPFA(S, T)) {
for (int i = 1; i <= N; ++i)
cur[i] = st[i];
ans += (LL)dfs(S, INF, T) * d[T];
}
return ans;
}
} // namespace FLOW
inline void solve() {
FLOW::init();
int S = FLOW::new_node(), T = FLOW::new_node();
static int id[2][2];
for (int i = 0; i < 2; ++i)
for (int j = 0; j < 2; ++j)
id[i][j] = FLOW::new_node();
for (int i = 1; i <= n; ++i) {
int u = FLOW::new_node();
FLOW::add_edge(S, u, R[i].c, 0);
for (int p = 0; p < 2; ++p)
for (int q = 0; q < 2; ++q)
FLOW::add_edge(u, id[p][q], INF,
(2 * p - 1) * R[i].x + (2 * q - 1) * R[i].y);
}
for (int i = 1; i <= n; ++i) {
int u = FLOW::new_node();
FLOW::add_edge(u, T, B[i].c, 0);
for (int p = 0; p < 2; ++p)
for (int q = 0; q < 2; ++q)
FLOW::add_edge(id[p][q], u, INF,
-(2 * p - 1) * B[i].x + -(2 * q - 1) * B[i].y);
}
printf("%lld\n", FLOW::solve(S, T));
}
int main() {
#ifdef K_ON // K-ON!
freopen("D.in", "r", stdin);
freopen("D.out", "w", stdout);
#endif
input();
solve();
return 0;
}
| replace | 106 | 107 | 106 | 107 | 0 | |
p03020 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
typedef long long ll;
const int Maxn = 2004;
const int Maxm = 10000;
const ll INFLL = 0x3f3f3f3f3f3f3f3f;
const int INF = 0x7FFFFFFF;
struct MinCostMaxFlow_Dinic {
struct Edge {
int to, cap;
ll cos;
Edge *nxt, *bak;
};
Edge pool[Maxm + 5];
Edge *ecnt, *G[Maxn + 5];
inline void addedge(int u, int v, int cap, ll c) {
Edge *p = ++ecnt;
p->to = v, p->cap = cap, p->cos = c;
p->nxt = G[u], G[u] = p;
p->bak = p + 1;
p = ++ecnt;
p->to = u, p->cap = 0, p->cos = -c;
p->nxt = G[v], G[v] = p;
p->bak = p - 1;
}
int node, s, t;
ll d[Maxn + 5];
Edge *cpy[Maxn + 5];
ll cost;
void init(int n) {
ecnt = &pool[0];
node = n;
for (int i = 1; i <= n; i++)
G[i] = NULL;
}
bool vis[Maxn + 5];
int dfs(int u, int tot) {
if (u == t)
return tot;
vis[u] = true;
int sum = 0;
for (; cpy[u] != NULL; cpy[u] = cpy[u]->nxt) {
int v = cpy[u]->to, w = cpy[u]->cos;
if (!vis[v] && d[v] == d[u] + w && cpy[u]->cap > 0) {
int delta = dfs(v, min(tot - sum, cpy[u]->cap));
cpy[u]->cap -= delta, cpy[u]->bak->cap += delta;
cost += cpy[u]->cos * delta;
sum += delta;
if (sum == tot)
break;
}
}
vis[u] = false;
return sum;
}
bool spfa(int _s, int _t) {
static bool inq[Maxn + 5];
memset(inq, false, sizeof inq);
for (int i = 0; i <= node; i++)
d[i] = -INFLL, cpy[i] = G[i];
queue<int> q;
q.push(_s), d[_s] = 0, inq[_s] = true;
while (!q.empty()) {
int u = q.front();
q.pop(), inq[u] = false;
for (Edge *p = G[u]; p != NULL; p = p->nxt) {
int v = p->to;
if (p->cap > 0 && d[v] < d[u] + p->cos) {
d[v] = d[u] + p->cos;
if (!inq[v]) {
inq[v] = true;
q.push(v);
}
}
}
}
return d[_t] != -INFLL;
}
ll mcmf(int _s, int _t) {
s = _s, t = _t, cost = 0;
while (spfa(s, t)) {
memset(vis, false, sizeof vis);
dfs(s, INF);
}
return cost;
}
};
int N;
MinCostMaxFlow_Dinic f;
int main() {
#ifdef LOACL
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
scanf("%d", &N);
int S = 1, T = 2 * N + 6;
f.init(2 * N + 6);
for (int i = 1; i <= N; i++) {
int x, y, val;
scanf("%d %d %d", &x, &y, &val);
f.addedge(S, i + 1, val, 0);
f.addedge(i + 1, N + 2, INF, x + y);
f.addedge(i + 1, N + 3, INF, -x + y);
f.addedge(i + 1, N + 4, INF, x - y);
f.addedge(i + 1, N + 5, INF, -x - y);
}
for (int i = 1; i <= N; i++) {
int x, y, val;
scanf("%d %d %d", &x, &y, &val);
f.addedge(i + N + 5, T, val, 0);
f.addedge(N + 2, i + N + 5, INF, -x - y);
f.addedge(N + 3, i + N + 5, INF, x - y);
f.addedge(N + 4, i + N + 5, INF, -x + y);
f.addedge(N + 5, i + N + 5, INF, x + y);
}
printf("%lld\n", f.mcmf(S, T));
return 0;
} | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
typedef long long ll;
const int Maxn = 20004;
const int Maxm = 100000;
const ll INFLL = 0x3f3f3f3f3f3f3f3f;
const int INF = 0x7FFFFFFF;
struct MinCostMaxFlow_Dinic {
struct Edge {
int to, cap;
ll cos;
Edge *nxt, *bak;
};
Edge pool[Maxm + 5];
Edge *ecnt, *G[Maxn + 5];
inline void addedge(int u, int v, int cap, ll c) {
Edge *p = ++ecnt;
p->to = v, p->cap = cap, p->cos = c;
p->nxt = G[u], G[u] = p;
p->bak = p + 1;
p = ++ecnt;
p->to = u, p->cap = 0, p->cos = -c;
p->nxt = G[v], G[v] = p;
p->bak = p - 1;
}
int node, s, t;
ll d[Maxn + 5];
Edge *cpy[Maxn + 5];
ll cost;
void init(int n) {
ecnt = &pool[0];
node = n;
for (int i = 1; i <= n; i++)
G[i] = NULL;
}
bool vis[Maxn + 5];
int dfs(int u, int tot) {
if (u == t)
return tot;
vis[u] = true;
int sum = 0;
for (; cpy[u] != NULL; cpy[u] = cpy[u]->nxt) {
int v = cpy[u]->to, w = cpy[u]->cos;
if (!vis[v] && d[v] == d[u] + w && cpy[u]->cap > 0) {
int delta = dfs(v, min(tot - sum, cpy[u]->cap));
cpy[u]->cap -= delta, cpy[u]->bak->cap += delta;
cost += cpy[u]->cos * delta;
sum += delta;
if (sum == tot)
break;
}
}
vis[u] = false;
return sum;
}
bool spfa(int _s, int _t) {
static bool inq[Maxn + 5];
memset(inq, false, sizeof inq);
for (int i = 0; i <= node; i++)
d[i] = -INFLL, cpy[i] = G[i];
queue<int> q;
q.push(_s), d[_s] = 0, inq[_s] = true;
while (!q.empty()) {
int u = q.front();
q.pop(), inq[u] = false;
for (Edge *p = G[u]; p != NULL; p = p->nxt) {
int v = p->to;
if (p->cap > 0 && d[v] < d[u] + p->cos) {
d[v] = d[u] + p->cos;
if (!inq[v]) {
inq[v] = true;
q.push(v);
}
}
}
}
return d[_t] != -INFLL;
}
ll mcmf(int _s, int _t) {
s = _s, t = _t, cost = 0;
while (spfa(s, t)) {
memset(vis, false, sizeof vis);
dfs(s, INF);
}
return cost;
}
};
int N;
MinCostMaxFlow_Dinic f;
int main() {
#ifdef LOACL
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
scanf("%d", &N);
int S = 1, T = 2 * N + 6;
f.init(2 * N + 6);
for (int i = 1; i <= N; i++) {
int x, y, val;
scanf("%d %d %d", &x, &y, &val);
f.addedge(S, i + 1, val, 0);
f.addedge(i + 1, N + 2, INF, x + y);
f.addedge(i + 1, N + 3, INF, -x + y);
f.addedge(i + 1, N + 4, INF, x - y);
f.addedge(i + 1, N + 5, INF, -x - y);
}
for (int i = 1; i <= N; i++) {
int x, y, val;
scanf("%d %d %d", &x, &y, &val);
f.addedge(i + N + 5, T, val, 0);
f.addedge(N + 2, i + N + 5, INF, -x - y);
f.addedge(N + 3, i + N + 5, INF, x - y);
f.addedge(N + 4, i + N + 5, INF, -x + y);
f.addedge(N + 5, i + N + 5, INF, x + y);
}
printf("%lld\n", f.mcmf(S, T));
return 0;
} | replace | 7 | 9 | 7 | 9 | 0 | |
p03020 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fo(i, a, b) for (int i = a; i <= b; ++i)
#define fod(i, a, b) for (int i = a; i >= b; --i)
const int N = 2115;
const int INF = 1e7;
typedef long long LL;
using namespace std;
vector<int> ap[N];
int n, n1, st, ed, f[N][N];
LL ans, pr[N][N];
void link(int x, int y, int w, LL c) {
ap[x].push_back(y);
f[x][y] = w, pr[x][y] = c;
ap[y].push_back(x);
f[y][x] = 0, pr[y][x] = -c;
}
typedef vector<int>::iterator IT;
namespace Flow {
LL dis[N];
bool bz[N];
IT cur[N];
int d[N];
bool spfa() {
memset(dis, 107, sizeof(dis));
memset(bz, 0, sizeof(bz));
dis[st] = 0, bz[st] = 1, d[1] = st;
fo(i, 1, n1) cur[i] = ap[i].begin();
int l = 0, r = 1;
while (l < r) {
int k = d[++l];
for (IT i = ap[k].begin(); i != ap[k].end(); i++) {
int p = *i;
if (f[k][p] && dis[k] + pr[k][p] < dis[p]) {
dis[p] = dis[k] + pr[k][p];
if (!bz[p])
bz[p] = 1, d[++r] = p;
}
}
bz[k] = 0;
}
return (dis[ed] <= 1e17);
}
int flow(int k, int s) {
if (k == ed)
return s;
int sl = 0, v;
bz[k] = 1;
for (; cur[k] != ap[k].end(); cur[k]++) {
int p = *cur[k];
if (!bz[p] && f[k][p] && dis[p] == dis[k] + pr[k][p]) {
if (v = flow(p, min(s, f[k][p]))) {
sl += v, s -= v;
f[k][p] -= v, f[p][k] += v;
ans += (LL)v * pr[k][p];
if (!s)
break;
}
}
}
bz[k] = 0;
return sl;
}
} // namespace Flow
using Flow::flow;
using Flow::spfa;
int main() {
cin >> n;
n1 = 2 * n + 6, st = 2 * n + 5, ed = n1;
fo(i, 1, n) {
int x, y, z;
scanf("%d%d%d", &x, &y, &z);
link(st, i, z, 0);
link(i, 2 * n + 1, z, x + y);
link(i, 2 * n + 2, z, x - y);
link(i, 2 * n + 3, z, -x + y);
link(i, 2 * n + 4, z, -x - y);
}
fo(i, 1, n) {
int x, y, z;
scanf("%d%d%d", &x, &y, &z);
link(i + n, ed, z, 0);
link(2 * n + 1, i + n, z, -x - y);
link(2 * n + 2, i + n, z, -x + y);
link(2 * n + 3, i + n, z, x - y);
link(2 * n + 4, i + n, z, x + y);
}
ans = 0;
while (spfa())
flow(st, INF);
printf("%lld\n", -ans);
} | #include <bits/stdc++.h>
#define fo(i, a, b) for (int i = a; i <= b; ++i)
#define fod(i, a, b) for (int i = a; i >= b; --i)
const int N = 2115;
const int INF = 1e7;
typedef long long LL;
using namespace std;
vector<int> ap[N];
int n, n1, st, ed, f[N][N];
LL ans, pr[N][N];
void link(int x, int y, int w, LL c) {
ap[x].push_back(y);
f[x][y] = w, pr[x][y] = c;
ap[y].push_back(x);
f[y][x] = 0, pr[y][x] = -c;
}
typedef vector<int>::iterator IT;
namespace Flow {
LL dis[N];
bool bz[N];
IT cur[N];
int d[200 * N];
bool spfa() {
memset(dis, 107, sizeof(dis));
memset(bz, 0, sizeof(bz));
dis[st] = 0, bz[st] = 1, d[1] = st;
fo(i, 1, n1) cur[i] = ap[i].begin();
int l = 0, r = 1;
while (l < r) {
int k = d[++l];
for (IT i = ap[k].begin(); i != ap[k].end(); i++) {
int p = *i;
if (f[k][p] && dis[k] + pr[k][p] < dis[p]) {
dis[p] = dis[k] + pr[k][p];
if (!bz[p])
bz[p] = 1, d[++r] = p;
}
}
bz[k] = 0;
}
return (dis[ed] <= 1e17);
}
int flow(int k, int s) {
if (k == ed)
return s;
int sl = 0, v;
bz[k] = 1;
for (; cur[k] != ap[k].end(); cur[k]++) {
int p = *cur[k];
if (!bz[p] && f[k][p] && dis[p] == dis[k] + pr[k][p]) {
if (v = flow(p, min(s, f[k][p]))) {
sl += v, s -= v;
f[k][p] -= v, f[p][k] += v;
ans += (LL)v * pr[k][p];
if (!s)
break;
}
}
}
bz[k] = 0;
return sl;
}
} // namespace Flow
using Flow::flow;
using Flow::spfa;
int main() {
cin >> n;
n1 = 2 * n + 6, st = 2 * n + 5, ed = n1;
fo(i, 1, n) {
int x, y, z;
scanf("%d%d%d", &x, &y, &z);
link(st, i, z, 0);
link(i, 2 * n + 1, z, x + y);
link(i, 2 * n + 2, z, x - y);
link(i, 2 * n + 3, z, -x + y);
link(i, 2 * n + 4, z, -x - y);
}
fo(i, 1, n) {
int x, y, z;
scanf("%d%d%d", &x, &y, &z);
link(i + n, ed, z, 0);
link(2 * n + 1, i + n, z, -x - y);
link(2 * n + 2, i + n, z, -x + y);
link(2 * n + 3, i + n, z, x - y);
link(2 * n + 4, i + n, z, x + y);
}
ans = 0;
while (spfa())
flow(st, INF);
printf("%lld\n", -ans);
} | replace | 21 | 22 | 21 | 22 | 0 | |
p03020 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
typedef long long ll;
namespace CF {
#define ad(x) ((x - 1 ^ 1) + 1)
const int N = 2054, M = 8000054;
const ll INF = 0x3f3f3f3f3f3f3f3fll;
struct edge {
int u, v, c, f;
edge(int u0 = 0, int v0 = 0, int c0 = 0, int f0 = 0)
: u(u0), v(v0), c(c0), f(f0) {}
} e[M];
int V, E, si = 1, ti = 2;
ll flow, cost;
int first[N], next[M];
int cur[N], que[M << 1];
ll dep[N];
bool in_que[N], used[N];
inline void addedge(int u, int v, int c, int f) {
e[++E] = edge(u, v, c, f), next[E] = first[u], first[u] = E;
e[++E] = edge(v, u, -c), next[E] = first[v], first[v] = E;
}
bool bfs() {
int h = M, t = h + 1, i, x, y;
memset(dep, 63, sizeof dep);
que[h] = ti, dep[ti] = 0, in_que[ti] = true;
for (; h < t;) {
x = que[h++], in_que[x] = false;
for (i = first[x]; i; i = next[i])
if (dep[y = e[i].v] > dep[x] - e[i].c && e[ad(i)].f) {
dep[y] = dep[x] - e[i].c;
if (!in_que[y])
in_que[y] = true, (dep[y] >= dep[que[h]] ? que[t++] : que[--h]) = y;
}
}
return dep[si] < INF;
}
int dfs(int x, int lim) {
int a, c, f = 0;
if (x == ti || !lim)
return lim;
used[x] = true;
for (int &i = cur[x]; i; i = next[i])
if (dep[e[i].v] == dep[x] - e[i].c && e[i].f && !used[e[i].v]) {
a = std::min(lim - f, e[i].f);
c = dfs(e[i].v, a);
e[i].f -= c, e[ad(i)].f += c;
if ((f += c) == lim)
return f;
}
return f;
}
void Dinic() {
int f;
for (cost = flow = 0; bfs();) {
memcpy(cur, first, sizeof cur);
memset(used, 0, sizeof used);
flow += f = dfs(si, INT_MAX);
cost += dep[si] * f;
}
}
} // namespace CF
int main() {
int i, n, w, x, y;
scanf("%d", &n);
for (i = 3; i < 3 + n; ++i) {
scanf("%d%d%d", &x, &y, &w);
CF::addedge(1, i, 0, w);
CF::addedge(i, 3 + n * 2, x + y, w);
CF::addedge(i, 4 + n * 2, x - y, w);
CF::addedge(i, 5 + n * 2, -x + y, w);
CF::addedge(i, 6 + n * 2, -x - y, w);
}
for (; i < 3 + n * 2; ++i) {
scanf("%d%d%d", &x, &y, &w);
CF::addedge(i, 2, 0, w);
CF::addedge(3 + n * 2, i, -x - y, w);
CF::addedge(4 + n * 2, i, -x + y, w);
CF::addedge(5 + n * 2, i, x - y, w);
CF::addedge(6 + n * 2, i, x + y, w);
}
CF::Dinic(), printf("%lld\n", -CF::cost);
return 0;
} | #include <bits/stdc++.h>
typedef long long ll;
namespace CF {
#define ad(x) ((x - 1 ^ 1) + 1)
const int N = 2054, M = 8000054;
const ll INF = 0x3f3f3f3f3f3f3f3fll;
struct edge {
int u, v, c, f;
edge(int u0 = 0, int v0 = 0, int c0 = 0, int f0 = 0)
: u(u0), v(v0), c(c0), f(f0) {}
} e[M];
int V, E, si = 1, ti = 2;
ll flow, cost;
int first[N], next[M];
int cur[N], que[M << 1];
ll dep[N];
bool in_que[N], used[N];
inline void addedge(int u, int v, int c, int f) {
e[++E] = edge(u, v, c, f), next[E] = first[u], first[u] = E;
e[++E] = edge(v, u, -c), next[E] = first[v], first[v] = E;
}
bool bfs() {
int h = M, t = h + 1, i, x, y;
memset(dep, 63, sizeof dep);
que[h] = ti, dep[ti] = 0, in_que[ti] = true;
for (; h < t;) {
x = que[h++], in_que[x] = false;
for (i = first[x]; i; i = next[i])
if (dep[y = e[i].v] > dep[x] - e[i].c && e[ad(i)].f) {
dep[y] = dep[x] - e[i].c;
if (!in_que[y])
in_que[y] = true,
(1 || dep[y] >= dep[que[h]] ? que[t++] : que[--h]) = y;
}
}
return dep[si] < INF;
}
int dfs(int x, int lim) {
int a, c, f = 0;
if (x == ti || !lim)
return lim;
used[x] = true;
for (int &i = cur[x]; i; i = next[i])
if (dep[e[i].v] == dep[x] - e[i].c && e[i].f && !used[e[i].v]) {
a = std::min(lim - f, e[i].f);
c = dfs(e[i].v, a);
e[i].f -= c, e[ad(i)].f += c;
if ((f += c) == lim)
return f;
}
return f;
}
void Dinic() {
int f;
for (cost = flow = 0; bfs();) {
memcpy(cur, first, sizeof cur);
memset(used, 0, sizeof used);
flow += f = dfs(si, INT_MAX);
cost += dep[si] * f;
}
}
} // namespace CF
int main() {
int i, n, w, x, y;
scanf("%d", &n);
for (i = 3; i < 3 + n; ++i) {
scanf("%d%d%d", &x, &y, &w);
CF::addedge(1, i, 0, w);
CF::addedge(i, 3 + n * 2, x + y, w);
CF::addedge(i, 4 + n * 2, x - y, w);
CF::addedge(i, 5 + n * 2, -x + y, w);
CF::addedge(i, 6 + n * 2, -x - y, w);
}
for (; i < 3 + n * 2; ++i) {
scanf("%d%d%d", &x, &y, &w);
CF::addedge(i, 2, 0, w);
CF::addedge(3 + n * 2, i, -x - y, w);
CF::addedge(4 + n * 2, i, -x + y, w);
CF::addedge(5 + n * 2, i, x - y, w);
CF::addedge(6 + n * 2, i, x + y, w);
}
CF::Dinic(), printf("%lld\n", -CF::cost);
return 0;
} | replace | 38 | 39 | 38 | 40 | TLE | |
p03020 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <climits>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
struct Edge {
int to, pair, flow;
long long int cost;
Edge(const int t, const int p, const int f, const long long int c)
: to{t}, pair{p}, cost{c}, flow{f} {};
};
struct Coordinate {
int x, y;
};
void add_edge(std::vector<std::vector<Edge>> &nodes, const int from,
const int to, const int flow, const long long int cost) {
nodes[from].emplace_back(to, nodes[to].size(), flow, cost);
nodes[to].emplace_back(from, nodes[from].size() - 1, 0, -cost);
}
std::vector<std::vector<Edge>>
make_network(const std::vector<std::pair<Coordinate, int>> &reds,
const std::vector<std::pair<Coordinate, int>> &blues) {
const int mid = reds.size() + blues.size();
const int source = mid + 4;
const int drain = source + 1;
std::vector<std::vector<Edge>> result(drain + 1);
for (auto i = 0; i < reds.size(); ++i) {
add_edge(result, source, i, reds[i].second, 0);
}
for (auto i = 0; i < blues.size(); ++i) {
add_edge(result, i + reds.size(), drain, blues[i].second, 0);
}
for (auto t = 0; t < 4; ++t) {
long long int x = ((t & 2) == 0) ? 1L : -1L;
long long int y = ((t & 1) == 0) ? 1L : -1L;
for (auto i = 0; i < reds.size(); ++i) {
add_edge(result, i, mid + t, reds[i].second,
2000000000LL + x * reds[i].first.x + y * reds[i].first.y);
add_edge(result, mid + t, i + reds.size(), blues[i].second,
2000000000LL - x * blues[i].first.x - y * blues[i].first.y);
}
}
return result;
}
long long int cal_min_cost_maxflow(std::vector<std::vector<Edge>> nodes) {
const int source = nodes.size() - 2;
const int drain = source + 1;
std::vector<long long int> potential(nodes.size(), 0),
min_cost(nodes.size(), LLONG_MAX);
std::vector<Edge *> prev(nodes.size(), nullptr);
std::priority_queue<std::pair<long long int, int>,
std::vector<std::pair<long long int, int>>,
std::function<bool(const std::pair<long long int, int>,
const std::pair<long long int, int>)>>
queue([](const std::pair<long long int, int> a,
const std::pair<long long int, int> b) {
return a.first > b.first;
});
long long int result = 0L;
while (true) {
min_cost[source] = 0;
queue.emplace(0, source);
while (!queue.empty()) {
auto cost = queue.top().first;
auto current = queue.top().second;
queue.pop();
if (min_cost[current] == cost && current != drain) {
for (const auto &next : nodes[current])
if (next.flow > 0) {
if (min_cost[next.to] >
potential[next.to] + cost + next.cost - potential[current]) {
min_cost[next.to] =
potential[next.to] + cost + next.cost - potential[current];
prev[next.to] = &nodes[next.to][next.pair];
queue.emplace(min_cost[next.to], next.to);
}
}
}
}
if (min_cost[drain] == LLONG_MAX)
return result;
auto last = drain;
auto min_flow = INT_MAX;
while (last != source) {
min_flow =
std::min(nodes[prev[last]->to][prev[last]->pair].flow, min_flow);
last = prev[last]->to;
}
result += min_flow * min_cost[drain];
last = drain;
while (last != source) {
auto e = prev[last];
e->flow += min_flow;
nodes[e->to][e->pair].flow -= min_flow;
last = e->to;
}
for (auto i = 0; i < nodes.size(); ++i) {
if (i != drain && min_cost[i] != LLONG_MAX)
potential[i] += min_cost[i];
}
std::fill(min_cost.begin(), min_cost.end(), LLONG_MAX);
}
}
int main() {
int n;
std::cin >> n;
std::vector<std::pair<Coordinate, int>> reds(n), blues(n);
for (auto &r : reds)
std::cin >> r.first.x >> r.first.y >> r.second;
for (auto &b : blues)
std::cin >> b.first.x >> b.first.y >> b.second;
long long int count = 0LL;
for (const auto r : reds)
count += r.second;
std::cout << count * 4000000000LL -
cal_min_cost_maxflow(make_network(reds, blues))
<< std::endl;
} | #include <algorithm>
#include <array>
#include <climits>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
struct Edge {
int to, pair, flow;
long long int cost;
Edge(const int t, const int p, const int f, const long long int c)
: to{t}, pair{p}, cost{c}, flow{f} {};
};
struct Coordinate {
int x, y;
};
void add_edge(std::vector<std::vector<Edge>> &nodes, const int from,
const int to, const int flow, const long long int cost) {
nodes[from].emplace_back(to, nodes[to].size(), flow, cost);
nodes[to].emplace_back(from, nodes[from].size() - 1, 0, -cost);
}
std::vector<std::vector<Edge>>
make_network(const std::vector<std::pair<Coordinate, int>> &reds,
const std::vector<std::pair<Coordinate, int>> &blues) {
const int mid = reds.size() + blues.size();
const int source = mid + 4;
const int drain = source + 1;
std::vector<std::vector<Edge>> result(drain + 1);
for (auto i = 0; i < reds.size(); ++i) {
add_edge(result, source, i, reds[i].second, 0);
}
for (auto i = 0; i < blues.size(); ++i) {
add_edge(result, i + reds.size(), drain, blues[i].second, 0);
}
for (auto t = 0; t < 4; ++t) {
long long int x = ((t & 2) == 0) ? 1L : -1L;
long long int y = ((t & 1) == 0) ? 1L : -1L;
for (auto i = 0; i < reds.size(); ++i) {
add_edge(result, i, mid + t, reds[i].second,
2000000000LL + x * reds[i].first.x + y * reds[i].first.y);
add_edge(result, mid + t, i + reds.size(), blues[i].second,
2000000000LL - x * blues[i].first.x - y * blues[i].first.y);
}
}
return result;
}
long long int cal_min_cost_maxflow(std::vector<std::vector<Edge>> nodes) {
const int source = nodes.size() - 2;
const int drain = source + 1;
std::vector<long long int> potential(nodes.size(), 0),
min_cost(nodes.size(), LLONG_MAX);
std::vector<Edge *> prev(nodes.size(), nullptr);
std::priority_queue<std::pair<long long int, int>,
std::vector<std::pair<long long int, int>>,
std::function<bool(const std::pair<long long int, int>,
const std::pair<long long int, int>)>>
queue([](const std::pair<long long int, int> a,
const std::pair<long long int, int> b) {
return a.first > b.first;
});
long long int result = 0L;
while (true) {
min_cost[source] = 0;
queue.emplace(0, source);
while (!queue.empty()) {
auto cost = queue.top().first;
auto current = queue.top().second;
queue.pop();
if (min_cost[current] == cost && current != drain) {
for (const auto &next : nodes[current])
if (next.flow > 0) {
if (min_cost[next.to] >
potential[next.to] + cost + next.cost - potential[current]) {
min_cost[next.to] =
potential[next.to] + cost + next.cost - potential[current];
prev[next.to] = &nodes[next.to][next.pair];
queue.emplace(min_cost[next.to], next.to);
}
}
}
}
if (min_cost[drain] == LLONG_MAX)
return result;
auto last = drain;
auto min_flow = INT_MAX;
while (last != source) {
min_flow =
std::min(nodes[prev[last]->to][prev[last]->pair].flow, min_flow);
last = prev[last]->to;
}
result += min_flow * min_cost[drain];
last = drain;
while (last != source) {
auto e = prev[last];
e->flow += min_flow;
nodes[e->to][e->pair].flow -= min_flow;
last = e->to;
}
for (auto i = 0; i < nodes.size(); ++i) {
if (i != drain && min_cost[i] != LLONG_MAX)
potential[i] -= min_cost[i];
}
std::fill(min_cost.begin(), min_cost.end(), LLONG_MAX);
}
}
int main() {
int n;
std::cin >> n;
std::vector<std::pair<Coordinate, int>> reds(n), blues(n);
for (auto &r : reds)
std::cin >> r.first.x >> r.first.y >> r.second;
for (auto &b : blues)
std::cin >> b.first.x >> b.first.y >> b.second;
long long int count = 0LL;
for (const auto r : reds)
count += r.second;
std::cout << count * 4000000000LL -
cal_min_cost_maxflow(make_network(reds, blues))
<< std::endl;
} | replace | 110 | 111 | 110 | 111 | TLE | |
p03020 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fo(i, a, b) for (int i = a, _e = b; i <= _e; ++i)
#define fd(i, a, b) for (int i = b, _e = a; i >= _e; --i)
#define ll long long
using namespace std;
const int N = 1005;
int n, x, y, w, i, js, la[N], T;
int d[N * N], fr[N];
ll ans, f[N];
bool vi[N];
struct edge {
int ne, y, l, c;
} e[N * 20];
void link(int x, int y, int l, int c) {
e[++js] = (edge){la[x], y, l, c};
la[x] = js;
e[++js] = (edge){la[y], x, 0, -c};
la[y] = js;
}
int main() {
cin >> n;
js = 1;
T = n + n + 5;
fo(i, 1, n) {
cin >> x >> y >> w;
link(0, i, w, 0);
link(i, n + n + 1, w, -x - y);
link(i, n + n + 2, w, -x + y);
link(i, n + n + 3, w, x - y);
link(i, n + n + 4, w, x + y);
}
fo(i, 1, n) {
cin >> x >> y >> w;
link(n + i, T, w, 0);
link(n + n + 1, n + i, w, x + y);
link(n + n + 2, n + i, w, x - y);
link(n + n + 3, n + i, w, -x + y);
link(n + n + 4, n + i, w, -x - y);
}
for (;;) {
fo(i, 0, T) f[i] = 1e18;
f[0] = 0;
vi[0] = 1;
for (int l = 0, r = 1, x, y; x = d[++l], l <= r; vi[x] = 0)
for (int i = la[x]; i; i = e[i].ne)
if (e[i].l && f[x] + e[i].c < f[y = e[i].y]) {
f[y] = f[x] + e[i].c;
fr[y] = i ^ 1;
if (!vi[y])
d[++r] = y, vi[y] = 1;
}
if (f[T] == 1e18)
break;
int mi = 10000;
for (int x = T; x; x = e[fr[x]].y)
mi = min(mi, e[fr[x] ^ 1].l);
ans += f[T] * mi;
for (int x = T; x; x = e[fr[x]].y)
e[fr[x]].l += mi, e[fr[x] ^ 1].l -= mi;
}
cout << -ans;
} | #include <bits/stdc++.h>
#define fo(i, a, b) for (int i = a, _e = b; i <= _e; ++i)
#define fd(i, a, b) for (int i = b, _e = a; i >= _e; --i)
#define ll long long
using namespace std;
const int N = 1005;
int n, x, y, w, i, js, la[N * 2], T;
int d[N * N * 2], fr[N * 2];
ll ans, f[N * 2];
bool vi[N * 2];
struct edge {
int ne, y, l, c;
} e[N * 20];
void link(int x, int y, int l, int c) {
e[++js] = (edge){la[x], y, l, c};
la[x] = js;
e[++js] = (edge){la[y], x, 0, -c};
la[y] = js;
}
int main() {
cin >> n;
js = 1;
T = n + n + 5;
fo(i, 1, n) {
cin >> x >> y >> w;
link(0, i, w, 0);
link(i, n + n + 1, w, -x - y);
link(i, n + n + 2, w, -x + y);
link(i, n + n + 3, w, x - y);
link(i, n + n + 4, w, x + y);
}
fo(i, 1, n) {
cin >> x >> y >> w;
link(n + i, T, w, 0);
link(n + n + 1, n + i, w, x + y);
link(n + n + 2, n + i, w, x - y);
link(n + n + 3, n + i, w, -x + y);
link(n + n + 4, n + i, w, -x - y);
}
for (;;) {
fo(i, 0, T) f[i] = 1e18;
f[0] = 0;
vi[0] = 1;
for (int l = 0, r = 1, x, y; x = d[++l], l <= r; vi[x] = 0)
for (int i = la[x]; i; i = e[i].ne)
if (e[i].l && f[x] + e[i].c < f[y = e[i].y]) {
f[y] = f[x] + e[i].c;
fr[y] = i ^ 1;
if (!vi[y])
d[++r] = y, vi[y] = 1;
}
if (f[T] == 1e18)
break;
int mi = 10000;
for (int x = T; x; x = e[fr[x]].y)
mi = min(mi, e[fr[x] ^ 1].l);
ans += f[T] * mi;
for (int x = T; x; x = e[fr[x]].y)
e[fr[x]].l += mi, e[fr[x] ^ 1].l -= mi;
}
cout << -ans;
} | replace | 6 | 10 | 6 | 10 | 0 | |
p03020 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long LL;
const LL MAX = 1e17;
const LL N = 1100;
struct qq {
LL x, y, z, z1, last;
} e[N * 10];
LL num, last[N];
void init(LL x, LL y, LL z, LL z1) {
num++;
e[num].x = x;
e[num].y = y;
e[num].z = z;
e[num].z1 = z1;
e[num].last = last[x];
last[x] = num;
swap(x, y);
z = 0;
z1 = -z1;
num++;
e[num].x = x;
e[num].y = y;
e[num].z = z;
e[num].z1 = z1;
e[num].last = last[x];
last[x] = num;
}
LL from[N];
LL f[N];
bool in[N];
LL st, ed;
bool SPFA() {
for (LL u = 1; u <= ed; u++)
from[u] = -1, f[u] = -MAX, in[u] = false;
queue<int> q;
q.push(st);
f[st] = 0;
in[st] = true;
while (!q.empty()) {
LL x = q.front();
q.pop();
for (LL u = last[x]; u != -1; u = e[u].last) {
LL y = e[u].y;
if (e[u].z > 0 && f[y] < f[x] + e[u].z1) {
f[y] = f[x] + e[u].z1;
from[y] = u;
if (in[y] == false) {
in[y] = true;
q.push(y);
}
}
}
in[x] = false;
}
return from[ed] != -1;
}
LL ans = 0;
void lalal() {
// printf("YES!\n");
LL x = from[ed], t = MAX;
while (x != -1) {
t = min(t, e[x].z);
x = from[e[x].x];
}
x = from[ed];
while (x != -1) {
ans = ans + t * e[x].z1;
e[x].z -= t;
e[x ^ 1].z += t;
x = from[e[x].x];
}
return;
}
int main() {
num = 1;
memset(last, -1, sizeof(last));
LL n;
scanf("%lld", &n);
st = 2 * n + 10 + 1;
ed = st + 1;
LL cnt = 0;
for (LL u = 1; u <= n; u++) {
LL x, y, c;
scanf("%lld%lld%lld", &x, &y, &c);
init(st, u, c, 0);
init(u, 2 * n + 1, MAX, x + y);
init(u, 2 * n + 2, MAX, x - y);
init(u, 2 * n + 3, MAX, -x + y);
init(u, 2 * n + 4, MAX, -x - y);
}
for (LL u = 1; u <= n; u++) {
LL x, y, c;
scanf("%lld%lld%lld", &x, &y, &c);
init(u + n, ed, c, 0);
init(2 * n + 1 + 4, u + n, MAX, x + y);
init(2 * n + 2 + 4, u + n, MAX, x - y);
init(2 * n + 3 + 4, u + n, MAX, -x + y);
init(2 * n + 4 + 4, u + n, MAX, -x - y);
}
init(2 * n + 1, 2 * n + 4 + 4, MAX, 0);
init(2 * n + 2, 2 * n + 3 + 4, MAX, 0);
init(2 * n + 3, 2 * n + 2 + 4, MAX, 0);
init(2 * n + 4, 2 * n + 1 + 4, MAX, 0);
while (SPFA())
lalal();
printf("%lld\n", ans);
return 0;
} | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long LL;
const LL MAX = 1e17;
const LL N = 2100;
struct qq {
LL x, y, z, z1, last;
} e[N * 10];
LL num, last[N];
void init(LL x, LL y, LL z, LL z1) {
num++;
e[num].x = x;
e[num].y = y;
e[num].z = z;
e[num].z1 = z1;
e[num].last = last[x];
last[x] = num;
swap(x, y);
z = 0;
z1 = -z1;
num++;
e[num].x = x;
e[num].y = y;
e[num].z = z;
e[num].z1 = z1;
e[num].last = last[x];
last[x] = num;
}
LL from[N];
LL f[N];
bool in[N];
LL st, ed;
bool SPFA() {
for (LL u = 1; u <= ed; u++)
from[u] = -1, f[u] = -MAX, in[u] = false;
queue<int> q;
q.push(st);
f[st] = 0;
in[st] = true;
while (!q.empty()) {
LL x = q.front();
q.pop();
for (LL u = last[x]; u != -1; u = e[u].last) {
LL y = e[u].y;
if (e[u].z > 0 && f[y] < f[x] + e[u].z1) {
f[y] = f[x] + e[u].z1;
from[y] = u;
if (in[y] == false) {
in[y] = true;
q.push(y);
}
}
}
in[x] = false;
}
return from[ed] != -1;
}
LL ans = 0;
void lalal() {
// printf("YES!\n");
LL x = from[ed], t = MAX;
while (x != -1) {
t = min(t, e[x].z);
x = from[e[x].x];
}
x = from[ed];
while (x != -1) {
ans = ans + t * e[x].z1;
e[x].z -= t;
e[x ^ 1].z += t;
x = from[e[x].x];
}
return;
}
int main() {
num = 1;
memset(last, -1, sizeof(last));
LL n;
scanf("%lld", &n);
st = 2 * n + 10 + 1;
ed = st + 1;
LL cnt = 0;
for (LL u = 1; u <= n; u++) {
LL x, y, c;
scanf("%lld%lld%lld", &x, &y, &c);
init(st, u, c, 0);
init(u, 2 * n + 1, MAX, x + y);
init(u, 2 * n + 2, MAX, x - y);
init(u, 2 * n + 3, MAX, -x + y);
init(u, 2 * n + 4, MAX, -x - y);
}
for (LL u = 1; u <= n; u++) {
LL x, y, c;
scanf("%lld%lld%lld", &x, &y, &c);
init(u + n, ed, c, 0);
init(2 * n + 1 + 4, u + n, MAX, x + y);
init(2 * n + 2 + 4, u + n, MAX, x - y);
init(2 * n + 3 + 4, u + n, MAX, -x + y);
init(2 * n + 4 + 4, u + n, MAX, -x - y);
}
init(2 * n + 1, 2 * n + 4 + 4, MAX, 0);
init(2 * n + 2, 2 * n + 3 + 4, MAX, 0);
init(2 * n + 3, 2 * n + 2 + 4, MAX, 0);
init(2 * n + 4, 2 * n + 1 + 4, MAX, 0);
while (SPFA())
lalal();
printf("%lld\n", ans);
return 0;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p03020 | C++ | Time Limit Exceeded | #include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
typedef long long ll;
const int maxn = 2000, maxm = 20005;
const ll inf = 1e11;
struct Edge {
Edge() {}
Edge(int a, int b, ll c, int d) {
v = a;
f = b;
w = c;
nxt = d;
}
int v, f, w, nxt;
};
int n, lmt;
int g[maxn + 10];
Edge e[maxm + 10];
int nume = 1;
int src, sink;
void addedge(int u, int v, int c, ll w) {
e[++nume] = Edge(v, c, w, g[u]);
g[u] = nume;
e[++nume] = Edge(u, 0, -w, g[v]);
g[v] = nume;
}
queue<int> que;
bool inq[maxn + 10];
ll dist[maxn + 10];
int prv[maxn + 10], pree[maxn + 10];
bool findpath() {
while (!que.empty())
que.pop();
que.push(src);
// memset(dist,63,sizeof dist);
for (int i = 0; i < maxn; ++i)
dist[i] = inf;
dist[src] = 0;
inq[src] = true;
while (!que.empty()) {
int u = que.front();
que.pop();
for (int i = g[u]; i; i = e[i].nxt) {
if (e[i].f > 0 && dist[u] + e[i].w < dist[e[i].v]) {
dist[e[i].v] = dist[u] + e[i].w;
prv[e[i].v] = u;
pree[e[i].v] = i;
if (!inq[e[i].v]) {
inq[e[i].v] = true;
que.push(e[i].v);
}
}
}
inq[u] = false;
}
if (dist[sink] < inf)
return true;
else
return false;
}
ll augment() {
int u = sink;
ll delta = inf;
while (u != src) {
if (e[pree[u]].f < delta)
delta = e[pree[u]].f;
u = prv[u];
}
u = sink;
while (u != src) {
e[pree[u]].f -= delta;
e[pree[u] ^ 1].f += delta;
u = prv[u];
}
return dist[sink] * delta;
}
ll mincostflow() {
ll cur = 0, ans = 0;
while (findpath()) {
cur += augment();
if (cur < ans)
ans = cur;
}
return ans;
}
int main() {
scanf("%d", &n);
src = 2 * n + 1, sink = 2 * n + 2;
for (int i = 1; i <= n; ++i) {
int x, y, c;
scanf("%d%d%d", &x, &y, &c);
addedge(2 * n + 1, i, c, 0);
addedge(i, 2 * n + 3, c, x + y);
addedge(i, 2 * n + 4, c, x - y);
addedge(i, 2 * n + 5, c, -x + y);
addedge(i, 2 * n + 6, c, -x - y);
}
for (int i = 1; i <= n; ++i) {
int x, y, c;
scanf("%d%d%d", &x, &y, &c);
addedge(n + i, 2 * n + 2, c, 0);
addedge(2 * n + 3, n + i, c, -x - y);
addedge(2 * n + 4, n + i, c, -x + y);
addedge(2 * n + 5, n + i, c, x - y);
addedge(2 * n + 6, n + i, c, x + y);
}
ll res = mincostflow();
printf("%lld", -res);
return 0;
}
| #include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
typedef long long ll;
const int maxn = 2000, maxm = 20005;
const ll inf = 1e11;
struct Edge {
Edge() {}
Edge(int a, int b, ll c, int d) {
v = a;
f = b;
w = c;
nxt = d;
}
int v, f, w, nxt;
};
int n, lmt;
int g[maxn + 10];
Edge e[maxm + 10];
int nume = 1;
int src, sink;
void addedge(int u, int v, int c, ll w) {
e[++nume] = Edge(v, c, w, g[u]);
g[u] = nume;
e[++nume] = Edge(u, 0, -w, g[v]);
g[v] = nume;
}
queue<int> que;
bool inq[maxn + 10];
ll dist[maxn + 10];
int prv[maxn + 10], pree[maxn + 10];
bool findpath() {
while (!que.empty())
que.pop();
que.push(src);
memset(dist, 63, sizeof dist);
// for(int i = 0;i < maxn; ++i) dist[i] = inf;
dist[src] = 0;
inq[src] = true;
while (!que.empty()) {
int u = que.front();
que.pop();
for (int i = g[u]; i; i = e[i].nxt) {
if (e[i].f > 0 && dist[u] + e[i].w < dist[e[i].v]) {
dist[e[i].v] = dist[u] + e[i].w;
prv[e[i].v] = u;
pree[e[i].v] = i;
if (!inq[e[i].v]) {
inq[e[i].v] = true;
que.push(e[i].v);
}
}
}
inq[u] = false;
}
if (dist[sink] < inf)
return true;
else
return false;
}
ll augment() {
int u = sink;
ll delta = inf;
while (u != src) {
if (e[pree[u]].f < delta)
delta = e[pree[u]].f;
u = prv[u];
}
u = sink;
while (u != src) {
e[pree[u]].f -= delta;
e[pree[u] ^ 1].f += delta;
u = prv[u];
}
return dist[sink] * delta;
}
ll mincostflow() {
ll cur = 0, ans = 0;
while (findpath()) {
cur += augment();
if (cur < ans)
ans = cur;
}
return ans;
}
int main() {
scanf("%d", &n);
src = 2 * n + 1, sink = 2 * n + 2;
for (int i = 1; i <= n; ++i) {
int x, y, c;
scanf("%d%d%d", &x, &y, &c);
addedge(2 * n + 1, i, c, 0);
addedge(i, 2 * n + 3, c, x + y);
addedge(i, 2 * n + 4, c, x - y);
addedge(i, 2 * n + 5, c, -x + y);
addedge(i, 2 * n + 6, c, -x - y);
}
for (int i = 1; i <= n; ++i) {
int x, y, c;
scanf("%d%d%d", &x, &y, &c);
addedge(n + i, 2 * n + 2, c, 0);
addedge(2 * n + 3, n + i, c, -x - y);
addedge(2 * n + 4, n + i, c, -x + y);
addedge(2 * n + 5, n + i, c, x - y);
addedge(2 * n + 6, n + i, c, x + y);
}
ll res = mincostflow();
printf("%lld", -res);
return 0;
}
| replace | 42 | 45 | 42 | 44 | TLE | |
p03021 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int N = 2000 + 5;
int n;
char s[N];
vector<int> v[N];
int sum;
void dfs(int p, int x, int d) {
if (s[x] == '1') {
sum += d;
}
for (auto u : v[x]) {
if (u != p) {
dfs(x, u, d + 1);
}
}
}
priority_queue<int> q[N];
void dfs2(int p, int x, int d, int &need) {
if (s[x] == '1') {
q[x].push(d);
}
for (auto u : v[x]) {
if (u != p) {
dfs2(x, u, d + 1, need);
while (q[x].size() and q[x].top() > d and q[u].size() and
q[u].top() > d) {
int v = -1;
v = q[x].top();
q[x].pop();
q[x].push(v - 1);
v = q[u].top();
q[u].pop();
q[u].push(v - 1);
need -= 2;
}
while (q[u].size()) {
q[x].push(q[u].top());
q[u].pop();
}
}
}
}
/*
6
101011
1 2
2 3
2 4
4 5
4 6
7
1111000
1 7
2 7
6 7
5 6
3 5
4 5
*/
int main() {
scanf("%d", &n);
scanf("%s", s + 1);
for (int i = 1; i < n; i++) {
int x, y;
scanf("%d %d", &x, &y);
v[x].push_back(y);
v[y].push_back(x);
}
int ans = 1e9;
for (int i = 1; i <= n; i++) {
// vector<priority_queue<int>> q(v[i].size());
// priority_queue<ii> vals;
priority_queue<int> vals;
int id = 0;
int sum_all = 0;
vector<ii> sums;
for (auto u : v[i]) {
sum = 0;
dfs(i, u, 1);
sums.push_back({sum, u});
sum_all += sum;
// if(!q[id].empty()) {
// vals.push({q[id].top(), id});
// }
if (sum) {
vals.push(sum);
}
id++;
}
// auto del = [&](int x) {
// int top = q[x].top();
// q[x].pop();
// if(top > 1)
// q[x].push(top - 1);
// // printf("pop %d->%d\n", x, top);
// if(q[x].size()) {
// // printf("add %d\n", q[x].top());
// vals.push({q[x].top(), x});
// }
// };
// int res = 0;
// while(vals.size() > 1) {
// // int x = vals.top().second; vals.pop();
// // int y = vals.top().second; vals.pop();
// int x = vals.top(); vals.pop();
// int y = vals.top(); vals.pop();
// // del(x);
// // del(y);
// if(x > 1)
// vals.push(x - 1);
// if(y > 1)
// vals.push(y - 1);
// res++;
// }
// if(vals.empty())
// ans = min(ans, res);
if (sum_all % 2)
continue;
id = -1;
int id_sum = 0;
for (auto x : sums) {
if (x.first > sum_all - x.first) {
id_sum = x.first;
id = x.second;
}
}
if (id == -1) {
ans = min(ans, sum_all / 2);
continue;
}
int need = id_sum - (sum_all - id_sum);
for (int i = 1; i <= n; i++) {
while (q[i].size())
q[i].pop();
}
dfs2(i, id, 1, need);
if (need <= 0)
ans = min(ans, sum_all / 2);
}
printf("%d\n", ans > 8e8 ? -1 : ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int N = 2000 + 5;
int n;
char s[N];
vector<int> v[N];
int sum;
void dfs(int p, int x, int d) {
if (s[x] == '1') {
sum += d;
}
for (auto u : v[x]) {
if (u != p) {
dfs(x, u, d + 1);
}
}
}
priority_queue<int> q[N];
void dfs2(int p, int x, int d, int &need) {
if (s[x] == '1') {
q[x].push(d);
}
for (auto u : v[x]) {
if (u != p) {
dfs2(x, u, d + 1, need);
while (q[x].size() and q[x].top() > d and q[u].size() and
q[u].top() > d) {
int v = -1;
v = q[x].top();
q[x].pop();
q[x].push(v - 1);
v = q[u].top();
q[u].pop();
q[u].push(v - 1);
need -= 2;
}
if (q[u].size() > q[x].size())
swap(q[x], q[u]);
while (q[u].size()) {
q[x].push(q[u].top());
q[u].pop();
}
}
}
}
/*
6
101011
1 2
2 3
2 4
4 5
4 6
7
1111000
1 7
2 7
6 7
5 6
3 5
4 5
*/
int main() {
scanf("%d", &n);
scanf("%s", s + 1);
for (int i = 1; i < n; i++) {
int x, y;
scanf("%d %d", &x, &y);
v[x].push_back(y);
v[y].push_back(x);
}
int ans = 1e9;
for (int i = 1; i <= n; i++) {
// vector<priority_queue<int>> q(v[i].size());
// priority_queue<ii> vals;
priority_queue<int> vals;
int id = 0;
int sum_all = 0;
vector<ii> sums;
for (auto u : v[i]) {
sum = 0;
dfs(i, u, 1);
sums.push_back({sum, u});
sum_all += sum;
// if(!q[id].empty()) {
// vals.push({q[id].top(), id});
// }
if (sum) {
vals.push(sum);
}
id++;
}
// auto del = [&](int x) {
// int top = q[x].top();
// q[x].pop();
// if(top > 1)
// q[x].push(top - 1);
// // printf("pop %d->%d\n", x, top);
// if(q[x].size()) {
// // printf("add %d\n", q[x].top());
// vals.push({q[x].top(), x});
// }
// };
// int res = 0;
// while(vals.size() > 1) {
// // int x = vals.top().second; vals.pop();
// // int y = vals.top().second; vals.pop();
// int x = vals.top(); vals.pop();
// int y = vals.top(); vals.pop();
// // del(x);
// // del(y);
// if(x > 1)
// vals.push(x - 1);
// if(y > 1)
// vals.push(y - 1);
// res++;
// }
// if(vals.empty())
// ans = min(ans, res);
if (sum_all % 2)
continue;
id = -1;
int id_sum = 0;
for (auto x : sums) {
if (x.first > sum_all - x.first) {
id_sum = x.first;
id = x.second;
}
}
if (id == -1) {
ans = min(ans, sum_all / 2);
continue;
}
int need = id_sum - (sum_all - id_sum);
for (int i = 1; i <= n; i++) {
while (q[i].size())
q[i].pop();
}
dfs2(i, id, 1, need);
if (need <= 0)
ans = min(ans, sum_all / 2);
}
printf("%d\n", ans > 8e8 ? -1 : ans);
return 0;
} | insert | 49 | 49 | 49 | 51 | TLE | |
p03021 | C++ | Runtime Error | /*
Date: 3/9/2020
Context: ZR3月省选集训
if (sum[x] >= 2 * max[x]) {
f[x] = sum[x] / 2;
}
else {
int u = mp[x];
sum[x] - max[x] + max(0 \leq k \leq f[u], 2 * k \leq 2 * max[u] -
sum[u]);
}
*/
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 2000 + 10;
char ch[N];
int mx[N], sum[N], f[N], ver[N * 2], head[N], nex[N], tot, mp[N], ans;
int n, dist, cnt[N];
inline void add(int x, int y) {
ver[++tot] = y;
nex[tot] = head[x];
head[x] = tot;
}
void dfs(int x, int fa) {
for (int i = head[x]; i; i = nex[i]) {
int y = ver[i];
if (y == fa)
continue;
dfs(y, x);
cnt[x] += cnt[y];
sum[x] += sum[y] + cnt[y];
if (sum[y] + cnt[y] > mx[x]) {
mp[x] = y;
mx[x] = sum[y] + cnt[y];
}
/*
mistake:
if (sum[y] > mx[x]) {
mp[x] = y;
mx[x] = sum[y];
}
*/
}
if (ch[x] == '1') {
cnt[x]++;
}
if (head[x] == 0)
return;
if (sum[x] - mx[x] >= mx[x]) {
f[x] = sum[x] / 2;
} else {
int u = mp[x];
f[x] = sum[x] - mx[x] + min(f[u], (2 * mx[x] - sum[x]) / 2);
}
// cout << "dfs::x " << x << endl;
}
inline void solve(int x) {
memset(mx, 0, sizeof(mx));
memset(sum, 0, sizeof(sum));
memset(cnt, 0, sizeof(cnt));
dist = 0;
dfs(x, 0);
if (sum[x] % 2)
return;
if (f[x] == sum[x] / 2) {
ans = min(f[x], ans);
}
}
signed main() {
ans = 1e9 + 7;
ios::sync_with_stdio(0);
cin >> n;
cin >> ch + 1;
for (int i = 1, u, v; i <= n - 1; i++) {
cin >> u >> v;
add(u, v);
add(v, u);
}
for (int i = 1; i <= n; i++) {
solve(i);
}
if (ans == 1e9 + 7) {
cout << -1 << endl;
} else {
cout << ans << endl;
}
return 0;
}
| /*
Date: 3/9/2020
Context: ZR3月省选集训
if (sum[x] >= 2 * max[x]) {
f[x] = sum[x] / 2;
}
else {
int u = mp[x];
sum[x] - max[x] + max(0 \leq k \leq f[u], 2 * k \leq 2 * max[u] -
sum[u]);
}
*/
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 20000 + 10;
char ch[N];
int mx[N], sum[N], f[N], ver[N * 2], head[N], nex[N], tot, mp[N], ans;
int n, dist, cnt[N];
inline void add(int x, int y) {
ver[++tot] = y;
nex[tot] = head[x];
head[x] = tot;
}
void dfs(int x, int fa) {
for (int i = head[x]; i; i = nex[i]) {
int y = ver[i];
if (y == fa)
continue;
dfs(y, x);
cnt[x] += cnt[y];
sum[x] += sum[y] + cnt[y];
if (sum[y] + cnt[y] > mx[x]) {
mp[x] = y;
mx[x] = sum[y] + cnt[y];
}
/*
mistake:
if (sum[y] > mx[x]) {
mp[x] = y;
mx[x] = sum[y];
}
*/
}
if (ch[x] == '1') {
cnt[x]++;
}
if (head[x] == 0)
return;
if (sum[x] - mx[x] >= mx[x]) {
f[x] = sum[x] / 2;
} else {
int u = mp[x];
f[x] = sum[x] - mx[x] + min(f[u], (2 * mx[x] - sum[x]) / 2);
}
// cout << "dfs::x " << x << endl;
}
inline void solve(int x) {
memset(mx, 0, sizeof(mx));
memset(sum, 0, sizeof(sum));
memset(cnt, 0, sizeof(cnt));
dist = 0;
dfs(x, 0);
if (sum[x] % 2)
return;
if (f[x] == sum[x] / 2) {
ans = min(f[x], ans);
}
}
signed main() {
ans = 1e9 + 7;
ios::sync_with_stdio(0);
cin >> n;
cin >> ch + 1;
for (int i = 1, u, v; i <= n - 1; i++) {
cin >> u >> v;
add(u, v);
add(v, u);
}
for (int i = 1; i <= n; i++) {
solve(i);
}
if (ans == 1e9 + 7) {
cout << -1 << endl;
} else {
cout << ans << endl;
}
return 0;
}
| replace | 15 | 16 | 15 | 16 | 0 | |
p03021 | C++ | Runtime Error | #include <bits/stdc++.h>
#define mp make_pair
#define X first
#define Y second
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define FOD(i, a, b) for (int i = a; i >= b; i--)
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int N = 2010;
const int INF = 1e9 + 7;
int n, low[N], high[N], cnt[N];
bool hasPices[N];
vector<int> adj[N];
void dfs(int u, int p) {
cnt[u] = hasPices[u];
high[u] = 0;
int maxLow = 0;
priority_queue<int, vector<int>, greater<int>> Q;
for (int v : adj[u])
if (v != p) {
dfs(v, u);
Q.push(high[v] + cnt[v]);
if (Q.size() > 2)
Q.pop();
cnt[u] += cnt[v];
high[u] += high[v] + cnt[v];
maxLow = max(maxLow, low[v] + cnt[v]);
}
if (Q.empty()) {
low[u] = 0;
} else {
int x = maxLow;
int sum = 0;
for (int v : adj[u])
if (v != p)
sum += min(high[v] + cnt[v], x - abs(high[v] + cnt[v] - x) % 2);
if (x * 2 > sum)
low[u] = x * 2 - sum;
else
low[u] = sum % 2;
}
}
int main() {
freopen("inp.txt", "r", stdin);
freopen("out.txt", "w", stdout);
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
string s;
cin >> s;
FOR(i, 1, n)
hasPices[i] = (s[i - 1] == '1');
FOR(i, 1, n - 1) {
int u, v;
cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
}
int ans = INF;
FOR(i, 1, n) {
dfs(i, i);
if (low[i] == 0)
ans = min(ans, high[i] / 2);
}
cout << (ans == INF ? -1 : ans);
return 0;
} | #include <bits/stdc++.h>
#define mp make_pair
#define X first
#define Y second
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define FOD(i, a, b) for (int i = a; i >= b; i--)
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int N = 2010;
const int INF = 1e9 + 7;
int n, low[N], high[N], cnt[N];
bool hasPices[N];
vector<int> adj[N];
void dfs(int u, int p) {
cnt[u] = hasPices[u];
high[u] = 0;
int maxLow = 0;
priority_queue<int, vector<int>, greater<int>> Q;
for (int v : adj[u])
if (v != p) {
dfs(v, u);
Q.push(high[v] + cnt[v]);
if (Q.size() > 2)
Q.pop();
cnt[u] += cnt[v];
high[u] += high[v] + cnt[v];
maxLow = max(maxLow, low[v] + cnt[v]);
}
if (Q.empty()) {
low[u] = 0;
} else {
int x = maxLow;
int sum = 0;
for (int v : adj[u])
if (v != p)
sum += min(high[v] + cnt[v], x - abs(high[v] + cnt[v] - x) % 2);
if (x * 2 > sum)
low[u] = x * 2 - sum;
else
low[u] = sum % 2;
}
}
int main() {
// freopen("inp.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n;
string s;
cin >> s;
FOR(i, 1, n)
hasPices[i] = (s[i - 1] == '1');
FOR(i, 1, n - 1) {
int u, v;
cin >> u >> v;
adj[u].push_back(v);
adj[v].push_back(u);
}
int ans = INF;
FOR(i, 1, n) {
dfs(i, i);
if (low[i] == 0)
ans = min(ans, high[i] / 2);
}
cout << (ans == INF ? -1 : ans);
return 0;
}
| replace | 51 | 53 | 51 | 53 | 0 | |
p03021 | C++ | Runtime Error | #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;
string S;
vector<int> E[2020];
vector<int> Ds[2020];
int SD[2020];
int D[2020][2020];
int lef;
void dfs(int cur, int pre, int id, int d) {
if (S[cur] == '1') {
Ds[id].push_back(d);
SD[id] += d;
}
FORR(e, E[cur]) if (e != pre) dfs(e, cur, id, d + 1);
}
void dfs1(int cur, int pre, int id, int d) {
D[cur][id] = d;
FORR(e, E[cur]) if (e != pre) dfs1(e, cur, id, d + 1);
}
pair<int, int> can(int cur, int pre) {
pair<int, int> P = {0, 0};
if (S[cur] == '1')
P.first = 1;
FORR(e, E[cur]) if (e != pre) {
auto Q = can(e, cur);
Q.second += Q.first;
int mi = min(Q.second, P.second);
lef -= mi;
Q.second -= mi;
P.second -= mi;
P.first += Q.first;
P.second += Q.second;
}
return P;
}
void solve() {
int i, j, k, l, r, x, y;
string s;
cin >> N;
cin >> S;
FOR(i, N - 1) {
cin >> x >> y;
E[x - 1].push_back(y - 1);
E[y - 1].push_back(x - 1);
}
FOR(x, N) dfs1(x, x, x, 0);
int mi = 1 << 30;
FOR(x, N) {
ZERO(SD);
FOR(y, N) Ds[y].clear();
FORR(e, E[x]) dfs(e, x, e, 1);
int sum = 0;
int num = 0;
FOR(y, N) {
sum += SD[y];
if (SD[y] > 0)
num++;
}
if (sum % 2)
continue;
int ma = *max_element(SD, SD + N);
if (ma * 2 <= sum) {
mi = min(mi, sum / 2);
continue;
}
y = max_element(SD, SD + N) - SD;
lef = (ma - (sum - ma)) / 2;
can(y, x);
if (lef <= 0)
mi = min(mi, sum / 2);
}
if (mi == 1 << 30)
mi = -1;
assert(mi != -1);
cout << mi << endl;
}
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;
string S;
vector<int> E[2020];
vector<int> Ds[2020];
int SD[2020];
int D[2020][2020];
int lef;
void dfs(int cur, int pre, int id, int d) {
if (S[cur] == '1') {
Ds[id].push_back(d);
SD[id] += d;
}
FORR(e, E[cur]) if (e != pre) dfs(e, cur, id, d + 1);
}
void dfs1(int cur, int pre, int id, int d) {
D[cur][id] = d;
FORR(e, E[cur]) if (e != pre) dfs1(e, cur, id, d + 1);
}
pair<int, int> can(int cur, int pre) {
pair<int, int> P = {0, 0};
if (S[cur] == '1')
P.first = 1;
FORR(e, E[cur]) if (e != pre) {
auto Q = can(e, cur);
Q.second += Q.first;
int mi = min(Q.second, P.second);
lef -= mi;
Q.second -= mi;
P.second -= mi;
P.first += Q.first;
P.second += Q.second;
}
return P;
}
void solve() {
int i, j, k, l, r, x, y;
string s;
cin >> N;
cin >> S;
FOR(i, N - 1) {
cin >> x >> y;
E[x - 1].push_back(y - 1);
E[y - 1].push_back(x - 1);
}
FOR(x, N) dfs1(x, x, x, 0);
int mi = 1 << 30;
FOR(x, N) {
ZERO(SD);
FOR(y, N) Ds[y].clear();
FORR(e, E[x]) dfs(e, x, e, 1);
int sum = 0;
int num = 0;
FOR(y, N) {
sum += SD[y];
if (SD[y] > 0)
num++;
}
if (sum % 2)
continue;
int ma = *max_element(SD, SD + N);
if (ma * 2 <= sum) {
mi = min(mi, sum / 2);
continue;
}
y = max_element(SD, SD + N) - SD;
lef = (ma - (sum - ma)) / 2;
can(y, x);
if (lef <= 0)
mi = min(mi, sum / 2);
}
if (mi == 1 << 30)
mi = -1;
cout << mi << endl;
}
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;
}
| delete | 94 | 95 | 94 | 94 | 0 | |
p03021 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
using namespace std;
const int N = 2005;
int n, sum[N], dep[N], sz[N];
char s[N];
int pp, lnk[N], nxt[N * 2], to[N * 2];
void ae(int k1, int k2) { to[++pp] = k2, nxt[pp] = lnk[k1], lnk[k1] = pp; }
void pre(int k1, int k2) {
sz[k1] = s[k1], sum[k1] = 0;
for (int i = lnk[k1]; i; i = nxt[i])
if (to[i] != k2)
dep[to[i]] = dep[k1] + 1, pre(to[i], k1), sz[k1] += sz[to[i]],
sum[k1] += sum[to[i]] + sz[to[i]];
}
int dfs(int k1, int k2) {
int v = -1;
for (int i = lnk[k1]; i; i = nxt[i])
if (to[i] != k2) {
dfs(to[i], k1);
if (v == -1 || sum[to[i]] > sum[v])
v = to[i];
}
if (v == -1)
return 0;
int k = dfs(v, k1) + sz[v];
if (sum[k1] - sum[v] - sz[v] >= k)
return sum[k1] & 1;
else
return k - (sum[k1] - sum[v] - sz[v]);
}
int main() {
scanf("%d%s", &n, s + 1);
rep(i, 1, n) s[i] &= 1;
rep(i, 2, n) {
int k1, k2;
scanf("%d%d", &k1, &k2);
ae(k1, k2), ae(k2, k1);
}
int ans = 1e9;
rep(k1, 1, n) {
pre(k1, 0);
if (dfs(k1, 0) == 0)
ans = min(ans, sum[k1] / 2);
}
if (ans == 1e9)
ans = -1;
printf("%d\n", ans);
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
using namespace std;
const int N = 2005;
int n, sum[N], dep[N], sz[N];
char s[N];
int pp, lnk[N], nxt[N * 2], to[N * 2];
void ae(int k1, int k2) { to[++pp] = k2, nxt[pp] = lnk[k1], lnk[k1] = pp; }
void pre(int k1, int k2) {
sz[k1] = s[k1], sum[k1] = 0;
for (int i = lnk[k1]; i; i = nxt[i])
if (to[i] != k2)
dep[to[i]] = dep[k1] + 1, pre(to[i], k1), sz[k1] += sz[to[i]],
sum[k1] += sum[to[i]] + sz[to[i]];
}
int dfs(int k1, int k2) {
int v = -1;
for (int i = lnk[k1]; i; i = nxt[i])
if (to[i] != k2) {
if (v == -1 || sum[to[i]] > sum[v])
v = to[i];
}
if (v == -1)
return 0;
int k = dfs(v, k1) + sz[v];
if (sum[k1] - sum[v] - sz[v] >= k)
return sum[k1] & 1;
else
return k - (sum[k1] - sum[v] - sz[v]);
}
int main() {
scanf("%d%s", &n, s + 1);
rep(i, 1, n) s[i] &= 1;
rep(i, 2, n) {
int k1, k2;
scanf("%d%d", &k1, &k2);
ae(k1, k2), ae(k2, k1);
}
int ans = 1e9;
rep(k1, 1, n) {
pre(k1, 0);
if (dfs(k1, 0) == 0)
ans = min(ans, sum[k1] / 2);
}
if (ans == 1e9)
ans = -1;
printf("%d\n", ans);
return 0;
}
| delete | 19 | 20 | 19 | 19 | TLE | |
p03021 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct number {
int siz, low, high;
number() : siz(0), low(0), high(0) {}
};
int main() {
do {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
} while (false);
int n;
cin >> n;
string str;
cin >> str;
vector<vector<int>> adj(n);
for (int i = 1; i < n; i++) {
int u, v;
cin >> u >> v;
adj[--u].push_back(--v);
adj[v].push_back(u);
}
auto add = [&](number a, number b) {
number res;
res.siz = a.siz + b.siz;
res.high = a.high + b.high;
if (a.low > b.low) {
swap(a, b);
}
if (a.high > b.low) {
res.low = res.high % 2;
} else {
res.low = b.low - a.high;
}
return res;
};
int ans = INT_MAX;
for (int root = 0; root < n; root++) {
vector<number> dp(n);
function<int(int, int, int)> dfs = [&](int u, int fa, int depth) {
int res = 0;
for (int v : adj[u]) {
if (v != fa) {
res += dfs(v, u, depth + 1);
dp[v].low += dp[v].siz;
dp[v].high += dp[v].siz;
dp[u] = add(dp[u], dp[v]);
}
}
if (str[u] == '1') {
dp[u].siz++;
res += depth;
}
return res;
};
int result = dfs(root, -1, 0);
if (!dp[result].low) {
ans = min(ans, result / 2);
}
}
cout << (ans == INT_MAX ? -1 : ans) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct number {
int siz, low, high;
number() : siz(0), low(0), high(0) {}
};
int main() {
do {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
} while (false);
int n;
cin >> n;
string str;
cin >> str;
vector<vector<int>> adj(n);
for (int i = 1; i < n; i++) {
int u, v;
cin >> u >> v;
adj[--u].push_back(--v);
adj[v].push_back(u);
}
auto add = [&](number a, number b) {
number res;
res.siz = a.siz + b.siz;
res.high = a.high + b.high;
if (a.low > b.low) {
swap(a, b);
}
if (a.high > b.low) {
res.low = res.high % 2;
} else {
res.low = b.low - a.high;
}
return res;
};
int ans = INT_MAX;
for (int root = 0; root < n; root++) {
vector<number> dp(n);
function<int(int, int, int)> dfs = [&](int u, int fa, int depth) {
int res = 0;
for (int v : adj[u]) {
if (v != fa) {
res += dfs(v, u, depth + 1);
dp[v].low += dp[v].siz;
dp[v].high += dp[v].siz;
dp[u] = add(dp[u], dp[v]);
}
}
if (str[u] == '1') {
dp[u].siz++;
res += depth;
}
return res;
};
int result = dfs(root, -1, 0);
if (!dp[root].low) {
ans = min(ans, result / 2);
}
}
cout << (ans == INT_MAX ? -1 : ans) << endl;
return 0;
}
| replace | 58 | 59 | 58 | 59 | 0 | |
p03021 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, x, y, hd[2010], cnt, dis[2010], q[2010], l, r, f[2010], fa[2010], ans,
siz[2010], col[2010], g[2010], c[2];
struct node {
int to, next;
} e[4010];
char s[2010];
void addedge(int x, int y) {
e[++cnt] = (node){y, hd[x]}, hd[x] = cnt;
e[++cnt] = (node){x, hd[y]}, hd[y] = cnt;
}
void dfs(int x) {
int ma = 0, maa, sum = 0;
siz[x] = (s[x] == '1');
for (int i = hd[x]; i; i = e[i].next)
if (e[i].to != fa[x]) {
fa[e[i].to] = x, dfs(e[i].to), sum += f[e[i].to] + siz[e[i].to],
siz[x] += siz[e[i].to];
if (f[e[i].to] + siz[e[i].to] > ma)
ma = f[e[i].to] + siz[e[i].to], maa = e[i].to;
}
f[x] = sum;
if (sum - ma >= g[maa] + siz[maa])
g[x] = 0;
else
g[x] = g[maa] + siz[maa] - (sum - ma);
}
void getcol(int x) {
for (int i = hd[x]; i; i = e[i].next)
if (e[i].to != fa[x])
fa[e[i].to] = x, col[e[i].to] = col[x] ^ 1, getcol(e[i].to);
}
int main() {
scanf("%d", &n), ans = 1000000000, scanf("%s", s + 1);
for (int i = 1; i < n; i++)
scanf("%d%d", &x, &y), addedge(x, y);
col[1] = 0, getcol(1), c[0] = c[1] = 0;
for (int i = 1; i <= n; i++)
if (s[i] == '1')
c[col[i]]++;
if ((c[0] & 1) && (c[1] & 1))
return puts("-1"), 0;
for (int i = 1; i <= n; i++)
if (!(c[col[i] ^ 1] & 1)) {
memset(fa, 0, sizeof(fa)), dfs(i);
if (g[i] == 0)
ans = min(ans, f[i] / 2);
}
if (ans == 1000000000)
puts("-1");
else
printf("%d\n", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n, x, y, hd[2010], cnt, dis[2010], q[2010], l, r, f[2010], fa[2010], ans,
siz[2010], col[2010], g[2010], c[2];
struct node {
int to, next;
} e[4010];
char s[2010];
void addedge(int x, int y) {
e[++cnt] = (node){y, hd[x]}, hd[x] = cnt;
e[++cnt] = (node){x, hd[y]}, hd[y] = cnt;
}
void dfs(int x) {
int ma = 0, maa, sum = 0;
siz[x] = (s[x] == '1');
for (int i = hd[x]; i; i = e[i].next)
if (e[i].to != fa[x]) {
fa[e[i].to] = x, dfs(e[i].to), sum += f[e[i].to] + siz[e[i].to],
siz[x] += siz[e[i].to];
if (f[e[i].to] + siz[e[i].to] > ma)
ma = f[e[i].to] + siz[e[i].to], maa = e[i].to;
}
if (!ma)
f[x] = g[x] = 0;
else {
f[x] = sum;
if (sum - ma >= g[maa] + siz[maa])
g[x] = 0;
else
g[x] = g[maa] + siz[maa] - (sum - ma);
}
}
void getcol(int x) {
for (int i = hd[x]; i; i = e[i].next)
if (e[i].to != fa[x])
fa[e[i].to] = x, col[e[i].to] = col[x] ^ 1, getcol(e[i].to);
}
int main() {
scanf("%d", &n), ans = 1000000000, scanf("%s", s + 1);
for (int i = 1; i < n; i++)
scanf("%d%d", &x, &y), addedge(x, y);
col[1] = 0, getcol(1), c[0] = c[1] = 0;
for (int i = 1; i <= n; i++)
if (s[i] == '1')
c[col[i]]++;
if ((c[0] & 1) && (c[1] & 1))
return puts("-1"), 0;
for (int i = 1; i <= n; i++)
if (!(c[col[i] ^ 1] & 1)) {
memset(fa, 0, sizeof(fa)), dfs(i);
if (g[i] == 0)
ans = min(ans, f[i] / 2);
}
if (ans == 1000000000)
puts("-1");
else
printf("%d\n", ans);
return 0;
} | replace | 25 | 30 | 25 | 34 | -11 | |
p03022 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int p = 998244353, inv2 = (p + 1) / 2;
int qpow(int a, int k) {
int ans = 1;
while (k) {
if (k & 1)
ans = 1LL * ans * a % p;
a = 1LL * a * a % p;
k >>= 1;
}
return ans;
}
int FWT_xor(int d[], int n0, int flg) {
for (int i = 1; i < (1 << n0); i <<= 1)
for (int j = 0; j < (1 << n0); j += (i << 1))
for (int k = 0; k < i; k++) {
int a0 = d[j | k], a1 = d[i | j | k];
d[j | k] = (a0 + a1) % p, d[i | j | k] = (a0 - a1 + p) % p;
if (flg == -1)
d[j | k] = 1LL * d[j | k] * inv2 % p,
d[i | j | k] = 1LL * d[i | j | k] * inv2 % p;
}
}
int F[1 << 18], Q[1 << 18], P[1 << 18], SP;
int N;
int main() {
scanf("%d", &N);
for (int i = 0; i < (1 << N); i++)
scanf("%d", &P[i]), SP = (SP + P[i]) % p;
SP = qpow(SP, p - 2);
for (int i = 0; i < (1 << N); i++)
P[i] = 1LL * P[i] * SP % p;
P[0] = (P[0] - 1 + p) % p;
Q[0] = (1 << N) - 1;
for (int i = 1; i < (1 << N); i++)
Q[i] = p - 1;
FWT_xor(P, N, 1);
FWT_xor(Q, N, 1);
for (int i = 1; i < (1 << N); i++)
F[i] = 1LL * Q[i] * qpow(P[i], p - 2) % p;
FWT_xor(F, N, -1);
int ans = p - F[0];
for (int i = 0; i < (1 << N); i++)
printf("%d\n", (ans + F[i]) % p);
} | #include <bits/stdc++.h>
using namespace std;
const int p = 998244353, inv2 = (p + 1) / 2;
int qpow(int a, int k) {
int ans = 1;
while (k) {
if (k & 1)
ans = 1LL * ans * a % p;
a = 1LL * a * a % p;
k >>= 1;
}
return ans;
}
void FWT_xor(int d[], int n0, int flg) {
for (int i = 1; i < (1 << n0); i <<= 1)
for (int j = 0; j < (1 << n0); j += (i << 1))
for (int k = 0; k < i; k++) {
int a0 = d[j | k], a1 = d[i | j | k];
d[j | k] = (a0 + a1) % p, d[i | j | k] = (a0 - a1 + p) % p;
if (flg == -1)
d[j | k] = 1LL * d[j | k] * inv2 % p,
d[i | j | k] = 1LL * d[i | j | k] * inv2 % p;
}
}
int F[1 << 18], Q[1 << 18], P[1 << 18], SP;
int N;
int main() {
scanf("%d", &N);
for (int i = 0; i < (1 << N); i++)
scanf("%d", &P[i]), SP = (SP + P[i]) % p;
SP = qpow(SP, p - 2);
for (int i = 0; i < (1 << N); i++)
P[i] = 1LL * P[i] * SP % p;
P[0] = (P[0] - 1 + p) % p;
Q[0] = (1 << N) - 1;
for (int i = 1; i < (1 << N); i++)
Q[i] = p - 1;
FWT_xor(P, N, 1);
FWT_xor(Q, N, 1);
for (int i = 1; i < (1 << N); i++)
F[i] = 1LL * Q[i] * qpow(P[i], p - 2) % p;
FWT_xor(F, N, -1);
int ans = p - F[0];
for (int i = 0; i < (1 << N); i++)
printf("%d\n", (ans + F[i]) % p);
} | replace | 15 | 16 | 15 | 16 | 0 | |
p03022 | C++ | Runtime Error | #include <bits/stdc++.h>
#define clr(x) memset(x, 0, sizeof x)
#define For(i, a, b) for (int i = (a); i <= (b); i++)
#define Fod(i, b, a) for (int i = (b); i >= (a); i--)
#define fi first
#define se second
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)
#define outval(x) cerr << #x " = " << x << endl
#define outtag(x) cerr << "---------------" #x "---------------" << endl
#define outarr(a, L, R) \
cerr << #a "[" << L << ".." << R << "] = "; \
For(_x, L, R) cerr << a[_x] << " "; \
cerr << endl;
using namespace std;
typedef long long LL;
LL read() {
LL x = 0, f = 0;
char ch = getchar();
while (!isdigit(ch))
f |= ch == '-', ch = getchar();
while (isdigit(ch))
x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
return f ? -x : x;
}
const int N = 18, mod = 998244353;
int Pow(int x, int y) {
int ans = 1;
for (; y; y >>= 1, x = (LL)x * x % mod)
if (y & 1)
ans = (LL)ans * x % mod;
return ans;
}
void Add(int &x, int y) {
if ((x += y) >= mod)
x -= mod;
}
void Del(int &x, int y) {
if ((x -= y) < 0)
x += mod;
}
int Add(int x) { return x >= mod ? x - mod : x; }
int Del(int x) { return x < 0 ? x + mod : x; }
int inv2 = (mod + 1) >> 1;
int n;
int a[N];
void FWT(int *a, int n, int flag) {
for (int d = 1; d < n; d <<= 1)
for (int i = 0; i < n; i += d << 1)
for (int j = 0; j < d; j++) {
int x = a[i + j], y = a[i + j + d];
a[i + j] = Add(x + y);
a[i + j + d] = Del(x - y);
if (flag < 0) {
a[i + j] = (LL)a[i + j] * inv2 % mod;
a[i + j + d] = (LL)a[i + j + d] * inv2 % mod;
}
}
}
int main() {
n = read(), n = 1 << n;
int s = 0;
For(i, 0, n - 1) a[i] = read(), s += a[i];
s = Pow(s, mod - 2);
For(i, 0, n - 1) a[i] = (LL)a[i] * s % mod;
FWT(a, n, 1);
Fod(i, n - 1, 0) {
if (a[i] == 1) {
a[i] = 0;
continue;
}
a[i] = Pow((a[i] - 1 + mod) % mod, mod - 2);
}
FWT(a, n, 1);
For(i, 0, n - 1) printf("%d\n", Del(a[i] - a[0]));
return 0;
} | #include <bits/stdc++.h>
#define clr(x) memset(x, 0, sizeof x)
#define For(i, a, b) for (int i = (a); i <= (b); i++)
#define Fod(i, b, a) for (int i = (b); i >= (a); i--)
#define fi first
#define se second
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)
#define outval(x) cerr << #x " = " << x << endl
#define outtag(x) cerr << "---------------" #x "---------------" << endl
#define outarr(a, L, R) \
cerr << #a "[" << L << ".." << R << "] = "; \
For(_x, L, R) cerr << a[_x] << " "; \
cerr << endl;
using namespace std;
typedef long long LL;
LL read() {
LL x = 0, f = 0;
char ch = getchar();
while (!isdigit(ch))
f |= ch == '-', ch = getchar();
while (isdigit(ch))
x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
return f ? -x : x;
}
const int N = 18, mod = 998244353;
int Pow(int x, int y) {
int ans = 1;
for (; y; y >>= 1, x = (LL)x * x % mod)
if (y & 1)
ans = (LL)ans * x % mod;
return ans;
}
void Add(int &x, int y) {
if ((x += y) >= mod)
x -= mod;
}
void Del(int &x, int y) {
if ((x -= y) < 0)
x += mod;
}
int Add(int x) { return x >= mod ? x - mod : x; }
int Del(int x) { return x < 0 ? x + mod : x; }
int inv2 = (mod + 1) >> 1;
int n;
int a[1 << N];
void FWT(int *a, int n, int flag) {
for (int d = 1; d < n; d <<= 1)
for (int i = 0; i < n; i += d << 1)
for (int j = 0; j < d; j++) {
int x = a[i + j], y = a[i + j + d];
a[i + j] = Add(x + y);
a[i + j + d] = Del(x - y);
if (flag < 0) {
a[i + j] = (LL)a[i + j] * inv2 % mod;
a[i + j + d] = (LL)a[i + j + d] * inv2 % mod;
}
}
}
int main() {
n = read(), n = 1 << n;
int s = 0;
For(i, 0, n - 1) a[i] = read(), s += a[i];
s = Pow(s, mod - 2);
For(i, 0, n - 1) a[i] = (LL)a[i] * s % mod;
FWT(a, n, 1);
Fod(i, n - 1, 0) {
if (a[i] == 1) {
a[i] = 0;
continue;
}
a[i] = Pow((a[i] - 1 + mod) % mod, mod - 2);
}
FWT(a, n, 1);
For(i, 0, n - 1) printf("%d\n", Del(a[i] - a[0]));
return 0;
} | replace | 45 | 46 | 45 | 46 | 0 | |
p03022 | C++ | Runtime Error | #include <bits/stdc++.h>
const int N = 18, M = 998244353;
using namespace std;
int n, l, a[N], b[N], t0, t1, sum;
inline int inv(int x) {
int y = 1, t = M - 2;
for (; t; t >>= 1)
t & 1 ? y = 1ll * y * x % M : 0, x = 1ll * x * x % M;
return y;
}
inline void fwt(int *c, int t) {
for (int i = 1; i < l; i <<= 1)
for (int j = 0; j < l; j++)
if (j & i)
t0 = (c[j ^ i] + c[j]) % M, t1 = (c[j ^ i] - c[j]) % M,
c[j] = t1 * 1ll * t % M, c[j ^ i] = t0 * 1ll * t % M;
}
int main() {
scanf("%d", &n), b[0] = l = 1 << n;
for (int i = 0; i < l; i++)
scanf("%d", a + i), sum = (sum + a[i]) % M, b[i]--;
sum = inv(sum);
for (int i = 0; i < l; i++)
a[i] = 1ll * a[i] * sum % M;
a[0]--; /*
for(int i=0;i<l;i++)
cerr<<a[i]<<' ';cerr<<endl;*/
fwt(a, 1), fwt(b, 1); /*
for(int i=0;i<l;i++)
cerr<<a[i]<<' ';cerr<<endl;
for(int i=0;i<l;i++)
cerr<<b[i]<<' ';cerr<<endl;*/
for (int i = 1; i < l; i++)
a[i] = b[i] = 1ll * b[i] * inv(a[i]) % M;
fwt(a, M + 1 >> 1);
b[0] = -a[0] * 1ll * l % M;
fwt(b, M + 1 >> 1);
for (int i = 0; i < l; i++)
printf("%d\n", (b[i] + M) % M);
} | #include <bits/stdc++.h>
const int N = 18, M = 998244353;
using namespace std;
int n, l, a[1 << N], b[1 << N], t0, t1, sum;
inline int inv(int x) {
int y = 1, t = M - 2;
for (; t; t >>= 1)
t & 1 ? y = 1ll * y * x % M : 0, x = 1ll * x * x % M;
return y;
}
inline void fwt(int *c, int t) {
for (int i = 1; i < l; i <<= 1)
for (int j = 0; j < l; j++)
if (j & i)
t0 = (c[j ^ i] + c[j]) % M, t1 = (c[j ^ i] - c[j]) % M,
c[j] = t1 * 1ll * t % M, c[j ^ i] = t0 * 1ll * t % M;
}
int main() {
scanf("%d", &n), b[0] = l = 1 << n;
for (int i = 0; i < l; i++)
scanf("%d", a + i), sum = (sum + a[i]) % M, b[i]--;
sum = inv(sum);
for (int i = 0; i < l; i++)
a[i] = 1ll * a[i] * sum % M;
a[0]--; /*
for(int i=0;i<l;i++)
cerr<<a[i]<<' ';cerr<<endl;*/
fwt(a, 1), fwt(b, 1); /*
for(int i=0;i<l;i++)
cerr<<a[i]<<' ';cerr<<endl;
for(int i=0;i<l;i++)
cerr<<b[i]<<' ';cerr<<endl;*/
for (int i = 1; i < l; i++)
a[i] = b[i] = 1ll * b[i] * inv(a[i]) % M;
fwt(a, M + 1 >> 1);
b[0] = -a[0] * 1ll * l % M;
fwt(b, M + 1 >> 1);
for (int i = 0; i < l; i++)
printf("%d\n", (b[i] + M) % M);
} | replace | 3 | 4 | 3 | 4 | 0 | |
p03023 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
/* Template file for Online Algorithmic Competitions */
/* Typedefs */
/* Basic types */
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
/* STL containers */
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<string> vs;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef vector<vpii> vvpii;
typedef set<int> si;
/* Macros */
/* Loops */
#define fl(i, a, b) for (int i(a); i <= (b); i++)
#define rep(i, n) fl(i, 1, (n))
#define loop(i, n) fl(i, 0, (n)-1)
#define rfl(i, a, b) for (int i(a); i >= (b); i--)
#define rrep(i, n) rfl(i, (n), 1)
/* Algorithmic functions */
#define srt(v) sort((v).begin(), (v).end())
/* STL container methods */
#define pb push_back
#define mp make_pair
#define eb emplace_back
/* String methods */
#define dig(i) (s[i] - '0')
#define slen(s) s.length()
/* Shorthand notations */
#define fr first
#define sc second
#define re return
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define sqr(x) ((x) * (x))
#define fill(x, y) memset(x, y, sizeof(x))
#define clr(a) fill(a, 0)
#define endl '\n'
/* Mathematical */
#define IINF 0x3f3f3f3f
#define LLINF 1000111000111000111LL
#define PI 3.14159265358979323
/* Debugging purpose */
#define trace1(x) cerr << #x << ": " << x << endl
#define trace2(x, y) cerr << #x << ": " << x << " | " << #y << ": " << y << endl
#define trace3(x, y, z) \
cerr << #x << ": " << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl
/* Fast Input Output */
#define high_functioning_sociopath \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
/* Constants */
const ll MOD = 1000000007LL;
const ll MAX = 100010LL;
/* Templates */
template <typename T> T power(T x, T y, ll m = MOD) {
T ans = 1;
x %= m;
while (y > 0) {
if (y & 1LL)
ans = (ans * x) % m;
y >>= 1LL;
x = (x * x) % m;
}
return ans % m;
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#endif
high_functioning_sociopath;
ll n;
cin >> n;
cout << 180 * (n - 2) << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
/* Template file for Online Algorithmic Competitions */
/* Typedefs */
/* Basic types */
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
/* STL containers */
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<string> vs;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef vector<vpii> vvpii;
typedef set<int> si;
/* Macros */
/* Loops */
#define fl(i, a, b) for (int i(a); i <= (b); i++)
#define rep(i, n) fl(i, 1, (n))
#define loop(i, n) fl(i, 0, (n)-1)
#define rfl(i, a, b) for (int i(a); i >= (b); i--)
#define rrep(i, n) rfl(i, (n), 1)
/* Algorithmic functions */
#define srt(v) sort((v).begin(), (v).end())
/* STL container methods */
#define pb push_back
#define mp make_pair
#define eb emplace_back
/* String methods */
#define dig(i) (s[i] - '0')
#define slen(s) s.length()
/* Shorthand notations */
#define fr first
#define sc second
#define re return
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define sqr(x) ((x) * (x))
#define fill(x, y) memset(x, y, sizeof(x))
#define clr(a) fill(a, 0)
#define endl '\n'
/* Mathematical */
#define IINF 0x3f3f3f3f
#define LLINF 1000111000111000111LL
#define PI 3.14159265358979323
/* Debugging purpose */
#define trace1(x) cerr << #x << ": " << x << endl
#define trace2(x, y) cerr << #x << ": " << x << " | " << #y << ": " << y << endl
#define trace3(x, y, z) \
cerr << #x << ": " << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl
/* Fast Input Output */
#define high_functioning_sociopath \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
/* Constants */
const ll MOD = 1000000007LL;
const ll MAX = 100010LL;
/* Templates */
template <typename T> T power(T x, T y, ll m = MOD) {
T ans = 1;
x %= m;
while (y > 0) {
if (y & 1LL)
ans = (ans * x) % m;
y >>= 1LL;
x = (x * x) % m;
}
return ans % m;
}
int main() {
high_functioning_sociopath;
ll n;
cin >> n;
cout << 180 * (n - 2) << "\n";
return 0;
}
| delete | 82 | 88 | 82 | 82 | 0 | |
p03023 | C++ | Runtime Error | /*------------------------Original Copyright belongs
to-------------------------/ !
! ! ## ## ## ##
! ! # #
# # !
! ### #### ### ### ## # ! !
# # # # # # # # # ## !
! # # # ### ### #### # ! !
# # # # # # # # # # !
! ### #### ### # # # # ### ###
! ! !
/------------------------------------------------------------------------------*/
#include <bits/stdc++.h>
using namespace std;
//------------Template begins--------------------//
#define ss string
#define last(s) s.length() - 1
#define lli long long int
#define v(type) vector<type>
#define pr(type1, type2) pair<type1, type2>
#define ma(type1, type2) map<type1, type2>
#define f first
#define s second
#define all(v) v.begin(), v.end()
#define pb push_back
#define pf push_front
#define mp make_pair
#define L(i, start, end) for (lli i = start; i <= end; i++)
#define R(i, start, end) for (lli i = start; i >= end; i--)
#define inp(var, start, end, array) \
for (var = start; var <= end; var++) \
cin >> array[var];
#define whatIs(x) cout << #x << " is " << x << endl
#define dbg1D(i, start, end, arr) \
for (lli i = start; i <= end; i++) \
cout << i << "th : " << arr[i] << endl;
#define dbg2D(i, j, s1, e1, s2, e2, arr) \
for (lli i = s1; i <= e1; i++) { \
cout << i << "th :"; \
for (lli j = s2; j <= e2; j++) \
cout << arr[i][j] << " "; \
cout << endl; \
}
lli dx[4] = {-1, 0, 0, +1};
lli dy[4] = {0, -1, +1, 0};
const lli LINF = 1e18;
const lli INF = 1e9;
const lli mod = 1e9 + 7;
lli power(lli a, lli b, lli m) {
if (b == 0)
return 1;
if (b == 1)
return a % m;
lli t = power(a, b / 2, m);
t = (t * t) % m;
if (b & 1)
t = (t * a) % m;
return t;
}
lli modInverse(lli a, lli m) { return power(a, m - 2, m); }
//---------------Template ends------------------//
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("ip.txt", "r", stdin);
freopen("op.txt", "w", stdout);
#endif
// #################### CATCH HERE ##########################
/* Uncomment if t test cases
lli t;
cin>>t;
while(t--)
{
lli n,ans,i,j;
cout<<ans<<endl;
}
*/
lli n;
cin >> n;
cout << ((n - 2) * 180) << endl;
// cout<<ans<<endl;
// ##########################################################
return 0;
} | /*------------------------Original Copyright belongs
to-------------------------/ !
! ! ## ## ## ##
! ! # #
# # !
! ### #### ### ### ## # ! !
# # # # # # # # # ## !
! # # # ### ### #### # ! !
# # # # # # # # # # !
! ### #### ### # # # # ### ###
! ! !
/------------------------------------------------------------------------------*/
#include <bits/stdc++.h>
using namespace std;
//------------Template begins--------------------//
#define ss string
#define last(s) s.length() - 1
#define lli long long int
#define v(type) vector<type>
#define pr(type1, type2) pair<type1, type2>
#define ma(type1, type2) map<type1, type2>
#define f first
#define s second
#define all(v) v.begin(), v.end()
#define pb push_back
#define pf push_front
#define mp make_pair
#define L(i, start, end) for (lli i = start; i <= end; i++)
#define R(i, start, end) for (lli i = start; i >= end; i--)
#define inp(var, start, end, array) \
for (var = start; var <= end; var++) \
cin >> array[var];
#define whatIs(x) cout << #x << " is " << x << endl
#define dbg1D(i, start, end, arr) \
for (lli i = start; i <= end; i++) \
cout << i << "th : " << arr[i] << endl;
#define dbg2D(i, j, s1, e1, s2, e2, arr) \
for (lli i = s1; i <= e1; i++) { \
cout << i << "th :"; \
for (lli j = s2; j <= e2; j++) \
cout << arr[i][j] << " "; \
cout << endl; \
}
lli dx[4] = {-1, 0, 0, +1};
lli dy[4] = {0, -1, +1, 0};
const lli LINF = 1e18;
const lli INF = 1e9;
const lli mod = 1e9 + 7;
lli power(lli a, lli b, lli m) {
if (b == 0)
return 1;
if (b == 1)
return a % m;
lli t = power(a, b / 2, m);
t = (t * t) % m;
if (b & 1)
t = (t * a) % m;
return t;
}
lli modInverse(lli a, lli m) { return power(a, m - 2, m); }
//---------------Template ends------------------//
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
// freopen("ip.txt","r",stdin);
// freopen("op.txt","w",stdout);
#endif
// #################### CATCH HERE ##########################
/* Uncomment if t test cases
lli t;
cin>>t;
while(t--)
{
lli n,ans,i,j;
cout<<ans<<endl;
}
*/
lli n;
cin >> n;
cout << ((n - 2) * 180) << endl;
// cout<<ans<<endl;
// ##########################################################
return 0;
} | replace | 67 | 69 | 67 | 69 | 0 | |
p03023 | C++ | Runtime Error | #include <bits/stdc++.h>
#define sz(a) int((a).size())
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define tr(c, i) for(typeof((c).begin() i = (c).begin(); i != (c).end(); i++)
#define present(c, x) ((c).find(x) != (c).end())
#define cpresent(c, x) (find(all(c), x) != (c).end())
#define LSOne(i) (i & (-i))
#define rep(i, a, b) for (int(i) = (a); (i) < (b); i++)
#define rrep(i, a, b) for (int(i) = (a); (i) > (b); i--)
#define BUG(x) \
{ cout << #x << " = " << x << endl; }
#define left(x) (x << 1)
#define right(x) ((x << 1) + 1)
#define middle(s, e) (s + (e - s) / 2)
#define size_tree(n) 2 * (int)pow(2, ceil(log2(n)))
#define CL(A, I) (memset(A, I, sizeof(A)))
#define endl '\n'
#define PHAS(_n) (pbits[(_n) >> 5] & (1u << ((_n)&0x1f)))
#define PSET(_n) (pbits[(_n) >> 5] |= (1u << ((_n)&0x1f)))
// unsigned int pbits[200000000/32+1];
static const int INF = 0x3f3f3f3f;
static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
static const long double epsilon = 1e-15;
static const long double pi = acos((long double)-1);
using namespace std;
inline void init_io() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef long long ll;
const int MAX_N = 100001;
/*
struct data{
string s;
int p,i;
data():s(""), p(0), i(0){};
data(string s_, int p_, int i_) : s(s_),p(p_), i(i_){};
bool operator < (data other) const {
if(s==other.s)
return p>other.p;
return s < other.s;
}
};
*/
int st[MAX_N];
int arr[10 * MAX_N];
int L[10 * MAX_N], R[10 * MAX_N];
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
#endif
init_io();
ll n;
cin >> n;
cout << ((n - 2) * 180) << endl;
return 0;
} | #include <bits/stdc++.h>
#define sz(a) int((a).size())
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define tr(c, i) for(typeof((c).begin() i = (c).begin(); i != (c).end(); i++)
#define present(c, x) ((c).find(x) != (c).end())
#define cpresent(c, x) (find(all(c), x) != (c).end())
#define LSOne(i) (i & (-i))
#define rep(i, a, b) for (int(i) = (a); (i) < (b); i++)
#define rrep(i, a, b) for (int(i) = (a); (i) > (b); i--)
#define BUG(x) \
{ cout << #x << " = " << x << endl; }
#define left(x) (x << 1)
#define right(x) ((x << 1) + 1)
#define middle(s, e) (s + (e - s) / 2)
#define size_tree(n) 2 * (int)pow(2, ceil(log2(n)))
#define CL(A, I) (memset(A, I, sizeof(A)))
#define endl '\n'
#define PHAS(_n) (pbits[(_n) >> 5] & (1u << ((_n)&0x1f)))
#define PSET(_n) (pbits[(_n) >> 5] |= (1u << ((_n)&0x1f)))
// unsigned int pbits[200000000/32+1];
static const int INF = 0x3f3f3f3f;
static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
static const long double epsilon = 1e-15;
static const long double pi = acos((long double)-1);
using namespace std;
inline void init_io() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef long long ll;
const int MAX_N = 100001;
/*
struct data{
string s;
int p,i;
data():s(""), p(0), i(0){};
data(string s_, int p_, int i_) : s(s_),p(p_), i(i_){};
bool operator < (data other) const {
if(s==other.s)
return p>other.p;
return s < other.s;
}
};
*/
int st[MAX_N];
int arr[10 * MAX_N];
int L[10 * MAX_N], R[10 * MAX_N];
int main() {
init_io();
ll n;
cin >> n;
cout << ((n - 2) * 180) << endl;
return 0;
} | replace | 57 | 61 | 57 | 58 | 0 | |
p03023 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
#define fr(i, a, b) for (ll i = a; i < b; i++)
#define pb(v, a) v.push_back(a)
#define Sort(v) sort(v.begin(), v.end())
#define For(m) for (auto it = m.begin(); it != m.end(); it++)
#define mp(p1, p2) make_pair(p1, p2)
#define mod 1000000007
#define PI 3.14159265358979323846
#define pii pair<ll, ll>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fast ll n;
cin >> n;
cout << (n - 2) * 180;
return 0;
} | #include <bits/stdc++.h>
#define ll long long int
#define fr(i, a, b) for (ll i = a; i < b; i++)
#define pb(v, a) v.push_back(a)
#define Sort(v) sort(v.begin(), v.end())
#define For(m) for (auto it = m.begin(); it != m.end(); it++)
#define mp(p1, p2) make_pair(p1, p2)
#define mod 1000000007
#define PI 3.14159265358979323846
#define pii pair<ll, ll>
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
fast ll n;
cin >> n;
cout << (n - 2) * 180;
return 0;
} | replace | 17 | 21 | 17 | 21 | 0 | |
p03023 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define lli long long int
#define ulli unsigned long long int
#define ld long double
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define loop(i, a, b) for (lli i = a; i < b; i++)
#define initialize(array, size, value) \
for (lli i = 0; i < size; i++) \
array[i] = value
#define couta(array, size) \
for (lli i = 0; i < size; i++) \
cout << array[i] << " "
#define vl vector<lli>
#define vp vector<pair<lli, lli>>
#define sl set<lli>
#define msp multiset<pair<long long, long long>> S;
#define pll pair<lli, lli>
#define mll \
map<lli, \
lli> // for( map<lli, lli>::iterator
// i=temp.begin();i!=temp.end();i++)cout<<i->fi<<" "<<i->se<<endl;
#define mvl map<lli, vl>
#define umll unordered_map<lli, lli>
#define vt vector<pair<lli, pll>>
#define vf vector<pair<pll, pll>>
#define qu queue<lli>
#define pq priority_queue<lli>
#define dq deque<lli>
#define ptr vector<lli>::iterator
#define bs(array, x) \
binary_search(array.begin(), array.end(), \
x) // also valid for set and multiset
#define lb(array, x) lower_bound(array.begin(), array.end(), x)
#define ub(array, x) upper_bound(array.begin(), array.end(), x)
#define nobw(array, i, j) \
upper_bound(array.begin(), array.end(), j) - \
lower_bound(array.begin(), array.end(), \
i) // number of numbers between i & j
#define vc clear()
#define endl '\n'
#define sp system("pause");
#define INF 9223372036854775807
#define MINF -9223372036854775808
typedef tree<pll, null_type, less<pll>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
// string binary = bitset<32>(n).to_string();
lli x, y, d;
void gcd(lli a, lli b) {
if (b == 0) {
d = a;
x = 1;
y = 0;
return;
}
gcd(b, a % b);
lli temp = x;
x = y;
y = temp - (a / b) * y;
return;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
lli n;
cin >> n;
cout << (n - 2) * 180;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define lli long long int
#define ulli unsigned long long int
#define ld long double
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define loop(i, a, b) for (lli i = a; i < b; i++)
#define initialize(array, size, value) \
for (lli i = 0; i < size; i++) \
array[i] = value
#define couta(array, size) \
for (lli i = 0; i < size; i++) \
cout << array[i] << " "
#define vl vector<lli>
#define vp vector<pair<lli, lli>>
#define sl set<lli>
#define msp multiset<pair<long long, long long>> S;
#define pll pair<lli, lli>
#define mll \
map<lli, \
lli> // for( map<lli, lli>::iterator
// i=temp.begin();i!=temp.end();i++)cout<<i->fi<<" "<<i->se<<endl;
#define mvl map<lli, vl>
#define umll unordered_map<lli, lli>
#define vt vector<pair<lli, pll>>
#define vf vector<pair<pll, pll>>
#define qu queue<lli>
#define pq priority_queue<lli>
#define dq deque<lli>
#define ptr vector<lli>::iterator
#define bs(array, x) \
binary_search(array.begin(), array.end(), \
x) // also valid for set and multiset
#define lb(array, x) lower_bound(array.begin(), array.end(), x)
#define ub(array, x) upper_bound(array.begin(), array.end(), x)
#define nobw(array, i, j) \
upper_bound(array.begin(), array.end(), j) - \
lower_bound(array.begin(), array.end(), \
i) // number of numbers between i & j
#define vc clear()
#define endl '\n'
#define sp system("pause");
#define INF 9223372036854775807
#define MINF -9223372036854775808
typedef tree<pll, null_type, less<pll>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
// string binary = bitset<32>(n).to_string();
lli x, y, d;
void gcd(lli a, lli b) {
if (b == 0) {
d = a;
x = 1;
y = 0;
return;
}
gcd(b, a % b);
lli temp = x;
x = y;
y = temp - (a / b) * y;
return;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
lli n;
cin >> n;
cout << (n - 2) * 180;
return 0;
} | delete | 70 | 74 | 70 | 70 | 0 | |
p03023 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define ll long long int
#define ull unsigned long long int
#define ld long double
#define mod 1000000007
#define inf 1000000000000000007
#define eps 0.00000001
#define pi 3.141592653589793
#define pii pair<int, int>
#define pdd pair<ld, ld>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define vii vector<int>
#define vpl vector<pll>
#define vll vector<ll>
#define sti stack<int>
#define stll stack<ll>
#define mseti multiset<ll>
#define msetd multiset<ll, greater<ll>>
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define stp setprecision(20) // use fixed before stp
#define endl '\n'
int main() {
FAST
#ifndef ONLINE_JUDGE
freopen("input.txt", "rt", stdin);
freopen("output.txt", "wt", stdout);
#endif
ll n;
cin >> n;
ll ans = 180 * (n - 2);
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define ll long long int
#define ull unsigned long long int
#define ld long double
#define mod 1000000007
#define inf 1000000000000000007
#define eps 0.00000001
#define pi 3.141592653589793
#define pii pair<int, int>
#define pdd pair<ld, ld>
#define pll pair<ll, ll>
#define ff first
#define ss second
#define vii vector<int>
#define vpl vector<pll>
#define vll vector<ll>
#define sti stack<int>
#define stll stack<ll>
#define mseti multiset<ll>
#define msetd multiset<ll, greater<ll>>
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define stp setprecision(20) // use fixed before stp
#define endl '\n'
int main() {
FAST ll n;
cin >> n;
ll ans = 180 * (n - 2);
cout << ans;
} | replace | 31 | 37 | 31 | 32 | 0 | |
p03023 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cout << 180 * (N - 2) / N << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << 180 * (N - 2) << endl;
}
| replace | 5 | 6 | 5 | 7 | 0 | |
p03023 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define int long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define pii pair<int, int>
#define all(x) (x).begin(), (x).end()
#define forn(i, n) for (int i = 0; i < (n); i++)
#define for1(i, n) for (int i = 1; i < (n); i++)
const int MOD = 987654319; // 1e9 + 7 ;
int mpow(int a, int b, int p = MOD) {
a = a % p;
int res = 1;
while (b > 0) {
if (b & 1)
res = (res * a) % p;
a = (a * a) % p;
b = b >> 1;
}
return res % p;
}
const int N = 300002;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
#endif
int n;
cin >> n;
cout << (n - 2) * 180;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
#define int long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define pii pair<int, int>
#define all(x) (x).begin(), (x).end()
#define forn(i, n) for (int i = 0; i < (n); i++)
#define for1(i, n) for (int i = 1; i < (n); i++)
const int MOD = 987654319; // 1e9 + 7 ;
int mpow(int a, int b, int p = MOD) {
a = a % p;
int res = 1;
while (b > 0) {
if (b & 1)
res = (res * a) % p;
a = (a * a) % p;
b = b >> 1;
}
return res % p;
}
const int N = 300002;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
cout << (n - 2) * 180;
} | replace | 33 | 36 | 33 | 34 | 0 | |
p03023 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main(void) {
int N;
cin >> N;
return (180 * (N) + 180);
} | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main(void) {
int N;
cin >> N;
cout << (180 + (N - 3) * 180);
return 0;
} | replace | 6 | 7 | 6 | 8 | 208 | |
p03025 | C++ | Runtime Error |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <typeinfo>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using R = double;
using Data = pair<ll, vector<ll>>;
template <typename T>
using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 60;
struct edge {
ll from;
ll to;
ll cost;
};
typedef pair<ll, ll> pll;
#define all(x) (x).begin(), (x).end()
#define rep(i, m, n) for (ll i = m; i < n; ++i)
#define pb push_back
#define fore(i, a) for (auto &i : a)
#define rrep(i, m, n) for (ll i = m; i >= n; --i)
#define INF INT_MAX / 2
const int MAX = 101010;
ll fac[MAX], finv[MAX], inv[MAX];
void combinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll comb(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll power(ll x, ll n) {
if (n == 0)
return 1;
else if (n % 2 == 1) {
return (x * power(x, n - 1)) % MOD;
} else {
ll half = power(x, n / 2);
return (half * half) % MOD;
}
}
ll N, A, B, C;
ll ans = 0;
int main() {
cin >> N >> A >> B >> C;
combinit();
ll X = (A * inv[A + B]) % MOD;
ll Y = (B * inv[A + B]) % MOD;
for (ll i = N; i <= 2 * N - 1; i++) {
ll temp = 1;
temp *= i;
temp %= MOD;
temp *= comb(i - 1, N - 1);
temp %= MOD;
temp *=
(power(X, N) * power(Y, i - N) + power(Y, N) * power(X, i - N)) % MOD;
temp %= MOD;
ans += temp;
ans %= MOD;
}
if (C > 0) {
ans *= (100 * inv[A + B]) % MOD;
ans %= MOD;
}
cout << ans % MOD << endl;
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <typeinfo>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using R = double;
using Data = pair<ll, vector<ll>>;
template <typename T>
using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 60;
struct edge {
ll from;
ll to;
ll cost;
};
typedef pair<ll, ll> pll;
#define all(x) (x).begin(), (x).end()
#define rep(i, m, n) for (ll i = m; i < n; ++i)
#define pb push_back
#define fore(i, a) for (auto &i : a)
#define rrep(i, m, n) for (ll i = m; i >= n; --i)
#define INF INT_MAX / 2
const int MAX = 303030;
ll fac[MAX], finv[MAX], inv[MAX];
void combinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll comb(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll power(ll x, ll n) {
if (n == 0)
return 1;
else if (n % 2 == 1) {
return (x * power(x, n - 1)) % MOD;
} else {
ll half = power(x, n / 2);
return (half * half) % MOD;
}
}
ll N, A, B, C;
ll ans = 0;
int main() {
cin >> N >> A >> B >> C;
combinit();
ll X = (A * inv[A + B]) % MOD;
ll Y = (B * inv[A + B]) % MOD;
for (ll i = N; i <= 2 * N - 1; i++) {
ll temp = 1;
temp *= i;
temp %= MOD;
temp *= comb(i - 1, N - 1);
temp %= MOD;
temp *=
(power(X, N) * power(Y, i - N) + power(Y, N) * power(X, i - N)) % MOD;
temp %= MOD;
ans += temp;
ans %= MOD;
}
if (C > 0) {
ans *= (100 * inv[A + B]) % MOD;
ans %= MOD;
}
cout << ans % MOD << endl;
return 0;
}
| replace | 44 | 45 | 44 | 45 | 0 | |
p03025 | C++ | Runtime Error | #include <bits/stdc++.h>
namespace MMNMM {
template <class SemiGroup, class size_type>
constexpr SemiGroup pow(const SemiGroup &a, size_type n,
const SemiGroup &b = SemiGroup::e()) {
SemiGroup ret = b, p = a;
while (n) {
if (n & 1)
ret *= p;
p *= p;
n >>= 1;
}
return ret;
}
template <class UnsignedInteger = unsigned long,
UnsignedInteger Mod = 1000000007>
class modint {
static_assert(Mod & 1, "mod mast be odd");
using value_type = UnsignedInteger;
using const_value = const value_type;
using reference_type = value_type &;
using const_reference = const_value &;
static constexpr size_t bit_length = 32;
static_assert(Mod < static_cast<UnsignedInteger>(1) << bit_length - 2,
"mod is too big");
static constexpr value_type mask =
~(~static_cast<UnsignedInteger>(0) << bit_length);
static constexpr value_type f(value_type n) {
value_type ret = 1;
for (auto _ = 0; _ < 5; ++_)
ret = ret * (2 - ret * n);
return -ret & mask;
}
static constexpr const_value minv{f(Mod)};
static constexpr const_value r2{-Mod % Mod};
static constexpr const_value r{
(static_cast<UnsignedInteger>(1) << bit_length) % Mod};
static constexpr value_type reduce(const_value v) {
return (v + Mod * ((v * minv) & mask)) >> bit_length;
}
value_type val;
static constexpr value_type upperbound = 2 * Mod;
public:
static constexpr modint e() { return modint(1); }
static constexpr value_type get_minv() noexcept { return minv; }
static constexpr value_type get_r2() noexcept { return r2; }
static constexpr value_type get_mod() noexcept { return Mod; }
constexpr value_type get_value() const noexcept {
return val == Mod ? 0 : reduce(val);
}
constexpr value_type get_raw() const noexcept { return val; }
constexpr modint() : val(0) {}
template <class T> constexpr modint(const T &_v = 0) : val(reduce(_v * r2)) {}
template <class UnsignedInteger2, UnsignedInteger2 Mod2>
constexpr modint(const modint<UnsignedInteger2, Mod2> &_v)
: val(reduce(_v.get_value() * r2)) {}
template <class UnsignedInteger2>
constexpr modint(const modint<UnsignedInteger2, Mod> &_v)
: val(_v.get_raw()) {}
constexpr modint(const modint &_v) = default;
constexpr const modint operator++(int) noexcept {
auto t = *this;
val += r;
val -= (val >= upperbound) * upperbound;
return t;
}
constexpr const modint operator--(int) noexcept {
auto t = *this;
val += (val < r) * upperbound;
val -= r;
return t;
}
constexpr modint &operator++() noexcept {
val += r;
val -= (val >= upperbound) * upperbound;
return *this;
}
constexpr modint &operator--() noexcept {
val += (val < r) * upperbound;
val -= r;
return *this;
}
constexpr modint operator+() const noexcept { return *this; }
constexpr modint operator-() const noexcept {
auto t = modint(upperbound - this->get_value());
return t;
}
explicit operator value_type() const noexcept { return this->val; }
constexpr modint &operator=(const modint &rhs) &noexcept {
this->val = rhs.get_raw();
return *this;
}
constexpr modint &operator+=(const modint &rhs) noexcept {
this->val += rhs.get_raw();
this->val -= (this->val >= upperbound) * upperbound;
return *this;
}
constexpr modint &operator-=(const modint &rhs) noexcept {
this->val += upperbound - rhs.get_raw();
this->val -= (this->val >= upperbound) * upperbound;
return *this;
}
constexpr modint &operator*=(const modint &rhs) noexcept {
this->val *= rhs.get_raw();
this->val = reduce(this->val);
return *this;
}
constexpr modint &operator/=(const modint &rhs) noexcept {
*this = pow(rhs, Mod - 2, *this);
return *this;
}
constexpr modint &operator|=(const modint &rhs) noexcept {
this->val += rhs.get_raw();
return *this;
}
constexpr void regularize() noexcept { this->val %= upperbound; }
constexpr modint operator+(const modint &rhs) noexcept {
auto t = *this;
t += rhs;
return t;
}
constexpr modint operator-(const modint &rhs) noexcept {
auto t = *this;
t -= rhs;
return t;
}
constexpr modint operator*(const modint &rhs) noexcept {
auto t = *this;
t *= rhs;
return t;
}
constexpr modint operator/(const modint &rhs) noexcept {
auto t = *this;
t /= rhs;
return t;
}
};
template <class UnsignedInteger, UnsignedInteger Mod>
std::ostream &operator<<(std::ostream &os,
const modint<UnsignedInteger, Mod> &mint) {
os << mint.get_value();
return os;
}
template <class UnsignedInteger, UnsignedInteger Mod>
std::istream &operator>>(std::istream &is, modint<UnsignedInteger, Mod> &mint) {
UnsignedInteger t;
is >> t;
mint = modint<UnsignedInteger, Mod>(t);
return is;
}
} // namespace MMNMM
int main() {
using namespace std;
constexpr unsigned long MOD = 1000000007;
using modint = MMNMM::modint<>;
modint N, A, B, C;
cin >> N >> A >> B >> C;
const unsigned long Nn = N.get_value();
A /= 100;
B /= 100;
C /= 100;
C = -C + 1;
C /= C * C;
A *= C;
B *= C;
vector<modint> ifr(Nn, 1);
for (unsigned long i = 2; i != Nn; ++i)
ifr[i] = ifr[MOD % i] * (MOD - MOD / i);
modint ansA{0}, ansB{0}, Ap{1}, Bp{1}, a = C * N, bin = 1;
for (unsigned long i = 0; i != Nn; ++i) {
ansA |= a * bin * Ap;
ansB |= a * bin * Bp;
a += C;
Ap *= A;
Bp *= B;
bin *= (N + i) * ifr[i + 1];
}
ansA.regularize();
ansB.regularize();
cout << ansA * Bp + ansB * Ap << endl;
return 0;
} | #include <bits/stdc++.h>
namespace MMNMM {
template <class SemiGroup, class size_type>
constexpr SemiGroup pow(const SemiGroup &a, size_type n,
const SemiGroup &b = SemiGroup::e()) {
SemiGroup ret = b, p = a;
while (n) {
if (n & 1)
ret *= p;
p *= p;
n >>= 1;
}
return ret;
}
template <class UnsignedInteger = unsigned long,
UnsignedInteger Mod = 1000000007>
class modint {
static_assert(Mod & 1, "mod mast be odd");
using value_type = UnsignedInteger;
using const_value = const value_type;
using reference_type = value_type &;
using const_reference = const_value &;
static constexpr size_t bit_length = 32;
static_assert(Mod < static_cast<UnsignedInteger>(1) << bit_length - 2,
"mod is too big");
static constexpr value_type mask =
~(~static_cast<UnsignedInteger>(0) << bit_length);
static constexpr value_type f(value_type n) {
value_type ret = 1;
for (auto _ = 0; _ < 5; ++_)
ret = ret * (2 - ret * n);
return -ret & mask;
}
static constexpr const_value minv{f(Mod)};
static constexpr const_value r2{-Mod % Mod};
static constexpr const_value r{
(static_cast<UnsignedInteger>(1) << bit_length) % Mod};
static constexpr value_type reduce(const_value v) {
return (v + Mod * ((v * minv) & mask)) >> bit_length;
}
value_type val;
static constexpr value_type upperbound = 2 * Mod;
public:
static constexpr modint e() { return modint(1); }
static constexpr value_type get_minv() noexcept { return minv; }
static constexpr value_type get_r2() noexcept { return r2; }
static constexpr value_type get_mod() noexcept { return Mod; }
constexpr value_type get_value() const noexcept {
return val == Mod ? 0 : reduce(val);
}
constexpr value_type get_raw() const noexcept { return val; }
constexpr modint() : val(0) {}
template <class T> constexpr modint(const T &_v = 0) : val(reduce(_v * r2)) {}
template <class UnsignedInteger2, UnsignedInteger2 Mod2>
constexpr modint(const modint<UnsignedInteger2, Mod2> &_v)
: val(reduce(_v.get_value() * r2)) {}
template <class UnsignedInteger2>
constexpr modint(const modint<UnsignedInteger2, Mod> &_v)
: val(_v.get_raw()) {}
constexpr modint(const modint &_v) = default;
constexpr const modint operator++(int) noexcept {
auto t = *this;
val += r;
val -= (val >= upperbound) * upperbound;
return t;
}
constexpr const modint operator--(int) noexcept {
auto t = *this;
val += (val < r) * upperbound;
val -= r;
return t;
}
constexpr modint &operator++() noexcept {
val += r;
val -= (val >= upperbound) * upperbound;
return *this;
}
constexpr modint &operator--() noexcept {
val += (val < r) * upperbound;
val -= r;
return *this;
}
constexpr modint operator+() const noexcept { return *this; }
constexpr modint operator-() const noexcept {
auto t = modint(upperbound - this->get_value());
return t;
}
explicit operator value_type() const noexcept { return this->val; }
constexpr modint &operator=(const modint &rhs) &noexcept {
this->val = rhs.get_raw();
return *this;
}
constexpr modint &operator+=(const modint &rhs) noexcept {
this->val += rhs.get_raw();
this->val -= (this->val >= upperbound) * upperbound;
return *this;
}
constexpr modint &operator-=(const modint &rhs) noexcept {
this->val += upperbound - rhs.get_raw();
this->val -= (this->val >= upperbound) * upperbound;
return *this;
}
constexpr modint &operator*=(const modint &rhs) noexcept {
this->val *= rhs.get_raw();
this->val = reduce(this->val);
return *this;
}
constexpr modint &operator/=(const modint &rhs) noexcept {
*this = pow(rhs, Mod - 2, *this);
return *this;
}
constexpr modint &operator|=(const modint &rhs) noexcept {
this->val += rhs.get_raw();
return *this;
}
constexpr void regularize() noexcept { this->val %= upperbound; }
constexpr modint operator+(const modint &rhs) noexcept {
auto t = *this;
t += rhs;
return t;
}
constexpr modint operator-(const modint &rhs) noexcept {
auto t = *this;
t -= rhs;
return t;
}
constexpr modint operator*(const modint &rhs) noexcept {
auto t = *this;
t *= rhs;
return t;
}
constexpr modint operator/(const modint &rhs) noexcept {
auto t = *this;
t /= rhs;
return t;
}
};
template <class UnsignedInteger, UnsignedInteger Mod>
std::ostream &operator<<(std::ostream &os,
const modint<UnsignedInteger, Mod> &mint) {
os << mint.get_value();
return os;
}
template <class UnsignedInteger, UnsignedInteger Mod>
std::istream &operator>>(std::istream &is, modint<UnsignedInteger, Mod> &mint) {
UnsignedInteger t;
is >> t;
mint = modint<UnsignedInteger, Mod>(t);
return is;
}
} // namespace MMNMM
int main() {
using namespace std;
constexpr unsigned long MOD = 1000000007;
using modint = MMNMM::modint<>;
modint N, A, B, C;
cin >> N >> A >> B >> C;
const unsigned long Nn = N.get_value();
A /= 100;
B /= 100;
C /= 100;
C = -C + 1;
C /= C * C;
A *= C;
B *= C;
vector<modint> ifr(Nn, 1);
if (Nn > 2)
for (unsigned long i = 2; i != Nn; ++i)
ifr[i] = ifr[MOD % i] * (MOD - MOD / i);
modint ansA{0}, ansB{0}, Ap{1}, Bp{1}, a = C * N, bin = 1;
for (unsigned long i = 0; i != Nn; ++i) {
ansA |= a * bin * Ap;
ansB |= a * bin * Bp;
a += C;
Ap *= A;
Bp *= B;
bin *= (N + i) * ifr[i + 1];
}
ansA.regularize();
ansB.regularize();
cout << ansA * Bp + ansB * Ap << endl;
return 0;
} | replace | 204 | 206 | 204 | 207 | -11 | |
p03025 | C++ | Runtime Error | #include <stdio.h>
#include <stdlib.h>
#define MAX_N (100000L)
#define MAX_FACT (MAX_N)
#define NUM_MOD (1000000007L)
long fs[MAX_FACT + 1], finvs[MAX_FACT + 1], invs[MAX_FACT + 1];
void combination_init() {
fs[0] = fs[1] = 1;
finvs[0] = finvs[1] = 1;
invs[1] = 1;
for (long i = 2; i <= MAX_FACT; i++) {
fs[i] = fs[i - 1] * i % NUM_MOD;
invs[i] = NUM_MOD - invs[NUM_MOD % i] * (NUM_MOD / i) % NUM_MOD;
finvs[i] = finvs[i - 1] * invs[i] % NUM_MOD;
}
}
long combination(long n, long k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fs[n] * (finvs[k] * finvs[n - k] % NUM_MOD) % NUM_MOD;
}
long mod(long n, long k) { return n % k >= 0 ? n % k : n % k + k; }
long pow_mod(long x, long k, long mod) {
long ret = 1, p = x;
while (k > 0) {
if (k & 1) {
ret = (ret * p) % mod;
}
p = (p * p) % mod;
k /= 2;
}
return ret;
}
int main(int argc, char *argv[]) {
// read inputs
long N, A, B, C;
scanf("%ld %ld %ld %ld", &N, &A, &B, &C);
// solve
long ans = 0;
combination_init();
// part1
long x1 = 0;
for (long k = 0; k <= N - 1; k++) {
x1 = mod(mod(mod(pow_mod(mod(A * invs[A + B], NUM_MOD), N, NUM_MOD) *
pow_mod(mod(B * invs[A + B], NUM_MOD), k, NUM_MOD),
NUM_MOD) *
combination(N + k, k),
NUM_MOD) +
x1,
NUM_MOD);
}
x1 = mod(N * x1, NUM_MOD);
// part2
long x2 = 0;
for (long k = 0; k <= N - 1; k++) {
x2 = mod(mod(mod(pow_mod(mod(A * invs[A + B], NUM_MOD), k, NUM_MOD) *
pow_mod(mod(B * invs[A + B], NUM_MOD), N, NUM_MOD),
NUM_MOD) *
combination(N + k, k),
NUM_MOD) +
x2,
NUM_MOD);
}
x2 = mod(N * x2, NUM_MOD);
printf("%ld\n",
mod(mod(mod(x1 + x2, NUM_MOD) * 100, NUM_MOD) * invs[A + B], NUM_MOD));
return 0;
}
| #include <stdio.h>
#include <stdlib.h>
#define MAX_N (300000L)
#define MAX_FACT (MAX_N)
#define NUM_MOD (1000000007L)
long fs[MAX_FACT + 1], finvs[MAX_FACT + 1], invs[MAX_FACT + 1];
void combination_init() {
fs[0] = fs[1] = 1;
finvs[0] = finvs[1] = 1;
invs[1] = 1;
for (long i = 2; i <= MAX_FACT; i++) {
fs[i] = fs[i - 1] * i % NUM_MOD;
invs[i] = NUM_MOD - invs[NUM_MOD % i] * (NUM_MOD / i) % NUM_MOD;
finvs[i] = finvs[i - 1] * invs[i] % NUM_MOD;
}
}
long combination(long n, long k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fs[n] * (finvs[k] * finvs[n - k] % NUM_MOD) % NUM_MOD;
}
long mod(long n, long k) { return n % k >= 0 ? n % k : n % k + k; }
long pow_mod(long x, long k, long mod) {
long ret = 1, p = x;
while (k > 0) {
if (k & 1) {
ret = (ret * p) % mod;
}
p = (p * p) % mod;
k /= 2;
}
return ret;
}
int main(int argc, char *argv[]) {
// read inputs
long N, A, B, C;
scanf("%ld %ld %ld %ld", &N, &A, &B, &C);
// solve
long ans = 0;
combination_init();
// part1
long x1 = 0;
for (long k = 0; k <= N - 1; k++) {
x1 = mod(mod(mod(pow_mod(mod(A * invs[A + B], NUM_MOD), N, NUM_MOD) *
pow_mod(mod(B * invs[A + B], NUM_MOD), k, NUM_MOD),
NUM_MOD) *
combination(N + k, k),
NUM_MOD) +
x1,
NUM_MOD);
}
x1 = mod(N * x1, NUM_MOD);
// part2
long x2 = 0;
for (long k = 0; k <= N - 1; k++) {
x2 = mod(mod(mod(pow_mod(mod(A * invs[A + B], NUM_MOD), k, NUM_MOD) *
pow_mod(mod(B * invs[A + B], NUM_MOD), N, NUM_MOD),
NUM_MOD) *
combination(N + k, k),
NUM_MOD) +
x2,
NUM_MOD);
}
x2 = mod(N * x2, NUM_MOD);
printf("%ld\n",
mod(mod(mod(x1 + x2, NUM_MOD) * 100, NUM_MOD) * invs[A + B], NUM_MOD));
return 0;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p03025 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef tuple<int, int, int> T;
const int MAX_N = (int)2e5 + 5;
const lint MOD = (lint)1e9 + 7;
lint E[MAX_N], inv_pow[MAX_N], ap[MAX_N], bp[MAX_N];
vector<lint> fact, fact_inv, inv;
T ExtendedGcd(int a, int b) {
if (b == 0)
return T(1, 0, a);
int x, y, g;
tie(x, y, g) = ExtendedGcd(b, a % b);
return T(y, x - a / b * y, g);
}
void mod_add(lint &a, lint b) { a = (a + b) % MOD; }
lint mod_pow(lint n, lint x) {
lint res = 1;
while (x) {
if (x & 1)
res = res * n % MOD;
x >>= 1;
n = n * n % MOD;
}
return res;
}
void createFactInvMod(int n) {
fact.resize((unsigned int)n + 1);
fact_inv.resize((unsigned int)n + 1);
fact[0] = 1;
for (int i = 1; i <= n; i++)
fact[i] = fact[i - 1] * i % MOD;
fact_inv[n] = mod_pow(fact[n], MOD - 2);
for (int i = n - 1; 0 <= i; i--)
fact_inv[i] = fact_inv[i + 1] * (i + 1) % MOD;
}
void createInvMod(int n) {
inv.resize((unsigned int)n + 1);
createFactInvMod(n);
inv[0] = 0;
for (int i = 1; i <= n; i++)
inv[i] = fact[i - 1] * fact_inv[i] % MOD;
}
lint comb(lint n, lint r) {
return fact[n] * fact_inv[r] % MOD * fact_inv[n - r] % MOD;
}
int main() {
ios::sync_with_stdio(false), cin.tie(nullptr);
lint N, A, B, C, D, ans = 0;
cin >> N >> A >> B >> C >> D;
createInvMod(100);
ap[0] = 1, bp[0] = 1;
for (lint i = 0; i < 2 * N; i++) {
ap[i + 1] = ap[i] * A % MOD;
bp[i + 1] = bp[i] * B % MOD;
inv_pow[i] = mod_pow(A + B, MOD - i - 1);
E[i] = 100 * i * inv[100 - C] % MOD;
}
for (lint i = N; i < 2 * N; i++) {
mod_add(ans, (ap[N] * bp[i - N] % MOD + ap[i - N] * bp[N] % MOD) % MOD *
E[i] % MOD * inv_pow[i] % MOD * comb(i - 1, N - 1) % MOD);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long lint;
typedef tuple<int, int, int> T;
const int MAX_N = (int)2e5 + 5;
const lint MOD = (lint)1e9 + 7;
lint E[MAX_N], inv_pow[MAX_N], ap[MAX_N], bp[MAX_N];
vector<lint> fact, fact_inv, inv;
T ExtendedGcd(int a, int b) {
if (b == 0)
return T(1, 0, a);
int x, y, g;
tie(x, y, g) = ExtendedGcd(b, a % b);
return T(y, x - a / b * y, g);
}
void mod_add(lint &a, lint b) { a = (a + b) % MOD; }
lint mod_pow(lint n, lint x) {
lint res = 1;
while (x) {
if (x & 1)
res = res * n % MOD;
x >>= 1;
n = n * n % MOD;
}
return res;
}
void createFactInvMod(int n) {
fact.resize((unsigned int)n + 1);
fact_inv.resize((unsigned int)n + 1);
fact[0] = 1;
for (int i = 1; i <= n; i++)
fact[i] = fact[i - 1] * i % MOD;
fact_inv[n] = mod_pow(fact[n], MOD - 2);
for (int i = n - 1; 0 <= i; i--)
fact_inv[i] = fact_inv[i + 1] * (i + 1) % MOD;
}
void createInvMod(int n) {
inv.resize((unsigned int)n + 1);
createFactInvMod(n);
inv[0] = 0;
for (int i = 1; i <= n; i++)
inv[i] = fact[i - 1] * fact_inv[i] % MOD;
}
lint comb(lint n, lint r) {
return fact[n] * fact_inv[r] % MOD * fact_inv[n - r] % MOD;
}
int main() {
ios::sync_with_stdio(false), cin.tie(nullptr);
lint N, A, B, C, ans = 0;
cin >> N >> A >> B >> C;
createInvMod(max(2 * N, 100LL));
ap[0] = 1, bp[0] = 1;
for (lint i = 0; i < 2 * N; i++) {
ap[i + 1] = ap[i] * A % MOD;
bp[i + 1] = bp[i] * B % MOD;
inv_pow[i] = mod_pow(A + B, MOD - i - 1);
E[i] = 100 * i * inv[100 - C] % MOD;
}
for (lint i = N; i < 2 * N; i++) {
mod_add(ans, (ap[N] * bp[i - N] % MOD + ap[i - N] * bp[N] % MOD) % MOD *
E[i] % MOD * inv_pow[i] % MOD * comb(i - 1, N - 1) % MOD);
}
cout << ans << endl;
return 0;
} | replace | 56 | 59 | 56 | 59 | 0 | |
p03025 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using std::cerr;
using std::cin;
using std::cout;
using std::endl;
using std::bitset;
using std::deque;
using std::iterator;
using std::map;
using std::multimap;
using std::multiset;
using std::pair;
using std::queue;
using std::set;
using std::stack;
using std::string;
using std::vector;
using std::fill;
using std::ios_base;
using std::max_element;
using std::min_element;
using std::reverse;
using std::sort;
using std::stable_sort;
using std::swap;
using std::unique;
using std::fixed;
using std::setprecision;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef string S;
ll min(ll a, ll b) { return a < b ? a : b; }
ll min(int a, ll b) { return a < b ? a : b; }
ll min(ll a, int b) { return a < b ? a : b; }
ll min(int a, int b) { return a < b ? a : b; }
ll max(ll a, ll b) { return a > b ? a : b; }
ll max(int a, ll b) { return a > b ? a : b; }
ll max(ll a, int b) { return a > b ? a : b; }
ll max(int a, int b) { return a > b ? a : b; }
namespace MySpace {};
#define F(i, n) for (int(i) = 0; (i) != (n); (i)++)
#define fi first
#define se second
#define re return
#define all(x) (x).begin(), (x).end()
#define int long long
long long n, a, b, c;
long long MOD = 1e9 + 7;
long long inq(long long a, long long b) {
if (b == 0)
return 1;
long long l = inq(a, b / 2);
if (b % 2)
return l * l % MOD * a % MOD;
return l * l % MOD;
}
long long fact[500000], defact[500000];
long long cnk(long long n, long long k) {
return fact[n] * defact[k] % MOD * defact[n - k] % MOD;
}
long long dwn = 1;
long long g[500000];
long long success[500000];
long long cnk2(long long n, long long k) {
long long fg = inq(a, k) * inq(b, n - k) % MOD *
inq(inq((a + b) * inq(2, MOD - 2), n), MOD - 2) % MOD;
return cnk(n, k) * dwn % MOD * fg % MOD * inq(g[n + 1], MOD - 2) % MOD;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> a >> b >> c;
fact[0] = 1, defact[0] = 1;
for (int i = 1; i < 2 * n; i++)
fact[i] = fact[i - 1] * i % MOD, defact[i] = inq(fact[i], MOD - 2);
for (int i = n; i < 2 * n; i++) {
g[i] = inq(2, i - 1);
}
for (int i = n; i < 2 * n; i++)
dwn = dwn * g[i] % MOD;
dwn = dwn * inq((a + b), 2 * n - 1) % MOD;
long long up = 0, sup = 0;
for (int i = n; i < 2 * n; i++) {
long long dup = 0;
for (int x = n - 1; x <= n - 1; x++) {
if (x == n - 1 && i - 1 - x <= n - 1) {
dup = (dup + cnk2(i - 1, x) * a % MOD * inq(a + b, MOD - 2)) % MOD;
}
}
for (int x = i - n; x <= i - n; x++) {
if (x <= n - 1 && i - 1 - x == n - 1) {
dup = (dup + cnk2(i - 1, x) * b % MOD * inq(a + b, MOD - 2)) % MOD;
}
}
up = (up + i * dup) % MOD;
sup = (sup + dup) % MOD;
}
if (sup != dwn) {
cout << 100 / 0;
}
up = up * (a + b + c) % MOD;
dwn = dwn * (a + b) % MOD;
cout << up * inq(dwn, MOD - 2) % MOD;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using std::cerr;
using std::cin;
using std::cout;
using std::endl;
using std::bitset;
using std::deque;
using std::iterator;
using std::map;
using std::multimap;
using std::multiset;
using std::pair;
using std::queue;
using std::set;
using std::stack;
using std::string;
using std::vector;
using std::fill;
using std::ios_base;
using std::max_element;
using std::min_element;
using std::reverse;
using std::sort;
using std::stable_sort;
using std::swap;
using std::unique;
using std::fixed;
using std::setprecision;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef string S;
ll min(ll a, ll b) { return a < b ? a : b; }
ll min(int a, ll b) { return a < b ? a : b; }
ll min(ll a, int b) { return a < b ? a : b; }
ll min(int a, int b) { return a < b ? a : b; }
ll max(ll a, ll b) { return a > b ? a : b; }
ll max(int a, ll b) { return a > b ? a : b; }
ll max(ll a, int b) { return a > b ? a : b; }
ll max(int a, int b) { return a > b ? a : b; }
namespace MySpace {};
#define F(i, n) for (int(i) = 0; (i) != (n); (i)++)
#define fi first
#define se second
#define re return
#define all(x) (x).begin(), (x).end()
#define int long long
long long n, a, b, c;
long long MOD = 1e9 + 7;
long long inq(long long a, long long b) {
if (b == 0)
return 1;
long long l = inq(a, b / 2);
if (b % 2)
return l * l % MOD * a % MOD;
return l * l % MOD;
}
long long fact[500000], defact[500000];
long long cnk(long long n, long long k) {
return fact[n] * defact[k] % MOD * defact[n - k] % MOD;
}
long long dwn = 1;
long long g[500000];
long long success[500000];
long long cnk2(long long n, long long k) {
long long fg = inq(a, k) * inq(b, n - k) % MOD *
inq(inq((a + b) * inq(2, MOD - 2) % MOD, n), MOD - 2) % MOD;
return cnk(n, k) * dwn % MOD * fg % MOD * inq(g[n + 1], MOD - 2) % MOD;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> a >> b >> c;
fact[0] = 1, defact[0] = 1;
for (int i = 1; i < 2 * n; i++)
fact[i] = fact[i - 1] * i % MOD, defact[i] = inq(fact[i], MOD - 2);
for (int i = n; i < 2 * n; i++) {
g[i] = inq(2, i - 1);
}
for (int i = n; i < 2 * n; i++)
dwn = dwn * g[i] % MOD;
dwn = dwn * inq((a + b), 2 * n - 1) % MOD;
long long up = 0, sup = 0;
for (int i = n; i < 2 * n; i++) {
long long dup = 0;
for (int x = n - 1; x <= n - 1; x++) {
if (x == n - 1 && i - 1 - x <= n - 1) {
dup = (dup + cnk2(i - 1, x) * a % MOD * inq(a + b, MOD - 2)) % MOD;
}
}
for (int x = i - n; x <= i - n; x++) {
if (x <= n - 1 && i - 1 - x == n - 1) {
dup = (dup + cnk2(i - 1, x) * b % MOD * inq(a + b, MOD - 2)) % MOD;
}
}
up = (up + i * dup) % MOD;
sup = (sup + dup) % MOD;
}
if (sup != dwn) {
cout << 100 / 0;
}
up = up * (a + b + c) % MOD;
dwn = dwn * (a + b) % MOD;
cout << up * inq(dwn, MOD - 2) % MOD;
}
| replace | 95 | 96 | 95 | 96 | 0 | |
p03025 | C++ | Runtime Error | /**
* author: otera
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#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;
// #define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf = 1e9 + 7;
const ll INF = 1LL << 60;
const ll mod = 1e9 + 7;
#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++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(), c.end()
#define pb push_back
#define debug(x) cerr << #x << " = " << (x) << endl;
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;
}
// modint: mod 計算を int を扱うように扱える構造体
template <int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
if (val < 0)
val += MOD;
}
constexpr int getmod() { return MOD; }
constexpr Fp operator-() const noexcept { return val ? MOD - val : 0; }
constexpr Fp operator+(const Fp &r) const noexcept { return Fp(*this) += r; }
constexpr Fp operator-(const Fp &r) const noexcept { return Fp(*this) -= r; }
constexpr Fp operator*(const Fp &r) const noexcept { return Fp(*this) *= r; }
constexpr Fp operator/(const Fp &r) const noexcept { return Fp(*this) /= r; }
constexpr Fp &operator+=(const Fp &r) noexcept {
val += r.val;
if (val >= MOD)
val -= MOD;
return *this;
}
constexpr Fp &operator-=(const Fp &r) noexcept {
val -= r.val;
if (val < 0)
val += MOD;
return *this;
}
constexpr Fp &operator*=(const Fp &r) noexcept {
val = val * r.val % MOD;
return *this;
}
constexpr Fp &operator/=(const Fp &r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % MOD;
if (val < 0)
val += MOD;
return *this;
}
constexpr bool operator==(const Fp &r) const noexcept {
return this->val == r.val;
}
constexpr bool operator!=(const Fp &r) const noexcept {
return this->val != r.val;
}
friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept {
return os << x.val;
}
friend constexpr istream &operator>>(istream &is, Fp<MOD> &x) noexcept {
return is >> x.val;
}
friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
// 二項係数ライブラリ
template <class T> struct BiCoef {
vector<T> fact_, inv_, finv_;
constexpr BiCoef() {}
constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
init(n);
}
constexpr void init(int n) noexcept {
fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
int MOD = fact_[0].getmod();
for (int i = 2; i < n; i++) {
fact_[i] = fact_[i - 1] * i;
inv_[i] = -inv_[MOD % i] * (MOD / i);
finv_[i] = finv_[i - 1] * inv_[i];
}
}
constexpr T com(int n, int k) const noexcept {
if (n < k || n < 0 || k < 0)
return 0;
return fact_[n] * finv_[k] * finv_[n - k];
}
constexpr T fact(int n) const noexcept {
if (n < 0)
return 0;
return fact_[n];
}
constexpr T inv(int n) const noexcept {
if (n < 0)
return 0;
return inv_[n];
}
constexpr T finv(int n) const noexcept {
if (n < 0)
return 0;
return finv_[n];
}
};
const int MOD = 1000000007;
// const int MOD = 998244353;
using mint = Fp<MOD>;
BiCoef<mint> bc;
void solve() {
int n, a, b, c;
cin >> n >> a >> b >> c;
mint ans = 0;
bc.init(100100);
for (int i = 0; i < n; ++i) {
ans += (mint)(n + i) * bc.com(n - 1 + i, i) *
(modpow((mint)a, n) * modpow((mint)b, i) +
modpow((mint)a, i) * modpow((mint)b, n)) /
modpow((mint)(a + b), (n + i));
}
cout << ans * (mint)100 / (mint)(a + b) << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
// cout << fixed << setprecision(10);
// int t; cin >> t; rep(i, t)solve();
solve();
return 0;
} | /**
* author: otera
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#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;
// #define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf = 1e9 + 7;
const ll INF = 1LL << 60;
const ll mod = 1e9 + 7;
#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++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(), c.end()
#define pb push_back
#define debug(x) cerr << #x << " = " << (x) << endl;
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;
}
// modint: mod 計算を int を扱うように扱える構造体
template <int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
if (val < 0)
val += MOD;
}
constexpr int getmod() { return MOD; }
constexpr Fp operator-() const noexcept { return val ? MOD - val : 0; }
constexpr Fp operator+(const Fp &r) const noexcept { return Fp(*this) += r; }
constexpr Fp operator-(const Fp &r) const noexcept { return Fp(*this) -= r; }
constexpr Fp operator*(const Fp &r) const noexcept { return Fp(*this) *= r; }
constexpr Fp operator/(const Fp &r) const noexcept { return Fp(*this) /= r; }
constexpr Fp &operator+=(const Fp &r) noexcept {
val += r.val;
if (val >= MOD)
val -= MOD;
return *this;
}
constexpr Fp &operator-=(const Fp &r) noexcept {
val -= r.val;
if (val < 0)
val += MOD;
return *this;
}
constexpr Fp &operator*=(const Fp &r) noexcept {
val = val * r.val % MOD;
return *this;
}
constexpr Fp &operator/=(const Fp &r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % MOD;
if (val < 0)
val += MOD;
return *this;
}
constexpr bool operator==(const Fp &r) const noexcept {
return this->val == r.val;
}
constexpr bool operator!=(const Fp &r) const noexcept {
return this->val != r.val;
}
friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept {
return os << x.val;
}
friend constexpr istream &operator>>(istream &is, Fp<MOD> &x) noexcept {
return is >> x.val;
}
friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
// 二項係数ライブラリ
template <class T> struct BiCoef {
vector<T> fact_, inv_, finv_;
constexpr BiCoef() {}
constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
init(n);
}
constexpr void init(int n) noexcept {
fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
int MOD = fact_[0].getmod();
for (int i = 2; i < n; i++) {
fact_[i] = fact_[i - 1] * i;
inv_[i] = -inv_[MOD % i] * (MOD / i);
finv_[i] = finv_[i - 1] * inv_[i];
}
}
constexpr T com(int n, int k) const noexcept {
if (n < k || n < 0 || k < 0)
return 0;
return fact_[n] * finv_[k] * finv_[n - k];
}
constexpr T fact(int n) const noexcept {
if (n < 0)
return 0;
return fact_[n];
}
constexpr T inv(int n) const noexcept {
if (n < 0)
return 0;
return inv_[n];
}
constexpr T finv(int n) const noexcept {
if (n < 0)
return 0;
return finv_[n];
}
};
const int MOD = 1000000007;
// const int MOD = 998244353;
using mint = Fp<MOD>;
BiCoef<mint> bc;
void solve() {
int n, a, b, c;
cin >> n >> a >> b >> c;
mint ans = 0;
bc.init(3000100);
for (int i = 0; i < n; ++i) {
ans += (mint)(n + i) * bc.com(n - 1 + i, i) *
(modpow((mint)a, n) * modpow((mint)b, i) +
modpow((mint)a, i) * modpow((mint)b, n)) /
modpow((mint)(a + b), (n + i));
}
cout << ans * (mint)100 / (mint)(a + b) << endl;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
// cout << fixed << setprecision(10);
// int t; cin >> t; rep(i, t)solve();
solve();
return 0;
} | replace | 179 | 180 | 179 | 180 | 0 | |
p03025 | C++ | Runtime Error | // Optimise
#include <bits/stdc++.h>
using namespace std;
#define Online 1
// #define multitest 1
#define Debug 1
void ControlIO();
void TimerStart();
void TimerStop();
#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;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll power(int base, int index) {
if (index == 0)
return 1;
ll temp = power(base, index / 2);
temp = (temp * temp) % mod;
if (index & 1)
temp = (temp * base) % mod;
return temp;
}
int n, a, b, c;
int _n = 1e5 + 10;
vector<ll> Fact(_n), Inv(_n);
int kmod = 1000000007;
void pre() {
Fact[0] = 1;
for (int i = 1; i < _n; ++i)
Fact[i] = (Fact[i - 1] * i) % kmod;
Inv[_n - 1] = power(Fact[_n - 1], kmod - 2);
for (int i = _n - 2; i >= 0; --i)
Inv[i] = (Inv[i + 1] * (1 + i)) % kmod;
// db(Inv[2]*2%mod);
}
ll com(int m) {
// db(m, n);
ll x = (Fact[m - 1] * Inv[n - 1]) % mod;
x *= Inv[m - n];
x %= mod;
ll temp = (power(a, n) * power(b, m - n)) % mod +
(power(a, m - n) * power(b, n)) % mod;
// db(temp);
temp %= mod;
temp *= m;
// db(temp);
temp %= mod;
temp *= x;
// db(temp);
return temp % mod;
}
void solve() {
pre();
cin >> n >> a >> b >> c;
ll ans = 0;
ll div = power(a + b, mod - 2);
a = (a * div) % mod;
b = (b * div) % mod;
for (int i = n; i < 2 * n; ++i) {
ans += com(i);
ans %= mod;
}
ans *= power(100 - c, mod - 2);
ans %= mod;
ans *= 100;
cout << (ans % mod) << '\n';
}
int main() {
ControlIO();
int t = 1;
#ifdef multitest
cin >> t;
#endif
TimerStart();
while (t--)
solve();
TimerStop();
return 0;
}
void ControlIO() {
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifndef Online
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
auto TimeStart = chrono::steady_clock::now();
auto TimeEnd = chrono::steady_clock::now();
void TimerStart() {
#ifndef Online
TimeStart = chrono::steady_clock::now();
#endif
}
void TimerStop() {
#ifndef Online
TimeEnd = chrono::steady_clock::now();
auto ElapsedTime = TimeEnd - TimeStart;
cout << "\n\nTime elapsed: " << chrono::duration<double>(ElapsedTime).count()
<< " seconds.\n";
#endif
} | // Optimise
#include <bits/stdc++.h>
using namespace std;
#define Online 1
// #define multitest 1
#define Debug 1
void ControlIO();
void TimerStart();
void TimerStop();
#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;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll power(int base, int index) {
if (index == 0)
return 1;
ll temp = power(base, index / 2);
temp = (temp * temp) % mod;
if (index & 1)
temp = (temp * base) % mod;
return temp;
}
int n, a, b, c;
int _n = 2e5 + 10;
vector<ll> Fact(_n), Inv(_n);
int kmod = 1000000007;
void pre() {
Fact[0] = 1;
for (int i = 1; i < _n; ++i)
Fact[i] = (Fact[i - 1] * i) % kmod;
Inv[_n - 1] = power(Fact[_n - 1], kmod - 2);
for (int i = _n - 2; i >= 0; --i)
Inv[i] = (Inv[i + 1] * (1 + i)) % kmod;
// db(Inv[2]*2%mod);
}
ll com(int m) {
// db(m, n);
ll x = (Fact[m - 1] * Inv[n - 1]) % mod;
x *= Inv[m - n];
x %= mod;
ll temp = (power(a, n) * power(b, m - n)) % mod +
(power(a, m - n) * power(b, n)) % mod;
// db(temp);
temp %= mod;
temp *= m;
// db(temp);
temp %= mod;
temp *= x;
// db(temp);
return temp % mod;
}
void solve() {
pre();
cin >> n >> a >> b >> c;
ll ans = 0;
ll div = power(a + b, mod - 2);
a = (a * div) % mod;
b = (b * div) % mod;
for (int i = n; i < 2 * n; ++i) {
ans += com(i);
ans %= mod;
}
ans *= power(100 - c, mod - 2);
ans %= mod;
ans *= 100;
cout << (ans % mod) << '\n';
}
int main() {
ControlIO();
int t = 1;
#ifdef multitest
cin >> t;
#endif
TimerStart();
while (t--)
solve();
TimerStop();
return 0;
}
void ControlIO() {
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifndef Online
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
auto TimeStart = chrono::steady_clock::now();
auto TimeEnd = chrono::steady_clock::now();
void TimerStart() {
#ifndef Online
TimeStart = chrono::steady_clock::now();
#endif
}
void TimerStop() {
#ifndef Online
TimeEnd = chrono::steady_clock::now();
auto ElapsedTime = TimeEnd - TimeStart;
cout << "\n\nTime elapsed: " << chrono::duration<double>(ElapsedTime).count()
<< " seconds.\n";
#endif
} | replace | 44 | 45 | 44 | 45 | 0 | |
p03025 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define sd(x) scanf("%d", &(x))
#define pii pair<int, int>
#define F first
#define S second
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
const int N = 1e5 + 10, mod = 1e9 + 7;
int fact[N], invfact[N];
inline int add(int x, int y) {
x += y;
if (x >= mod)
x -= mod;
return x;
}
inline int sub(int x, int y) {
x -= y;
if (x < 0)
x += mod;
return x;
}
inline int mul(int x, int y) { return (((ll)x) * y) % mod; }
inline int powr(int a, ll b) {
int x = 1 % mod;
while (b) {
if (b & 1)
x = mul(x, a);
a = mul(a, a);
b >>= 1;
}
return x;
}
inline int inv(int a) { return powr(a, mod - 2); }
void pre() {
fact[0] = invfact[0] = 1;
for (int i = 1; i < N; i++)
fact[i] = mul(i, fact[i - 1]);
invfact[N - 1] = inv(fact[N - 1]);
for (int i = N - 2; i >= 1; i--)
invfact[i] = mul(invfact[i + 1], i + 1);
assert(invfact[1] == 1);
}
inline int C(int n, int k) {
if (n < k || k < 0)
return 0;
return mul(fact[n], mul(invfact[k], invfact[n - k]));
}
int main() {
pre();
int n, a, b, c;
sd(n);
sd(a);
sd(b);
sd(c);
a = mul(a, inv(100));
b = mul(b, inv(100));
c = mul(c, inv(100));
a = mul(a, inv(sub(1, c)));
b = mul(b, inv(sub(1, c)));
int x = 0;
for (int i = n; i < 2 * n; i++) {
int t = mul(C(i - 1, n - 1), mul(powr(a, n), powr(b, i - n)));
t = add(t, mul(C(i - 1, n - 1), mul(powr(a, i - n), powr(b, n))));
x = add(x, mul(i, t));
}
printf("%d\n", mul(inv(sub(1, c)), x));
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define sd(x) scanf("%d", &(x))
#define pii pair<int, int>
#define F first
#define S second
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
const int N = 2e5 + 10, mod = 1e9 + 7;
int fact[N], invfact[N];
inline int add(int x, int y) {
x += y;
if (x >= mod)
x -= mod;
return x;
}
inline int sub(int x, int y) {
x -= y;
if (x < 0)
x += mod;
return x;
}
inline int mul(int x, int y) { return (((ll)x) * y) % mod; }
inline int powr(int a, ll b) {
int x = 1 % mod;
while (b) {
if (b & 1)
x = mul(x, a);
a = mul(a, a);
b >>= 1;
}
return x;
}
inline int inv(int a) { return powr(a, mod - 2); }
void pre() {
fact[0] = invfact[0] = 1;
for (int i = 1; i < N; i++)
fact[i] = mul(i, fact[i - 1]);
invfact[N - 1] = inv(fact[N - 1]);
for (int i = N - 2; i >= 1; i--)
invfact[i] = mul(invfact[i + 1], i + 1);
assert(invfact[1] == 1);
}
inline int C(int n, int k) {
if (n < k || k < 0)
return 0;
return mul(fact[n], mul(invfact[k], invfact[n - k]));
}
int main() {
pre();
int n, a, b, c;
sd(n);
sd(a);
sd(b);
sd(c);
a = mul(a, inv(100));
b = mul(b, inv(100));
c = mul(c, inv(100));
a = mul(a, inv(sub(1, c)));
b = mul(b, inv(sub(1, c)));
int x = 0;
for (int i = n; i < 2 * n; i++) {
int t = mul(C(i - 1, n - 1), mul(powr(a, n), powr(b, i - n)));
t = add(t, mul(C(i - 1, n - 1), mul(powr(a, i - n), powr(b, n))));
x = add(x, mul(i, t));
}
printf("%d\n", mul(inv(sub(1, c)), x));
} | replace | 26 | 27 | 26 | 27 | 0 | |
p03025 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i, b, e) for (ll i = (ll)b; i < (ll)e; i++)
#define rep0(i, n) REP(i, 0ll, n)
#define rep1(i, n) REP(i, 1ll, n + 1)
const ll longinf = 1ll << 60;
const int inf = (1 << 30) - 1;
// II→factorialを計算するrange
const ll MOD = 1e9 + 7;
const int II = 1e5 + 3;
ll addMod(ll a, ll b) { return ((a % MOD) + (b % MOD)) % MOD; }
ll mulMod(ll a, ll b) { return ((a % MOD) * (b % MOD)) % MOD; }
ll powMod(ll a, ll b) {
if (b == 0)
return 1;
else if (b % 2 == 0) {
ll ret = powMod(a, b / 2);
return ((ret % MOD) * (ret % MOD)) % MOD;
} else
return ((powMod(a, b - 1) % MOD) * (a % MOD)) % MOD;
}
ll divMod(ll a, ll b) { return ((a % MOD) * (powMod(b, MOD - 2) % MOD)) % MOD; }
ll fact[II + 1];
ll invfact[II + 1];
void calc() { // main関数内にcalc();を入れること(前計算)
fact[0] = 1;
invfact[0] = 1;
rep0(i, II) {
fact[i + 1] = mulMod(fact[i], i + 1);
invfact[i + 1] = divMod(1, fact[i + 1]);
}
}
int main() {
ll n, a, b, c;
cin >> n >> a >> b >> c;
calc();
ll p = divMod(a, a + b);
ll q = divMod(b, a + b);
ll ans = 0;
for (int m = n; m < 2 * n; m++) {
ll comb = mulMod(fact[m - 1], invfact[n - 1]);
comb = mulMod(comb, invfact[m - n]);
ll A = mulMod(powMod(p, n), powMod(q, m - n));
ll B = mulMod(powMod(p, m - n), powMod(q, n));
ll C = mulMod(addMod(A, B), m);
ans = addMod(ans, mulMod(comb, C));
}
ll d = divMod(100ll, addMod(a, b));
cout << mulMod(ans, d) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define REP(i, b, e) for (ll i = (ll)b; i < (ll)e; i++)
#define rep0(i, n) REP(i, 0ll, n)
#define rep1(i, n) REP(i, 1ll, n + 1)
const ll longinf = 1ll << 60;
const int inf = (1 << 30) - 1;
// II→factorialを計算するrange
const ll MOD = 1e9 + 7;
const ll II = 2e5 + 3;
ll addMod(ll a, ll b) { return ((a % MOD) + (b % MOD)) % MOD; }
ll mulMod(ll a, ll b) { return ((a % MOD) * (b % MOD)) % MOD; }
ll powMod(ll a, ll b) {
if (b == 0)
return 1;
else if (b % 2 == 0) {
ll ret = powMod(a, b / 2);
return ((ret % MOD) * (ret % MOD)) % MOD;
} else
return ((powMod(a, b - 1) % MOD) * (a % MOD)) % MOD;
}
ll divMod(ll a, ll b) { return ((a % MOD) * (powMod(b, MOD - 2) % MOD)) % MOD; }
ll fact[II + 1];
ll invfact[II + 1];
void calc() { // main関数内にcalc();を入れること(前計算)
fact[0] = 1;
invfact[0] = 1;
rep0(i, II) {
fact[i + 1] = mulMod(fact[i], i + 1);
invfact[i + 1] = divMod(1, fact[i + 1]);
}
}
int main() {
ll n, a, b, c;
cin >> n >> a >> b >> c;
calc();
ll p = divMod(a, a + b);
ll q = divMod(b, a + b);
ll ans = 0;
for (int m = n; m < 2 * n; m++) {
ll comb = mulMod(fact[m - 1], invfact[n - 1]);
comb = mulMod(comb, invfact[m - n]);
ll A = mulMod(powMod(p, n), powMod(q, m - n));
ll B = mulMod(powMod(p, m - n), powMod(q, n));
ll C = mulMod(addMod(A, B), m);
ans = addMod(ans, mulMod(comb, C));
}
ll d = divMod(100ll, addMod(a, b));
cout << mulMod(ans, d) << endl;
return 0;
} | replace | 12 | 13 | 12 | 13 | 0 | |
p03026 | C++ | Runtime Error | #include <bits/stdc++.h>
#define For(i, a, b) for (int(i) = (a); (i) < (b); ++(i))
#define rFor(i, a, b) for (int(i) = (a)-1; (i) >= (b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef pair<int, int> pii;
int n;
vector<int> G[1010];
int c[1010], p[1010];
int cur;
void dfs(int v) {
p[v] = c[cur--];
for (int nv : G[v])
if (!p[nv])
dfs(nv);
}
int main() {
scanf("%d", &n);
rep(i, n - 1) {
int a, b;
scanf("%d%d", &a, &b);
G[--a].push_back(--b);
G[b].push_back(a);
}
rep(i, n) scanf("%d", &c[i]);
sort(c, c + n);
rep(i, n) p[i] = 0;
cur = n - 1;
dfs(0);
int ans = 0;
rep(i, n - 1) ans += c[i];
printf("%d\n%d", ans, p[0]);
rep(i, n - 1) printf(" %d", p[i + 1]);
printf("\n");
} | #include <bits/stdc++.h>
#define For(i, a, b) for (int(i) = (a); (i) < (b); ++(i))
#define rFor(i, a, b) for (int(i) = (a)-1; (i) >= (b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef pair<int, int> pii;
int n;
vector<int> G[10010];
int c[10010], p[10010];
int cur;
void dfs(int v) {
p[v] = c[cur--];
for (int nv : G[v])
if (!p[nv])
dfs(nv);
}
int main() {
scanf("%d", &n);
rep(i, n - 1) {
int a, b;
scanf("%d%d", &a, &b);
G[--a].push_back(--b);
G[b].push_back(a);
}
rep(i, n) scanf("%d", &c[i]);
sort(c, c + n);
rep(i, n) p[i] = 0;
cur = n - 1;
dfs(0);
int ans = 0;
rep(i, n - 1) ans += c[i];
printf("%d\n%d", ans, p[0]);
rep(i, n - 1) printf(" %d", p[i + 1]);
printf("\n");
} | replace | 12 | 14 | 12 | 14 | 0 | |
p03026 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void dfs(int node, vector<vector<int>> edge, vector<int> &val,
priority_queue<int, vector<int>, greater<int>> &c) {
if (val[node] != -1 || c.empty())
return;
val[node] = 0; // 仮置き
for (auto tar : edge[node]) {
if (val[tar] == -1)
dfs(tar, edge, val, c);
}
val[node] = c.top();
c.pop();
}
int main() {
int n, a, b, x;
cin >> n;
vector<vector<int>> edge(n, vector<int>());
vector<int> val(n, -1);
priority_queue<int, vector<int>, greater<int>> c;
for (int i = 0; i < n - 1; i++) {
cin >> a >> b;
a--;
b--;
edge[a].push_back(b);
edge[b].push_back(a);
}
ll ans = 0;
for (int i = 0; i < n; i++) {
cin >> x;
c.push(x);
ans += x;
}
dfs(0, edge, val, c);
cout << ans - val[0] << endl;
for (auto node : val) {
cout << node << " ";
}
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void dfs(int node, vector<vector<int>> &edge, vector<int> &val,
priority_queue<int, vector<int>, greater<int>> &c) {
if (val[node] != -1 || c.empty())
return;
val[node] = 0; // 仮置き
for (auto tar : edge[node]) {
if (val[tar] == -1)
dfs(tar, edge, val, c);
}
val[node] = c.top();
c.pop();
}
int main() {
int n, a, b, x;
cin >> n;
vector<vector<int>> edge(n, vector<int>());
vector<int> val(n, -1);
priority_queue<int, vector<int>, greater<int>> c;
for (int i = 0; i < n - 1; i++) {
cin >> a >> b;
a--;
b--;
edge[a].push_back(b);
edge[b].push_back(a);
}
ll ans = 0;
for (int i = 0; i < n; i++) {
cin >> x;
c.push(x);
ans += x;
}
dfs(0, edge, val, c);
cout << ans - val[0] << endl;
for (auto node : val) {
cout << node << " ";
}
cout << endl;
} | replace | 4 | 5 | 4 | 5 | TLE | |
p03026 | C++ | Runtime Error | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
#define INF ((int)1e9)
#define INFLL ((ll)1e18)
#define MOD (1000000007LL)
int main(int argc, const char *argv[]) {
ios_base::sync_with_stdio(false);
int N;
cin >> N;
vector<vector<int>> G(N);
for (int n = 0; n < N - 1; ++n) {
int a, b;
cin >> a >> b;
--a;
--b;
G[a].push_back(b);
G[b].push_back(a);
}
multiset<int> Set;
int Res = 0;
for (int n = 0; n < N; ++n) {
int c;
cin >> c;
Set.insert(c);
Res += c;
}
auto itEnd = Set.rbegin();
Res -= *itEnd;
cout << Res << endl;
set<pair<int, int>> Num;
vector<int> NumNow(N);
for (int n = 0; n < N; ++n) {
Num.insert({G[n].size(), n});
NumNow[n] = G[n].size();
}
vector<int> Res2(N, -1);
for (auto it = Set.begin(); it != Set.end();) {
auto itV = Num.begin();
if (Res2[itV->second] == -1) {
Res2[itV->second] = (*it);
++it;
}
Num.erase(itV);
for (int u : G[itV->first]) {
if (Res2[u] == -1) {
--NumNow[u];
Num.insert({NumNow[u], u});
}
}
}
for (int n = 0; n < N; ++n) {
cout << Res2[n] << '\n';
}
return 0;
}
| #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
#define INF ((int)1e9)
#define INFLL ((ll)1e18)
#define MOD (1000000007LL)
int main(int argc, const char *argv[]) {
ios_base::sync_with_stdio(false);
int N;
cin >> N;
vector<vector<int>> G(N);
for (int n = 0; n < N - 1; ++n) {
int a, b;
cin >> a >> b;
--a;
--b;
G[a].push_back(b);
G[b].push_back(a);
}
multiset<int> Set;
int Res = 0;
for (int n = 0; n < N; ++n) {
int c;
cin >> c;
Set.insert(c);
Res += c;
}
auto itEnd = Set.rbegin();
Res -= *itEnd;
cout << Res << endl;
set<pair<int, int>> Num;
vector<int> NumNow(N);
for (int n = 0; n < N; ++n) {
Num.insert({G[n].size(), n});
NumNow[n] = G[n].size();
}
vector<int> Res2(N, -1);
for (auto it = Set.begin(); it != Set.end();) {
auto itV = Num.begin();
if (Res2[itV->second] == -1) {
Res2[itV->second] = (*it);
++it;
}
Num.erase(itV);
for (int u : G[itV->second]) {
if (Res2[u] == -1) {
--NumNow[u];
Num.insert({NumNow[u], u});
}
}
}
for (int n = 0; n < N; ++n) {
cout << Res2[n] << '\n';
}
return 0;
}
| replace | 63 | 64 | 63 | 64 | 0 | |
p03026 | C++ | Time Limit Exceeded | #include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#define REP(i, e) for (int i = 0; i < (int)(e); i++)
#define FOR(i, b, e) for (int i = (int)(b); i < (int)(e); i++)
#define ALL(c) (c).begin(), (c).end()
#define EACH(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define RALL(c) (c).rbegin(), (c).rend()
#define ALLA(a, n) ((a) + 0), ((a) + n)
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<long long> vll;
typedef vector<string> vstring;
typedef vector<double> vdouble;
template <class T> void pp(T v, int n) {
REP(i, n) cout << v[i] << ' ';
cout << endl;
}
template <class T> void pp(T v) {
EACH(it, v) cout << *it << ' ';
cout << endl;
}
template <class T> T &ls(T &a, T b) {
if (b < a)
a = b;
return a;
}
template <class T> T &gs(T &a, T b) {
if (b > a)
a = b;
return a;
}
inline ll to_i(const string &s) {
ll n;
sscanf(s.c_str(), "%lld", &n);
return n;
}
inline string to_s(ll n) {
char buf[32];
sprintf(buf, "%lld", n);
return string(buf);
}
struct Edge {
int src, dst;
};
int main() {
int n;
while (cin >> n) {
vector<vector<Edge>> v(n);
REP(i, n - 1) {
int a, b;
cin >> a >> b;
a--;
b--;
v[a].push_back((Edge){a, b});
v[b].push_back((Edge){b, a});
}
vll c(n);
REP(i, n) cin >> c[i];
sort(RALL(c));
ll best = 0;
vint bestV;
REP(root, n) {
vint vc(n, -1);
queue<int> qu;
int o = 0;
for (qu.push(root); qu.size(); qu.pop()) {
int p = qu.front();
if (vc[p] != -1)
continue;
vc[p] = c[o++];
for (auto e : v[p])
if (vc[e.dst] == -1)
qu.push(e.dst);
}
ll result = 0;
REP(i, n) for (auto e : v[i]) result += min(vc[e.src], vc[e.dst]);
if (result > best) {
best = result;
bestV.swap(vc);
}
}
cout << best / 2 << endl;
REP(i, n) {
if (i)
cout << ' ';
cout << bestV[i];
}
cout << endl;
}
}
| #include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#define REP(i, e) for (int i = 0; i < (int)(e); i++)
#define FOR(i, b, e) for (int i = (int)(b); i < (int)(e); i++)
#define ALL(c) (c).begin(), (c).end()
#define EACH(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define RALL(c) (c).rbegin(), (c).rend()
#define ALLA(a, n) ((a) + 0), ((a) + n)
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<long long> vll;
typedef vector<string> vstring;
typedef vector<double> vdouble;
template <class T> void pp(T v, int n) {
REP(i, n) cout << v[i] << ' ';
cout << endl;
}
template <class T> void pp(T v) {
EACH(it, v) cout << *it << ' ';
cout << endl;
}
template <class T> T &ls(T &a, T b) {
if (b < a)
a = b;
return a;
}
template <class T> T &gs(T &a, T b) {
if (b > a)
a = b;
return a;
}
inline ll to_i(const string &s) {
ll n;
sscanf(s.c_str(), "%lld", &n);
return n;
}
inline string to_s(ll n) {
char buf[32];
sprintf(buf, "%lld", n);
return string(buf);
}
struct Edge {
int src, dst;
};
int main() {
int n;
while (cin >> n) {
vector<vector<Edge>> v(n);
REP(i, n - 1) {
int a, b;
cin >> a >> b;
a--;
b--;
v[a].push_back((Edge){a, b});
v[b].push_back((Edge){b, a});
}
vll c(n);
REP(i, n) cin >> c[i];
sort(RALL(c));
ll best = 0;
vint bestV;
REP(root, n) {
if (root != 0)
continue;
vint vc(n, -1);
queue<int> qu;
int o = 0;
for (qu.push(root); qu.size(); qu.pop()) {
int p = qu.front();
if (vc[p] != -1)
continue;
vc[p] = c[o++];
for (auto e : v[p])
if (vc[e.dst] == -1)
qu.push(e.dst);
}
ll result = 0;
REP(i, n) for (auto e : v[i]) result += min(vc[e.src], vc[e.dst]);
if (result > best) {
best = result;
bestV.swap(vc);
}
}
cout << best / 2 << endl;
REP(i, n) {
if (i)
cout << ' ';
cout << bestV[i];
}
cout << endl;
}
}
| insert | 87 | 87 | 87 | 89 | TLE | |
p03026 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
vector<vector<int>> to;
vector<int> c;
vector<bool> done;
vector<int> nodes;
vector<pair<int, int>> ab;
int nodecount;
queue<int> q;
/*
void bfs(int id)
{
done[id]=true;
nodes[id]=c[nodecount];
nodecount++;
//cout << id << endl;
for(int i=0;i<to[id].size();i++)
{
int nxid=to[id][i];
if(done[nxid]!=true)
bfs(nxid);
}
}
*/
void bfs(int id) {
q.push(id);
while (!q.empty()) {
int now = q.front();
q.pop();
done[now] = true;
nodes[now] = c[nodecount];
nodecount++;
for (int i = 0; i < to[now].size(); i++) {
int nxid = to[now][i];
if (done[nxid] != true)
q.push(nxid);
}
}
}
int val(void) {
int ans = 0;
for (int i = 0; i < ab.size(); i++)
ans += min(nodes[ab[i].first], nodes[ab[i].second]);
return ans;
}
int main() {
int n;
cin >> n;
to = vector<vector<int>>(n);
for (int i = 0; i < n - 1; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
ab.push_back(make_pair(a, b));
to[a].push_back(b);
to[b].push_back(a);
}
c = vector<int>(n);
for (int i = 0; i < n; i++)
cin >> c[i];
sort(c.begin(), c.end());
reverse(c.begin(), c.end());
int ans = 0;
int ansid = 0;
for (int i = 0; i < n; i++) {
done = vector<bool>(n, false);
nodes = vector<int>(n, 0);
nodecount = 0;
bfs(i);
int tmp = val();
if (tmp > ans) {
ans = tmp;
ansid = i;
}
}
cout << ans << endl;
done = vector<bool>(n, false);
nodes = vector<int>(n, 0);
nodecount = 0;
bfs(ansid);
for (int i = 0; i < n; i++)
cout << nodes[i] << " ";
cout << endl;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
vector<vector<int>> to;
vector<int> c;
vector<bool> done;
vector<int> nodes;
vector<pair<int, int>> ab;
int nodecount;
queue<int> q;
/*
void bfs(int id)
{
done[id]=true;
nodes[id]=c[nodecount];
nodecount++;
//cout << id << endl;
for(int i=0;i<to[id].size();i++)
{
int nxid=to[id][i];
if(done[nxid]!=true)
bfs(nxid);
}
}
*/
void bfs(int id) {
q.push(id);
while (!q.empty()) {
int now = q.front();
q.pop();
done[now] = true;
nodes[now] = c[nodecount];
nodecount++;
for (int i = 0; i < to[now].size(); i++) {
int nxid = to[now][i];
if (done[nxid] != true)
q.push(nxid);
}
}
}
int val(void) {
int ans = 0;
for (int i = 0; i < ab.size(); i++)
ans += min(nodes[ab[i].first], nodes[ab[i].second]);
return ans;
}
int main() {
int n;
cin >> n;
to = vector<vector<int>>(n);
for (int i = 0; i < n - 1; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
ab.push_back(make_pair(a, b));
to[a].push_back(b);
to[b].push_back(a);
}
c = vector<int>(n);
for (int i = 0; i < n; i++)
cin >> c[i];
sort(c.begin(), c.end());
reverse(c.begin(), c.end());
int ans = 0;
int ansid = 0;
for (int i = 0; i < 1; i++) {
done = vector<bool>(n, false);
nodes = vector<int>(n, 0);
nodecount = 0;
bfs(i);
int tmp = val();
if (tmp > ans) {
ans = tmp;
ansid = i;
}
}
cout << ans << endl;
done = vector<bool>(n, false);
nodes = vector<int>(n, 0);
nodecount = 0;
bfs(ansid);
for (int i = 0; i < n; i++)
cout << nodes[i] << " ";
cout << endl;
} | replace | 87 | 88 | 87 | 88 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.