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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02864 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
const int BUF = 305;
const long long INF = 1LL << 62;
int nCol, nCut;
int col2height[BUF];
void read() {
cin >> nCol >> nCut;
for (int i = 0; i < nCol; ++i) {
cin >> col2height[i];
}
}
long long rec(int idx, int remainCut, int heightId, long long dp[BUF][BUF][BUF],
vector<int> &id2height, map<int, int> height2id) {
if (idx == nCol)
return 0;
long long &ret = dp[idx][remainCut][heightId];
if (ret != -1)
return ret;
ret = INF;
// cut
if (remainCut > 0) {
ret = min(ret,
rec(idx + 1, remainCut - 1, heightId, dp, id2height, height2id));
}
// not cut
ret = min(ret, rec(idx + 1, remainCut, height2id[col2height[idx]], dp,
id2height, height2id) +
+max(0, col2height[idx] - id2height[heightId]));
return ret;
}
void work() {
vector<int> id2height;
for (int i = 0; i < nCol; ++i) {
id2height.push_back(col2height[i]);
}
id2height.push_back(0);
sort(id2height.begin(), id2height.end());
id2height.erase(unique(id2height.begin(), id2height.end()), id2height.end());
map<int, int> height2id;
for (int i = 0; i < id2height.size(); ++i) {
height2id[id2height[i]] = i;
}
static long long dp[BUF][BUF][BUF];
memset(dp, -1, sizeof(dp));
cout << rec(0, nCut, 0, dp, id2height, height2id) << endl;
}
int main() {
read();
work();
return 0;
}
| #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
const int BUF = 305;
const long long INF = 1LL << 62;
int nCol, nCut;
int col2height[BUF];
void read() {
cin >> nCol >> nCut;
for (int i = 0; i < nCol; ++i) {
cin >> col2height[i];
}
}
long long rec(int idx, int remainCut, int heightId, long long dp[BUF][BUF][BUF],
vector<int> &id2height, map<int, int> &height2id) {
if (idx == nCol)
return 0;
long long &ret = dp[idx][remainCut][heightId];
if (ret != -1)
return ret;
ret = INF;
// cut
if (remainCut > 0) {
ret = min(ret,
rec(idx + 1, remainCut - 1, heightId, dp, id2height, height2id));
}
// not cut
ret = min(ret, rec(idx + 1, remainCut, height2id[col2height[idx]], dp,
id2height, height2id) +
+max(0, col2height[idx] - id2height[heightId]));
return ret;
}
void work() {
vector<int> id2height;
for (int i = 0; i < nCol; ++i) {
id2height.push_back(col2height[i]);
}
id2height.push_back(0);
sort(id2height.begin(), id2height.end());
id2height.erase(unique(id2height.begin(), id2height.end()), id2height.end());
map<int, int> height2id;
for (int i = 0; i < id2height.size(); ++i) {
height2id[id2height[i]] = i;
}
static long long dp[BUF][BUF][BUF];
memset(dp, -1, sizeof(dp));
cout << rec(0, nCut, 0, dp, id2height, height2id) << endl;
}
int main() {
read();
work();
return 0;
}
| replace | 20 | 21 | 20 | 21 | TLE | |
p02865 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int N, M = 0;
cin >> N;
for (int i = 1; i <= N; i++) {
for (int j = 1; j <= N; j++) {
if (i + j == N) {
M = M + 1;
}
}
}
cout << M / 2 << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
cout << (n - 1) / 2 << endl;
return 0;
} | replace | 5 | 15 | 5 | 8 | TLE | |
p02865 | C++ | Time Limit Exceeded | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
#include <limits>
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
typedef long long ll;
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define mod 1000000007
#define fst first
#define pb push_back
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;
}
// ユークリッドの互除法
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
int main() {
ll n;
cin >> n;
ll cnt = 0;
for (ll i = 1; i <= n; i++) {
for (ll j = i + 1; j <= n - 1; j++) {
if (n - j == i) {
cnt++;
}
}
}
cout << cnt << endl;
} | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
#include <limits>
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
typedef long long ll;
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define mod 1000000007
#define fst first
#define pb push_back
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;
}
// ユークリッドの互除法
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
int main() {
ll n;
cin >> n;
ll cnt = 0;
cout << (n - 1) / 2 << endl;
} | replace | 46 | 54 | 46 | 47 | TLE | |
p02865 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans = 0, i = 1, num;
while (i) {
if (N - num <= num) {
break;
}
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int ans = N / 2 - 1 * ((N + 1) % 2);
cout << ans << endl;
return 0;
} | replace | 6 | 13 | 6 | 7 | TLE | |
p02865 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <cctype>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
std::string line;
int main() {
int n;
cin >> n;
int cnt = 0;
for (int i = 1; i < n / 2; ++i) {
for (int j = n / 2; j < n; ++j) {
if (n == i + j) {
cnt++;
break;
}
}
}
cout << cnt << endl;
return 0;
};
| #include <bits/stdc++.h>
#include <cctype>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
std::string line;
int main() {
int n;
cin >> n;
int cnt = 0;
cnt = (n - 1) / 2;
cout << cnt << endl;
return 0;
};
| replace | 17 | 25 | 17 | 19 | TLE | |
p02865 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
int main() {
ll k;
cin >> k;
ll i, j, c = 0;
for (i = 1; i < k; i++) {
for (j = i; j < k; j++) {
if (i + j == k && i != j) {
c++;
}
}
}
cout << c << endl;
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
int main() {
int n, m, x, k, count, i;
cin >> n;
cout << (n - 1) / 2;
return 0;
} | replace | 5 | 16 | 5 | 9 | TLE | |
p02865 | C++ | Time Limit Exceeded | // #include<bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
/*
#include <boost/multiprecision/cpp_dec_float.hpp>
#include<boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
namespace mp = boost::multiprecision;
using Real = mp::number<mp::cpp_dec_float<1024>>;
using Bint = mp::cpp_int;
*/
using namespace std;
#define int long long
#define REP(i, s, e) for ((i) = (s); (i) < (e); (i)++)
#define RREP(i, s, e) for ((i) = ((s)-1); (i) >= (e); (i)--)
#define FOR(i, n) for ((i) = (0); (i) < (n); (i)++)
#define RFOR(i, n) for ((i) = ((n)-1); (i) >= (0); (i)--)
#define MOD 1000000007
signed main() {
int N;
cin >> N;
int ans = 0;
for (int i = 1; i < N; i++) {
for (int j = i + 1; j < N; j++) {
if (i + j == N)
ans++;
}
}
cout << ans << endl;
}
| // #include<bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
/*
#include <boost/multiprecision/cpp_dec_float.hpp>
#include<boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
namespace mp = boost::multiprecision;
using Real = mp::number<mp::cpp_dec_float<1024>>;
using Bint = mp::cpp_int;
*/
using namespace std;
#define int long long
#define REP(i, s, e) for ((i) = (s); (i) < (e); (i)++)
#define RREP(i, s, e) for ((i) = ((s)-1); (i) >= (e); (i)--)
#define FOR(i, n) for ((i) = (0); (i) < (n); (i)++)
#define RFOR(i, n) for ((i) = ((n)-1); (i) >= (0); (i)--)
#define MOD 1000000007
signed main() {
int N;
cin >> N;
int ans = 0;
for (int i = 1; i < N; i++) {
int n = N - i;
if (n > i)
ans++;
}
cout << ans << endl;
}
| replace | 33 | 37 | 33 | 36 | TLE | |
p02865 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
typedef long long ll;
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
// 素因数分解
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> res;
for (ll i = 2; i * i <= n; i++) {
if (n % i)
continue;
res.emplace_back(i, 0);
while (n % i == 0) {
n /= i;
res.back().second++;
}
}
if (n != 1)
res.emplace_back(n, 1);
return res;
}
int main() {
int N;
cin >> N;
int ans = 0;
REP(i, N) {
REP(j, N) {
if (i > j && i != j && N == i + j)
ans++;
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
typedef long long ll;
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
// 素因数分解
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> res;
for (ll i = 2; i * i <= n; i++) {
if (n % i)
continue;
res.emplace_back(i, 0);
while (n % i == 0) {
n /= i;
res.back().second++;
}
}
if (n != 1)
res.emplace_back(n, 1);
return res;
}
int main() {
int N;
cin >> N;
int ans = 0;
if (N <= 2)
ans = 0;
else {
if (N % 2 == 0)
ans = (N - 1) / 2;
else
ans = N / 2;
}
cout << ans << endl;
} | replace | 27 | 32 | 27 | 34 | TLE | |
p02865 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
using vll = vector<long long>;
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;
}
#define che(a, string) cout << "//" << string << "==" << (a) << "//" << endl;
#define SORT(a) sort((a).begin(), (a).end())
#define rSORT(a) reverse((a).begin(), (a).end())
#define For(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) For(i, 0, n)
#define leftunique(a) \
{ \
SORT(a); \
(a).erase(unique((a).begin(), (a).end()), (a).end()); \
}
// leftuniqueは配列から同じ要素のものを取り除く 例 4 6 2 1 3 4 1 2 なら 1 2 3 4
// 6 になる
#define debug(x) cout << #x << " = " << (x) << endl;
bool IsInt(double a) {
int b = a / 1;
if (a == b) {
return true;
} else {
return false;
}
}
bool coY() { cout << "Yes" << endl; }
bool coN() { cout << "No" << endl; }
const int mod = 1e9 + 7;
const ll INF = 1LL << 60;
// ここから書き始める
int main() {
cout << setprecision(10);
int n;
cin >> n;
ll ans = 0;
rep(i, n) {
For(j, i + 1, n) {
if (i + j == n) {
ans++;
}
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
using vll = vector<long long>;
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;
}
#define che(a, string) cout << "//" << string << "==" << (a) << "//" << endl;
#define SORT(a) sort((a).begin(), (a).end())
#define rSORT(a) reverse((a).begin(), (a).end())
#define For(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) For(i, 0, n)
#define leftunique(a) \
{ \
SORT(a); \
(a).erase(unique((a).begin(), (a).end()), (a).end()); \
}
// leftuniqueは配列から同じ要素のものを取り除く 例 4 6 2 1 3 4 1 2 なら 1 2 3 4
// 6 になる
#define debug(x) cout << #x << " = " << (x) << endl;
bool IsInt(double a) {
int b = a / 1;
if (a == b) {
return true;
} else {
return false;
}
}
bool coY() { cout << "Yes" << endl; }
bool coN() { cout << "No" << endl; }
const int mod = 1e9 + 7;
const ll INF = 1LL << 60;
// ここから書き始める
int main() {
cout << setprecision(10);
int n;
cin >> n;
ll ans = 0;
For(i, 1, n / 2 + 1) {
int j = n - i;
if (j > 0 && i != j) {
ans++;
}
}
cout << ans << endl;
}
| replace | 53 | 58 | 53 | 57 | TLE | |
p02865 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define int long long
#define all(v) v.begin(), v.end()
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define rep2(i, a, b) for (int i = a; i >= b; i--)
#define f first
#define s second
#define PB push_back
#define MP make_pair
#define db long double
#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
#define trace4(a, b, c, d) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl
#define trace5(a, b, c, d, e) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl
#define trace6(a, b, c, d, e, f) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << endl
#define cases \
int testcases; \
cin >> testcases; \
while (testcases--)
// void time() {
// #ifndef ONLINE_JUDGE
// cout << "\nTime: " << 1.0 * clock() / CLOCKS_PER_SEC << "s\n";
// #endif
// }
int32_t main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
IOS
int n;
cin >> n;
cout << (n - 1) / 2;
// time();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define int long long
#define all(v) v.begin(), v.end()
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define rep2(i, a, b) for (int i = a; i >= b; i--)
#define f first
#define s second
#define PB push_back
#define MP make_pair
#define db long double
#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
#define trace4(a, b, c, d) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl
#define trace5(a, b, c, d, e) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl
#define trace6(a, b, c, d, e, f) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << endl
#define cases \
int testcases; \
cin >> testcases; \
while (testcases--)
// void time() {
// #ifndef ONLINE_JUDGE
// cout << "\nTime: " << 1.0 * clock() / CLOCKS_PER_SEC << "s\n";
// #endif
// }
int32_t main() {
IOS
int n;
cin >> n;
cout << (n - 1) / 2;
// time();
return 0;
}
| delete | 43 | 47 | 43 | 43 | 0 | |
p02865 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
const long double PI = (acos(-1));
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
int ans = 0;
for (int i = 1; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (i + j == n) {
ans++;
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
const long double PI = (acos(-1));
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n;
cin >> n;
int ans = 0;
for (int i = 1; i < n; i++) {
if (n - i > i && n - i > 1 && n) {
ans++;
}
}
cout << ans << endl;
} | replace | 11 | 15 | 11 | 13 | TLE | |
p02865 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, sum, i, j;
cin >> n;
sum = 0;
for (i = 1; i < n; ++i) {
for (j = i + 1; i + j < n; ++j) {
sum = sum + 1;
}
}
cout << sum << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, sum, i, j;
cin >> n;
sum = 0;
if (n % 2 == 0) {
sum = n / 2 - 1;
} else {
sum = n / 2;
}
cout << sum << endl;
return 0;
}
| replace | 7 | 11 | 7 | 11 | TLE | |
p02865 | C++ | Runtime Error | #include <bits/stdc++.h>
#define endl "\n"
#define pb push_back
#define ll long long
#define ld long double
#define d1(x) cerr << #x << "--> " << x << endl
#define d2(x, y) cerr << #x << "--> " << x << " | " << #y << "--> " << y << endl
#define d3(x, y, z) \
cerr << #x << "--> " << x << " | " << #y << "--> " << y << " | " << #z \
<< "--> " << z << endl
#define vpll vector<pair<ll, ll>>
#define F first
#define S second
using namespace std;
ll mode = pow(10, 9) + 7;
bool cmp(pair<ll, ll> x, pair<ll, ll> y) { return x.S < y.S; }
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
#endif
ios::sync_with_stdio(0);
cin.tie(0);
ll n;
cin >> n;
if (n % 2 == 0) {
n = n / 2;
cout << n - 1 << endl;
} else {
n = n / 2;
cout << n << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define endl "\n"
#define pb push_back
#define ll long long
#define ld long double
#define d1(x) cerr << #x << "--> " << x << endl
#define d2(x, y) cerr << #x << "--> " << x << " | " << #y << "--> " << y << endl
#define d3(x, y, z) \
cerr << #x << "--> " << x << " | " << #y << "--> " << y << " | " << #z \
<< "--> " << z << endl
#define vpll vector<pair<ll, ll>>
#define F first
#define S second
using namespace std;
ll mode = pow(10, 9) + 7;
bool cmp(pair<ll, ll> x, pair<ll, ll> y) { return x.S < y.S; }
int main() {
#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
#endif
ios::sync_with_stdio(0);
cin.tie(0);
ll n;
cin >> n;
if (n % 2 == 0) {
n = n / 2;
cout << n - 1 << endl;
} else {
n = n / 2;
cout << n << endl;
}
return 0;
} | replace | 21 | 22 | 21 | 22 | 0 | |
p02865 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
#define N 1000
int main() {
long int n, i, j, k, cnt = 0;
cin >> n;
k = n;
for (i = 1; i < n / 2; i++) {
for (j = i + 1; j < k; j++) {
if (n == i + j) {
cnt++;
k--;
break;
}
}
}
cout << cnt << endl;
return 0;
} | #include <algorithm>
#include <iostream>
#include <math.h>
using namespace std;
#define N 1000
int main() {
long int n, i, j, k, cnt = 0;
cin >> n;
k = n;
for (i = 1; i <= n / 2; i++) {
for (j = k - 1; j > n / 2; j--) {
if (n == i + j) {
cnt++;
k--;
break;
}
}
}
cout << cnt << endl;
return 0;
} | replace | 12 | 14 | 12 | 14 | TLE | |
p02866 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long ul;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<ll> vint;
typedef vector<vector<ll>> vvint;
typedef vector<vector<vector<ll>>> vvvint;
typedef vector<string> vstring;
typedef vector<vector<string>> vvstring;
typedef vector<char> vchar;
typedef vector<vector<char>> vvchar;
typedef vector<long double> vdouble;
typedef vector<vector<long double>> vvdouble;
typedef vector<vector<vector<long double>>> vvvdouble;
typedef pair<ll, ll> pint;
typedef vector<pint> vpint;
typedef vector<bool> vbool;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repf(i, f, n) for (ll i = f; i < n; i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define ALL(obj) (obj).begin(), (obj).end()
// #define LLONG_MAX 9223372036854775806
#define vmax(vec) *max_element(vec.begin(), vec.end())
#define vmin(vec) *min_element(vec.begin(), vec.end())
#define vsort(vec) sort(vec.begin(), vec.end())
#define vsortgr(vec) sort(vec.begin(), vec.end(), greater<ll>())
// #define MOD 1000000007
#define MOD 998244353
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;
}
//
// struct Node{
// vint children;
// ll index;
// ll prop;
// };
// struct edge{ll to; ll cost;};
int dy[] = {0, 0, 1, -1};
int dx[] = {
1,
-1,
0,
0,
};
template <typename T> struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(const int &x) {
to = x;
return *this;
}
operator int() const { return to; }
};
template <typename T> using Edges = vector<edge<T>>;
template <typename T> using WeightedGraph = vector<Edges<T>>;
using UnWeightedGraph = vector<vector<int>>;
template <typename T> using Matrix = vector<vector<T>>;
ll gcd(ll a, ll b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
return b ? gcd(b, a % b) : a;
}
ll lcm(int a, ll b) { return a * b / gcd(a, b); }
// 繰り返し二乗法
ll power(ll a, ll b) {
if (a == 1)
return a;
// if(a==0)re
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return res;
}
const int MAX = 510000;
ll fact[MAX], fact_inv[MAX];
void init_fact(ll n) {
fact[0] = 1;
// 階乗の計算
rep(i, n) fact[i + 1] = fact[i] * (i + 1) % MOD;
fact_inv[n] = power(fact[n], MOD - 2);
// 逆元の計算
for (ll i = n - 1; i >= 0; i--)
fact_inv[i] = fact_inv[i + 1] * (i + 1) % MOD;
}
ll comb(ll n, ll r) {
return (fact[n] * fact_inv[r]) % MOD * fact_inv[n - r] % MOD;
}
ll perm(ll n, ll r) { return (fact[n] * fact_inv[n - r]) % MOD; }
struct UnionFind {
vector<ll> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
vector<ll> num;
// vector<ll> dist; // rootまでの距離
UnionFind(ll N) : par(N), num(N) { // 最初は全てが根であるとして初期化
for (ll i = 0; i < N; i++)
par[i] = i;
for (ll i = 0; i < N; i++)
num[i] = 1;
// for(ll i = 0; i < N; i++) dist[i] = 0;
}
ll root(ll x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(ll x, ll y) { // xとyの木を併合
ll rx = root(x); // xの根をrx
ll ry = root(y); // yの根をry
if (rx == ry)
return; // xとyの根が同じ(=同じ木にある)時はそのまま
par[rx] =
ry; // xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
num[ry] = num[rx] + num[ry];
}
bool same(ll x, ll y) { // 2つのデータx, yが属する木が同じならtrueを返す
ll rx = root(x);
ll ry = root(y);
return rx == ry;
}
ll size(ll x) { return num[root(x)]; }
};
vint divisor(ll n) { // nの約数
vint ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.pb(i);
if (i * i != n)
ret.pb(n / i);
}
}
vsort(ret);
return ret;
}
ll my_pow(ll x, ll y) {
ll rtn = 1;
rep(i, y) rtn *= x;
return rtn;
}
ll get_digit_in(ll n, ll i) { // i桁目の数字を得る。
for (ll j = 0; j < i - 1; j++) {
n /= 10;
}
return n % 10;
}
ll get_digit(ll n) {
ll rtn = 0;
while (n > 0) {
n /= 10;
rtn++;
}
return rtn;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> rtn;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
rtn[i]++;
n /= i;
}
}
if (n != 1)
rtn[n] = 1;
return rtn;
}
// nPnの順列に対して処理を実行する
void foreach_permutation(ll n, function<void(ll *)> f) {
ll indexes[n];
for (ll i = 0; i < n; i++)
indexes[i] = i;
do {
f(indexes);
} while (std::next_permutation(indexes, indexes + n));
}
void recursive_comb(ll *indexes, ll s, ll rest, function<void(ll *)> f) {
if (rest == 0) {
f(indexes);
} else {
if (s < 0)
return;
recursive_comb(indexes, s - 1, rest, f);
indexes[rest - 1] = s;
recursive_comb(indexes, s - 1, rest - 1, f);
}
}
// nCkの組み合わせに対して処理を実行する
void foreach_comb(ll n, ll k, function<void(ll *)> f) {
ll indexes[k];
recursive_comb(indexes, n - 1, k, f);
}
// nPkの順列に対して処理を実行する
void foreach_permutation(ll n, ll k, function<void(ll *)> f) {
foreach_comb(n, k, [&](ll *c_indexes) {
foreach_permutation(k, [&](ll *p_indexes) {
ll indexes[k];
for (ll i = 0; i < k; i++) {
indexes[i] = c_indexes[p_indexes[i]];
}
f(indexes);
});
});
}
// ll arr[1000500];
// vint primes;
// //エラトステネスの篩
// void Eratosthenes(){
// ll N = 1000500;
// for(ll i = 0; i < N; i++){
// arr[i] = 1;
// }
// for(ll i = 2; i < sqrt(N); i++){
// if(arr[i]){
// for(ll j = 0; i * (j + 2) < N; j++){
// arr[i *(j + 2)] = 0;
// }
// }
// }
// for(ll i = 2; i < N; i++){
// if(arr[i]){
// primes.pb(i);
// //cout << i << endl;
// }
// }
// }
void print(vint &V) {
for (auto e : V)
cout << e << " ";
cout << endl;
}
int main() {
cout << fixed << setprecision(12);
ll N;
cin >> N;
vint D(N);
rep(i, N) cin >> D[i];
vint cnt(N, 0);
rep(i, N) { cnt[D[i]]++; }
if (D[0] > 0 || cnt[0] > 1) {
cout << 0 << endl;
return 0;
}
ll ans = 1;
rep(i, *max_element(ALL(D))) {
if (cnt[i] == 0) {
cout << 0 << endl;
return 0;
}
ans *= power(cnt[i], cnt[i + 1]);
ans %= MOD;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef unsigned long ul;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<ll> vint;
typedef vector<vector<ll>> vvint;
typedef vector<vector<vector<ll>>> vvvint;
typedef vector<string> vstring;
typedef vector<vector<string>> vvstring;
typedef vector<char> vchar;
typedef vector<vector<char>> vvchar;
typedef vector<long double> vdouble;
typedef vector<vector<long double>> vvdouble;
typedef vector<vector<vector<long double>>> vvvdouble;
typedef pair<ll, ll> pint;
typedef vector<pint> vpint;
typedef vector<bool> vbool;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repf(i, f, n) for (ll i = f; i < n; i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define ALL(obj) (obj).begin(), (obj).end()
// #define LLONG_MAX 9223372036854775806
#define vmax(vec) *max_element(vec.begin(), vec.end())
#define vmin(vec) *min_element(vec.begin(), vec.end())
#define vsort(vec) sort(vec.begin(), vec.end())
#define vsortgr(vec) sort(vec.begin(), vec.end(), greater<ll>())
// #define MOD 1000000007
#define MOD 998244353
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;
}
//
// struct Node{
// vint children;
// ll index;
// ll prop;
// };
// struct edge{ll to; ll cost;};
int dy[] = {0, 0, 1, -1};
int dx[] = {
1,
-1,
0,
0,
};
template <typename T> struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(const int &x) {
to = x;
return *this;
}
operator int() const { return to; }
};
template <typename T> using Edges = vector<edge<T>>;
template <typename T> using WeightedGraph = vector<Edges<T>>;
using UnWeightedGraph = vector<vector<int>>;
template <typename T> using Matrix = vector<vector<T>>;
ll gcd(ll a, ll b) {
if (a < b) {
a ^= b;
b ^= a;
a ^= b;
}
return b ? gcd(b, a % b) : a;
}
ll lcm(int a, ll b) { return a * b / gcd(a, b); }
// 繰り返し二乗法
ll power(ll a, ll b) {
if (a == 1)
return a;
// if(a==0)re
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return res;
}
const int MAX = 510000;
ll fact[MAX], fact_inv[MAX];
void init_fact(ll n) {
fact[0] = 1;
// 階乗の計算
rep(i, n) fact[i + 1] = fact[i] * (i + 1) % MOD;
fact_inv[n] = power(fact[n], MOD - 2);
// 逆元の計算
for (ll i = n - 1; i >= 0; i--)
fact_inv[i] = fact_inv[i + 1] * (i + 1) % MOD;
}
ll comb(ll n, ll r) {
return (fact[n] * fact_inv[r]) % MOD * fact_inv[n - r] % MOD;
}
ll perm(ll n, ll r) { return (fact[n] * fact_inv[n - r]) % MOD; }
struct UnionFind {
vector<ll> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
vector<ll> num;
// vector<ll> dist; // rootまでの距離
UnionFind(ll N) : par(N), num(N) { // 最初は全てが根であるとして初期化
for (ll i = 0; i < N; i++)
par[i] = i;
for (ll i = 0; i < N; i++)
num[i] = 1;
// for(ll i = 0; i < N; i++) dist[i] = 0;
}
ll root(ll x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(ll x, ll y) { // xとyの木を併合
ll rx = root(x); // xの根をrx
ll ry = root(y); // yの根をry
if (rx == ry)
return; // xとyの根が同じ(=同じ木にある)時はそのまま
par[rx] =
ry; // xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
num[ry] = num[rx] + num[ry];
}
bool same(ll x, ll y) { // 2つのデータx, yが属する木が同じならtrueを返す
ll rx = root(x);
ll ry = root(y);
return rx == ry;
}
ll size(ll x) { return num[root(x)]; }
};
vint divisor(ll n) { // nの約数
vint ret;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
ret.pb(i);
if (i * i != n)
ret.pb(n / i);
}
}
vsort(ret);
return ret;
}
ll my_pow(ll x, ll y) {
ll rtn = 1;
rep(i, y) rtn *= x;
return rtn;
}
ll get_digit_in(ll n, ll i) { // i桁目の数字を得る。
for (ll j = 0; j < i - 1; j++) {
n /= 10;
}
return n % 10;
}
ll get_digit(ll n) {
ll rtn = 0;
while (n > 0) {
n /= 10;
rtn++;
}
return rtn;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> rtn;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
rtn[i]++;
n /= i;
}
}
if (n != 1)
rtn[n] = 1;
return rtn;
}
// nPnの順列に対して処理を実行する
void foreach_permutation(ll n, function<void(ll *)> f) {
ll indexes[n];
for (ll i = 0; i < n; i++)
indexes[i] = i;
do {
f(indexes);
} while (std::next_permutation(indexes, indexes + n));
}
void recursive_comb(ll *indexes, ll s, ll rest, function<void(ll *)> f) {
if (rest == 0) {
f(indexes);
} else {
if (s < 0)
return;
recursive_comb(indexes, s - 1, rest, f);
indexes[rest - 1] = s;
recursive_comb(indexes, s - 1, rest - 1, f);
}
}
// nCkの組み合わせに対して処理を実行する
void foreach_comb(ll n, ll k, function<void(ll *)> f) {
ll indexes[k];
recursive_comb(indexes, n - 1, k, f);
}
// nPkの順列に対して処理を実行する
void foreach_permutation(ll n, ll k, function<void(ll *)> f) {
foreach_comb(n, k, [&](ll *c_indexes) {
foreach_permutation(k, [&](ll *p_indexes) {
ll indexes[k];
for (ll i = 0; i < k; i++) {
indexes[i] = c_indexes[p_indexes[i]];
}
f(indexes);
});
});
}
// ll arr[1000500];
// vint primes;
// //エラトステネスの篩
// void Eratosthenes(){
// ll N = 1000500;
// for(ll i = 0; i < N; i++){
// arr[i] = 1;
// }
// for(ll i = 2; i < sqrt(N); i++){
// if(arr[i]){
// for(ll j = 0; i * (j + 2) < N; j++){
// arr[i *(j + 2)] = 0;
// }
// }
// }
// for(ll i = 2; i < N; i++){
// if(arr[i]){
// primes.pb(i);
// //cout << i << endl;
// }
// }
// }
void print(vint &V) {
for (auto e : V)
cout << e << " ";
cout << endl;
}
int main() {
cout << fixed << setprecision(12);
ll N;
cin >> N;
vint D(N);
rep(i, N) cin >> D[i];
vint cnt(N, 0);
rep(i, N) { cnt[D[i]]++; }
if (D[0] > 0 || cnt[0] > 1) {
cout << 0 << endl;
return 0;
}
ll ans = 1;
ll maxval = *max_element(ALL(D));
rep(i, maxval) {
if (cnt[i] == 0) {
cout << 0 << endl;
return 0;
}
ans *= power(cnt[i], cnt[i + 1]);
ans %= MOD;
}
cout << ans << endl;
}
| replace | 312 | 313 | 312 | 314 | TLE | |
p02866 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const long long int mod = 998244353;
int main() {
long long int N, x = 0;
cin >> N;
vector<long long int> D(N);
cin >> D.at(0);
if (D.at(0) == 0) {
if (N == 1)
x = 1;
else {
for (long long int i = 1; i < N; i++)
cin >> D.at(i);
sort(D.begin(), D.end());
if (D.at(1) != 0) {
x = 1;
vector<long long int> C(D.at(N - 1));
for (long long int i = 0; i < D.at(N - 1); i++)
C.at(i) = count(D.begin(), D.end(), i);
for (long long int i = 1; i < N; i++)
x = x * C.at(D.at(i) - 1) % mod;
}
}
}
printf("%lld\n", x);
} | #include <bits/stdc++.h>
using namespace std;
const long long int mod = 998244353;
int main() {
long long int N, x = 0;
cin >> N;
vector<long long int> D(N);
cin >> D.at(0);
if (D.at(0) == 0) {
if (N == 1)
x = 1;
else {
for (long long int i = 1; i < N; i++)
cin >> D.at(i);
sort(D.begin(), D.end());
if (D.at(1) != 0) {
x = 1;
vector<long long int> C(D.at(N - 1));
for (long long int i = 0; i < D.at(N - 1); i++)
C.at(i) = upper_bound(D.begin(), D.end(), i) -
lower_bound(D.begin(), D.end(), i);
for (long long int i = 1; i < N; i++)
x = x * C.at(D.at(i) - 1) % mod;
}
}
}
printf("%lld\n", x);
} | replace | 19 | 20 | 19 | 21 | TLE | |
p02866 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
// #define MODE 1
#ifdef MODE
#define DEB(X) cout << #X << ": " << X << " ";
#define END cout << endl;
#else
#define DEB(X) \
{}
#define END \
{}
#endif
typedef long long ll;
#define int ll
#define uset unordered_set
#define umap unordered_map
typedef std::pair<int, int> P;
struct edge {
int to, cost;
};
const int INF = 100000000000000000;
const int INF2 = 9223372036854775807;
const int MOD = 1000000007;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define min(X, Y) (((int)(X) < (int)(Y)) ? (X) : (Y))
#define max(X, Y) (((int)(X) > (int)(Y)) ? (X) : (Y))
#define MAX(X, Y) (*max_element(X, Y))
#define MIN(X, Y) (*min_element(X, Y))
#define NP(X, Y) next_permutation(X, Y)
#define setp(X, Y) cout << fixed << setprecision(X) << Y << endl
int ceil2(int a, int b) {
if (a % b == 0) {
return a / b;
} else {
return a / b + 1;
}
}
int pow2(int a, int b) {
int r = 1;
for (int i = 1; i <= b; i++) {
r *= a;
}
return r;
}
int Log2(int a) {
int t = 0;
while (1) {
if (a == 0 || a == 1) {
break;
}
a /= 2;
t++;
}
return t;
}
int N;
int A[100010];
int num[100010];
int mod_pow(int b, int e, int m) {
if (e == 0) {
return 1;
} else {
int sum = mod_pow(b, e / 2, m);
if (e % 2 == 0) {
return (sum * sum) % m;
} else {
return (((sum * sum) % m) * b) % m;
}
}
}
signed main() {
cin >> N;
int cnt = 0;
REP(i, N) {
cin >> A[i];
if (A[i] == 0) {
cnt++;
}
}
if (A[0] != 0 || cnt > 1) {
cout << 0 << endl;
return 0;
}
REP(i, N) { num[A[i]] = true; }
for (int i = 0; i <= MAX(A, A + N); i++) {
if (num[i] == 0) {
cout << 0 << endl;
return 0;
}
}
int s = 1;
int m = 998244353;
map<int, int> H;
REP(i, N) { H[A[i]]++; }
int t = 0;
cnt = 0;
for (auto x : H) {
if (cnt >= 1) {
s *= mod_pow(t, x.second, m);
s %= m;
}
t = x.second;
cnt++;
}
cout << s << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
// #define MODE 1
#ifdef MODE
#define DEB(X) cout << #X << ": " << X << " ";
#define END cout << endl;
#else
#define DEB(X) \
{}
#define END \
{}
#endif
typedef long long ll;
#define int ll
#define uset unordered_set
#define umap unordered_map
typedef std::pair<int, int> P;
struct edge {
int to, cost;
};
const int INF = 100000000000000000;
const int INF2 = 9223372036854775807;
const int MOD = 1000000007;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define min(X, Y) (((int)(X) < (int)(Y)) ? (X) : (Y))
#define max(X, Y) (((int)(X) > (int)(Y)) ? (X) : (Y))
#define MAX(X, Y) (*max_element(X, Y))
#define MIN(X, Y) (*min_element(X, Y))
#define NP(X, Y) next_permutation(X, Y)
#define setp(X, Y) cout << fixed << setprecision(X) << Y << endl
int ceil2(int a, int b) {
if (a % b == 0) {
return a / b;
} else {
return a / b + 1;
}
}
int pow2(int a, int b) {
int r = 1;
for (int i = 1; i <= b; i++) {
r *= a;
}
return r;
}
int Log2(int a) {
int t = 0;
while (1) {
if (a == 0 || a == 1) {
break;
}
a /= 2;
t++;
}
return t;
}
int N;
int A[100010];
int num[100010];
int mod_pow(int b, int e, int m) {
if (e == 0) {
return 1;
} else {
int sum = mod_pow(b, e / 2, m);
if (e % 2 == 0) {
return (sum * sum) % m;
} else {
return (((sum * sum) % m) * b) % m;
}
}
}
signed main() {
cin >> N;
int cnt = 0;
REP(i, N) {
cin >> A[i];
if (A[i] == 0) {
cnt++;
}
}
if (A[0] != 0 || cnt > 1) {
cout << 0 << endl;
return 0;
}
REP(i, N) { num[A[i]] = true; }
int M = MAX(A, A + N);
for (int i = 0; i <= M; i++) {
if (num[i] == 0) {
cout << 0 << endl;
return 0;
}
}
int s = 1;
int m = 998244353;
map<int, int> H;
REP(i, N) { H[A[i]]++; }
int t = 0;
cnt = 0;
for (auto x : H) {
if (cnt >= 1) {
s *= mod_pow(t, x.second, m);
s %= m;
}
t = x.second;
cnt++;
}
cout << s << endl;
return 0;
}
| replace | 104 | 105 | 104 | 106 | TLE | |
p02866 | C++ | Time Limit Exceeded | //{{{
#include <algorithm>
#include <cmath>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <sys/time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
enum : int { M = (int)1e9 + 7 };
enum : ll { MLL = (ll)1e18L + 9 };
using namespace std;
#ifdef LOCAL
#include "rprint2.hpp"
#else
#define FUNC(name) \
template <ostream &out = cout, class... T> void name(T &&...) {}
FUNC(printde) FUNC(printdbe) FUNC(printdwe) FUNC(printdu);
#endif
template <template <class T, class = std::allocator<T>> class V, class E>
istream &operator>>(istream &in, V<E> &v) {
for (auto &e : v) {
in >> e;
}
return in;
}
//}}}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> ds(n);
cin >> ds;
if (ds[0]) {
cout << 0 << '\n';
return 0;
}
sort(ds.begin(), ds.end());
int len = 1;
ll ans = 1;
int prev = 1;
for (int i = 1; i < n;) {
int cnt = 0;
while (i < n && ds[i] == len) {
i++;
cnt++;
ans = ans * prev % 998244353;
}
printde(i, cnt, len, ans);
len++;
prev = cnt;
}
cout << ans << '\n';
}
| //{{{
#include <algorithm>
#include <cmath>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <sys/time.h>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using ll = long long;
enum : int { M = (int)1e9 + 7 };
enum : ll { MLL = (ll)1e18L + 9 };
using namespace std;
#ifdef LOCAL
#include "rprint2.hpp"
#else
#define FUNC(name) \
template <ostream &out = cout, class... T> void name(T &&...) {}
FUNC(printde) FUNC(printdbe) FUNC(printdwe) FUNC(printdu);
#endif
template <template <class T, class = std::allocator<T>> class V, class E>
istream &operator>>(istream &in, V<E> &v) {
for (auto &e : v) {
in >> e;
}
return in;
}
//}}}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> ds(n);
cin >> ds;
if (ds[0]) {
cout << 0 << '\n';
return 0;
}
sort(ds.begin(), ds.end());
int len = 1;
ll ans = 1;
int prev = 1;
for (int i = 1; i < n;) {
int cnt = 0;
while (i < n && ds[i] == len) {
i++;
cnt++;
ans = ans * prev % 998244353;
}
if (cnt == 0) {
ans = 0;
break;
}
printde(i, cnt, len, ans);
len++;
prev = cnt;
}
cout << ans << '\n';
}
| insert | 59 | 59 | 59 | 63 | TLE | |
p02866 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;
const int mod = 998244353;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
int c[100005];
int main() {
std::ifstream in("/Users/admin/Downloads/in13.txt");
std::cin.rdbuf(in.rdbuf());
int n;
cin >> n;
vi d(n);
int md = 0;
rep(i, n) {
cin >> d[i];
maxs(md, d[i]);
c[d[i]]++;
if (i == 0 && d[i] != 0) {
cout << 0 << endl;
return 0;
}
}
mint ans = 1;
if (c[0] != 1) {
cout << 0 << endl;
return 0;
}
rep(i, md + 1) {
if (c[i] == 0) {
cout << 0 << endl;
return 0;
}
if (i > 0) {
rep(k, c[i]) {
mint t = c[i - 1];
ans *= t;
}
}
}
cout << ans.x << endl;
return 0;
} | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define show(x) cout << #x << " = " << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;
const int mod = 998244353;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
int c[100005];
int main() {
int n;
cin >> n;
vi d(n);
int md = 0;
rep(i, n) {
cin >> d[i];
maxs(md, d[i]);
c[d[i]]++;
if (i == 0 && d[i] != 0) {
cout << 0 << endl;
return 0;
}
}
mint ans = 1;
if (c[0] != 1) {
cout << 0 << endl;
return 0;
}
rep(i, md + 1) {
if (c[i] == 0) {
cout << 0 << endl;
return 0;
}
if (i > 0) {
rep(k, c[i]) {
mint t = c[i - 1];
ans *= t;
}
}
}
cout << ans.x << endl;
return 0;
} | delete | 91 | 93 | 91 | 91 | 0 | |
p02866 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using llong = long long;
using ldbl = long double;
using lpair = pair<llong, llong>;
#define ALL(x) x.begin(), x.end()
const llong inf = 1'000'000'000'000'007ll;
const llong mod = 998244353;
llong mpow(llong n, llong m) {
if (m == 1)
return n;
llong ret = mpow(n, m / 2);
ret = ret * ret % mod;
if (m & 1)
ret = ret * n % mod;
return ret;
}
int main() {
llong N;
vector<llong> D;
map<llong, llong> m;
cin >> N;
D.resize(N);
llong maxi = -inf;
for (auto &in : D) {
cin >> in;
++m[in];
maxi = max(maxi, in);
}
llong ans = 1;
if (!(m[0] == 1 && D[0] == 0)) {
ans = 0;
}
for (int i = 1; i <= maxi; ++i) {
ans = ans * mpow(m[i - 1], m[i]) % mod;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using llong = long long;
using ldbl = long double;
using lpair = pair<llong, llong>;
#define ALL(x) x.begin(), x.end()
const llong inf = 1'000'000'000'000'007ll;
const llong mod = 998244353;
llong mpow(llong n, llong m) {
if (m == 0)
return 0;
if (m == 1)
return n;
llong ret = mpow(n, m / 2);
ret = ret * ret % mod;
if (m & 1)
ret = ret * n % mod;
return ret;
}
int main() {
llong N;
vector<llong> D;
map<llong, llong> m;
cin >> N;
D.resize(N);
llong maxi = -inf;
for (auto &in : D) {
cin >> in;
++m[in];
maxi = max(maxi, in);
}
llong ans = 1;
if (!(m[0] == 1 && D[0] == 0)) {
ans = 0;
}
for (int i = 1; i <= maxi; ++i) {
ans = ans * mpow(m[i - 1], m[i]) % mod;
}
cout << ans << endl;
return 0;
} | insert | 13 | 13 | 13 | 15 | 0 | |
p02866 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 998244353;
const ll LINF = 1LL << 60;
const int INF = 1 << 30;
// 繰り返し二乗法
ll mod_pow(ll x, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1) {
res = res * x % mod;
}
x = x * x % mod;
n >>= 1;
}
return res;
}
int main() {
ll n;
cin >> n;
vector<ll> d(n);
for (ll i = 0; i < n; i++) {
cin >> d[i];
if (i != 0 && d[i] == 0) {
cout << 0 << endl;
return 0;
}
}
if (d[0] != 0) {
cout << 0 << endl;
return 0;
}
vector<ll> cnt(n, 0);
for (ll i = 0; i < n; i++) {
cnt[d[i]]++;
}
ll l;
for (ll i = 1; i < n; i++) {
if (cnt[i] == 0) {
l = i;
for (ll j = i + 1; j < n; j++) {
if (cnt[j] != 0) {
cout << 0 << endl;
return 0;
}
}
}
}
ll ans = 1;
for (ll i = 1; i < min(l, n); i++) {
ans *= mod_pow(cnt[i - 1] % mod, cnt[i]);
ans %= mod;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 998244353;
const ll LINF = 1LL << 60;
const int INF = 1 << 30;
// 繰り返し二乗法
ll mod_pow(ll x, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1) {
res = res * x % mod;
}
x = x * x % mod;
n >>= 1;
}
return res;
}
int main() {
ll n;
cin >> n;
vector<ll> d(n);
for (ll i = 0; i < n; i++) {
cin >> d[i];
if (i != 0 && d[i] == 0) {
cout << 0 << endl;
return 0;
}
}
if (d[0] != 0) {
cout << 0 << endl;
return 0;
}
vector<ll> cnt(n, 0);
for (ll i = 0; i < n; i++) {
cnt[d[i]]++;
}
ll l;
for (ll i = 1; i < n; i++) {
if (cnt[i] == 0) {
l = i;
for (ll j = i + 1; j < n; j++) {
if (cnt[j] != 0) {
cout << 0 << endl;
return 0;
}
break;
}
}
}
ll ans = 1;
for (ll i = 1; i < min(l, n); i++) {
ans *= mod_pow(cnt[i - 1] % mod, cnt[i]);
ans %= mod;
}
cout << ans << endl;
return 0;
} | insert | 56 | 56 | 56 | 57 | TLE | |
p02866 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
const double PI = acos(-1);
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = ll(1e9 + 7);
const ll INF = ll(1e18) + 7;
// repetition
#define REP(i, n) for (ll i = 0; i < n; i++)
#define RREP(i, n) for (ll i = n; i != 0; i--)
ll gcd(ll a, ll b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
unsigned getDigit(unsigned num) {
unsigned digit = 0;
while (num != 0) {
num /= 10;
digit++;
}
return digit;
}
unsigned binarySearch(ll target, ll max, ll min) {
while ((max - min) > 1) {
if ((max + min) / 2 > target) {
max = (max + min) / 2;
min = min;
} else {
max = max;
min = (max + min) / 2;
}
}
}
void f(int rest, string s) {
char abc[] = "abc";
if (rest == 0) {
cout << s << endl;
} else {
for (int i = 0; i < 3; i++) {
f(rest - 1, s + abc[i]);
}
}
}
// origin (ox, oy) destination (dx, dy)
//
/*
ll dfs2(ll ox, ll oy, vector<vector<char>> v, vector<vector<int>> dist) {
int m = 0;
for (int i = 0; i < 4; i++) {
int nx = ox+dx[i], ny = oy + dy[i];
if(nx < 0 || nx >= w || ny < 0 || nx >= h) continue;
if(v[nx][ny] != '.') continue;
if(dist[nx][ny] == -1) {
dist[nx][ny] = dist[ox][oy] + 1;
dist[nx][ny] = min(dist[ox][oy], dist[nx][ny]);
cout << "v[nx][ny]: " << dist[nx][ny] << endl;
cout << "dx: " << dx << endl;
cout << "dy: " << dy << endl;
cout << "v[ox][oy]: " << v[ox][oy] << endl;
cout << "(nx, ny)" << "("<< nx << "," << ny << ")"<< endl;
dfs2(nx, ny, v, dist);
}
m = max(m, dist[nx][ny]);
}
return m;
}
int main() {
// n,m->size, k-> value
// vector<vector<ll>> a(n ,vector<ll>(m, k));
// vector
// vector<ll> s(n,0);
// vector<vector<ll>> v;
// map<ll,ll> m;
// priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>
pq;
// vector<pair<ll, ll>> epv(n, {0, 0});
// vector<vector<char>> v(h, vector<char>(w));
for(auto&& m: em) {
epv.push_back({ m.second, m.first });
}
ll n, k, a;
cin >> n >> k;
vector<ll> vp;
vector<ll> vn;
ll c = 0;
REP(i, n) {
cin >> a;
if(a >= 0 ) vp.push_back(a);
else vn.push_back(a);
}
sort(vp.begin(), vp.end());
sort(vn.begin(), vn.end());
ll ps = vp.size();
ll ns = vn.size();
cout << "k: " << k << endl;
cout << "ps: " << ps << endl;
cout << "ns: " << ns << endl;
if(k < ps * ns) {
ll m = k%ns;
ll d = k - (m+1);
cout << vn[m] * vp[d] << endl;
}else {
ll kd = k - ps*ns;
ll md = kd%ps;
ll dd = kd - md;
ll s = 0;
REP(i, ps) {
s = s+(ps-i-1);
cout << "s: " << s << endl;
cout << "kd: " << kd << endl;
cout << "s: " << s << endl;
cout << "kd: " << kd << endl;
cout << "i: " << i << endl;
if(s > kd) {
cout << "vp[i]: " << vp[i] << endl;
cout << "vp[ps-i]: " << vp[s-kd+i-1] << endl;
cout << vp[i] * vp[s-kd+i-1] << endl;
break;
}
}
}
}
ll h, w;
vector<vector<char>> v;
vector<ll> dx = {-1, 0, 1, 0};
vector<ll> dy = {0, -1, 0, 1};
ll bfs(ll ox, ll oy) {
vector<vector<ll>> vd(h, vector<ll>(w, -1));
queue<pair<ll, ll>> q;
q.push({ox, oy});
vd[oy][ox] = 0;
ll res = 0;
while(!q.empty()) {
pair<ll, ll> vn = q.front();
q.pop();
res = max(res, vd[vn.second][vn.first]);
for(ll i = 0; i < 4; i++){
ll nx = vn.first +dx[i];
ll ny = vn.second + dy[i];
if(nx < 0 || ny < 0 || nx >= w || ny >= h) continue;
if(v[ny][nx] == '#') continue;
if(vd[ny][nx] == -1) {
vd[ny][nx] = res + 1;
q.push({nx, ny});
}
}
}
return res;
}
bool kai(string s) {
bool flg = true;
ll n = s.size();
for(ll i=0; i<n/2; i++) {
if(s[i] == s[n-1 -i]){
flg = true;
} else {
flg = false;
break;
}
}
return flg;
}
*/
struct UnionFind {
vector<ll> par;
map<ll, ll> s;
UnionFind(ll n) : par(n) {
REP(i, n) {
par[i] = i;
s[i]++;
}
}
ll root(ll x) {
if (par[x] == x)
return x;
return root(par[x]);
}
void unite(ll x, ll y) {
ll rx = root(x);
ll ry = root(y);
if (rx == ry)
return;
if (size(rx) > size(ry)) {
s[rx] = s[rx] + s[ry];
par[root(y)] = rx;
} else {
s[ry] = s[ry] + s[rx];
par[root(x)] = ry;
}
}
bool same(ll x, ll y) { return root(x) == root(y); }
ll size(ll x) { return s[root(x)]; }
};
ll mod_pow(ll base, ll exp, ll mod) {
if (exp == 1)
return base % mod;
if (exp % 2 == 1)
return (base * mod_pow(base, exp - 1, mod)) % mod;
ll t = mod_pow(base, exp / 2, mod);
return (t * t) % mod;
}
// nPr
ll mod_permutation(ll n, ll r) {
ll t = 1;
while (r != 0) {
t = (t % MOD) * (n % MOD);
n--;
r--;
}
return t;
}
ll mod_factorial(ll r) {
ll v = 1;
while (r != 0) {
v = (v % MOD) * (r % MOD);
r--;
}
return v;
}
deque<ll> prime_factorization(ll n) {
vector<ll> P;
ll nn = sqrt(n) + 2;
vector<ll> prime(nn, true);
for (ll i = 2; i <= nn; i++) {
if (prime[i]) {
for (ll j = 2 * i; j <= nn; j += i) {
prime[j] = false;
}
P.emplace_back(i);
}
}
deque<ll> d;
REP(i, P.size()) {
while (n % P[i] == 0) {
d.push_back(P[i]);
n /= P[i];
}
}
if (n > nn)
d.push_back(n);
return d;
}
struct Node {
vector<ll> edges;
vector<ll> costs;
bool done;
ll cost;
friend bool operator<(const Node &lhs, const Node &rhs) {
return rhs.cost < lhs.cost;
}
};
ll mod_conb() {
//((p%MOD)*(mod_pow(k, MOD-2)%MOD)*(mod_pow(ki, MOD-2)%MOD))%MOD
}
vector<vector<ll>> vv;
ll c = 0;
vector<ll> v;
ll n, m, q;
// indexからmまでのn桁の数列の列挙
void dfs2(ll index, ll count) {
if (count < n) {
for (ll i = index; i <= m; i++) {
v[count] = i;
dfs2(i, count + 1);
}
} else {
vv.push_back(v);
}
}
int main() {
ll n;
std::ifstream in("in08.txt");
std::cin.rdbuf(in.rdbuf());
cin >> n;
map<ll, ll> m;
map<ll, ll> mi;
ll d;
ll able = true;
REP(i, n) {
cin >> d;
mi[i] = d;
m[d]++;
}
ll t = 1;
// 木を作れるかの判定,ノードの組み合わせで距離が作れるか
ll mod = 998244353;
if (mi[0] != 0)
able = false;
if (m[0] != 1)
able = false;
REP(i, m.size()) {
if (i == 0) {
} else {
if (m[i - 1] == 0 || m[i] == 0) {
able = false;
break;
} else {
ll tmp = mod_pow(m[i - 1], m[i], mod);
t = (t * tmp) % mod;
}
}
}
if (able)
cout << t % mod << endl;
else
cout << 0;
} | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
const double PI = acos(-1);
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = ll(1e9 + 7);
const ll INF = ll(1e18) + 7;
// repetition
#define REP(i, n) for (ll i = 0; i < n; i++)
#define RREP(i, n) for (ll i = n; i != 0; i--)
ll gcd(ll a, ll b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
unsigned getDigit(unsigned num) {
unsigned digit = 0;
while (num != 0) {
num /= 10;
digit++;
}
return digit;
}
unsigned binarySearch(ll target, ll max, ll min) {
while ((max - min) > 1) {
if ((max + min) / 2 > target) {
max = (max + min) / 2;
min = min;
} else {
max = max;
min = (max + min) / 2;
}
}
}
void f(int rest, string s) {
char abc[] = "abc";
if (rest == 0) {
cout << s << endl;
} else {
for (int i = 0; i < 3; i++) {
f(rest - 1, s + abc[i]);
}
}
}
// origin (ox, oy) destination (dx, dy)
//
/*
ll dfs2(ll ox, ll oy, vector<vector<char>> v, vector<vector<int>> dist) {
int m = 0;
for (int i = 0; i < 4; i++) {
int nx = ox+dx[i], ny = oy + dy[i];
if(nx < 0 || nx >= w || ny < 0 || nx >= h) continue;
if(v[nx][ny] != '.') continue;
if(dist[nx][ny] == -1) {
dist[nx][ny] = dist[ox][oy] + 1;
dist[nx][ny] = min(dist[ox][oy], dist[nx][ny]);
cout << "v[nx][ny]: " << dist[nx][ny] << endl;
cout << "dx: " << dx << endl;
cout << "dy: " << dy << endl;
cout << "v[ox][oy]: " << v[ox][oy] << endl;
cout << "(nx, ny)" << "("<< nx << "," << ny << ")"<< endl;
dfs2(nx, ny, v, dist);
}
m = max(m, dist[nx][ny]);
}
return m;
}
int main() {
// n,m->size, k-> value
// vector<vector<ll>> a(n ,vector<ll>(m, k));
// vector
// vector<ll> s(n,0);
// vector<vector<ll>> v;
// map<ll,ll> m;
// priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>
pq;
// vector<pair<ll, ll>> epv(n, {0, 0});
// vector<vector<char>> v(h, vector<char>(w));
for(auto&& m: em) {
epv.push_back({ m.second, m.first });
}
ll n, k, a;
cin >> n >> k;
vector<ll> vp;
vector<ll> vn;
ll c = 0;
REP(i, n) {
cin >> a;
if(a >= 0 ) vp.push_back(a);
else vn.push_back(a);
}
sort(vp.begin(), vp.end());
sort(vn.begin(), vn.end());
ll ps = vp.size();
ll ns = vn.size();
cout << "k: " << k << endl;
cout << "ps: " << ps << endl;
cout << "ns: " << ns << endl;
if(k < ps * ns) {
ll m = k%ns;
ll d = k - (m+1);
cout << vn[m] * vp[d] << endl;
}else {
ll kd = k - ps*ns;
ll md = kd%ps;
ll dd = kd - md;
ll s = 0;
REP(i, ps) {
s = s+(ps-i-1);
cout << "s: " << s << endl;
cout << "kd: " << kd << endl;
cout << "s: " << s << endl;
cout << "kd: " << kd << endl;
cout << "i: " << i << endl;
if(s > kd) {
cout << "vp[i]: " << vp[i] << endl;
cout << "vp[ps-i]: " << vp[s-kd+i-1] << endl;
cout << vp[i] * vp[s-kd+i-1] << endl;
break;
}
}
}
}
ll h, w;
vector<vector<char>> v;
vector<ll> dx = {-1, 0, 1, 0};
vector<ll> dy = {0, -1, 0, 1};
ll bfs(ll ox, ll oy) {
vector<vector<ll>> vd(h, vector<ll>(w, -1));
queue<pair<ll, ll>> q;
q.push({ox, oy});
vd[oy][ox] = 0;
ll res = 0;
while(!q.empty()) {
pair<ll, ll> vn = q.front();
q.pop();
res = max(res, vd[vn.second][vn.first]);
for(ll i = 0; i < 4; i++){
ll nx = vn.first +dx[i];
ll ny = vn.second + dy[i];
if(nx < 0 || ny < 0 || nx >= w || ny >= h) continue;
if(v[ny][nx] == '#') continue;
if(vd[ny][nx] == -1) {
vd[ny][nx] = res + 1;
q.push({nx, ny});
}
}
}
return res;
}
bool kai(string s) {
bool flg = true;
ll n = s.size();
for(ll i=0; i<n/2; i++) {
if(s[i] == s[n-1 -i]){
flg = true;
} else {
flg = false;
break;
}
}
return flg;
}
*/
struct UnionFind {
vector<ll> par;
map<ll, ll> s;
UnionFind(ll n) : par(n) {
REP(i, n) {
par[i] = i;
s[i]++;
}
}
ll root(ll x) {
if (par[x] == x)
return x;
return root(par[x]);
}
void unite(ll x, ll y) {
ll rx = root(x);
ll ry = root(y);
if (rx == ry)
return;
if (size(rx) > size(ry)) {
s[rx] = s[rx] + s[ry];
par[root(y)] = rx;
} else {
s[ry] = s[ry] + s[rx];
par[root(x)] = ry;
}
}
bool same(ll x, ll y) { return root(x) == root(y); }
ll size(ll x) { return s[root(x)]; }
};
ll mod_pow(ll base, ll exp, ll mod) {
if (exp == 1)
return base % mod;
if (exp % 2 == 1)
return (base * mod_pow(base, exp - 1, mod)) % mod;
ll t = mod_pow(base, exp / 2, mod);
return (t * t) % mod;
}
// nPr
ll mod_permutation(ll n, ll r) {
ll t = 1;
while (r != 0) {
t = (t % MOD) * (n % MOD);
n--;
r--;
}
return t;
}
ll mod_factorial(ll r) {
ll v = 1;
while (r != 0) {
v = (v % MOD) * (r % MOD);
r--;
}
return v;
}
deque<ll> prime_factorization(ll n) {
vector<ll> P;
ll nn = sqrt(n) + 2;
vector<ll> prime(nn, true);
for (ll i = 2; i <= nn; i++) {
if (prime[i]) {
for (ll j = 2 * i; j <= nn; j += i) {
prime[j] = false;
}
P.emplace_back(i);
}
}
deque<ll> d;
REP(i, P.size()) {
while (n % P[i] == 0) {
d.push_back(P[i]);
n /= P[i];
}
}
if (n > nn)
d.push_back(n);
return d;
}
struct Node {
vector<ll> edges;
vector<ll> costs;
bool done;
ll cost;
friend bool operator<(const Node &lhs, const Node &rhs) {
return rhs.cost < lhs.cost;
}
};
ll mod_conb() {
//((p%MOD)*(mod_pow(k, MOD-2)%MOD)*(mod_pow(ki, MOD-2)%MOD))%MOD
}
vector<vector<ll>> vv;
ll c = 0;
vector<ll> v;
ll n, m, q;
// indexからmまでのn桁の数列の列挙
void dfs2(ll index, ll count) {
if (count < n) {
for (ll i = index; i <= m; i++) {
v[count] = i;
dfs2(i, count + 1);
}
} else {
vv.push_back(v);
}
}
int main() {
ll n;
// std::ifstream in("in08.txt");
// std::cin.rdbuf(in.rdbuf());
cin >> n;
map<ll, ll> m;
map<ll, ll> mi;
ll d;
ll able = true;
REP(i, n) {
cin >> d;
mi[i] = d;
m[d]++;
}
ll t = 1;
// 木を作れるかの判定,ノードの組み合わせで距離が作れるか
ll mod = 998244353;
if (mi[0] != 0)
able = false;
if (m[0] != 1)
able = false;
REP(i, m.size()) {
if (i == 0) {
} else {
if (m[i - 1] == 0 || m[i] == 0) {
able = false;
break;
} else {
ll tmp = mod_pow(m[i - 1], m[i], mod);
t = (t * tmp) % mod;
}
}
}
if (able)
cout << t % mod << endl;
else
cout << 0;
} | replace | 340 | 342 | 340 | 342 | TLE | |
p02866 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
using ll = long long;
string char_to_string(char val) { return string(1, val); }
int char_to_int(char val) { return val - '0'; }
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;
}
int vector_finder(std::vector<ll> vec, int number) {
auto itr = std::find(vec.begin(), vec.end(), number);
size_t index = std::distance(vec.begin(), itr);
if (index != vec.size()) { // 発見できたとき
return 1;
} else { // 発見できなかったとき
return 0;
}
}
struct edge {
ll to, cost;
};
ll modpow(ll a, ll n, ll mod) {
if (n == 0) {
return 1;
} else if (n % 2 == 1) {
return modpow(a, n - 1, mod) * a % mod;
} else {
ll t = modpow(a, n / 2, mod);
return t * t % mod;
}
}
int main() {
int N;
cin >> N;
vector<ll> D(N);
REP(i, N) cin >> D[i];
if (D[0] != 0) { // 1番目が0でなければ構築不可能
cout << 0 << endl;
return 0;
}
// それ以外の検査
// ソートしてよい
sort(all(D));
vector<ll> res;
ll cnt = 0;
REP(i, N) { // 前処理
cnt++;
if (D[i] != D[i + 1]) {
res.push_back(cnt);
cnt = 0;
}
}
bool flag = false;
REP(i, N - 1) { // 連番になってなければ構築不可能。
if (D[i + 1] - D[i] > 1)
flag = true;
}
if (flag == true || D[1] == 0) {
cout << 0 << endl;
return 0;
}
// 判定パート
ll ans = 1;
const ll MOD = 998244353;
REP(i, N - 1) {
ans *= ((ll)pow(res[i], res[i + 1]) % MOD);
ans %= MOD;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
using ll = long long;
string char_to_string(char val) { return string(1, val); }
int char_to_int(char val) { return val - '0'; }
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;
}
int vector_finder(std::vector<ll> vec, int number) {
auto itr = std::find(vec.begin(), vec.end(), number);
size_t index = std::distance(vec.begin(), itr);
if (index != vec.size()) { // 発見できたとき
return 1;
} else { // 発見できなかったとき
return 0;
}
}
struct edge {
ll to, cost;
};
ll modpow(ll a, ll n, ll mod) {
if (n == 0) {
return 1;
} else if (n % 2 == 1) {
return modpow(a, n - 1, mod) * a % mod;
} else {
ll t = modpow(a, n / 2, mod);
return t * t % mod;
}
}
int main() {
int N;
cin >> N;
vector<ll> D(N);
REP(i, N) cin >> D[i];
if (D[0] != 0) { // 1番目が0でなければ構築不可能
cout << 0 << endl;
return 0;
}
// それ以外の検査
// ソートしてよい
sort(all(D));
vector<ll> res;
ll cnt = 0;
REP(i, N) { // 前処理
cnt++;
if (D[i] != D[i + 1]) {
res.push_back(cnt);
cnt = 0;
}
}
bool flag = false;
REP(i, N - 1) { // 連番になってなければ構築不可能。
if (D[i + 1] - D[i] > 1)
flag = true;
}
if (flag == true || D[1] == 0) {
cout << 0 << endl;
return 0;
}
// 判定パート
ll ans = 1;
const ll MOD = 998244353;
REP(i, res.size() - 1) {
ans *= modpow(res[i], res[i + 1], MOD);
ans %= MOD;
}
cout << ans << endl;
} | replace | 80 | 82 | 80 | 82 | 0 | |
p02866 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
using vll = vector<long long>;
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;
}
#define che(a, string) cout << "//" << string << "==" << (a) << "//" << endl;
#define SORT(a) sort((a).begin(), (a).end())
#define rSORT(a) reverse((a).begin(), (a).end())
#define For(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) For(i, 0, n)
#define leftunique(a) \
{ \
SORT(a); \
(a).erase(unique((a).begin(), (a).end()), (a).end()); \
}
// leftuniqueは配列から同じ要素のものを取り除く 例 4 6 2 1 3 4 1 2 なら 1 2 3 4
// 6 になる
bool IsInt(double a) {
int b = a / 1;
if (a == b) {
return true;
} else {
return false;
}
}
bool coY() { cout << "Yes" << endl; }
bool coN() { cout << "No" << endl; }
const int mod = 998244353;
const ll INF = 1LL << 60;
// a^n mod を計算する
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// ここから書き始める
int main() {
cout << setprecision(10);
ll n;
cin >> n;
map<ll, ll> tree;
rep(i, n) {
ll a;
cin >> a; // 入力で距離を与える
if (i == 0) {
// 距離は0じゃないといけない!!
if (a != 0) {
cout << 0 << endl; // 1個目の距離が0じゃない木は存在しない
return 0;
} else {
tree[a] = 1;
}
}
// i != 0 の ときは map にどんどんぶち込んでいく。
else {
if (tree.count(a)) {
tree[a]++;
} else
tree[a] = 1;
}
}
// 一回マップの中を見てみる
ll ans = 1;
rep(i, n) {
if (i == 0) {
if (tree[i] != 1) { // 0は1個しかダメ。
cout << 0 << endl;
return 0;
}
} else if (tree[i] != 0) {
ans *= modpow(tree[i - 1], tree[i], mod);
ans %= mod;
} else {
For(j, i + 1, n) {
if (tree[j] != 0) {
cout << 0 << endl;
return 0;
}
}
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
using vll = vector<long long>;
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;
}
#define che(a, string) cout << "//" << string << "==" << (a) << "//" << endl;
#define SORT(a) sort((a).begin(), (a).end())
#define rSORT(a) reverse((a).begin(), (a).end())
#define For(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) For(i, 0, n)
#define leftunique(a) \
{ \
SORT(a); \
(a).erase(unique((a).begin(), (a).end()), (a).end()); \
}
// leftuniqueは配列から同じ要素のものを取り除く 例 4 6 2 1 3 4 1 2 なら 1 2 3 4
// 6 になる
bool IsInt(double a) {
int b = a / 1;
if (a == b) {
return true;
} else {
return false;
}
}
bool coY() { cout << "Yes" << endl; }
bool coN() { cout << "No" << endl; }
const int mod = 998244353;
const ll INF = 1LL << 60;
// a^n mod を計算する
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// ここから書き始める
int main() {
cout << setprecision(10);
ll n;
cin >> n;
map<ll, ll> tree;
rep(i, n) {
ll a;
cin >> a; // 入力で距離を与える
if (i == 0) {
// 距離は0じゃないといけない!!
if (a != 0) {
cout << 0 << endl; // 1個目の距離が0じゃない木は存在しない
return 0;
} else {
tree[a] = 1;
}
}
// i != 0 の ときは map にどんどんぶち込んでいく。
else {
if (tree.count(a)) {
tree[a]++;
} else
tree[a] = 1;
}
}
// 一回マップの中を見てみる
ll ans = 1;
rep(i, n) {
if (i == 0) {
if (tree[i] != 1) { // 0は1個しかダメ。
cout << 0 << endl;
return 0;
}
} else if (tree[i] != 0) {
ans *= modpow(tree[i - 1], tree[i], mod);
ans %= mod;
} else {
For(j, i + 1, n) {
if (tree[j] != 0) {
cout << 0 << endl;
return 0;
}
}
break;
}
}
cout << ans << endl;
}
| insert | 103 | 103 | 103 | 104 | TLE | |
p02866 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long double ld;
typedef long long ll;
using namespace std;
const ll p = 998244353;
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
freopen("input.txt", "r", stdin);
cout << setprecision(20);
int n;
cin >> n;
vector<int> a(n, 0);
int det;
cin >> det;
a[det]++;
for (int i = 1; i < n; i++) {
int x;
cin >> x;
a[x]++;
}
if (a[0] != 1 || det != 0) {
cout << "0";
return 0;
}
ll ans = 1;
for (int i = 1; i < n; i++) {
ll pw = 1;
for (int j = 0; j < a[i]; j++) {
pw *= a[i - 1];
pw %= p;
}
ans *= pw;
ans %= p;
}
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
typedef long double ld;
typedef long long ll;
using namespace std;
const ll p = 998244353;
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
// freopen("input.txt", "r", stdin);
cout << setprecision(20);
int n;
cin >> n;
vector<int> a(n, 0);
int det;
cin >> det;
a[det]++;
for (int i = 1; i < n; i++) {
int x;
cin >> x;
a[x]++;
}
if (a[0] != 1 || det != 0) {
cout << "0";
return 0;
}
ll ans = 1;
for (int i = 1; i < n; i++) {
ll pw = 1;
for (int j = 0; j < a[i]; j++) {
pw *= a[i - 1];
pw %= p;
}
ans *= pw;
ans %= p;
}
cout << ans;
return 0;
}
| replace | 12 | 13 | 12 | 13 | -6 | terminate called after throwing an instance of 'std::length_error'
what(): cannot create std::vector larger than max_size()
|
p02866 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<bool> VB;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<char> VC;
typedef vector<VC> VVC;
typedef vector<VB> VVB;
typedef pair<int, int> PII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef pair<LL, LL> PLL;
typedef vector<PII> VPII;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define PF push_front
#define POB pop_back()
#define POF pop_front()
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a) * (a))
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
#define LB lower_bound
#define UB upper_bound
#define SORTR(c) sort((c).begin(), (c).end(), greater<int>())
// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define FORR(i, a, b) for (int i = (b - 1); i >= a; i--)
#define REPR(i, n) RFOR(i, 0, n)
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
const LL INF = INT_MAX;
const LL LINF = LLONG_MAX;
const LL MOD = 1e9 + 7;
const LL MODD = 998244353;
// other
//-------------------------------------------
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define FI first
#define SE second
// memo
// setprecision()
VI dx = {1, 0, -1, 0};
VI dy = {0, 1, 0, -1};
LL Gcd(LL a, LL b) { return __gcd(a, b); }
LL Lcm(LL a, LL b) {
LL abd = Gcd(a, b);
LL x = a / abd, y = b / abd;
return x * y * abd;
}
LL RepSqu(LL N, LL P, LL M) {
if (N == 0) {
return 0;
}
if (P == 0) {
return 1;
}
if (P % 2 == 0) {
LL t = RepSqu(N, P / 2, M);
return t * t % M;
}
return (N * RepSqu(N, P - 1, M)) % M;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, D;
cin >> N;
LL ans = 1;
VLL T(N, 0), A(N);
REP(i, N) {
cin >> D;
T.at(D)++;
A.at(i) = D;
}
if (T.at(0) != 1) {
cout << 0 << endl;
return 0;
}
FOR(i, 1, N) {
ans *= T.at(A.at(i) - 1);
ans %= MODD;
}
cout << ans % MODD << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<bool> VB;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<char> VC;
typedef vector<VC> VVC;
typedef vector<VB> VVB;
typedef pair<int, int> PII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef pair<LL, LL> PLL;
typedef vector<PII> VPII;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define PF push_front
#define POB pop_back()
#define POF pop_front()
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a) * (a))
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
#define LB lower_bound
#define UB upper_bound
#define SORTR(c) sort((c).begin(), (c).end(), greater<int>())
// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define FORR(i, a, b) for (int i = (b - 1); i >= a; i--)
#define REPR(i, n) RFOR(i, 0, n)
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
const LL INF = INT_MAX;
const LL LINF = LLONG_MAX;
const LL MOD = 1e9 + 7;
const LL MODD = 998244353;
// other
//-------------------------------------------
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define FI first
#define SE second
// memo
// setprecision()
VI dx = {1, 0, -1, 0};
VI dy = {0, 1, 0, -1};
LL Gcd(LL a, LL b) { return __gcd(a, b); }
LL Lcm(LL a, LL b) {
LL abd = Gcd(a, b);
LL x = a / abd, y = b / abd;
return x * y * abd;
}
LL RepSqu(LL N, LL P, LL M) {
if (N == 0) {
return 0;
}
if (P == 0) {
return 1;
}
if (P % 2 == 0) {
LL t = RepSqu(N, P / 2, M);
return t * t % M;
}
return (N * RepSqu(N, P - 1, M)) % M;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, D;
cin >> N;
LL ans = 1;
VLL T(N, 0), A(N);
REP(i, N) {
cin >> D;
T.at(D)++;
A.at(i) = D;
}
if (T.at(0) != 1) {
cout << 0 << endl;
return 0;
}
if (A.at(0) != 0) {
cout << 0 << endl;
return 0;
}
FOR(i, 1, N) {
ans *= T.at(A.at(i) - 1);
ans %= MODD;
}
cout << ans % MODD << endl;
return 0;
} | insert | 132 | 132 | 132 | 136 | 0 | |
p02866 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int D[100050];
for (int i = 1; i <= N; i++)
cin >> D[i];
int bucket_max = 0;
int bucket[100050];
for (int i = 1; i <= N; i++) {
bucket_max = (D[i] > bucket_max) ? D[i] : bucket_max;
bucket[D[i]]++;
}
if (!(bucket[0] == 1 && D[1] == 0)) {
cout << 0 << endl;
return 0;
}
long ans = 1;
for (int i = 1; i <= bucket_max; i++) {
for (int k = 0; k < bucket[i]; k++) {
ans = ans * bucket[i - 1] % 998244353;
}
}
cout << ans << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int D[100050];
for (int i = 1; i <= N; i++)
cin >> D[i];
int bucket_max = 0;
int bucket[100050] = {};
for (int i = 1; i <= N; i++) {
bucket_max = (D[i] > bucket_max) ? D[i] : bucket_max;
bucket[D[i]]++;
}
if (!(bucket[0] == 1 && D[1] == 0)) {
cout << 0 << endl;
return 0;
}
long ans = 1;
for (int i = 1; i <= bucket_max; i++) {
for (int k = 0; k < bucket[i]; k++) {
ans = ans * bucket[i - 1] % 998244353;
}
}
cout << ans << endl;
return 0;
}
| replace | 12 | 13 | 12 | 13 | TLE | |
p02866 | C++ | Time Limit Exceeded | #include <cstdio>
#include <iostream>
#define ll long long
#define mod 998244353
using namespace std;
int n, x;
int cnt[1000010];
ll ans = 1;
ll ksm(ll x, ll i) {
ll res = 1;
for (; i; i >>= 1, x = x * x % mod)
if (i & 1)
res = res * x % mod;
return res;
}
int main() {
scanf("%d", &n);
for (register int i = 1; i <= n; i++) {
scanf("%d", &x);
if (i == 1 && x != 0) {
printf("0");
return 0;
}
cnt[x]++;
}
if (cnt[0] != 1) {
printf("0");
return 0;
}
for (register int i = 1; i <= 100000; i++) {
if (!cnt[i]) {
for (register int j = i + 1; j <= 100000; j++) {
if (cnt[j]) {
printf("0");
return 0;
}
}
}
ans = ans * ksm(cnt[i - 1], cnt[i]) % mod;
}
printf("%lld", ans);
return 0;
} | #include <cstdio>
#include <iostream>
#define ll long long
#define mod 998244353
using namespace std;
int n, x;
int cnt[1000010];
ll ans = 1;
ll ksm(ll x, ll i) {
ll res = 1;
for (; i; i >>= 1, x = x * x % mod)
if (i & 1)
res = res * x % mod;
return res;
}
int main() {
scanf("%d", &n);
for (register int i = 1; i <= n; i++) {
scanf("%d", &x);
if (i == 1 && x != 0) {
printf("0");
return 0;
}
cnt[x]++;
}
if (cnt[0] != 1) {
printf("0");
return 0;
}
for (register int i = 1; i <= 100000; i++) {
if (!cnt[i]) {
for (register int j = i + 1; j <= 100000; j++) {
if (cnt[j]) {
printf("0");
return 0;
}
}
break;
}
ans = ans * ksm(cnt[i - 1], cnt[i]) % mod;
}
printf("%lld", ans);
return 0;
} | insert | 37 | 37 | 37 | 38 | TLE | |
p02866 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define Int int64_t
using namespace std;
int64_t modpow(int64_t a, int64_t b, int64_t MOD) {
int64_t ret = 1;
while (b > 0) {
if (b & 1) {
(ret *= a) %= MOD;
}
(a *= a) %= MOD;
b >>= 1;
}
return ret % MOD;
}
int main() {
const Int MOD = 998244353;
int N;
cin >> N;
vector<Int> D(N);
vector<Int> c(100010, 0);
for (int i = 0; i < N; ++i) {
cin >> D[i];
++c[D[i]];
}
Int ans = 0;
if (D[0] == 0 && c[0] == 1) {
ans = 1;
}
for (int i = 1; i <= *max_element(D.begin(), D.end()); ++i) {
(ans *= modpow(c[i - 1], c[i], MOD)) %= MOD;
}
cout << ans % MOD << endl;
return 0;
}
| #include <bits/stdc++.h>
#define Int int64_t
using namespace std;
int64_t modpow(int64_t a, int64_t b, int64_t MOD) {
int64_t ret = 1;
while (b > 0) {
if (b & 1) {
(ret *= a) %= MOD;
}
(a *= a) %= MOD;
b >>= 1;
}
return ret % MOD;
}
int main() {
const Int MOD = 998244353;
int N;
cin >> N;
vector<Int> D(N);
vector<Int> c(100010, 0);
for (int i = 0; i < N; ++i) {
cin >> D[i];
++c[D[i]];
}
Int ans = 0;
if (D[0] == 0 && c[0] == 1) {
ans = 1;
}
int max_d = 0;
for (int i = 0; i < N; ++i) {
max_d = max(max_d, (int)D[i]);
}
for (int i = 1; i <= max_d; ++i) {
if (c[i - 1] <= 0 || c[i] <= 0) {
ans = 0;
break;
}
(ans *= modpow(c[i - 1], c[i], MOD)) %= MOD;
}
cout << ans % MOD << endl;
return 0;
}
| replace | 32 | 33 | 32 | 41 | TLE | |
p02866 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <vector>
#define mp make_pair
#define pb push_back
#define p push
#define FOR(a, c) for (int a = 0; a < c; a++)
#define FORR(el, vecc) for (auto &el : vecc)
#define ll long long int
#define abs(x) (x < 0 ? (-x) : x)
#define getI(a) scanf("%d", &a)
#define getII(a, b) scanf("%d %d", &a, &b)
#define getIII(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define getL(a) scanf("%lld", &a)
#define getLL(a, b) scanf("%lld %lld", &a, &b)
#define getLLL(a, b, c) scanf("%lld%lld%lld", &a, &b, &c)
#define BEND(c) (c).begin(), (c).end()
#define BEND2(c) (c).begin(), (c).end(), greater<int>()
#define fi first
#define se second
#define PI 3.1415926535897932384626
#define getS(a) scanf("%s", a)
#define pfi(a) printf("%d", a);
#define pfii(a, b) printf("%d%d", a, b);
#define pfl(a) printf("%lld", a);
#define pfll(a, b) printf("%lld%lld", a, b);
#define pfd(a) printf("%.6lf\n", a);
#define SIZE
#define sag (sol | 1)
#define sol (root << 1)
#define ort (bas + son) / 2
#define N (int)(1e5 + 10)
using namespace std;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvl;
typedef vector<long long> vl;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<long long, long long>> vpl;
typedef vector<vector<pair<long long, long long>>> vvpl;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
const int MX = 200005;
long long fast_exp(long long n, long long k) {
ll t = n;
if (k == 1)
return n;
k--;
while (k--) {
n = (n * t) % 998244353;
}
return n;
}
/*ios_base::sync_with_stdio(false);cin.tie(0);*/
int main() {
ll n;
cin >> n;
vl vec(n);
map<ll, ll> mm;
for (int i = 0; i < n; ++i) {
cin >> vec[i];
mm[vec[i]]++;
}
if (vec[0] != 0) {
cout << 0;
return 0;
}
sort(BEND2(vec));
if (mm[0] != 1) {
cout << 0;
return 0;
}
ll res = 1;
for (int j = 1; j <= vec[0]; ++j) {
res = (res * ((fast_exp(mm[j - 1], mm[j])) % 998244353) % 998244353) %
998244353;
res = res % 998244353;
}
cout << res;
} | #include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <vector>
#define mp make_pair
#define pb push_back
#define p push
#define FOR(a, c) for (int a = 0; a < c; a++)
#define FORR(el, vecc) for (auto &el : vecc)
#define ll long long int
#define abs(x) (x < 0 ? (-x) : x)
#define getI(a) scanf("%d", &a)
#define getII(a, b) scanf("%d %d", &a, &b)
#define getIII(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define getL(a) scanf("%lld", &a)
#define getLL(a, b) scanf("%lld %lld", &a, &b)
#define getLLL(a, b, c) scanf("%lld%lld%lld", &a, &b, &c)
#define BEND(c) (c).begin(), (c).end()
#define BEND2(c) (c).begin(), (c).end(), greater<int>()
#define fi first
#define se second
#define PI 3.1415926535897932384626
#define getS(a) scanf("%s", a)
#define pfi(a) printf("%d", a);
#define pfii(a, b) printf("%d%d", a, b);
#define pfl(a) printf("%lld", a);
#define pfll(a, b) printf("%lld%lld", a, b);
#define pfd(a) printf("%.6lf\n", a);
#define SIZE
#define sag (sol | 1)
#define sol (root << 1)
#define ort (bas + son) / 2
#define N (int)(1e5 + 10)
using namespace std;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvl;
typedef vector<long long> vl;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<long long, long long>> vpl;
typedef vector<vector<pair<long long, long long>>> vvpl;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
const int MX = 200005;
long long fast_exp(long long n, long long k) {
ll t = n;
while (k > 1) {
k--;
n = (n * t) % 998244353;
}
return n;
}
/*ios_base::sync_with_stdio(false);cin.tie(0);*/
int main() {
ll n;
cin >> n;
vl vec(n);
map<ll, ll> mm;
for (int i = 0; i < n; ++i) {
cin >> vec[i];
mm[vec[i]]++;
}
if (vec[0] != 0) {
cout << 0;
return 0;
}
sort(BEND2(vec));
if (mm[0] != 1) {
cout << 0;
return 0;
}
ll res = 1;
for (int j = 1; j <= vec[0]; ++j) {
res = (res * ((fast_exp(mm[j - 1], mm[j])) % 998244353) % 998244353) %
998244353;
res = res % 998244353;
}
cout << res;
} | replace | 61 | 65 | 61 | 64 | TLE | |
p02866 | C++ | Runtime Error | #include <bits/stdc++.h>
#define long long long int
using namespace std;
// @author: pashka
int main() {
ios::sync_with_stdio(false);
int n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<int> d(n);
for (int i = 0; i < n; i++)
d[a[i]]++;
if (a[0] != 0 || d[0] != 1) {
cout << 0;
return 0;
}
long res = 1;
for (int i = 1; i < n; i++) {
int x = a[i];
res *= d[x - 1];
res %= 998244353;
}
cout << res << "\n";
return 0;
} | #include <bits/stdc++.h>
#define long long long int
using namespace std;
// @author: pashka
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<int> d(n);
for (int i = 0; i < n; i++)
d[a[i]]++;
if (a[0] != 0 || d[0] != 1) {
cout << 0;
return 0;
}
long res = 1;
for (int i = 1; i < n; i++) {
int x = a[i];
res *= d[x - 1];
res %= 998244353;
}
cout << res << "\n";
return 0;
} | insert | 10 | 10 | 10 | 11 | 0 | |
p02866 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
#define N_MAX 100001
#define MOD 998244353
long long int intpow(int base, int p) {
if (1 == p) {
return base;
}
if (0 == p % 2) {
long long int val = intpow(base, p / 2);
return (val * val) % MOD;
} else {
return (intpow(base, p - 1) * (long long int)base) % MOD;
}
}
void func() {
int N;
scanf("%d", &N);
int D0;
scanf("%d", &D0);
if (0 != D0) {
printf("0");
return;
}
int table[N_MAX];
int maxdist = 0;
fill(table, table + N, 0);
table[0] = 1;
for (int i = 1; i < N; i++) {
int d;
scanf("%d", &d);
table[d]++;
maxdist = max(maxdist, d);
}
long long int ret = 1;
if (1 != table[0]) {
printf("0");
return;
}
for (int i = 1; i <= maxdist; i++) {
ret = (ret * intpow(table[i - 1], table[i])) % MOD;
}
printf("%lld", ret);
return;
}
int main() {
FILE *fin = NULL, *fout = NULL;
// fin = freopen("input.txt", "r", stdin);
// fout = freopen("output.txt", "w", stdout);
func();
// finalize
if (NULL != fin)
fclose(fin);
if (NULL != fout)
fclose(fout);
return 0;
} | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
#define N_MAX 100001
#define MOD 998244353
long long int intpow(int base, int p) {
if (0 == p) {
return 1;
}
if (1 == p) {
return base;
}
if (0 == p % 2) {
long long int val = intpow(base, p / 2);
return (val * val) % MOD;
} else {
return (intpow(base, p - 1) * (long long int)base) % MOD;
}
}
void func() {
int N;
scanf("%d", &N);
int D0;
scanf("%d", &D0);
if (0 != D0) {
printf("0");
return;
}
int table[N_MAX];
int maxdist = 0;
fill(table, table + N, 0);
table[0] = 1;
for (int i = 1; i < N; i++) {
int d;
scanf("%d", &d);
table[d]++;
maxdist = max(maxdist, d);
}
long long int ret = 1;
if (1 != table[0]) {
printf("0");
return;
}
for (int i = 1; i <= maxdist; i++) {
ret = (ret * intpow(table[i - 1], table[i])) % MOD;
}
printf("%lld", ret);
return;
}
int main() {
FILE *fin = NULL, *fout = NULL;
// fin = freopen("input.txt", "r", stdin);
// fout = freopen("output.txt", "w", stdout);
func();
// finalize
if (NULL != fin)
fclose(fin);
if (NULL != fout)
fclose(fout);
return 0;
} | insert | 14 | 14 | 14 | 17 | 0 | |
p02866 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
#define all(x) (x).begin(), (x).end()
#define fsp(x) fixed << setprecision(x)
const ll inf = LLONG_MAX;
const long double pi = acos(-1);
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }
// a^n mod p
// n > 0
// #include <cmath>
long long modpow(long long a, long long n, long long p) {
a %= p;
if (a == 0)
return 0;
if (a == 1)
return 1;
long long b = 1, cnt = 0;
while (b < p && cnt < n) {
b *= a;
cnt++;
}
if (b < p)
return b;
b %= p;
return modpow(b, n / cnt, p) * (long long)pow(a, n % cnt) % p;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
// const ll p = 1e9 + 7;
const ll p = 998244353;
ll n;
cin >> n;
vll d(n);
map<ll, ll> mp;
for (ll i = 0; i < n; i++) {
cin >> d[i];
mp[d[i]]++;
}
if (mp[0] != 1) {
cout << 0 << endl;
return 0;
}
ll ans = 1;
for (ll i = 1; i <= (mp.end()->first); i++) {
ans *= modpow(mp[i - 1], mp[i], p);
ans %= p;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
#define all(x) (x).begin(), (x).end()
#define fsp(x) fixed << setprecision(x)
const ll inf = LLONG_MAX;
const long double pi = acos(-1);
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }
// a^n mod p
// n > 0
// #include <cmath>
long long modpow(long long a, long long n, long long p) {
a %= p;
if (a == 0)
return 0;
if (a == 1)
return 1;
long long b = 1, cnt = 0;
while (b < p && cnt < n) {
b *= a;
cnt++;
}
if (b < p)
return b;
b %= p;
return modpow(b, n / cnt, p) * (long long)pow(a, n % cnt) % p;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
// const ll p = 1e9 + 7;
const ll p = 998244353;
ll n;
cin >> n;
vll d(n);
map<ll, ll> mp;
for (ll i = 0; i < n; i++) {
cin >> d[i];
mp[d[i]]++;
}
if (mp[0] != 1) {
cout << 0 << endl;
return 0;
}
ll ans = 1;
for (ll i = 1; i < n; i++) {
ans *= mp[d[i] - 1];
ans %= p;
}
cout << ans << endl;
}
| replace | 52 | 54 | 52 | 54 | TLE | |
p02866 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
#define ALL(a) (a).begin(), (a).end()
#define FOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define LLONG_MAXs 9223372036854775800 / 2
#define ALL(a) (a).begin(), (a).end()
#include <cmath>
#include <iostream>
using namespace std;
bool isPrimeNum(ll x) { // 素数である場合 true を返す
if (x <= 1) { // 1以下である場合は素数でないことがすぐにわかる
return false;
}
// sqrt( double型 ) は引数の平方根を double型で返すので、int型でキャスト
int n = (int)sqrt((double)x);
for (int i = 2; i <= n; i++) {
if (x % i == 0) { // 割り切る整数がある場合、即判定終了
return false;
}
}
return true; // 割り切る整数がない場合、素数である
}
ll myPow(ll x, ll n, ll m) {
if (n == 0)
return 1;
if (n % 2 == 0)
return myPow(x * x % m, n / 2, m);
else
return x * myPow(x, n - 1, m) % m;
}
constexpr ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
constexpr ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
constexpr ll abs(ll a, ll b) {
if (a >= b)
return a - b;
if (a < b)
return b - a;
}
constexpr double dabs(double a, double b) {
if (a >= b)
return a - b;
if (a < b)
return b - a;
}
constexpr ll min(ll a, ll b) {
if (a >= b)
return b;
if (a < b)
return a;
}
constexpr ll max(ll a, ll b) {
if (a >= b)
return a;
if (a < b)
return b;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int dx8[8] = {1, 0, -1, 0, 1, -1, 1, -1};
int dy8[8] = {0, 1, 0, -1, 1, 1, -1, -1};
class UnionFind {
public:
// 親の番号を格納する。親だった場合は-(その集合のサイズ)
vector<int> Parent;
// 作るときはParentの値を全て-1にする
// こうすると全てバラバラになる
UnionFind(int N) { Parent = vector<int>(N, -1); }
// Aがどのグループに属しているか調べる
int root(int A) {
if (Parent[A] < 0)
return A;
return Parent[A] = root(Parent[A]);
}
// 自分のいるグループの頂点数を調べる
int size(int A) {
return -Parent[root(A)]; // 親をとってきたい]
}
bool issame(int x, int y) { return root(x) == root(y); }
// AとBをくっ付ける
bool connect(int A, int B) {
// AとBを直接つなぐのではなく、root(A)にroot(B)をくっつける
A = root(A);
B = root(B);
if (A == B) {
// すでにくっついてるからくっ付けない
return false;
}
// 大きい方(A)に小さいほう(B)をくっ付けたい
// 大小が逆だったらひっくり返しちゃう。
if (size(A) < size(B))
swap(A, B);
// Aのサイズを更新する
Parent[A] += Parent[B];
// Bの親をAに変更する
Parent[B] = A;
return true;
}
};
long long fac[510000], finv[510000], inv[510000];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 510000; 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;
}
}
// 二項係数計算
long long COM(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;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
string replaceAll(string &replacedStr, string from, string to) {
unsigned int pos = replacedStr.find(from);
int toLen = to.length();
if (from.empty()) {
return replacedStr;
}
while ((pos = replacedStr.find(from, pos)) != std::string::npos) {
replacedStr.replace(pos, from.length(), to);
pos += toLen;
}
return replacedStr;
}
void yn(bool flag) {
if (flag) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return;
}
void YN(bool flag) {
if (flag) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return;
}
std::vector<ll> enum_div(ll n) // nの約数を列挙
{
std::vector<ll> ret;
for (ll i = 1; i * i <= n; ++i) {
if (n % i == 0) {
ret.push_back(i);
if (i != 1 && i * i != n) {
ret.push_back(n / i);
}
}
}
ret.push_back(n);
return ret;
}
void Ssort(int no, char *month[]) {
int i, j;
char *temp;
for (i = 0; i < no; i++) {
for (j = i + 1; j < no; j++) {
if (strcmp((month[i]), (month[j])) > 0) {
temp = *(month + i);
*(month + i) = *(month + j);
*(month + j) = temp;
}
}
}
}
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// グラフセット
struct Edge {
ll to; // 辺の行き先
ll weight; // 辺の重み
Edge(int t, int w) : to(t), weight(w) {}
};
using Graph = vector<vector<Edge>>;
int main() {
ll N, M, L;
cin >> N;
ll D[N];
ll dis[100000] = {};
ll ans;
ll dmax = 0;
ll amari = 998244353;
FOR(i, 0, N - 1) {
cin >> D[i];
dis[D[i]]++;
dmax = max(dmax, D[i]);
}
if (D[0] == 0 && dis[0] == 1) {
ans = 1;
FOR(i, 2, dmax) {
ans = ans * myPow(dis[i - 1], dis[i], amari);
ans %= ans * amari;
// cout << i << " " << ans << endl;
}
} else {
ans = 0;
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
#define ALL(a) (a).begin(), (a).end()
#define FOR(i, a, b) for (long long int i = (a); i <= (b); i++)
#define RFOR(i, a, b) for (long long int i = (a); i >= (b); i--)
#define MOD 1000000007
#define LLONG_MAXs 9223372036854775800 / 2
#define ALL(a) (a).begin(), (a).end()
#include <cmath>
#include <iostream>
using namespace std;
bool isPrimeNum(ll x) { // 素数である場合 true を返す
if (x <= 1) { // 1以下である場合は素数でないことがすぐにわかる
return false;
}
// sqrt( double型 ) は引数の平方根を double型で返すので、int型でキャスト
int n = (int)sqrt((double)x);
for (int i = 2; i <= n; i++) {
if (x % i == 0) { // 割り切る整数がある場合、即判定終了
return false;
}
}
return true; // 割り切る整数がない場合、素数である
}
ll myPow(ll x, ll n, ll m) {
if (n == 0)
return 1;
if (n % 2 == 0)
return myPow(x * x % m, n / 2, m);
else
return x * myPow(x, n - 1, m) % m;
}
constexpr ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
constexpr ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
constexpr ll abs(ll a, ll b) {
if (a >= b)
return a - b;
if (a < b)
return b - a;
}
constexpr double dabs(double a, double b) {
if (a >= b)
return a - b;
if (a < b)
return b - a;
}
constexpr ll min(ll a, ll b) {
if (a >= b)
return b;
if (a < b)
return a;
}
constexpr ll max(ll a, ll b) {
if (a >= b)
return a;
if (a < b)
return b;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int dx8[8] = {1, 0, -1, 0, 1, -1, 1, -1};
int dy8[8] = {0, 1, 0, -1, 1, 1, -1, -1};
class UnionFind {
public:
// 親の番号を格納する。親だった場合は-(その集合のサイズ)
vector<int> Parent;
// 作るときはParentの値を全て-1にする
// こうすると全てバラバラになる
UnionFind(int N) { Parent = vector<int>(N, -1); }
// Aがどのグループに属しているか調べる
int root(int A) {
if (Parent[A] < 0)
return A;
return Parent[A] = root(Parent[A]);
}
// 自分のいるグループの頂点数を調べる
int size(int A) {
return -Parent[root(A)]; // 親をとってきたい]
}
bool issame(int x, int y) { return root(x) == root(y); }
// AとBをくっ付ける
bool connect(int A, int B) {
// AとBを直接つなぐのではなく、root(A)にroot(B)をくっつける
A = root(A);
B = root(B);
if (A == B) {
// すでにくっついてるからくっ付けない
return false;
}
// 大きい方(A)に小さいほう(B)をくっ付けたい
// 大小が逆だったらひっくり返しちゃう。
if (size(A) < size(B))
swap(A, B);
// Aのサイズを更新する
Parent[A] += Parent[B];
// Bの親をAに変更する
Parent[B] = A;
return true;
}
};
long long fac[510000], finv[510000], inv[510000];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 510000; 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;
}
}
// 二項係数計算
long long COM(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;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
string replaceAll(string &replacedStr, string from, string to) {
unsigned int pos = replacedStr.find(from);
int toLen = to.length();
if (from.empty()) {
return replacedStr;
}
while ((pos = replacedStr.find(from, pos)) != std::string::npos) {
replacedStr.replace(pos, from.length(), to);
pos += toLen;
}
return replacedStr;
}
void yn(bool flag) {
if (flag) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
return;
}
void YN(bool flag) {
if (flag) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
return;
}
std::vector<ll> enum_div(ll n) // nの約数を列挙
{
std::vector<ll> ret;
for (ll i = 1; i * i <= n; ++i) {
if (n % i == 0) {
ret.push_back(i);
if (i != 1 && i * i != n) {
ret.push_back(n / i);
}
}
}
ret.push_back(n);
return ret;
}
void Ssort(int no, char *month[]) {
int i, j;
char *temp;
for (i = 0; i < no; i++) {
for (j = i + 1; j < no; j++) {
if (strcmp((month[i]), (month[j])) > 0) {
temp = *(month + i);
*(month + i) = *(month + j);
*(month + j) = temp;
}
}
}
}
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// グラフセット
struct Edge {
ll to; // 辺の行き先
ll weight; // 辺の重み
Edge(int t, int w) : to(t), weight(w) {}
};
using Graph = vector<vector<Edge>>;
int main() {
ll N, M, L;
cin >> N;
ll D[N];
ll dis[100000] = {};
ll ans;
ll dmax = 0;
ll amari = 998244353;
FOR(i, 0, N - 1) {
cin >> D[i];
dis[D[i]]++;
dmax = max(dmax, D[i]);
}
if (D[0] == 0 && dis[0] == 1) {
ans = 1;
FOR(i, 2, dmax) {
ans = ans * myPow(dis[i - 1], dis[i], amari);
ans %= amari;
// cout << i << " " << ans << endl;
}
} else {
ans = 0;
}
cout << ans << endl;
return 0;
}
| replace | 275 | 276 | 275 | 276 | 0 | |
p02866 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
const ll mod = 998244353;
int main(void) {
ll n, i, j, d, ans, dmax = -1;
ll dcnt[100010];
for (i = 0; i < n; i++) {
dcnt[i] = 0;
}
cin >> n;
cin >> d;
if (d != 0) {
cout << 0 << endl;
return 0;
}
dcnt[d]++;
for (i = 1; i < n; i++) {
cin >> d;
if (dmax < d)
dmax = d;
dcnt[d]++;
}
if (dcnt[0] != 1) {
cout << 0 << endl;
return 0;
}
ans = 1;
for (i = 1; i <= dmax; i++) {
if (dcnt[i] == 0) {
cout << 0 << endl;
return 0;
}
for (j = 0; j < dcnt[i]; j++) {
ans *= dcnt[i - 1];
ans %= mod;
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
const ll mod = 998244353;
int main(void) {
ll n, i, j, d, ans, dmax = -1;
ll dcnt[100010] = {};
cin >> n;
cin >> d;
if (d != 0) {
cout << 0 << endl;
return 0;
}
dcnt[d]++;
for (i = 1; i < n; i++) {
cin >> d;
if (dmax < d)
dmax = d;
dcnt[d]++;
}
if (dcnt[0] != 1) {
cout << 0 << endl;
return 0;
}
ans = 1;
for (i = 1; i <= dmax; i++) {
if (dcnt[i] == 0) {
cout << 0 << endl;
return 0;
}
for (j = 0; j < dcnt[i]; j++) {
ans *= dcnt[i - 1];
ans %= mod;
}
}
cout << ans << endl;
return 0;
} | replace | 17 | 22 | 17 | 18 | TLE | |
p02866 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn begin()
#define en end()
#define pb(a) push_back(a)
#define pp() pop_back()
#define V vector
#define P pair
#define V2(a, b, c) V<V<int>> a(b, V<int>(c))
#define V2a(a, b, c, d) V<V<int>> a(b, V<int>(c, d))
#define incin(a) \
int a; \
cin >> a
#define yuko(a) setprecision(a)
#define uni(a) a.erase(unique(a.begin(), a.end()), a.end())
#define pri priority_queue
#define syo <int,V<int>
#define ff fi.fi
#define fs fi.se
#define sf se.fi
#define ss se.se
#define all(a) (a).begin(), (a).end()
#define Pi P<int, int>
#define elif else if
// #define min min<int>
// #define max max<int>
int low(V<int> a, int b) {
decltype(a)::iterator c = lower_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
int upp(V<int> a, int b) {
decltype(a)::iterator c = upper_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
template <class T> void cou(vector<vector<T>> a) {
int b = a.size();
int c = a[0].size();
fo(i, b) {
fo(j, c) {
cout << a[i][j];
if (j == c - 1)
cout << endl;
else
cout << ' ';
}
}
}
/*template<>
void cou(vector<vector<char>> a){
int b=a.size();
int c=a[0].size();
fo(i,b){
fo(j,c){
cout<<a[i][j];
if(j==c-1)
cout<<endl;
else
cout<<' ';
}
}
}*/
int wari(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
int keta(int a) {
double b = a;
b = log10(b);
int c = b;
return c + 1;
}
int souwa(int a) { return a * (a + 1) / 2; }
/*int lcm(int a,int b){
int d=a,e=b,f;
if(a<b)
swap(a,b);
int c,m=1;
while(m){
c=a%b;
if(c==0){
f=b;
m--;
}
else{
a=b;
b=c;
}
}
return d*e/f;
} */
int gcm(int a, int b) {
if (a % b == 0)
return b;
return gcm(b, a % b);
}
bool prime(int a) {
if (a < 2)
return false;
else if (a == 2)
return true;
else if (a % 2 == 0)
return false;
double b = sqrt(a);
for (int i = 3; i <= b; i += 2) {
if (a % i == 0) {
return false;
}
}
return true;
}
struct Union {
vector<int> par;
Union(int a) { par = vector<int>(a, -1); }
int find(int a) {
if (par[a] < 0)
return a;
else
return par[a] = find(par[a]);
}
bool same(int a, int b) { return find(a) == find(b); }
int Size(int a) { return -par[find(a)]; }
void unite(int a, int b) {
a = find(a);
b = find(b);
if (a == b)
return;
if (Size(b) > Size(a))
swap<int>(a, b);
par[a] += par[b];
par[b] = a;
}
};
int ketas(int a) {
string b = to_string(a);
int c = 0;
fo(i, keta(a)) { c += b[i] - '0'; }
return c;
}
/*int gcm(int a,int b){
if(b==0)
return a;
return gcm(b,a%b);
}*/
int lcm(int a, int b) { return a / gcm(a, b) * b; }
/*struct aa{
vector<int> gt;
aa(int n){
gt= vector<int>(n, 1);
}
void c(V<int> d,int b){
if(d[b]==0){
gt[d[b]-1]++;
gt[gt.sz-1]++;
}
else{
gt[d[b]-1]++;
c(d,d[d[b]]-1);
}
}
void cok(int a){
cout<<gt[a-1]<<endl;
fo(i,a-1)
cout<<gt[i]<<endl;
}
};
*/
/*struct dfs(){
}*/
bool fe(int a, int b) {
a %= 10;
b %= 10;
if (a == 0)
a = 10;
if (b == 0)
b = 10;
if (a > b)
return true;
else
return false;
}
int INF = 1000000007;
struct edge {
int s, t, d;
};
V<int> mojisyu(string a) {
V<int> b(26, 0);
fo(i, a.sz) { b[a[i] - 'a']++; }
return b;
}
int wa2(int a) {
if (a % 2 == 1)
return a / 2;
return a / 2 - 1;
}
/*signed main(){
int a,b,c;
cin>>a>>b>>c;
V<V<edge>> d(a);
fo(i,b){
edge e;
cin>>e.s>>e.t>>e.d;
d[e.s].pb(e);
}
V<int> e(a,INF);
e[c]=0;
priority_queue<P<int,int>,V<P<int,int>>,greater<P<int,int>>> f;
f.push({0,c});
int h=INF;
while(!f.empty()){
P<int,int> g;
g=f.top();
f.pop();
int v = g.second, i = g.first;
for(edge l : d[v]){
if(e[l.t] > i + l.d){
e[l.t] = i + l.d;
f.push({i+l.d , l.t});
}
}
}
fo(i,a){
if(e[i]==INF)
cout<<"INF"<<endl;
else
cout<<e[i]<<endl;
}
}
?*/
signed main() {
int N, x = 1, y = 1;
cin >> N;
V<int> D(N);
fo(i, N) cin >> D[i];
if (D[0] != 0)
cout << 0 << endl;
else {
Sort(D);
V<int> X(D[N - 1] + 1), Y;
if (D[1] != 0) {
X[0] = 1;
for (int i = 1; i < X.sz; i++) {
X[i] = count(D.bgn, D.en, i);
}
Y = X;
Sort(Y);
if (Y[0] == 0)
x = 0;
else {
for (int i = 2; i < X.sz; i++) {
fo(j, X[i]) {
x *= X[i - 1];
x %= 998244353;
}
}
}
co(x);
} else
cout << 0 << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn begin()
#define en end()
#define pb(a) push_back(a)
#define pp() pop_back()
#define V vector
#define P pair
#define V2(a, b, c) V<V<int>> a(b, V<int>(c))
#define V2a(a, b, c, d) V<V<int>> a(b, V<int>(c, d))
#define incin(a) \
int a; \
cin >> a
#define yuko(a) setprecision(a)
#define uni(a) a.erase(unique(a.begin(), a.end()), a.end())
#define pri priority_queue
#define syo <int,V<int>
#define ff fi.fi
#define fs fi.se
#define sf se.fi
#define ss se.se
#define all(a) (a).begin(), (a).end()
#define Pi P<int, int>
#define elif else if
// #define min min<int>
// #define max max<int>
int low(V<int> a, int b) {
decltype(a)::iterator c = lower_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
int upp(V<int> a, int b) {
decltype(a)::iterator c = upper_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
template <class T> void cou(vector<vector<T>> a) {
int b = a.size();
int c = a[0].size();
fo(i, b) {
fo(j, c) {
cout << a[i][j];
if (j == c - 1)
cout << endl;
else
cout << ' ';
}
}
}
/*template<>
void cou(vector<vector<char>> a){
int b=a.size();
int c=a[0].size();
fo(i,b){
fo(j,c){
cout<<a[i][j];
if(j==c-1)
cout<<endl;
else
cout<<' ';
}
}
}*/
int wari(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
int keta(int a) {
double b = a;
b = log10(b);
int c = b;
return c + 1;
}
int souwa(int a) { return a * (a + 1) / 2; }
/*int lcm(int a,int b){
int d=a,e=b,f;
if(a<b)
swap(a,b);
int c,m=1;
while(m){
c=a%b;
if(c==0){
f=b;
m--;
}
else{
a=b;
b=c;
}
}
return d*e/f;
} */
int gcm(int a, int b) {
if (a % b == 0)
return b;
return gcm(b, a % b);
}
bool prime(int a) {
if (a < 2)
return false;
else if (a == 2)
return true;
else if (a % 2 == 0)
return false;
double b = sqrt(a);
for (int i = 3; i <= b; i += 2) {
if (a % i == 0) {
return false;
}
}
return true;
}
struct Union {
vector<int> par;
Union(int a) { par = vector<int>(a, -1); }
int find(int a) {
if (par[a] < 0)
return a;
else
return par[a] = find(par[a]);
}
bool same(int a, int b) { return find(a) == find(b); }
int Size(int a) { return -par[find(a)]; }
void unite(int a, int b) {
a = find(a);
b = find(b);
if (a == b)
return;
if (Size(b) > Size(a))
swap<int>(a, b);
par[a] += par[b];
par[b] = a;
}
};
int ketas(int a) {
string b = to_string(a);
int c = 0;
fo(i, keta(a)) { c += b[i] - '0'; }
return c;
}
/*int gcm(int a,int b){
if(b==0)
return a;
return gcm(b,a%b);
}*/
int lcm(int a, int b) { return a / gcm(a, b) * b; }
/*struct aa{
vector<int> gt;
aa(int n){
gt= vector<int>(n, 1);
}
void c(V<int> d,int b){
if(d[b]==0){
gt[d[b]-1]++;
gt[gt.sz-1]++;
}
else{
gt[d[b]-1]++;
c(d,d[d[b]]-1);
}
}
void cok(int a){
cout<<gt[a-1]<<endl;
fo(i,a-1)
cout<<gt[i]<<endl;
}
};
*/
/*struct dfs(){
}*/
bool fe(int a, int b) {
a %= 10;
b %= 10;
if (a == 0)
a = 10;
if (b == 0)
b = 10;
if (a > b)
return true;
else
return false;
}
int INF = 1000000007;
struct edge {
int s, t, d;
};
V<int> mojisyu(string a) {
V<int> b(26, 0);
fo(i, a.sz) { b[a[i] - 'a']++; }
return b;
}
int wa2(int a) {
if (a % 2 == 1)
return a / 2;
return a / 2 - 1;
}
/*signed main(){
int a,b,c;
cin>>a>>b>>c;
V<V<edge>> d(a);
fo(i,b){
edge e;
cin>>e.s>>e.t>>e.d;
d[e.s].pb(e);
}
V<int> e(a,INF);
e[c]=0;
priority_queue<P<int,int>,V<P<int,int>>,greater<P<int,int>>> f;
f.push({0,c});
int h=INF;
while(!f.empty()){
P<int,int> g;
g=f.top();
f.pop();
int v = g.second, i = g.first;
for(edge l : d[v]){
if(e[l.t] > i + l.d){
e[l.t] = i + l.d;
f.push({i+l.d , l.t});
}
}
}
fo(i,a){
if(e[i]==INF)
cout<<"INF"<<endl;
else
cout<<e[i]<<endl;
}
}
?*/
signed main() {
int N, x = 1, y = 1;
cin >> N;
V<int> D(N);
fo(i, N) cin >> D[i];
if (D[0] != 0)
cout << 0 << endl;
else {
Sort(D);
V<int> X(D[N - 1] + 1), Y;
if (D[1] != 0) {
X[0] = 1;
for (int i = 0; i < D.sz; i++) {
X[D[i]]++;
}
Y = X;
Sort(Y);
if (Y[0] == 0)
x = 0;
else {
for (int i = 2; i < X.sz; i++) {
fo(j, X[i]) {
x *= X[i - 1];
x %= 998244353;
}
}
}
co(x);
} else
cout << 0 << endl;
}
}
| replace | 255 | 257 | 255 | 257 | TLE | |
p02866 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define mod 1000000007 // 10^9+7
#define div 998244353
#define rep(i, n) for (int i = 0; i < n; i++)
int n, cnt = 1, ans = 1, maxl = 0;
int d[200000];
map<int, int> mp;
int my_pow(int a, int b) {
if (b == 1)
return a;
if (b % 2)
return (my_pow(a, b / 2) * my_pow(a, (b / 2) + 1)) % div;
return (my_pow(a, b / 2) * my_pow(a, b / 2)) % div;
}
signed main() {
cin >> n;
rep(i, n) {
cin >> d[i];
mp[d[i]]++;
maxl = max(maxl, d[i]);
}
if (d[0] != 0 || mp[0] > 1) {
cout << 0 << endl;
return 0;
}
for (int i = 1; i <= maxl; i++) {
ans *= my_pow(mp[i - 1], mp[i]);
ans %= div;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define mod 1000000007 // 10^9+7
#define div 998244353
#define rep(i, n) for (int i = 0; i < n; i++)
int n, cnt = 1, ans = 1, maxl = 0;
int d[200000];
map<int, int> mp;
int my_pow(int a, int b) {
if (b == 1)
return a;
if (b % 2)
return (my_pow(a, b / 2) * my_pow(a, (b / 2) + 1)) % div;
return (my_pow(a, b / 2) * my_pow(a, b / 2)) % div;
}
signed main() {
cin >> n;
rep(i, n) {
cin >> d[i];
mp[d[i]]++;
maxl = max(maxl, d[i]);
}
if (d[0] != 0 || mp[0] > 1) {
cout << 0 << endl;
return 0;
}
for (int i = 1; i <= maxl; i++) {
if (mp[i] == 0) {
cout << 0 << endl;
return 0;
}
ans *= my_pow(mp[i - 1], mp[i]);
ans %= div;
}
cout << ans << endl;
return 0;
}
| insert | 29 | 29 | 29 | 33 | 0 | |
p02866 | Python | Runtime Error | from collections import Counter
N = int(input())
Dlist = list(map(int, input().split()))
DCounter = Counter(Dlist)
if DCounter[0] == 1 and Dlist[0] == 0:
num = 1
mae = 1
for key, value in sorted(DCounter.items()[1:]):
num *= mae**value
mae = value
num %= 998244353
print(num % 998244353)
else:
print(0)
| from collections import Counter
N = int(input())
Dlist = list(map(int, input().split()))
DCounter = Counter(Dlist)
if DCounter[0] == 1 and Dlist[0] == 0:
num = 1
for i in range(1, max(Dlist) + 1):
num *= DCounter[i - 1] ** DCounter[i]
print(num % 998244353)
else:
print(0)
| replace | 7 | 12 | 7 | 10 | TypeError: 'dict_items' object is not subscriptable | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02866/Python/s839580086.py", line 8, in <module>
for key, value in sorted(DCounter.items()[1:]):
TypeError: 'dict_items' object is not subscriptable
|
p02866 | Python | Runtime Error | LARGE = 998244353
def solve(n, d_list):
cnt = [0] * (max(d_list) + 1)
for i in range(n):
cnt[d_list[i]] += 1
if cnt[0] != 1 or d_list[0] != 0:
return 0
res = 1
for i in range(max(d_list)):
res *= pow(cnt[i], cnt[i + 1], LARGE)
res %= LARGE
return res
def main():
n = int(input())
d_list = list(map(int(input())))
res = solve(n, d_list)
print(res)
def test():
assert solve(4, [0, 1, 1, 2]) == 2
assert solve(4, [1, 1, 1, 1]) == 0
assert solve(7, [0, 3, 2, 1, 2, 2, 1]) == 24
if __name__ == "__main__":
test()
main()
| LARGE = 998244353
def solve(n, d_list):
cnt = [0] * (max(d_list) + 1)
for i in range(n):
cnt[d_list[i]] += 1
if cnt[0] != 1 or d_list[0] != 0:
return 0
res = 1
for i in range(max(d_list)):
res *= pow(cnt[i], cnt[i + 1], LARGE)
res %= LARGE
return res
def main():
n = int(input())
d_list = list(map(int, input().split()))
res = solve(n, d_list)
print(res)
def test():
assert solve(4, [0, 1, 1, 2]) == 2
assert solve(4, [1, 1, 1, 1]) == 0
assert solve(7, [0, 3, 2, 1, 2, 2, 1]) == 24
if __name__ == "__main__":
test()
main()
| replace | 18 | 19 | 18 | 19 | ValueError: invalid literal for int() with base 10: '0 1 1 2' | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02866/Python/s784122479.py", line 32, in <module>
main()
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02866/Python/s784122479.py", line 19, in main
d_list = list(map(int(input())))
ValueError: invalid literal for int() with base 10: '0 1 1 2'
|
p02866 | Python | Runtime Error | import collections
def mod_pow(a, n, mod):
result = 1
a_n = a
while n > 0:
if n & 1:
result = result * a_n % mod
a_n = a_n * a_n % mod
n >>= 1
return result
def main(n, d):
MOD = 998244353
counter = collections.Counter(d)
if counter[0] != 1:
return 0
if 0 in counter.values:
return 0
pows = [
mod_pow(a=counter[i - 1], n=counter[i], mod=MOD)
for i in range(1, max(counter.keys()) + 1)
]
patterns = 1
for p in pows:
patterns *= p
patterns %= MOD
return patterns
if __name__ == "__main__":
N = int(input())
D = list(map(int, input().split()))
print(main(n=N, d=D))
| import collections
def mod_pow(a, n, mod):
result = 1
a_n = a
while n > 0:
if n & 1:
result = result * a_n % mod
a_n = a_n * a_n % mod
n >>= 1
return result
def main(n, d):
MOD = 998244353
counter = collections.Counter(d)
if counter[0] != 1 or d[0] != 0:
return 0
pows = [
mod_pow(a=counter[i - 1], n=counter[i], mod=MOD)
for i in range(1, max(counter.keys()) + 1)
]
patterns = 1
for p in pows:
patterns *= p
patterns %= MOD
return patterns
if __name__ == "__main__":
N = int(input())
D = list(map(int, input().split()))
print(main(n=N, d=D))
| replace | 17 | 20 | 17 | 18 | TypeError: argument of type 'builtin_function_or_method' is not iterable | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02866/Python/s386049563.py", line 34, in <module>
print(main(n=N, d=D))
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02866/Python/s386049563.py", line 20, in main
if 0 in counter.values:
TypeError: argument of type 'builtin_function_or_method' is not iterable
|
p02866 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define all_map(itr, mp) for (auto itr = mp.begin(); itr != mp.end(); itr++)
#define ALL(a) (a).begin(), (a).end()
#define MOD 998244353
int main() {
ll n;
cin >> n;
ll cnt[100010] = {};
vector<ll> d(n);
rep(i, n) {
cin >> d[i];
cnt[d[i]]++;
}
if (d.front() != 0 || cnt[0] > 1) {
cout << 0;
return 0;
}
ll ans = 1;
rep(i, 100010) if (d[i] > 0) ans = (ans * d[i]) % MOD;
cout << ans << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define all_map(itr, mp) for (auto itr = mp.begin(); itr != mp.end(); itr++)
#define ALL(a) (a).begin(), (a).end()
#define MOD 998244353
int main() {
ll n;
cin >> n;
ll cnt[100010] = {};
vector<ll> d(n);
rep(i, n) {
cin >> d[i];
cnt[d[i]]++;
}
if (d.front() != 0 || cnt[0] > 1) {
cout << 0;
return 0;
}
ll ans = 1;
for (ll pos = 1; pos < n; ++pos) {
if (cnt[pos] == 0)
continue;
ll base = 1;
rep(i, cnt[pos]) base = (base * cnt[pos - 1]) % MOD;
ans = (ans * base) % MOD;
}
cout << ans << endl;
} | replace | 33 | 35 | 33 | 40 | -11 | |
p02867 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define For(i, j, k) for (int i = (int)(j); i <= (int)(k); i++)
#define Rep(i, j, k) for (int i = (int)(j); i >= (int)(k); i--)
inline ll read() {
ll x = 0;
char ch = getchar();
bool f = 0;
for (; !isdigit(ch); ch = getchar())
if (ch == '-')
f = 1;
for (; isdigit(ch); ch = getchar())
x = x * 10 + ch - '0';
return f ? -x : x;
}
void write(ll x) {
if (x < 0)
putchar('-'), x = -x;
if (x >= 10)
write(x / 10);
putchar(x % 10 + '0');
}
void writeln(ll x) {
write(x);
puts("");
}
void writep(ll x) {
write(x);
putchar(' ');
}
const int N = 1e5 + 5;
struct node {
int id, val;
bool operator<(const node &b) const {
if (val == b.val)
return id < b.id;
return val < b.val;
}
} b[N], d[N];
int n, p[N], tot, tr[N];
void upt(int x) {
while (x <= n)
tr[x]++, x += (x & -x);
}
int query(int x) {
int res = 0;
while (x)
res += tr[x], x -= (x & -x);
return res;
}
ll calc(int *a) {
memset(tr, 0, sizeof(tr));
ll ans = 0;
for (int i = 1; i <= n; ++i)
b[i].id = i, b[i].val = a[i];
sort(b + 1, b + n + 1);
tot = 1;
p[b[1].id] = 1;
for (int i = 2; i <= n; ++i)
if (b[i].val == b[i - 1].val)
p[b[i].id] = tot;
else
p[b[i].id] = ++tot;
for (int i = n; i >= 1; --i) {
ans += query(p[i] - 1);
upt(p[i]);
}
return ans;
}
int a[N], c[N], pos[N];
signed main() {
freopen("in06.txt", "r", stdin);
n = read();
for (int i = 1; i <= n; ++i)
a[i] = read(), b[i].id = i, b[i].val = a[i];
for (int i = 1; i <= n; ++i)
c[i] = read(), d[i].id = i, d[i].val = c[i];
sort(b + 1, b + n + 1);
sort(d + 1, d + n + 1);
for (int i = 1; i <= n; ++i)
if (b[i].val > d[i].val)
return puts("No"), 0;
// for(int i=1;i<=n;++i,putchar(' '))
// cout<<b[i].id;puts("");
// for(int i=1;i<=n;++i,putchar(' '))
// cout<<d[i].id;puts("");
for (int i = 1; i <= n; ++i)
p[b[i].id] = d[i].id;
// for(int i=1;i<=n;++i)
// cout<<p[i]<<" ";cout<<endl;
int tot = 0;
for (int i = 1; i <= n; ++i)
pos[p[i]] = i;
for (int i = n; i >= 1; --i) {
if (p[i] != i) {
int tmp = pos[i];
// cout<<p[pos[i]]<<" "<<p[i]<<endl;
swap(p[pos[i]], p[i]);
pos[p[pos[i]]] = tmp;
++tot;
}
}
// cout<<tot<<endl;
if (tot <= n - 2)
puts("Yes");
else {
for (int i = 1; i < n; ++i)
if (b[i + 1].val <= d[i].val)
return puts("Yes"), 0;
puts("No");
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define For(i, j, k) for (int i = (int)(j); i <= (int)(k); i++)
#define Rep(i, j, k) for (int i = (int)(j); i >= (int)(k); i--)
inline ll read() {
ll x = 0;
char ch = getchar();
bool f = 0;
for (; !isdigit(ch); ch = getchar())
if (ch == '-')
f = 1;
for (; isdigit(ch); ch = getchar())
x = x * 10 + ch - '0';
return f ? -x : x;
}
void write(ll x) {
if (x < 0)
putchar('-'), x = -x;
if (x >= 10)
write(x / 10);
putchar(x % 10 + '0');
}
void writeln(ll x) {
write(x);
puts("");
}
void writep(ll x) {
write(x);
putchar(' ');
}
const int N = 1e5 + 5;
struct node {
int id, val;
bool operator<(const node &b) const {
if (val == b.val)
return id < b.id;
return val < b.val;
}
} b[N], d[N];
int n, p[N], tot, tr[N];
void upt(int x) {
while (x <= n)
tr[x]++, x += (x & -x);
}
int query(int x) {
int res = 0;
while (x)
res += tr[x], x -= (x & -x);
return res;
}
ll calc(int *a) {
memset(tr, 0, sizeof(tr));
ll ans = 0;
for (int i = 1; i <= n; ++i)
b[i].id = i, b[i].val = a[i];
sort(b + 1, b + n + 1);
tot = 1;
p[b[1].id] = 1;
for (int i = 2; i <= n; ++i)
if (b[i].val == b[i - 1].val)
p[b[i].id] = tot;
else
p[b[i].id] = ++tot;
for (int i = n; i >= 1; --i) {
ans += query(p[i] - 1);
upt(p[i]);
}
return ans;
}
int a[N], c[N], pos[N];
signed main() {
// freopen("in06.txt","r",stdin);
n = read();
for (int i = 1; i <= n; ++i)
a[i] = read(), b[i].id = i, b[i].val = a[i];
for (int i = 1; i <= n; ++i)
c[i] = read(), d[i].id = i, d[i].val = c[i];
sort(b + 1, b + n + 1);
sort(d + 1, d + n + 1);
for (int i = 1; i <= n; ++i)
if (b[i].val > d[i].val)
return puts("No"), 0;
// for(int i=1;i<=n;++i,putchar(' '))
// cout<<b[i].id;puts("");
// for(int i=1;i<=n;++i,putchar(' '))
// cout<<d[i].id;puts("");
for (int i = 1; i <= n; ++i)
p[b[i].id] = d[i].id;
// for(int i=1;i<=n;++i)
// cout<<p[i]<<" ";cout<<endl;
int tot = 0;
for (int i = 1; i <= n; ++i)
pos[p[i]] = i;
for (int i = n; i >= 1; --i) {
if (p[i] != i) {
int tmp = pos[i];
// cout<<p[pos[i]]<<" "<<p[i]<<endl;
swap(p[pos[i]], p[i]);
pos[p[pos[i]]] = tmp;
++tot;
}
}
// cout<<tot<<endl;
if (tot <= n - 2)
puts("Yes");
else {
for (int i = 1; i < n; ++i)
if (b[i + 1].val <= d[i].val)
return puts("Yes"), 0;
puts("No");
}
return 0;
}
| replace | 73 | 74 | 73 | 74 | TLE | |
p02867 | C++ | Runtime Error | // https://atcoder.jp/contests/nikkei2019-2-qual/tasks/nikkei2019_2_qual_c
#define CIN_ONLY
#define DECIMAL_DIGITS 10
#define STATIC_MOD 1e9 + 7
#ifdef BTK
/*<head>*/
#include "Template.hpp"
/*</head>*/
#else
/*<body>*/
/* #region auto includes */
/* #region stl */
/*<stl>*/
#include <bits/stdc++.h>
#include <sys/types.h>
#include <unistd.h>
using namespace std;
/*</stl>*/
/* #endregion */
/* #region template/IncludeSTL.hpp*/
/**
* @file IncludeSTL.hpp
* @author btk
* @brief 標準ライブラリをincludeするだけ
* @version 0.1
* @date 2019-07-21
* @todo 何故か2回includeされる（展開scriptに
* @copyright Copyright (c) 2019
*
*/
/* #endregion */
/* #region template/Macro.hpp*/
/**
* @file Macro.hpp
* @author btk
* @brief マクロとか，LLとか
* @version 0.1
* @date 2019-07-13
*
* @copyright Copyright (c) 2019
*
*/
//! LL
using LL = long long;
/**
* @def DEBUG
* @brief デバッグ用のif文 提出時はif(0)で実行されない
*/
/*</head>*/
#ifdef BTK
#define DEBUG if (1)
#else
#ifdef CIN_ONLY
#define FAST_IO
#endif
#define DEBUG if (0)
#endif
/**
* @def ALL(v)
* @brief
* ALLマクロ
*/
#define ALL(v) (v).begin(), (v).end()
/**
* @def REC(ret, ...)
* @brief
* 再帰ラムダをするためのマクロ
*/
#define REC(ret, ...) std::function<ret(__VA_ARGS__)>
/**
* @def VAR_NAME(var)
* @brief 変数名を取得する
*/
#define VAR_NAME(var) #var
/**
* @brief
* rangeで生まれる使わない変数を消す用（警告消し）
*/
template <typename T> inline T &unused_var(T &v) { return v; }
/* #endregion */
/* #region template/IO.hpp*/
/**
* @file IO.hpp
* @author btk
* @brief cin高速化とか，出力の小数桁固定とか
* @version 0.1
* @date 2019-07-13
*
* @copyright Copyright (c) 2019
*/
/**
* @brief 入出力の設定を行うための構造体
*/
struct cww {
/**
* @brief Construct a new cww::cww object
* @details
* CIN_ONLYを定義すると，submit時にcinとscanfの同期を切る設定が走る
* DECIMAL_DIGITSを定義すると，doubleの出力時指定した桁数分小数部を吐くようになる
*/
cww() {
#ifdef FAST_IO
ios::sync_with_stdio(false);
cin.tie(0);
#endif
#ifdef DECIMAL_DIGITS
cout << fixed;
cout << setprecision(DECIMAL_DIGITS);
#endif
}
};
//! 入出力設定構造体を実体化
cww star;
/**
* @brief
* vectorに直接cin流すためのやつ
* @tparam T
* @param is
* @param v
* @return istream&
*/
template <typename T>
std::istream &operator>>(std::istream &is, std::vector<T> &v) {
for (auto &it : v)
is >> it;
return is;
}
/* #endregion */
/* #region template/Loop.hpp*/
/**
* @file Loop.hpp
* @author btk
* @brief rangeとかループ系のクラス
* @version 0.1
* @date 2019-07-13
*
* @copyright Copyright (c) 2019
*
*/
/**
* @brief
* rangeを逆向きに操作したいとき用
* @details
* ループの範囲は[bg,ed)なので注意
* @see range
*/
class reverse_range {
private:
struct I {
int x;
int operator*() { return x - 1; }
bool operator!=(I &lhs) { return x > lhs.x; }
void operator++() { --x; }
};
I i, n;
public:
/**
* @brief Construct a new reverse range object
*
* @param n
*/
reverse_range(int n) : i({0}), n({n}) {}
/**
* @brief Construct a new reverse range object
*
* @param i
* @param n
*/
reverse_range(int i, int n) : i({i}), n({n}) {}
/**
* @brief
* begin iterator
* @return I&
*/
I &begin() { return n; }
/**
* @brief
* end iterator
* @return I&
*/
I &end() { return i; }
};
/**
* @brief
* python みたいな range-based for を実現
* @details
* ループの範囲は[bg,ed)なので注意
* !つけると逆向きにループが回る (reverse_range)
* 空間計算量はO(1)
* 使わない変数ができて警告が出がちなので，unused_varとかを使って警告消しするとよい
*/
class range {
private:
struct I {
int x;
int operator*() { return x; }
bool operator!=(I &lhs) { return x < lhs.x; }
void operator++() { ++x; }
};
I i, n;
public:
/**
* @brief Construct a new range object
*
* @param n
*/
range(int n) : i({0}), n({n}) {}
/**
* @brief Construct a new range object
*
* @param i
* @param n
*/
range(int i, int n) : i({i}), n({n}) {}
/**
* @brief
* begin iterator
* @return I&
*/
I &begin() { return i; }
/**
* @brief
* end iterator
* @return I&
*/
I &end() { return n; }
/**
* @brief
* 逆向きに参照するrange(reverse_rangeを取得できるs)
* @return reverse_range
*/
reverse_range operator!() { return reverse_range(*i, *n); }
};
/* #endregion */
/* #region template/MinMaxOperation.hpp*/
/**
* @file MinMaxOperation.hpp
* @author btk
* @brief 最大値とか最小値を求める
* @version 0.1
* @date 2019-07-04
*
* @copyright Copyright (c) 2019
*
*/
/**
* @brief 2項の最小値求める
*
* @tparam T
*/
template <typename T> struct min_op {
/**
* @brief 本体
*
* @param l
* @param r
* @return T
*/
static T exec(const T l, const T r) { return l < r ? l : r; }
};
/**
* @brief 2項の最大値求める
*
* @tparam T
*/
template <typename T> struct max_op {
/**
* @brief 本体
*
* @param l
* @param r
* @return T
*/
static T exec(const T l, const T r) { return l > r ? l : r; }
};
/**
* @brief テンプレート再帰の末尾
*
* @tparam F 二項演算
* @tparam T
* @param v
* @return T
*/
template <typename F, typename T> inline T multi_op(T &&v) { return v; }
/**
* @brief 複数項における演算の結果を返す
*
* @tparam F
* @tparam T
* @tparam Ts
* @param head
* @param tail
* @return T
*/
template <typename F, typename T, typename... Ts>
inline T multi_op(const T head, Ts &&...tail) {
return F::exec(head, multi_op<F>(tail...));
}
/**
* @brief 複数項の最小値
* @see multi_op
* @tparam T
* @tparam Ts
* @param head
* @param tail
* @return T
*/
template <typename T, typename... Ts>
inline T multi_min(T &&head, Ts &&...tail) {
return multi_op<min_op<T>>(head, tail...);
}
/**
* @brief 複数項の最大値
* @see multi_op
* @tparam T
* @tparam Ts
* @param head
* @param tail
* @return T
*/
template <typename T, typename... Ts>
inline T multi_max(T &&head, Ts &&...tail) {
return multi_op<max_op<T>>(head, tail...);
}
/**
* @brief
* 先頭の値をFで参照する関数に基づいて変更できたらする
* @tparam F
* @tparam T
* @tparam Ts
* @param target
* @param candidates
* @return true
* @return false
*/
template <typename F, typename T, typename... Ts>
inline bool ch_op(T &target, Ts &&...candidates) {
const T old = target;
target = multi_op<F>(target, candidates...);
return old != target;
}
/**
* @brief change min
* @tparam T 型
* @param target 変更する値
* @param candidates
* @return 更新があればtrue
*/
template <typename T, typename... Ts>
inline bool chmin(T &target, Ts &&...candidates) {
return ch_op<min_op<T>>(target, candidates...);
}
/**
* @brief chminのmax版
* @see chmin
* @tparam T 型
* @param target 変更する値
* @param candidates
* @return 更新があればtrue
*/
template <typename T, typename... Ts>
inline bool chmax(T &target, Ts &&...candidates) {
return ch_op<max_op<T>>(target, candidates...);
}
/* #endregion */
/* #region template/Random.hpp*/
/**
* @file Random.hpp
* @author btk
* @brief 乱数生成系
* @version 0.1
* @date 2019-07-13
* @copyright Copyright (c) 2019
*/
//! 乱数のシード値をプロセスIDとして取得
const pid_t pid = getpid();
/**
* @brief XorShift32の実装
*/
class XorShift32 {
private:
//! XorShiftの現在の値
unsigned value;
/**
* @brief XorShift32のアルゴリズムに基づいて value を更新
*/
inline void update() {
value = value ^ (value << 13);
value = value ^ (value >> 17);
value = value ^ (value << 5);
}
/**
* @brief 値を更新し，更新前の値を返却
* @return unsigned 呼び出し時の value を用いる
*/
inline unsigned get() {
unsigned v = value;
update();
return v;
}
public:
/**
* @brief [0, 2^bit) の範囲の乱数値を取り出す
* @tparam デフォルトは31
* @return int
*/
template <int bit = 31> inline int next_int() {
return (int)(get() >> (32 - bit));
}
/**
* @brief [-2^bit,2^bit)の範囲の乱数値を取り出す
* @tparam デフォルトは31
* @return int
*/
template <int bit = 31> inline int next_signed() {
unsigned v = get();
return (int)((v >> (31 - bit)) - (1 << (bit)));
}
/**
* @brief next_int呼び出し時の最大値を取得
* @tparam 31
* @return int
*/
template <int bit = 31> inline int range_max() {
return (int)((1u << bit) - 1);
};
/**
* @brief Construct a new XorShift32 object
* @param seed
* @details 初期シードをvalueとするXorShift32のインスタンスを生成
*/
XorShift32(const unsigned seed) {
value = seed;
update();
}
/**
* @brief Construct a new XorShift 32 object
* @details 初期シードをプロセスIDとするXorShift32のインスタンスを生成
*/
XorShift32() : XorShift32(pid) {}
};
/* #endregion */
/* #region Template.hpp*/
/**
* @file Template.hpp
* @brief 競技プログラミング用テンプレート
* @author btk15049
* @date 2019/05/02
*/
/* #endregion */
/* #endregion */
/*</body>*/
#endif
int N;
bool check(vector<int> A, vector<int> B) {
sort(ALL(A));
sort(ALL(B));
for (int i : range(N)) {
if (A[i] > B[i])
return false;
}
return true;
}
bool check1(vector<int> A, vector<int> B) {
sort(ALL(A));
sort(ALL(B));
for (int i : range(N - 1)) {
if (A[i + 1] <= B[i])
return true;
}
return false;
}
bool check2(vector<int> A, vector<int> B) {
vector<int> id(N);
iota(ALL(id), 0);
sort(ALL(id), [&](int l, int r) {
return pair<int, int>(A[l], B[l]) < pair<int, int>(A[r], B[r]);
});
vector<int> AA(N);
vector<pair<int, int>> BB(N);
for (int i : range(N)) {
AA[i] = A[id[i]];
BB[i] = {B[id[i]], i};
}
sort(ALL(BB));
int cnt = 0;
int x = 0;
do {
x = BB[x].second;
cnt++;
} while (x > 0);
return cnt != N;
}
int main() {
cin >> N;
vector<int> A(N);
vector<int> B(N);
cin >> A >> B;
if (check(A, B) == false) {
cerr << "hukanou" << endl;
cout << "No" << endl;
return 0;
}
if (check1(A, B)) {
cout << "Yes" << endl;
return 0;
}
if (check2(A, B)) {
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
return -1;
return 0;
} | // https://atcoder.jp/contests/nikkei2019-2-qual/tasks/nikkei2019_2_qual_c
#define CIN_ONLY
#define DECIMAL_DIGITS 10
#define STATIC_MOD 1e9 + 7
#ifdef BTK
/*<head>*/
#include "Template.hpp"
/*</head>*/
#else
/*<body>*/
/* #region auto includes */
/* #region stl */
/*<stl>*/
#include <bits/stdc++.h>
#include <sys/types.h>
#include <unistd.h>
using namespace std;
/*</stl>*/
/* #endregion */
/* #region template/IncludeSTL.hpp*/
/**
* @file IncludeSTL.hpp
* @author btk
* @brief 標準ライブラリをincludeするだけ
* @version 0.1
* @date 2019-07-21
* @todo 何故か2回includeされる（展開scriptに
* @copyright Copyright (c) 2019
*
*/
/* #endregion */
/* #region template/Macro.hpp*/
/**
* @file Macro.hpp
* @author btk
* @brief マクロとか，LLとか
* @version 0.1
* @date 2019-07-13
*
* @copyright Copyright (c) 2019
*
*/
//! LL
using LL = long long;
/**
* @def DEBUG
* @brief デバッグ用のif文 提出時はif(0)で実行されない
*/
/*</head>*/
#ifdef BTK
#define DEBUG if (1)
#else
#ifdef CIN_ONLY
#define FAST_IO
#endif
#define DEBUG if (0)
#endif
/**
* @def ALL(v)
* @brief
* ALLマクロ
*/
#define ALL(v) (v).begin(), (v).end()
/**
* @def REC(ret, ...)
* @brief
* 再帰ラムダをするためのマクロ
*/
#define REC(ret, ...) std::function<ret(__VA_ARGS__)>
/**
* @def VAR_NAME(var)
* @brief 変数名を取得する
*/
#define VAR_NAME(var) #var
/**
* @brief
* rangeで生まれる使わない変数を消す用（警告消し）
*/
template <typename T> inline T &unused_var(T &v) { return v; }
/* #endregion */
/* #region template/IO.hpp*/
/**
* @file IO.hpp
* @author btk
* @brief cin高速化とか，出力の小数桁固定とか
* @version 0.1
* @date 2019-07-13
*
* @copyright Copyright (c) 2019
*/
/**
* @brief 入出力の設定を行うための構造体
*/
struct cww {
/**
* @brief Construct a new cww::cww object
* @details
* CIN_ONLYを定義すると，submit時にcinとscanfの同期を切る設定が走る
* DECIMAL_DIGITSを定義すると，doubleの出力時指定した桁数分小数部を吐くようになる
*/
cww() {
#ifdef FAST_IO
ios::sync_with_stdio(false);
cin.tie(0);
#endif
#ifdef DECIMAL_DIGITS
cout << fixed;
cout << setprecision(DECIMAL_DIGITS);
#endif
}
};
//! 入出力設定構造体を実体化
cww star;
/**
* @brief
* vectorに直接cin流すためのやつ
* @tparam T
* @param is
* @param v
* @return istream&
*/
template <typename T>
std::istream &operator>>(std::istream &is, std::vector<T> &v) {
for (auto &it : v)
is >> it;
return is;
}
/* #endregion */
/* #region template/Loop.hpp*/
/**
* @file Loop.hpp
* @author btk
* @brief rangeとかループ系のクラス
* @version 0.1
* @date 2019-07-13
*
* @copyright Copyright (c) 2019
*
*/
/**
* @brief
* rangeを逆向きに操作したいとき用
* @details
* ループの範囲は[bg,ed)なので注意
* @see range
*/
class reverse_range {
private:
struct I {
int x;
int operator*() { return x - 1; }
bool operator!=(I &lhs) { return x > lhs.x; }
void operator++() { --x; }
};
I i, n;
public:
/**
* @brief Construct a new reverse range object
*
* @param n
*/
reverse_range(int n) : i({0}), n({n}) {}
/**
* @brief Construct a new reverse range object
*
* @param i
* @param n
*/
reverse_range(int i, int n) : i({i}), n({n}) {}
/**
* @brief
* begin iterator
* @return I&
*/
I &begin() { return n; }
/**
* @brief
* end iterator
* @return I&
*/
I &end() { return i; }
};
/**
* @brief
* python みたいな range-based for を実現
* @details
* ループの範囲は[bg,ed)なので注意
* !つけると逆向きにループが回る (reverse_range)
* 空間計算量はO(1)
* 使わない変数ができて警告が出がちなので，unused_varとかを使って警告消しするとよい
*/
class range {
private:
struct I {
int x;
int operator*() { return x; }
bool operator!=(I &lhs) { return x < lhs.x; }
void operator++() { ++x; }
};
I i, n;
public:
/**
* @brief Construct a new range object
*
* @param n
*/
range(int n) : i({0}), n({n}) {}
/**
* @brief Construct a new range object
*
* @param i
* @param n
*/
range(int i, int n) : i({i}), n({n}) {}
/**
* @brief
* begin iterator
* @return I&
*/
I &begin() { return i; }
/**
* @brief
* end iterator
* @return I&
*/
I &end() { return n; }
/**
* @brief
* 逆向きに参照するrange(reverse_rangeを取得できるs)
* @return reverse_range
*/
reverse_range operator!() { return reverse_range(*i, *n); }
};
/* #endregion */
/* #region template/MinMaxOperation.hpp*/
/**
* @file MinMaxOperation.hpp
* @author btk
* @brief 最大値とか最小値を求める
* @version 0.1
* @date 2019-07-04
*
* @copyright Copyright (c) 2019
*
*/
/**
* @brief 2項の最小値求める
*
* @tparam T
*/
template <typename T> struct min_op {
/**
* @brief 本体
*
* @param l
* @param r
* @return T
*/
static T exec(const T l, const T r) { return l < r ? l : r; }
};
/**
* @brief 2項の最大値求める
*
* @tparam T
*/
template <typename T> struct max_op {
/**
* @brief 本体
*
* @param l
* @param r
* @return T
*/
static T exec(const T l, const T r) { return l > r ? l : r; }
};
/**
* @brief テンプレート再帰の末尾
*
* @tparam F 二項演算
* @tparam T
* @param v
* @return T
*/
template <typename F, typename T> inline T multi_op(T &&v) { return v; }
/**
* @brief 複数項における演算の結果を返す
*
* @tparam F
* @tparam T
* @tparam Ts
* @param head
* @param tail
* @return T
*/
template <typename F, typename T, typename... Ts>
inline T multi_op(const T head, Ts &&...tail) {
return F::exec(head, multi_op<F>(tail...));
}
/**
* @brief 複数項の最小値
* @see multi_op
* @tparam T
* @tparam Ts
* @param head
* @param tail
* @return T
*/
template <typename T, typename... Ts>
inline T multi_min(T &&head, Ts &&...tail) {
return multi_op<min_op<T>>(head, tail...);
}
/**
* @brief 複数項の最大値
* @see multi_op
* @tparam T
* @tparam Ts
* @param head
* @param tail
* @return T
*/
template <typename T, typename... Ts>
inline T multi_max(T &&head, Ts &&...tail) {
return multi_op<max_op<T>>(head, tail...);
}
/**
* @brief
* 先頭の値をFで参照する関数に基づいて変更できたらする
* @tparam F
* @tparam T
* @tparam Ts
* @param target
* @param candidates
* @return true
* @return false
*/
template <typename F, typename T, typename... Ts>
inline bool ch_op(T &target, Ts &&...candidates) {
const T old = target;
target = multi_op<F>(target, candidates...);
return old != target;
}
/**
* @brief change min
* @tparam T 型
* @param target 変更する値
* @param candidates
* @return 更新があればtrue
*/
template <typename T, typename... Ts>
inline bool chmin(T &target, Ts &&...candidates) {
return ch_op<min_op<T>>(target, candidates...);
}
/**
* @brief chminのmax版
* @see chmin
* @tparam T 型
* @param target 変更する値
* @param candidates
* @return 更新があればtrue
*/
template <typename T, typename... Ts>
inline bool chmax(T &target, Ts &&...candidates) {
return ch_op<max_op<T>>(target, candidates...);
}
/* #endregion */
/* #region template/Random.hpp*/
/**
* @file Random.hpp
* @author btk
* @brief 乱数生成系
* @version 0.1
* @date 2019-07-13
* @copyright Copyright (c) 2019
*/
//! 乱数のシード値をプロセスIDとして取得
const pid_t pid = getpid();
/**
* @brief XorShift32の実装
*/
class XorShift32 {
private:
//! XorShiftの現在の値
unsigned value;
/**
* @brief XorShift32のアルゴリズムに基づいて value を更新
*/
inline void update() {
value = value ^ (value << 13);
value = value ^ (value >> 17);
value = value ^ (value << 5);
}
/**
* @brief 値を更新し，更新前の値を返却
* @return unsigned 呼び出し時の value を用いる
*/
inline unsigned get() {
unsigned v = value;
update();
return v;
}
public:
/**
* @brief [0, 2^bit) の範囲の乱数値を取り出す
* @tparam デフォルトは31
* @return int
*/
template <int bit = 31> inline int next_int() {
return (int)(get() >> (32 - bit));
}
/**
* @brief [-2^bit,2^bit)の範囲の乱数値を取り出す
* @tparam デフォルトは31
* @return int
*/
template <int bit = 31> inline int next_signed() {
unsigned v = get();
return (int)((v >> (31 - bit)) - (1 << (bit)));
}
/**
* @brief next_int呼び出し時の最大値を取得
* @tparam 31
* @return int
*/
template <int bit = 31> inline int range_max() {
return (int)((1u << bit) - 1);
};
/**
* @brief Construct a new XorShift32 object
* @param seed
* @details 初期シードをvalueとするXorShift32のインスタンスを生成
*/
XorShift32(const unsigned seed) {
value = seed;
update();
}
/**
* @brief Construct a new XorShift 32 object
* @details 初期シードをプロセスIDとするXorShift32のインスタンスを生成
*/
XorShift32() : XorShift32(pid) {}
};
/* #endregion */
/* #region Template.hpp*/
/**
* @file Template.hpp
* @brief 競技プログラミング用テンプレート
* @author btk15049
* @date 2019/05/02
*/
/* #endregion */
/* #endregion */
/*</body>*/
#endif
int N;
bool check(vector<int> A, vector<int> B) {
sort(ALL(A));
sort(ALL(B));
for (int i : range(N)) {
if (A[i] > B[i])
return false;
}
return true;
}
bool check1(vector<int> A, vector<int> B) {
sort(ALL(A));
sort(ALL(B));
for (int i : range(N - 1)) {
if (A[i + 1] <= B[i])
return true;
}
return false;
}
bool check2(vector<int> A, vector<int> B) {
vector<int> id(N);
iota(ALL(id), 0);
sort(ALL(id), [&](int l, int r) {
return pair<int, int>(A[l], B[l]) < pair<int, int>(A[r], B[r]);
});
vector<int> AA(N);
vector<pair<int, int>> BB(N);
for (int i : range(N)) {
AA[i] = A[id[i]];
BB[i] = {B[id[i]], i};
}
sort(ALL(BB));
int cnt = 0;
int x = 0;
do {
x = BB[x].second;
cnt++;
} while (x > 0);
return cnt != N;
}
int main() {
cin >> N;
vector<int> A(N);
vector<int> B(N);
cin >> A >> B;
if (check(A, B) == false) {
cerr << "hukanou" << endl;
cout << "No" << endl;
return 0;
}
if (check1(A, B)) {
cout << "Yes" << endl;
return 0;
}
if (check2(A, B)) {
cout << "Yes" << endl;
return 0;
}
cout << "No" << endl;
return 0;
} | delete | 549 | 550 | 549 | 549 | 0 | |
p02867 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
bool hasCycle = false;
void search(int curr, int &n, vector<vector<int>> &v, vector<int> &visited,
int count) {
if (hasCycle)
return;
visited[curr] = count;
for (auto &to : v[curr]) {
if (visited[to] != -1) {
if (count - visited[to] + 1 != n)
hasCycle = true;
continue;
}
search(to, n, v, visited, count + 1);
}
}
int main() {
int n;
cin >> n;
vector<int> a(n), b(n), c(n), d(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
c[i] = a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
d[i] = b[i];
}
sort(c.begin(), c.end());
sort(d.begin(), d.end());
for (int i = 0; i < n; i++) {
if (c[i] > d[i]) {
cout << "No" << endl;
return 0;
}
}
for (int i = 0; i < n; i++) {
int ci = upper_bound(c.begin(), c.end(), d[i]) - c.begin();
if (ci - i > 1) {
cout << "Yes" << endl;
return 0;
}
}
assert(false);
map<int, int> cm, dm;
for (int i = 0; i < n; i++) {
cm[c[i]] = i;
dm[d[i]] = i;
}
vector<vector<int>> v(n);
vector<int> visited(n, -1);
for (int i = 0; i < n; i++) {
v[cm[a[i]]].emplace_back(dm[b[i]]);
if (cm[a[i]] == dm[b[i]]) {
cout << "Yes" << endl;
return 0;
}
}
for (int i = 0; i < n; i++) {
if (visited[i] == -1)
search(i, n, v, visited, 0);
}
if (hasCycle)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
bool hasCycle = false;
void search(int curr, int &n, vector<vector<int>> &v, vector<int> &visited,
int count) {
if (hasCycle)
return;
visited[curr] = count;
for (auto &to : v[curr]) {
if (visited[to] != -1) {
if (count - visited[to] + 1 != n)
hasCycle = true;
continue;
}
search(to, n, v, visited, count + 1);
}
}
int main() {
int n;
cin >> n;
vector<int> a(n), b(n), c(n), d(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
c[i] = a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
d[i] = b[i];
}
sort(c.begin(), c.end());
sort(d.begin(), d.end());
for (int i = 0; i < n; i++) {
if (c[i] > d[i]) {
cout << "No" << endl;
return 0;
}
}
for (int i = 0; i < n; i++) {
int ci = upper_bound(c.begin(), c.end(), d[i]) - c.begin();
if (ci - i > 1) {
cout << "Yes" << endl;
return 0;
}
}
map<int, int> cm, dm;
for (int i = 0; i < n; i++) {
cm[c[i]] = i;
dm[d[i]] = i;
}
vector<vector<int>> v(n);
vector<int> visited(n, -1);
for (int i = 0; i < n; i++) {
v[cm[a[i]]].emplace_back(dm[b[i]]);
if (cm[a[i]] == dm[b[i]]) {
cout << "Yes" << endl;
return 0;
}
}
for (int i = 0; i < n; i++) {
if (visited[i] == -1)
search(i, n, v, visited, 0);
}
if (hasCycle)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
} | delete | 47 | 48 | 47 | 47 | -6 | 5d0cdb3d-ee50-4ea1-9d86-4a6c4695f647.out: /home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02867/C++/s112190854.cpp:42: int main(): Assertion `false' failed.
|
p02867 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, int> P;
int main() {
int N;
cin >> N;
vector<P> A(N), B(N);
for (int i = 0; i < N; ++i) {
cin >> A[i].first;
A[i].second = i;
}
for (int i = 0; i < N; ++i) {
cin >> B[i].first;
B[i].second = A[i].first;
}
sort(B.begin(), B.end());
sort(A.begin(), A.end());
bool ans = true;
for (int i = 0; i < N; ++i) {
if (A[i].first > B[i].first) {
ans = false;
break;
}
}
vector<int> p(N);
if (ans) {
for (int i = 0; i < N; ++i) {
p[A[i].second] = B[i].second;
}
int count = 0, root = 0, node = 0;
while (1) {
node = p[node];
++count;
if (root == node)
break;
}
if (count == N) {
ans = false;
for (int i = 0; i < N - 1; ++i) {
if (A[i + 1].first <= B[i].first) {
ans = true;
break;
}
}
}
}
if (ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, int> P;
int main() {
int N;
cin >> N;
vector<P> A(N), B(N);
for (int i = 0; i < N; ++i) {
cin >> A[i].first;
A[i].second = i;
}
for (int i = 0; i < N; ++i) {
cin >> B[i].first;
B[i].second = i;
}
sort(B.begin(), B.end());
sort(A.begin(), A.end());
bool ans = true;
for (int i = 0; i < N; ++i) {
if (A[i].first > B[i].first) {
ans = false;
break;
}
}
vector<int> p(N);
if (ans) {
for (int i = 0; i < N; ++i) {
p[A[i].second] = B[i].second;
}
int count = 0, root = 0, node = 0;
while (1) {
node = p[node];
++count;
if (root == node)
break;
}
if (count == N) {
ans = false;
for (int i = 0; i < N - 1; ++i) {
if (A[i + 1].first <= B[i].first) {
ans = true;
break;
}
}
}
}
if (ans)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| replace | 20 | 21 | 20 | 21 | 0 | |
p02867 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
namespace TYC {
typedef long long ll;
typedef pair<int, int> pii;
const int N = 1e5 + 5;
int n, A[N], B[N], P[N];
map<int, int> idA, idB;
inline int read() {
int x = 0, f = 0, ch = getchar();
while (!isdigit(ch))
f |= (ch == '-'), ch = getchar();
while (isdigit(ch))
x = x * 10 + ch - '0', ch = getchar();
return f ? -x : x;
}
inline void End(const int t) {
puts(t ? "Yes" : "No");
exit(0);
}
void work() {
n = read();
for (int i = 1; i <= n; i++)
A[i] = read(), idA[A[i]] = i;
for (int i = 1; i <= n; i++)
B[i] = read(), idB[B[i]] = i;
sort(A + 1, A + 1 + n);
sort(B + 1, B + 1 + n);
for (int i = 1; i <= n; i++)
if (A[i] > B[i])
End(0);
for (int i = 1; i < n; i++)
if (A[i] == A[i + 1] || B[i] == B[i + 1])
End(1);
for (int i = 1; i < n; i++)
if (A[i + 1] <= B[i])
End(1);
else
P[idA[A[i]]] = idB[B[i]];
int c = 1, u = P[1];
while (u != 1)
c++, u = P[u];
End(c != n);
}
} // namespace TYC
int main() {
TYC::work();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
namespace TYC {
typedef long long ll;
typedef pair<int, int> pii;
const int N = 1e5 + 5;
int n, A[N], B[N], P[N];
map<int, int> idA, idB;
inline int read() {
int x = 0, f = 0, ch = getchar();
while (!isdigit(ch))
f |= (ch == '-'), ch = getchar();
while (isdigit(ch))
x = x * 10 + ch - '0', ch = getchar();
return f ? -x : x;
}
inline void End(const int t) {
puts(t ? "Yes" : "No");
exit(0);
}
void work() {
n = read();
for (int i = 1; i <= n; i++)
A[i] = read(), idA[A[i]] = i;
for (int i = 1; i <= n; i++)
B[i] = read(), idB[B[i]] = i;
sort(A + 1, A + 1 + n);
sort(B + 1, B + 1 + n);
for (int i = 1; i <= n; i++)
if (A[i] > B[i])
End(0);
for (int i = 1; i < n; i++)
if (A[i] == A[i + 1] || B[i] == B[i + 1])
End(1);
for (int i = 1; i <= n; i++)
if (i < n && A[i + 1] <= B[i])
End(1);
else
P[idA[A[i]]] = idB[B[i]];
int c = 1, u = P[1];
while (u != 1)
c++, u = P[u];
End(c != n);
}
} // namespace TYC
int main() {
TYC::work();
return 0;
} | replace | 39 | 41 | 39 | 41 | TLE | |
p02867 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#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 PB push_back
#define ar2 array<int, 2>
typedef long long LL;
const int P = 1e9 + 7;
const int N = 2005;
const double pi = acos(-1);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
struct dat {
int a, b;
} c[N];
int n, a[N], b[N], to[N];
int main() {
scanf("%d", &n);
rep(i, 1, n) scanf("%d", a + i);
rep(i, 1, n) scanf("%d", b + i);
rep(i, 1, n) c[i].a = a[i], c[i].b = b[i];
sort(a + 1, a + n + 1);
sort(b + 1, b + n + 1);
rep(i, 1, n) if (a[i] > b[i]) {
printf("No\n");
return 0;
}
rep(i, 1, n) if (a[i] <= b[i - 1]) {
printf("Yes\n");
return 0;
}
sort(c + 1, c + n + 1, [](dat x, dat y) { return x.b < y.b; });
// rep(i,1,n)cout<<c[i].a<<" "<<c[i].b<<endl;
rep(i, 1, n) {
int l = 1, r = n;
while (l <= r) {
int mid = l + r >> 1;
if (c[i].a <= c[mid].b)
to[i] = mid, r = mid - 1;
else
l = mid + 1;
}
// cout<<i<<" "<<to[i]<<endl;
}
int cnt = 1, i = 1;
while (to[i] != 1) {
i = to[i], cnt++;
}
printf(cnt < n ? "Yes\n" : "No\n");
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#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 PB push_back
#define ar2 array<int, 2>
typedef long long LL;
const int P = 1e9 + 7;
const int N = 1e5 + 5;
const double pi = acos(-1);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
struct dat {
int a, b;
} c[N];
int n, a[N], b[N], to[N];
int main() {
scanf("%d", &n);
rep(i, 1, n) scanf("%d", a + i);
rep(i, 1, n) scanf("%d", b + i);
rep(i, 1, n) c[i].a = a[i], c[i].b = b[i];
sort(a + 1, a + n + 1);
sort(b + 1, b + n + 1);
rep(i, 1, n) if (a[i] > b[i]) {
printf("No\n");
return 0;
}
rep(i, 1, n) if (a[i] <= b[i - 1]) {
printf("Yes\n");
return 0;
}
sort(c + 1, c + n + 1, [](dat x, dat y) { return x.b < y.b; });
// rep(i,1,n)cout<<c[i].a<<" "<<c[i].b<<endl;
rep(i, 1, n) {
int l = 1, r = n;
while (l <= r) {
int mid = l + r >> 1;
if (c[i].a <= c[mid].b)
to[i] = mid, r = mid - 1;
else
l = mid + 1;
}
// cout<<i<<" "<<to[i]<<endl;
}
int cnt = 1, i = 1;
while (to[i] != 1) {
i = to[i], cnt++;
}
printf(cnt < n ? "Yes\n" : "No\n");
return 0;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02867 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cstdio>
#include <tuple>
#include <vector>
using namespace std;
int main() {
int N;
scanf("%d", &N);
vector<pair<int, int>> A, B;
for (int n = 0; n < N; ++n) {
int a;
scanf("%d", &a);
A.emplace_back(a, n);
}
for (int n = 0; n < N; ++n) {
int b;
scanf("%d", &b);
B.emplace_back(b, n);
}
sort(A.begin(), A.end());
sort(B.begin(), B.end());
for (int n = 0; n < N; ++n) {
if (B[n].first < A[n].first) {
printf("No\n");
return 0;
}
}
for (int n = 1; n < N; ++n) {
if (A[n].first <= B[n - 1].first) {
printf("Yes\n");
return 0;
}
}
vector<int> Ans(N), Now(N), Pos(N);
for (int n = 0; n < N; ++n) {
Now[n] = n;
Pos[n] = n;
Ans[B[n].second] = A[n].second;
}
for (int n = 0; n < N - 1; ++n) {
if (Now[n] == Ans[n]) {
printf("Yes\n");
return 0;
}
int i = Pos[n];
swap(Now[i], Now[n]);
// Now[i] = Now[n];
assert(false);
Pos[Now[n]] = n;
Pos[Now[i]] = i;
}
printf("No\n");
return 0;
}
| #include <algorithm>
#include <cassert>
#include <cstdio>
#include <tuple>
#include <vector>
using namespace std;
int main() {
int N;
scanf("%d", &N);
vector<pair<int, int>> A, B;
for (int n = 0; n < N; ++n) {
int a;
scanf("%d", &a);
A.emplace_back(a, n);
}
for (int n = 0; n < N; ++n) {
int b;
scanf("%d", &b);
B.emplace_back(b, n);
}
sort(A.begin(), A.end());
sort(B.begin(), B.end());
for (int n = 0; n < N; ++n) {
if (B[n].first < A[n].first) {
printf("No\n");
return 0;
}
}
for (int n = 1; n < N; ++n) {
if (A[n].first <= B[n - 1].first) {
printf("Yes\n");
return 0;
}
}
vector<int> Ans(N), Now(N), Pos(N);
for (int n = 0; n < N; ++n) {
Now[n] = n;
Pos[n] = n;
Ans[B[n].second] = A[n].second;
}
for (int n = 0; n < N - 1; ++n) {
if (Now[n] == Ans[n]) {
printf("Yes\n");
return 0;
}
int i = Pos[Ans[n]];
Now[i] = Now[n];
Pos[Now[i]] = i;
}
printf("No\n");
return 0;
}
| replace | 47 | 52 | 47 | 49 | 0 | |
p02867 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <forward_list>
#include <initializer_list>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#define cauto const auto &
#define ALL(v) begin(v), end(v)
#else
#define ALL(v) (v).begin(), (v).end()
#endif
using namespace std;
namespace {
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long>> vvll, vvLL;
#define VV(T) vector<vector<T>>
template <class T>
void initvv(vector<vector<T>> &v, int a, int b, const T &t = T()) {
v.assign(a, vector<T>(b, t));
}
template <class T> inline T &chmin(T &x, const T &y) { return x = min(x, y); }
template <class T> inline T &chmax(T &x, const T &y) { return x = max(x, y); }
template <class F, class T> void convert(const F &f, T &t) {
stringstream ss;
ss << f;
ss >> t;
}
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define RALL(v) (v).rbegin(), (v).rend()
#define MOD 1000000007LL
#define EPS 1e-8
struct union_find {
typedef unsigned size_type;
vector<int> par;
size_type grs;
explicit union_find(size_type n = 0) { init(n); }
void init(size_type n) {
par.assign(n, -1);
grs = n;
}
size_type find(size_type x) {
if (par[x] < 0) {
return x;
}
return par[x] = find(par[x]);
}
size_type size(size_type x) { return -par[find(x)]; }
size_type groups() { return grs; }
bool unite(size_type x, size_type y) {
x = find(x);
y = find(y);
if (x == y) {
return false;
}
if (par[x] < par[y]) {
swap(x, y);
}
par[y] += par[x];
par[x] = y;
--grs;
return true;
}
bool same(size_type x, size_type y) { return find(x) == find(y); }
bool is_root(size_type x) { return find(x) == x; }
};
bool check1(vint as, vint bs) {
int n = as.size();
sort(ALL(as));
sort(ALL(bs));
for (int i = 0; i < n; ++i) {
if (as[i] > bs[i]) {
return false;
}
}
return true;
}
bool solve() {
int n;
scanf("%d", &n);
vector<pii> ps(n);
for (int i = 0; i < n; ++i) {
scanf("%d", &ps[i].second);
}
for (int i = 0; i < n; ++i) {
scanf("%d", &ps[i].first);
}
sort(ALL(ps));
vector<int> as(n), bs(n);
for (int i = 0; i < n; ++i) {
as[i] = ps[i].second;
bs[i] = ps[i].first;
}
if (!check1(as, bs)) {
return false;
}
vector<int> ls(n);
for (int i = 0; i < n; ++i) {
ls[i] = upper_bound(ALL(bs), as[i]) - bs.begin() - 1;
}
if (set<int>(ALL(ls)).size() != n) {
return true;
}
union_find uf(n);
for (int i = 0; i < n; ++i) {
uf.unite(i, ls[i]);
}
if (uf.groups() > 1) {
return true;
}
return false;
}
void mainmain() { puts(solve() ? "Yes" : "No"); }
} // namespace
int main() try {
// ios::sync_with_stdio(false); cin.tie(0);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(4);
mainmain();
} catch (...) {
throw;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <forward_list>
#include <initializer_list>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#define cauto const auto &
#define ALL(v) begin(v), end(v)
#else
#define ALL(v) (v).begin(), (v).end()
#endif
using namespace std;
namespace {
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<long long> vll, vLL;
typedef vector<vector<long long>> vvll, vvLL;
#define VV(T) vector<vector<T>>
template <class T>
void initvv(vector<vector<T>> &v, int a, int b, const T &t = T()) {
v.assign(a, vector<T>(b, t));
}
template <class T> inline T &chmin(T &x, const T &y) { return x = min(x, y); }
template <class T> inline T &chmax(T &x, const T &y) { return x = max(x, y); }
template <class F, class T> void convert(const F &f, T &t) {
stringstream ss;
ss << f;
ss >> t;
}
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define RALL(v) (v).rbegin(), (v).rend()
#define MOD 1000000007LL
#define EPS 1e-8
struct union_find {
typedef unsigned size_type;
vector<int> par;
size_type grs;
explicit union_find(size_type n = 0) { init(n); }
void init(size_type n) {
par.assign(n, -1);
grs = n;
}
size_type find(size_type x) {
if (par[x] < 0) {
return x;
}
return par[x] = find(par[x]);
}
size_type size(size_type x) { return -par[find(x)]; }
size_type groups() { return grs; }
bool unite(size_type x, size_type y) {
x = find(x);
y = find(y);
if (x == y) {
return false;
}
if (par[x] < par[y]) {
swap(x, y);
}
par[y] += par[x];
par[x] = y;
--grs;
return true;
}
bool same(size_type x, size_type y) { return find(x) == find(y); }
bool is_root(size_type x) { return find(x) == x; }
};
bool check1(vint as, vint bs) {
int n = as.size();
sort(ALL(as));
sort(ALL(bs));
for (int i = 0; i < n; ++i) {
if (as[i] > bs[i]) {
return false;
}
}
return true;
}
bool solve() {
int n;
scanf("%d", &n);
vector<pii> ps(n);
for (int i = 0; i < n; ++i) {
scanf("%d", &ps[i].second);
}
for (int i = 0; i < n; ++i) {
scanf("%d", &ps[i].first);
}
sort(ALL(ps));
vector<int> as(n), bs(n);
for (int i = 0; i < n; ++i) {
as[i] = ps[i].second;
bs[i] = ps[i].first;
}
if (!check1(as, bs)) {
return false;
}
vector<int> ls(n);
for (int i = 0; i < n; ++i) {
ls[i] = lower_bound(ALL(bs), as[i]) - bs.begin();
if (ls[i] >= n) {
return false;
}
}
if (set<int>(ALL(ls)).size() != n) {
return true;
}
union_find uf(n);
for (int i = 0; i < n; ++i) {
uf.unite(i, ls[i]);
}
if (uf.groups() > 1) {
return true;
}
return false;
}
void mainmain() { puts(solve() ? "Yes" : "No"); }
} // namespace
int main() try {
// ios::sync_with_stdio(false); cin.tie(0);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(4);
mainmain();
} catch (...) {
throw;
}
| replace | 145 | 146 | 145 | 149 | 0 | |
p02867 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using namespace std;
int g[100000];
int dfs(int x) {
if (g[x] == x) {
return x;
} else {
return x = dfs(g[x]);
}
}
int main() {
int n, x, y;
vector<pair<int, int>> a, b;
int p = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &x);
a.push_back({x, i});
}
for (int i = 0; i < n; i++) {
scanf("%d", &x);
b.push_back({x, i});
}
sort(a.begin(), a.end());
sort(b.begin(), b.end());
for (int i = 0; i < n; i++) {
if (a[i].first > b[i].first) {
printf("No\n");
return 0;
}
}
p = 0;
for (int i = 0; i < n; i++) {
if (i == p) {
while (a[p].first <= b[i].first) {
p++;
}
for (int j = i; j < p; j++) {
a[j].first = b[i].first;
b[j].first = b[i].first;
}
}
}
for (int i = 0; i < n; i++) {
if (a[i].second == b[i].second) {
printf("Yes\n");
return 0;
}
}
for (int i = 1; i < n; i++) {
if (a[i].first == a[i - 1].first || b[i].first == b[i - 1].first) {
printf("Yes\n");
return 0;
}
}
for (int i = 0; i < n; i++) {
g[i] = i;
}
for (int i = 0; i < n; i++) {
x = dfs(a[i].second);
y = dfs(b[i].second);
if (x != y) {
g[max(x, y)] = g[min(x, y)];
}
}
for (int i = 0; i < n; i++) {
x = dfs(i);
if (x) {
printf("Yes\n");
return 0;
}
}
printf("No\n");
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using namespace std;
int g[100000];
int dfs(int x) {
if (g[x] == x) {
return x;
} else {
return x = dfs(g[x]);
}
}
int main() {
int n, x, y;
vector<pair<int, int>> a, b;
int p = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &x);
a.push_back({x, i});
}
for (int i = 0; i < n; i++) {
scanf("%d", &x);
b.push_back({x, i});
}
sort(a.begin(), a.end());
sort(b.begin(), b.end());
for (int i = 0; i < n; i++) {
if (a[i].first > b[i].first) {
printf("No\n");
return 0;
}
}
p = 0;
for (int i = 0; i < n; i++) {
if (i == p) {
while (p < n && a[p].first <= b[i].first) {
p++;
}
for (int j = i; j < p; j++) {
a[j].first = b[i].first;
b[j].first = b[i].first;
}
}
}
for (int i = 0; i < n; i++) {
if (a[i].second == b[i].second) {
printf("Yes\n");
return 0;
}
}
for (int i = 1; i < n; i++) {
if (a[i].first == a[i - 1].first || b[i].first == b[i - 1].first) {
printf("Yes\n");
return 0;
}
}
for (int i = 0; i < n; i++) {
g[i] = i;
}
for (int i = 0; i < n; i++) {
x = dfs(a[i].second);
y = dfs(b[i].second);
if (x != y) {
g[max(x, y)] = g[min(x, y)];
}
}
for (int i = 0; i < n; i++) {
x = dfs(i);
if (x) {
printf("Yes\n");
return 0;
}
}
printf("No\n");
} | replace | 43 | 44 | 43 | 44 | 0 | |
p02867 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vpii vector<pair<int, int>>
#define gph map<int, vector<int>>
#define mp make_pair
#define FOR(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR1(i, n) for (int i = 1; i <= (int)(n); i++)
#define FORD0(i, n) for (int i = (int)n; i >= 0; i--)
#define FORD1(i, n) for (int i = (int)n; i >= 1; i--)
#define FORS(i, n) for (; i < (int)(n); i++)
#define debug(X) \
{ cout << #X << " = " << (X) << endl; }
#define printArr(A, n) \
{ \
cout << #A << " = "; \
FOR(i, n) cout << A[i] << ' '; \
cout << endl; \
}
using namespace std;
#define int long long int
#define ll int
bool vis[(int)1e5 + 5] = {0};
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
freopen("in29.txt", "r", stdin);
int n;
cin >> n;
vi a(n), b(n);
vector<pair<int, int>> temp;
FOR(i, n) cin >> a[i];
FOR(i, n) cin >> b[i];
FOR(i, n) temp.pb(mp(b[i], a[i]));
sort(temp.begin(), temp.end());
sort(a.begin(), a.end());
sort(b.begin(), b.end());
FOR(i, n) {
temp[i].first = temp[i].second;
temp[i].second = i;
}
sort(temp.begin(), temp.end());
FOR(i, n) {
if (a[i] > b[i]) {
cout << "No" << endl;
return 0;
}
}
FOR(i, n - 1) {
if (a[i + 1] <= b[i]) {
cout << "Yes" << endl;
return 0;
}
}
int cnt = 0;
int j = 0;
while (!vis[j]) {
vis[j] = true;
cnt++;
j = temp[j].second;
}
// debug(cnt);
if (cnt < n)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vpii vector<pair<int, int>>
#define gph map<int, vector<int>>
#define mp make_pair
#define FOR(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR1(i, n) for (int i = 1; i <= (int)(n); i++)
#define FORD0(i, n) for (int i = (int)n; i >= 0; i--)
#define FORD1(i, n) for (int i = (int)n; i >= 1; i--)
#define FORS(i, n) for (; i < (int)(n); i++)
#define debug(X) \
{ cout << #X << " = " << (X) << endl; }
#define printArr(A, n) \
{ \
cout << #A << " = "; \
FOR(i, n) cout << A[i] << ' '; \
cout << endl; \
}
using namespace std;
#define int long long int
#define ll int
bool vis[(int)1e5 + 5] = {0};
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// freopen("in29.txt", "r", stdin);
int n;
cin >> n;
vi a(n), b(n);
vector<pair<int, int>> temp;
FOR(i, n) cin >> a[i];
FOR(i, n) cin >> b[i];
FOR(i, n) temp.pb(mp(b[i], a[i]));
sort(temp.begin(), temp.end());
sort(a.begin(), a.end());
sort(b.begin(), b.end());
FOR(i, n) {
temp[i].first = temp[i].second;
temp[i].second = i;
}
sort(temp.begin(), temp.end());
FOR(i, n) {
if (a[i] > b[i]) {
cout << "No" << endl;
return 0;
}
}
FOR(i, n - 1) {
if (a[i + 1] <= b[i]) {
cout << "Yes" << endl;
return 0;
}
}
int cnt = 0;
int j = 0;
while (!vis[j]) {
vis[j] = true;
cnt++;
j = temp[j].second;
}
// debug(cnt);
if (cnt < n)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| replace | 29 | 30 | 29 | 30 | -11 | |
p02868 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using ll = long long;
struct edge {
int to;
ll cost;
};
typedef pair<int, int> P;
const ll INF = 1e18;
const int MAX_V = 1e5;
vector<edge> G[MAX_V];
vector<ll> d(MAX_V, INF);
void dijkstra(int s) {
priority_queue<P, vector<P>, greater<P>> que;
d[s] = 0;
que.push(P(0, s));
while (!que.empty()) {
P p = que.top();
que.pop();
int v = p.second;
if (d[v] < p.first)
continue;
rep(i, G[v].size()) {
edge e = G[v][i];
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.push(P(d[e.to], e.to));
}
}
}
}
int main() {
int n, m;
cin >> n >> m;
for (int i = n - 1; i >= 1; i--)
G[i].push_back(edge{i - 1, 0});
rep(i, m) {
int l, r;
ll c;
cin >> l >> r >> c;
l--;
r--;
G[l].push_back(edge{r, c});
}
dijkstra(0);
if (d[n - 1] == INF)
cout << -1 << endl;
else
cout << d[n - 1] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using ll = long long;
struct edge {
int to;
ll cost;
};
typedef pair<ll, int> P;
const ll INF = 1e18;
const int MAX_V = 1e5;
vector<edge> G[MAX_V];
vector<ll> d(MAX_V, INF);
void dijkstra(int s) {
priority_queue<P, vector<P>, greater<P>> que;
d[s] = 0;
que.push(P(0, s));
while (!que.empty()) {
P p = que.top();
que.pop();
int v = p.second;
if (d[v] < p.first)
continue;
rep(i, G[v].size()) {
edge e = G[v][i];
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.push(P(d[e.to], e.to));
}
}
}
}
int main() {
int n, m;
cin >> n >> m;
for (int i = n - 1; i >= 1; i--)
G[i].push_back(edge{i - 1, 0});
rep(i, m) {
int l, r;
ll c;
cin >> l >> r >> c;
l--;
r--;
G[l].push_back(edge{r, c});
}
dijkstra(0);
if (d[n - 1] == INF)
cout << -1 << endl;
else
cout << d[n - 1] << endl;
return 0;
} | replace | 9 | 10 | 9 | 10 | TLE | |
p02868 | C++ | Time Limit Exceeded | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef long double ld;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define F first
#define S second
const int mx = 100010;
const ll mod = 1e9 + 7;
typedef vector<vector<pair<ll, int>>> wgraph;
typedef pair<ll, int> pli;
vector<ll> bfs(wgraph v, int x) {
priority_queue<pli, vector<pli>, greater<pli>> q;
vector<ll> dist(v.size(), longinf);
dist[x] = 0;
q.push({0LL, x});
while (q.size()) {
pli p = q.top();
q.pop();
ll d = p.F, now = p.S;
if (dist[now] < d) {
continue;
}
for (auto to : v[now]) {
if (dist[to.S] > d + to.F) {
dist[to.S] = d + to.F;
q.push({dist[to.S], to.S});
}
}
}
return dist;
}
int main() {
int n, m;
cin >> n >> m;
wgraph v(n);
rep(i, m) {
int x, y, z;
cin >> x >> y >> z;
x--;
y--;
v[x].emplace_back(z, y);
for (int j = x + 1; j < y; j++) {
v[y].emplace_back(0, j);
}
}
vector<ll> dist = bfs(v, 0);
ll ans = dist[n - 1];
if (ans == longinf)
ans = -1;
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef long double ld;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define F first
#define S second
const int mx = 100010;
const ll mod = 1e9 + 7;
typedef vector<vector<pair<ll, int>>> wgraph;
typedef pair<ll, int> pli;
vector<ll> bfs(wgraph v, int x) {
priority_queue<pli, vector<pli>, greater<pli>> q;
vector<ll> dist(v.size(), longinf);
dist[x] = 0;
q.push({0LL, x});
while (q.size()) {
pli p = q.top();
q.pop();
ll d = p.F, now = p.S;
if (dist[now] < d) {
continue;
}
for (auto to : v[now]) {
if (dist[to.S] > d + to.F) {
dist[to.S] = d + to.F;
q.push({dist[to.S], to.S});
}
}
}
return dist;
}
int main() {
int n, m;
cin >> n >> m;
wgraph v(n);
rep(i, m) {
int x, y, z;
cin >> x >> y >> z;
x--;
y--;
v[x].emplace_back(z, y);
}
for (int i = n - 1; i > 0; i--) {
v[i].emplace_back(0, i - 1);
}
vector<ll> dist = bfs(v, 0);
ll ans = dist[n - 1];
if (ans == longinf)
ans = -1;
cout << ans << endl;
return 0;
} | replace | 66 | 69 | 66 | 69 | TLE | |
p02868 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#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()
#define pb push_back
#define mod 1000000007
using ll = long long;
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<pair<int, int>, ll>> LRC(N);
rep(i, M) {
cin >> LRC[i].first.first >> LRC[i].first.second >> LRC[i].second;
LRC[i].first.first--;
LRC[i].first.second--;
}
vector<vector<int>> G(N);
vector<vector<ll>> CO(N);
rep(i, M) {
G[LRC[i].first.first].pb(LRC[i].first.second);
CO[LRC[i].first.first].pb(LRC[i].second);
}
rep(i, N - 1) {
G[i + 1].pb(i);
CO[i + 1].pb(0);
}
// ここからダイクストラ
vector<ll> D(N, -1);
vector<bool> used(N, false);
priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>>
q;
q.push({0, 0});
int cnt = 0;
while (!q.empty()) {
pair<ll, int> nowNode = q.top();
q.pop();
if (used[nowNode.second])
continue;
used[nowNode.second] = true;
D[nowNode.second] = nowNode.first;
rep(i, (int)G[nowNode.second].size()) {
// if(D[G[nowNode.second][i]] != -1 && D[G[nowNode.second][i]] <=
// D[nowNode.second] + nowNode.first) continue;
q.push({D[nowNode.second] + CO[nowNode.second][i], G[nowNode.second][i]});
cnt++;
}
}
// rep(i,N) cout << D[i] << endl;
// cout << cnt << endl;
cout << D[N - 1] << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#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()
#define pb push_back
#define mod 1000000007
using ll = long long;
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<pair<int, int>, ll>> LRC(M);
rep(i, M) {
cin >> LRC[i].first.first >> LRC[i].first.second >> LRC[i].second;
LRC[i].first.first--;
LRC[i].first.second--;
}
vector<vector<int>> G(N);
vector<vector<ll>> CO(N);
rep(i, M) {
G[LRC[i].first.first].pb(LRC[i].first.second);
CO[LRC[i].first.first].pb(LRC[i].second);
}
rep(i, N - 1) {
G[i + 1].pb(i);
CO[i + 1].pb(0);
}
// ここからダイクストラ
vector<ll> D(N, -1);
vector<bool> used(N, false);
priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>>
q;
q.push({0, 0});
int cnt = 0;
while (!q.empty()) {
pair<ll, int> nowNode = q.top();
q.pop();
if (used[nowNode.second])
continue;
used[nowNode.second] = true;
D[nowNode.second] = nowNode.first;
rep(i, (int)G[nowNode.second].size()) {
// if(D[G[nowNode.second][i]] != -1 && D[G[nowNode.second][i]] <=
// D[nowNode.second] + nowNode.first) continue;
q.push({D[nowNode.second] + CO[nowNode.second][i], G[nowNode.second][i]});
cnt++;
}
}
// rep(i,N) cout << D[i] << endl;
// cout << cnt << endl;
cout << D[N - 1] << endl;
return 0;
}
| replace | 24 | 25 | 24 | 25 | 0 | |
p02868 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define FORN(i, m, n) for (int(i) = (m); (i) <= (n); (i)++)
#define FORR(i, m, n) for (int(i) = (m); (i) >= (n); (i)--)
#define rep(i, n) FOR(i, 0, n)
#define repn(i, n) FORN(i, 1, n)
#define repr(i, n) FORR(i, n, 0)
#define repnr(i, n) FORR(i, n, 1)
#define co(n) cout << (n) << endl
#define cosp(n) cout << (n) << ' '
#define setp(n) cout << fixed << setprecision(n);
#define all(s) (s).begin(), (s).end()
#define pb push_back
#define mp make_pair
#define fs first
#define sc second
typedef long long ll;
typedef pair<ll, ll> P;
struct Edge {
int to;
int cost;
};
const ll INF = 1e9 + 1;
const ll LINF = 1e18 + 1;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const double PI = acos(-1);
const double EPS = 1e-9;
const int MAX_N = 1e5;
vector<vector<Edge>> tree;
ll dist[MAX_N] = {};
int main(void) {
int n, m;
cin >> n >> m;
tree.resize(n);
fill_n(dist, n, LINF);
repn(i, n - 1) {
Edge e = {i - 1, 0};
tree[i].pb(e);
}
rep(i, m) {
int l, r, c;
cin >> l >> r >> c;
l--;
r--;
Edge e = {r, c};
tree[l].pb(e);
}
priority_queue<P> q;
q.push(mp(0, 0));
while (!q.empty()) {
P p = q.top();
q.pop();
if (p.fs >= dist[p.sc])
continue;
dist[p.sc] = p.fs;
rep(i, tree[p.sc].size()) {
Edge e = tree[p.sc][i];
q.push(mp(p.fs + e.cost, e.to));
}
}
if (dist[n - 1] == LINF)
co(-1);
else
co(dist[n - 1]);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define FORN(i, m, n) for (int(i) = (m); (i) <= (n); (i)++)
#define FORR(i, m, n) for (int(i) = (m); (i) >= (n); (i)--)
#define rep(i, n) FOR(i, 0, n)
#define repn(i, n) FORN(i, 1, n)
#define repr(i, n) FORR(i, n, 0)
#define repnr(i, n) FORR(i, n, 1)
#define co(n) cout << (n) << endl
#define cosp(n) cout << (n) << ' '
#define setp(n) cout << fixed << setprecision(n);
#define all(s) (s).begin(), (s).end()
#define pb push_back
#define mp make_pair
#define fs first
#define sc second
typedef long long ll;
typedef pair<ll, ll> P;
struct Edge {
int to;
int cost;
};
const ll INF = 1e9 + 1;
const ll LINF = 1e18 + 1;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const double PI = acos(-1);
const double EPS = 1e-9;
const int MAX_N = 1e5;
vector<vector<Edge>> tree;
ll dist[MAX_N] = {};
int main(void) {
int n, m;
cin >> n >> m;
tree.resize(n);
fill_n(dist, n, LINF);
repn(i, n - 1) {
Edge e = {i - 1, 0};
tree[i].pb(e);
}
rep(i, m) {
int l, r, c;
cin >> l >> r >> c;
l--;
r--;
Edge e = {r, c};
tree[l].pb(e);
}
priority_queue<P, vector<P>, greater<P>> q;
q.push(mp(0, 0));
while (!q.empty()) {
P p = q.top();
q.pop();
if (p.fs >= dist[p.sc])
continue;
dist[p.sc] = p.fs;
rep(i, tree[p.sc].size()) {
Edge e = tree[p.sc][i];
q.push(mp(p.fs + e.cost, e.to));
}
}
if (dist[n - 1] == LINF)
co(-1);
else
co(dist[n - 1]);
return 0;
}
| replace | 55 | 56 | 55 | 56 | TLE | |
p02868 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
constexpr int N = 100010;
// https://smijake3.hatenablog.com/entry/2019/04/28/021457#%E5%8C%BA%E9%96%93chmin%E3%82%AF%E3%82%A8%E3%83%AARMQRSQ%E3%82%92%E5%87%A6%E7%90%86%E3%81%99%E3%82%8B%E5%AE%9F%E8%A3%85
class SegmentTree {
const ll inf = 1e18;
int n, n0;
ll max_v[4 * N], smax_v[4 * N];
ll sum[4 * N], max_c[4 * N];
void update_node_max(int k, ll x) {
sum[k] += (x - max_v[k]) * max_c[k];
max_v[k] = x;
}
void push(int k) {
if (max_v[k] < max_v[2 * k + 1]) {
update_node_max(2 * k + 1, max_v[k]);
}
if (max_v[k] < max_v[2 * k + 2]) {
update_node_max(2 * k + 2, max_v[k]);
}
}
void update(int k) {
sum[k] = sum[2 * k + 1] + sum[2 * k + 2];
if (max_v[2 * k + 1] < max_v[2 * k + 2]) {
max_v[k] = max_v[2 * k + 2];
max_c[k] = max_c[2 * k + 2];
smax_v[k] = max(max_v[2 * k + 1], smax_v[2 * k + 2]);
} else if (max_v[2 * k + 1] > max_v[2 * k + 2]) {
max_v[k] = max_v[2 * k + 1];
max_c[k] = max_c[2 * k + 1];
smax_v[k] = max(smax_v[2 * k + 1], max_v[2 * k + 2]);
} else {
max_v[k] = max_v[2 * k + 1];
max_c[k] = max_c[2 * k + 1] + max_c[2 * k + 2];
smax_v[k] = max(smax_v[2 * k + 1], smax_v[2 * k + 2]);
}
}
void _update_min(ll x, int a, int b, int k, int l, int r) {
if (b <= l || r <= a || max_v[k] <= x) {
return;
}
if (a <= l && r <= b && smax_v[k] < x) {
update_node_max(k, x);
return;
}
push(k);
_update_min(x, a, b, 2 * k + 1, l, (l + r) / 2);
_update_min(x, a, b, 2 * k + 2, (l + r) / 2, r);
update(k);
}
ll _query_max(int a, int b, int k, int l, int r) {
if (b <= l || r <= a) {
return 0;
}
if (a <= l && r <= b) {
return max_v[k];
}
push(k);
ll lv = _query_max(a, b, 2 * k + 1, l, (l + r) / 2);
ll rv = _query_max(a, b, 2 * k + 2, (l + r) / 2, r);
return max(lv, rv);
}
ll _query_sum(int a, int b, int k, int l, int r) {
if (b <= l || r <= a) {
return 0;
}
if (a <= l && r <= b) {
return sum[k];
}
push(k);
ll lv = _query_sum(a, b, 2 * k + 1, l, (l + r) / 2);
ll rv = _query_sum(a, b, 2 * k + 2, (l + r) / 2, r);
return lv + rv;
}
public:
SegmentTree(int n) : n(n) {
n0 = 1;
while (n0 < n)
n0 <<= 1;
for (int i = 0; i < n; ++i) {
max_v[n0 - 1 + i] = sum[n0 - 1 + i] = (i == 0 ? 0 : inf);
smax_v[n0 - 1 + i] = -inf;
max_c[n0 - 1 + i] = 1;
}
for (int i = n; i < n0; ++i) {
max_v[n0 - 1 + i] = smax_v[n0 - 1 + i] = -inf;
sum[n0 - 1 + i] = max_c[n0 - 1 + i] = 0;
}
for (int i = n0 - 2; i >= 0; i--)
update(i);
}
// range minimize query
void update_min(int a, int b, ll x) { return _update_min(x, a, b, 0, 0, n0); }
// range maximum query
ll query_max(int a, int b) { return _query_max(a, b, 0, 0, n0); }
// range sum query
ll query_sum(int a, int b) { return _query_sum(a, b, 0, 0, n0); }
};
constexpr int MAX_N = N;
using P = pair<ll, ll>;
SegmentTree st(MAX_N);
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<ll> l(m), r(m), c(m);
for (int i = 0; i < m; i++) {
cin >> l[i] >> r[i] >> c[i];
l[i]--;
}
vector<int> index(n);
iota(index.begin(), index.end(), 0);
sort(index.begin(), index.end(), [&](const int &lhs, const int &rhs) {
return P(l[lhs], r[lhs]) < P(l[rhs], r[rhs]);
});
for (int i = 0; i < m; i++) {
ll lx = l[index[i]], rx = r[index[i]];
ll cur = st.query_sum(lx, lx + 1);
st.update_min(lx, rx, cur + c[index[i]]);
}
ll ret = st.query_sum(n - 1, n);
cout << (ret == 1e18 ? -1 : ret) << endl;
}
| #include "bits/stdc++.h"
using namespace std;
using ll = long long;
constexpr int N = 100010;
// https://smijake3.hatenablog.com/entry/2019/04/28/021457#%E5%8C%BA%E9%96%93chmin%E3%82%AF%E3%82%A8%E3%83%AARMQRSQ%E3%82%92%E5%87%A6%E7%90%86%E3%81%99%E3%82%8B%E5%AE%9F%E8%A3%85
class SegmentTree {
const ll inf = 1e18;
int n, n0;
ll max_v[4 * N], smax_v[4 * N];
ll sum[4 * N], max_c[4 * N];
void update_node_max(int k, ll x) {
sum[k] += (x - max_v[k]) * max_c[k];
max_v[k] = x;
}
void push(int k) {
if (max_v[k] < max_v[2 * k + 1]) {
update_node_max(2 * k + 1, max_v[k]);
}
if (max_v[k] < max_v[2 * k + 2]) {
update_node_max(2 * k + 2, max_v[k]);
}
}
void update(int k) {
sum[k] = sum[2 * k + 1] + sum[2 * k + 2];
if (max_v[2 * k + 1] < max_v[2 * k + 2]) {
max_v[k] = max_v[2 * k + 2];
max_c[k] = max_c[2 * k + 2];
smax_v[k] = max(max_v[2 * k + 1], smax_v[2 * k + 2]);
} else if (max_v[2 * k + 1] > max_v[2 * k + 2]) {
max_v[k] = max_v[2 * k + 1];
max_c[k] = max_c[2 * k + 1];
smax_v[k] = max(smax_v[2 * k + 1], max_v[2 * k + 2]);
} else {
max_v[k] = max_v[2 * k + 1];
max_c[k] = max_c[2 * k + 1] + max_c[2 * k + 2];
smax_v[k] = max(smax_v[2 * k + 1], smax_v[2 * k + 2]);
}
}
void _update_min(ll x, int a, int b, int k, int l, int r) {
if (b <= l || r <= a || max_v[k] <= x) {
return;
}
if (a <= l && r <= b && smax_v[k] < x) {
update_node_max(k, x);
return;
}
push(k);
_update_min(x, a, b, 2 * k + 1, l, (l + r) / 2);
_update_min(x, a, b, 2 * k + 2, (l + r) / 2, r);
update(k);
}
ll _query_max(int a, int b, int k, int l, int r) {
if (b <= l || r <= a) {
return 0;
}
if (a <= l && r <= b) {
return max_v[k];
}
push(k);
ll lv = _query_max(a, b, 2 * k + 1, l, (l + r) / 2);
ll rv = _query_max(a, b, 2 * k + 2, (l + r) / 2, r);
return max(lv, rv);
}
ll _query_sum(int a, int b, int k, int l, int r) {
if (b <= l || r <= a) {
return 0;
}
if (a <= l && r <= b) {
return sum[k];
}
push(k);
ll lv = _query_sum(a, b, 2 * k + 1, l, (l + r) / 2);
ll rv = _query_sum(a, b, 2 * k + 2, (l + r) / 2, r);
return lv + rv;
}
public:
SegmentTree(int n) : n(n) {
n0 = 1;
while (n0 < n)
n0 <<= 1;
for (int i = 0; i < n; ++i) {
max_v[n0 - 1 + i] = sum[n0 - 1 + i] = (i == 0 ? 0 : inf);
smax_v[n0 - 1 + i] = -inf;
max_c[n0 - 1 + i] = 1;
}
for (int i = n; i < n0; ++i) {
max_v[n0 - 1 + i] = smax_v[n0 - 1 + i] = -inf;
sum[n0 - 1 + i] = max_c[n0 - 1 + i] = 0;
}
for (int i = n0 - 2; i >= 0; i--)
update(i);
}
// range minimize query
void update_min(int a, int b, ll x) { return _update_min(x, a, b, 0, 0, n0); }
// range maximum query
ll query_max(int a, int b) { return _query_max(a, b, 0, 0, n0); }
// range sum query
ll query_sum(int a, int b) { return _query_sum(a, b, 0, 0, n0); }
};
constexpr int MAX_N = N;
using P = pair<ll, ll>;
SegmentTree st(MAX_N);
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<ll> l(m), r(m), c(m);
for (int i = 0; i < m; i++) {
cin >> l[i] >> r[i] >> c[i];
l[i]--;
}
vector<int> index(m);
iota(index.begin(), index.end(), 0);
sort(index.begin(), index.end(), [&](const int &lhs, const int &rhs) {
return P(l[lhs], r[lhs]) < P(l[rhs], r[rhs]);
});
for (int i = 0; i < m; i++) {
ll lx = l[index[i]], rx = r[index[i]];
ll cur = st.query_sum(lx, lx + 1);
st.update_min(lx, rx, cur + c[index[i]]);
}
ll ret = st.query_sum(n - 1, n);
cout << (ret == 1e18 ? -1 : ret) << endl;
}
| replace | 134 | 135 | 134 | 135 | 0 | |
p02868 | C++ | Runtime Error | #include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using pli = pair<int64_t, int>;
using mii = map<int, int>;
struct node {
mii edge;
bool done = false;
int64_t cost = -1;
bool operator<(const node &rhs) const {
if (rhs.cost == -1 && this->cost == -1) {
return false;
} else if (rhs.cost == -1) {
return true;
} else if (this->cost == -1) {
return false;
}
return this->cost < rhs.cost;
}
bool operator>(const node &rhs) const { return rhs < *this; }
void update_cost(int64_t x) noexcept {
if (x < 0) {
cerr << "Illegal Argument in node.update_cost: x=" << x << endl;
exit(1);
}
if (this->cost == -1 || this->cost > x) {
this->cost = x;
}
}
};
int main() {
int N, M;
cin >> N >> M;
vector<node> nodes(N);
mii cover;
for (auto i = 0; i < M; i++) {
int L, R, C;
cin >> L >> R >> C;
if (cover.count(L - 1) == 0) {
cover[L - 1] = R - 1;
} else {
cover[L - 1] = max(cover[L - 1], R - 1);
}
if (nodes.at(L - 1).edge.count(R - 1) == 0) {
nodes.at(L - 1).edge[R - 1] = C;
} else {
nodes.at(L - 1).edge[R - 1] = min(nodes.at(L - 1).edge[R - 1], C);
}
if (nodes.at(R - 1).edge.count(L - 1) == 0) {
nodes.at(R - 1).edge[L - 1] = C;
} else {
nodes.at(R - 1).edge[L - 1] = min(nodes.at(R - 1).edge[L - 1], C);
}
}
if (cover.count(0) == 0) {
cout << -1 << endl;
return 0;
}
auto range = cover.at(0);
for (auto i = 0; i < cover.size() && i < range; i++) {
range = max(range, cover.at(i));
if (range == N - 1) {
break;
}
}
if (range != N - 1) {
cout << -1 << endl;
return 0;
}
for (auto i = N - 1; i > 0; i--) {
nodes.at(i).edge[i - 1] = 0;
}
priority_queue<pli, vector<pli>, greater<>> q;
nodes.at(0).cost = 0;
q.emplace(0, 0);
do {
auto top = q.top();
q.pop();
nodes.at(top.second).done = true;
for (auto e : nodes.at(top.second).edge) {
nodes.at(e.first).update_cost(top.first + e.second);
if (!nodes.at(e.first).done) {
q.emplace(nodes.at(e.first).cost, e.first);
}
}
} while (!q.empty());
cout << nodes.at(N - 1).cost << endl;
return 0;
}
| #include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using pli = pair<int64_t, int>;
using mii = map<int, int>;
struct node {
mii edge;
bool done = false;
int64_t cost = -1;
bool operator<(const node &rhs) const {
if (rhs.cost == -1 && this->cost == -1) {
return false;
} else if (rhs.cost == -1) {
return true;
} else if (this->cost == -1) {
return false;
}
return this->cost < rhs.cost;
}
bool operator>(const node &rhs) const { return rhs < *this; }
void update_cost(int64_t x) noexcept {
if (x < 0) {
cerr << "Illegal Argument in node.update_cost: x=" << x << endl;
exit(1);
}
if (this->cost == -1 || this->cost > x) {
this->cost = x;
}
}
};
int main() {
int N, M;
cin >> N >> M;
vector<node> nodes(N);
mii cover;
for (auto i = 0; i < M; i++) {
int L, R, C;
cin >> L >> R >> C;
if (cover.count(L - 1) == 0) {
cover[L - 1] = R - 1;
} else {
cover[L - 1] = max(cover[L - 1], R - 1);
}
if (nodes.at(L - 1).edge.count(R - 1) == 0) {
nodes.at(L - 1).edge[R - 1] = C;
} else {
nodes.at(L - 1).edge[R - 1] = min(nodes.at(L - 1).edge[R - 1], C);
}
if (nodes.at(R - 1).edge.count(L - 1) == 0) {
nodes.at(R - 1).edge[L - 1] = C;
} else {
nodes.at(R - 1).edge[L - 1] = min(nodes.at(R - 1).edge[L - 1], C);
}
}
if (cover.count(0) == 0) {
cout << -1 << endl;
return 0;
}
auto range = cover.at(0);
for (auto i = 1; i < N && i <= range; i++) {
if (cover.count(i) == 0) {
continue;
}
range = max(range, cover.at(i));
if (range == N - 1) {
break;
}
}
if (range != N - 1) {
cout << -1 << endl;
return 0;
}
for (auto i = N - 1; i > 0; i--) {
nodes.at(i).edge[i - 1] = 0;
}
priority_queue<pli, vector<pli>, greater<>> q;
nodes.at(0).cost = 0;
q.emplace(0, 0);
do {
auto top = q.top();
q.pop();
nodes.at(top.second).done = true;
for (auto e : nodes.at(top.second).edge) {
nodes.at(e.first).update_cost(top.first + e.second);
if (!nodes.at(e.first).done) {
q.emplace(nodes.at(e.first).cost, e.first);
}
}
} while (!q.empty());
cout << nodes.at(N - 1).cost << endl;
return 0;
}
| replace | 73 | 74 | 73 | 77 | 0 | |
p02868 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define debug(x) \
do { \
cerr << #x << ": " << x << "\n"; \
} while (0)
#define debugv(x) \
do { \
cerr << #x << ": "; \
for (auto &e : (x)) \
cerr << e << " "; \
cerr << "\n"; \
} while (0)
#define fori(i, n) for (int i = 0; i < (int)(n); ++i)
#define forn(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n); i >= 0; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
#define RETURN(x) \
do { \
cout << x << '\n'; \
return 0; \
} while (0)
#define FIRSTWIN \
do { \
cout << "Monocarp\n"; \
return 0; \
} while (0)
#define SECONDWIN \
do { \
cout << "Bicarp\n"; \
return 0; \
} while (0)
const int MAXN = 1e5 + 4;
const int MOD = 1e9 + 7;
const int INF = 1e9 + 1;
int N, M;
vector<pii> V[MAXN];
vector<LL> A[MAXN];
int main() {
#ifdef OJ
freopen("input.txt", "rt", stdin);
// freopen("output.txt", "wt", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N >> M;
fori(i, M) {
int l, r, c;
cin >> l >> r >> c;
l--;
r--;
V[l].eb(c, r);
}
multiset<LL> S;
S.insert(0);
A[1].pb(0);
fori(i, N) {
for (LL a : A[i]) {
assert(S.find(a) != S.end());
S.erase(a);
}
if (!S.size())
RETURN(-1);
LL mn = *S.begin();
if (i == N - 1) {
cout << mn << endl;
return 0;
}
for (auto v : V[i]) {
LL tmp = mn + v.fi;
S.insert(tmp);
A[v.se + 1].pb(tmp);
}
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define debug(x) \
do { \
cerr << #x << ": " << x << "\n"; \
} while (0)
#define debugv(x) \
do { \
cerr << #x << ": "; \
for (auto &e : (x)) \
cerr << e << " "; \
cerr << "\n"; \
} while (0)
#define fori(i, n) for (int i = 0; i < (int)(n); ++i)
#define forn(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n); i >= 0; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
#define RETURN(x) \
do { \
cout << x << '\n'; \
return 0; \
} while (0)
#define FIRSTWIN \
do { \
cout << "Monocarp\n"; \
return 0; \
} while (0)
#define SECONDWIN \
do { \
cout << "Bicarp\n"; \
return 0; \
} while (0)
const int MAXN = 1e5 + 4;
const int MOD = 1e9 + 7;
const int INF = 1e9 + 1;
int N, M;
vector<pii> V[MAXN];
vector<LL> A[MAXN];
int main() {
#ifdef OJ
freopen("input.txt", "rt", stdin);
// freopen("output.txt", "wt", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N >> M;
fori(i, M) {
int l, r, c;
cin >> l >> r >> c;
l--;
r--;
V[l].eb(c, r);
}
multiset<LL> S;
S.insert(0);
A[1].pb(0);
fori(i, N) {
for (LL a : A[i])
S.erase(S.find(a));
if (!S.size())
RETURN(-1);
LL mn = *S.begin();
if (i == N - 1) {
cout << mn << endl;
return 0;
}
for (auto v : V[i]) {
LL tmp = mn + v.fi;
S.insert(tmp);
A[v.se + 1].pb(tmp);
}
}
return 0;
}
| replace | 71 | 75 | 71 | 73 | 0 | |
p02868 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long LL;
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define RI(X) scanf("%d", &(X))
#define RII(X, Y) scanf("%d%d", &(X), &(Y))
#define RIII(X, Y, Z) scanf("%d%d%d", &(X), &(Y), &(Z))
#define DRI(X) \
int(X); \
scanf("%d", &X)
#define DRII(X, Y) \
int X, Y; \
scanf("%d%d", &X, &Y)
#define DRIII(X, Y, Z) \
int X, Y, Z; \
scanf("%d%d%d", &X, &Y, &Z)
#define RS(X) scanf("%s", (X))
#define CASET \
int ___T, case_n = 1; \
scanf("%d ", &___T); \
while (___T-- > 0)
#define MP make_pair
#define PB push_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define PII pair<int, int>
#define VI vector<int>
#define VL vector<long long>
#define VPII vector<pair<int, int>>
#define PLL pair<long long, long long>
#define VPLL vector<pair<long long, long long>>
#define F first
#define S second
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
set<pair<LL, int>> paths;
set<pair<int, pair<LL, int>>> eds;
DRII(n, m);
VI res(n);
REP(i, m) {
DRIII(l, r, c);
l--;
r--;
eds.insert({l, {c, r}});
}
paths.insert({0, 0});
int curr = 0;
auto it = eds.begin();
LL cc = 0;
while (curr < n - 1 and !paths.empty()) {
res[curr] = cc;
while (it != eds.end() and it->F <= curr) {
paths.insert({cc + (it->S).F, (it->S).S});
it++;
}
auto it2 = paths.begin();
while (it2 != paths.end() and it2->S <= curr)
paths.erase(it2++);
int next = it2->S;
cc = it2->F;
REPP(i, curr + 1, next + 1) { res[i] = cc; }
curr = next;
}
if (curr == n - 1) {
printf("%lld\n", cc);
} else {
printf("-1\n");
}
}
| #include <bits/stdc++.h>
typedef long long LL;
#define SZ(X) ((int)(X).size())
#define ALL(X) (X).begin(), (X).end()
#define REP(I, N) for (int I = 0; I < (N); ++I)
#define REPP(I, A, B) for (int I = (A); I < (B); ++I)
#define RI(X) scanf("%d", &(X))
#define RII(X, Y) scanf("%d%d", &(X), &(Y))
#define RIII(X, Y, Z) scanf("%d%d%d", &(X), &(Y), &(Z))
#define DRI(X) \
int(X); \
scanf("%d", &X)
#define DRII(X, Y) \
int X, Y; \
scanf("%d%d", &X, &Y)
#define DRIII(X, Y, Z) \
int X, Y, Z; \
scanf("%d%d%d", &X, &Y, &Z)
#define RS(X) scanf("%s", (X))
#define CASET \
int ___T, case_n = 1; \
scanf("%d ", &___T); \
while (___T-- > 0)
#define MP make_pair
#define PB push_back
#define MS0(X) memset((X), 0, sizeof((X)))
#define MS1(X) memset((X), -1, sizeof((X)))
#define LEN(X) strlen(X)
#define PII pair<int, int>
#define VI vector<int>
#define VL vector<long long>
#define VPII vector<pair<int, int>>
#define PLL pair<long long, long long>
#define VPLL vector<pair<long long, long long>>
#define F first
#define S second
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
set<pair<LL, int>> paths;
set<pair<int, pair<LL, int>>> eds;
DRII(n, m);
VI res(n);
REP(i, m) {
DRIII(l, r, c);
l--;
r--;
eds.insert({l, {c, r}});
}
paths.insert({0, 0});
int curr = 0;
auto it = eds.begin();
LL cc = 0;
while (curr < n - 1 and !paths.empty()) {
res[curr] = cc;
while (it != eds.end() and it->F <= curr) {
paths.insert({cc + (it->S).F, (it->S).S});
it++;
}
auto it2 = paths.begin();
while (it2 != paths.end() and it2->S <= curr)
paths.erase(it2++);
if (paths.empty())
continue;
int next = it2->S;
cc = it2->F;
REPP(i, curr + 1, next + 1) { res[i] = cc; }
curr = next;
}
if (curr == n - 1) {
printf("%lld\n", cc);
} else {
printf("-1\n");
}
}
| insert | 64 | 64 | 64 | 66 | 0 | |
p02868 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define popcnt(x) __builtin_popcount(x)
#define inf 0x3f3f3f3f
#define watch(x) cout << (#x) << " is " << (x) << endl
#define rand() (rand() << 15 | rand())
using namespace std;
typedef long long ll;
#define EPS 1e-9
#define PI acos(-1.0)
const int N = 1e5 + 4;
vector<pair<int, int>> add[N];
vector<long long> er[N];
long long dp[N];
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n, m;
cin >> n >> m;
for (int i = 0; i < m; ++i) {
int l, r, c;
cin >> l >> r >> c;
add[l].push_back({r, c});
}
multiset<long long> ms;
for (int i = 1; i <= n; ++i) {
for (int c : er[i])
ms.erase(ms.find(c));
if (i > 1)
dp[i] = (ms.empty() ? -LLONG_MAX / 2 : *ms.begin());
else
dp[i] = 0;
for (auto p : add[i]) {
ms.insert(dp[i] + p.second);
er[p.first + 1].push_back(dp[i] + p.second);
}
}
cout << (dp[n] < 0 ? -1 : dp[n]) << "\n";
} | #include <bits/stdc++.h>
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define popcnt(x) __builtin_popcount(x)
#define inf 0x3f3f3f3f
#define watch(x) cout << (#x) << " is " << (x) << endl
#define rand() (rand() << 15 | rand())
using namespace std;
typedef long long ll;
#define EPS 1e-9
#define PI acos(-1.0)
const int N = 1e5 + 4;
vector<pair<int, int>> add[N];
vector<long long> er[N];
long long dp[N];
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n, m;
cin >> n >> m;
for (int i = 0; i < m; ++i) {
int l, r, c;
cin >> l >> r >> c;
add[l].push_back({r, c});
}
multiset<long long> ms;
for (int i = 1; i <= n; ++i) {
for (long long c : er[i])
ms.erase(ms.find(c));
if (i > 1)
dp[i] = (ms.empty() ? -LLONG_MAX / 2 : *ms.begin());
else
dp[i] = 0;
for (auto p : add[i]) {
ms.insert(dp[i] + p.second);
er[p.first + 1].push_back(dp[i] + p.second);
}
}
cout << (dp[n] < 0 ? -1 : dp[n]) << "\n";
} | replace | 28 | 29 | 28 | 29 | 0 | |
p02868 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <utility>
#include <vector>
using ll_t = long long;
using pii = std::pair<int, int>;
const int MAXN = (int)1e5 + 1;
const ll_t INF = (ll_t)1e15;
struct SegmentTree {
struct Node {
int l, r;
ll_t tag; // 这个区间内，<=tag的值不变，>tag的值改为tag.
};
Node node[MAXN];
inline int ls(int p) { return p << 1; }
inline int rs(int p) { return p << 1 | 1; }
void PushUp(int rt) {
node[rt].tag = std::max(node[ls(rt)].tag, node[rs(rt)].tag);
}
void PushDown(int rt) {
if (node[ls(rt)].tag > node[rt].tag)
node[ls(rt)].tag = node[rt].tag;
if (node[rs(rt)].tag > node[rt].tag)
node[rs(rt)].tag = node[rt].tag;
}
void Build(int rt, int l, int r) {
node[rt].l = l;
node[rt].r = r;
node[rt].tag = INF;
if (l == r && l == 1)
node[rt].tag = 0;
if (l == r)
return;
int mid = l + r >> 1;
Build(ls(rt), l, mid);
Build(rs(rt), mid + 1, r);
}
void Modify(int l, int r, ll_t x, int rt) {
if (l <= node[rt].l && node[rt].r <= r) {
if (node[rt].tag > x)
node[rt].tag = x;
return;
}
PushDown(rt);
int mid = node[rt].l + node[rt].r >> 1;
if (l <= mid)
Modify(l, r, x, ls(rt));
if (r > mid)
Modify(l, r, x, rs(rt));
PushUp(rt);
}
ll_t Query(int pos, int rt) {
if (node[rt].l == node[rt].r)
return node[rt].tag;
PushDown(rt);
int mid = node[rt].l + node[rt].r >> 1;
ll_t res;
if (pos <= mid)
res = Query(pos, ls(rt));
else
res = Query(pos, rs(rt));
PushUp(rt);
return res;
}
};
std::vector<pii> edges[MAXN];
SegmentTree tree;
ll_t solve(int n) {
tree.Build(1, 1, n);
for (int i = 1; i < n; ++i) {
ll_t dis = tree.Query(i, 1);
// printf("pos = %d dis = %lld\n", i, dis);
for (const auto &edge : edges[i]) {
int r = edge.first, c = edge.second;
tree.Modify(i + 1, r, dis + c, 1);
}
}
ll_t res = tree.Query(n, 1);
if (res >= INF)
res = -1;
return res;
}
int main() {
int n, m;
scanf("%d %d", &n, &m);
for (int i = 0; i < m; ++i) {
int l, r, c;
scanf("%d %d %d", &l, &r, &c);
edges[l].emplace_back(r, c);
}
printf("%lld\n", solve(n));
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <utility>
#include <vector>
using ll_t = long long;
using pii = std::pair<int, int>;
const int MAXN = (int)1e5 + 1;
const ll_t INF = (ll_t)1e15;
struct SegmentTree {
struct Node {
int l, r;
ll_t tag; // 这个区间内，<=tag的值不变，>tag的值改为tag.
};
Node node[MAXN * 4];
inline int ls(int p) { return p << 1; }
inline int rs(int p) { return p << 1 | 1; }
void PushUp(int rt) {
node[rt].tag = std::max(node[ls(rt)].tag, node[rs(rt)].tag);
}
void PushDown(int rt) {
if (node[ls(rt)].tag > node[rt].tag)
node[ls(rt)].tag = node[rt].tag;
if (node[rs(rt)].tag > node[rt].tag)
node[rs(rt)].tag = node[rt].tag;
}
void Build(int rt, int l, int r) {
node[rt].l = l;
node[rt].r = r;
node[rt].tag = INF;
if (l == r && l == 1)
node[rt].tag = 0;
if (l == r)
return;
int mid = l + r >> 1;
Build(ls(rt), l, mid);
Build(rs(rt), mid + 1, r);
}
void Modify(int l, int r, ll_t x, int rt) {
if (l <= node[rt].l && node[rt].r <= r) {
if (node[rt].tag > x)
node[rt].tag = x;
return;
}
PushDown(rt);
int mid = node[rt].l + node[rt].r >> 1;
if (l <= mid)
Modify(l, r, x, ls(rt));
if (r > mid)
Modify(l, r, x, rs(rt));
PushUp(rt);
}
ll_t Query(int pos, int rt) {
if (node[rt].l == node[rt].r)
return node[rt].tag;
PushDown(rt);
int mid = node[rt].l + node[rt].r >> 1;
ll_t res;
if (pos <= mid)
res = Query(pos, ls(rt));
else
res = Query(pos, rs(rt));
PushUp(rt);
return res;
}
};
std::vector<pii> edges[MAXN];
SegmentTree tree;
ll_t solve(int n) {
tree.Build(1, 1, n);
for (int i = 1; i < n; ++i) {
ll_t dis = tree.Query(i, 1);
// printf("pos = %d dis = %lld\n", i, dis);
for (const auto &edge : edges[i]) {
int r = edge.first, c = edge.second;
tree.Modify(i + 1, r, dis + c, 1);
}
}
ll_t res = tree.Query(n, 1);
if (res >= INF)
res = -1;
return res;
}
int main() {
int n, m;
scanf("%d %d", &n, &m);
for (int i = 0; i < m; ++i) {
int l, r, c;
scanf("%d %d %d", &l, &r, &c);
edges[l].emplace_back(r, c);
}
printf("%lld\n", solve(n));
return 0;
}
| replace | 15 | 16 | 15 | 16 | 0 | |
p02868 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const ll N = 1e5 + 5, mod = 1e15;
ll dist[N];
vector<pii> adj[N];
ll n, m;
void dij() {
for (int i = 0; i < n; i++)
dist[i] = mod;
set<pii> s;
dist[0] = 0;
s.insert({0, 0});
while (!s.empty()) {
int v = (*s.begin()).second;
s.erase(s.begin());
for (auto e : adj[v]) {
int w = e.second, u = e.first;
if (dist[u] > dist[v] + w) {
s.erase({dist[u], u});
dist[u] = dist[v] + w;
s.insert({dist[u], u});
}
}
}
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n >> m;
vector<pair<pii, int>> edge;
for (int i = 0; i < n - 1; i++) {
adj[i + 1].push_back({i, 0});
}
for (int i = 0; i < m; i++) {
int v, u, w;
cin >> v >> u >> w;
v--, u--;
adj[v].push_back({u, w});
adj[u].push_back({v, w});
}
dij();
if (dist[n - 1] == mod)
cout << -1 << "\n";
else
cout << dist[n - 1] << "\n";
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
const ll N = 1e5 + 5, mod = 1e15;
ll dist[N];
vector<pii> adj[N];
ll n, m;
void dij() {
for (int i = 0; i < n; i++)
dist[i] = mod;
set<pii> s;
dist[0] = 0;
s.insert({0, 0});
while (!s.empty()) {
int v = (*s.begin()).second;
s.erase(s.begin());
for (auto e : adj[v]) {
int w = e.second, u = e.first;
if (dist[u] > dist[v] + w) {
s.erase({dist[u], u});
dist[u] = dist[v] + w;
s.insert({dist[u], u});
}
}
}
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cin >> n >> m;
vector<pair<pii, int>> edge;
for (int i = 0; i < n - 1; i++) {
adj[i + 1].push_back({i, 0});
}
for (int i = 0; i < m; i++) {
int v, u, w;
cin >> v >> u >> w;
v--, u--;
adj[v].push_back({u, w});
adj[u].push_back({v, w});
}
dij();
if (dist[n - 1] == mod)
cout << -1 << "\n";
else
cout << dist[n - 1] << "\n";
} | replace | 4 | 5 | 4 | 5 | TLE | |
p02868 | C++ | Runtime Error | #include <cstdio>
#include <cstdlib>
#include <vector>
using namespace std;
const long long TINF = 100000000000000000ll;
template <class T> class segmintree {
private:
T ragin(int i, int j, int k, int a, int b) {
return a <= j && k <= b ? seg[i]
: k <= a || b <= j ? TINF
: min(ragin(2 * i, j, (j + k) / 2, a, b),
ragin(2 * i + 1, (j + k) / 2, k, a, b));
}
public:
T *seg;
int S;
segmintree(int n) {
S = 0;
while ((1 << S) <= n)
S++;
seg = (T *)calloc(sizeof(T), 1 << (S + 1));
for (int i = 0; i < 1 << (S + 1); i++) {
seg[i + (1 << S)] = TINF;
}
}
void set(int i, T k) {
int p = i + (1 << S);
seg[p] = k;
while (p > 1) {
p /= 2;
seg[p] = min(seg[2 * p], seg[2 * p + 1]);
}
}
T rag(int a, int b) { return ragin(1, 0, 1 << S, a, b); }
T val(int i) {
int p = i + (1 << S);
return seg[p];
}
};
int main() {
int n, m;
scanf("%d%d", &n, &m);
vector<int> L(m), R(m);
vector<vector<int>> E(n);
vector<long long> C(m);
for (int i = 0; i < m; i++) {
scanf("%d%d%lld", &L[i], &R[i], &C[i]);
L[i]--, R[i]--;
E[R[i]].push_back(i);
}
segmintree<long long> seg(n + 1);
seg.set(0, 0);
for (int i = 1; i < n; i++) {
long long V = TINF;
for (int x = 0; x < E[i].size(); x++) {
int j = E[i][x];
V = min(V, seg.rag(L[j], i) + C[j]);
// printf("%d %d %lld\n",L[j],i,seg.rag(L[j],i)+C[j]);
}
seg.set(i, V);
}
long long ans = seg.val(n - 1);
printf("%lld\n", ans == TINF ? -1 : ans);
return 0;
}
| #include <cstdio>
#include <cstdlib>
#include <vector>
using namespace std;
const long long TINF = 100000000000000000ll;
template <class T> class segmintree {
private:
T ragin(int i, int j, int k, int a, int b) {
return a <= j && k <= b ? seg[i]
: k <= a || b <= j ? TINF
: min(ragin(2 * i, j, (j + k) / 2, a, b),
ragin(2 * i + 1, (j + k) / 2, k, a, b));
}
public:
T *seg;
int S;
segmintree(int n) {
S = 0;
while ((1 << S) <= n)
S++;
seg = (T *)calloc(sizeof(T), 1 << (S + 1));
for (int i = 0; i < 1 << (S + 1); i++) {
seg[i] = TINF;
}
}
void set(int i, T k) {
int p = i + (1 << S);
seg[p] = k;
while (p > 1) {
p /= 2;
seg[p] = min(seg[2 * p], seg[2 * p + 1]);
}
}
T rag(int a, int b) { return ragin(1, 0, 1 << S, a, b); }
T val(int i) {
int p = i + (1 << S);
return seg[p];
}
};
int main() {
int n, m;
scanf("%d%d", &n, &m);
vector<int> L(m), R(m);
vector<vector<int>> E(n);
vector<long long> C(m);
for (int i = 0; i < m; i++) {
scanf("%d%d%lld", &L[i], &R[i], &C[i]);
L[i]--, R[i]--;
E[R[i]].push_back(i);
}
segmintree<long long> seg(n + 1);
seg.set(0, 0);
for (int i = 1; i < n; i++) {
long long V = TINF;
for (int x = 0; x < E[i].size(); x++) {
int j = E[i][x];
V = min(V, seg.rag(L[j], i) + C[j]);
// printf("%d %d %lld\n",L[j],i,seg.rag(L[j],i)+C[j]);
}
seg.set(i, V);
}
long long ans = seg.val(n - 1);
printf("%lld\n", ans == TINF ? -1 : ans);
return 0;
}
| replace | 26 | 27 | 26 | 27 | -6 | malloc(): corrupted top size
|
p02868 | C++ | Time Limit Exceeded | #pragma target("avx")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define INF_LL 100000000000000000LL
#define INF 200000000
#define MOD 998244353
#define ll long long
#define all(x) x.begin(), x.end()
#define REP(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
// typedef float double;
// typedef priority_queue prique;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<P> vp;
typedef vector<ll> vl;
typedef vector<vi> matrix;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int sign[2] = {1, -1};
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
ll modpow(ll a, ll b, ll m) {
if (b == 0)
return 1;
ll t = modpow(a, b / 2, m);
if (b & 1) {
return (t * t % m) * a % m;
} else {
return t * t % m;
}
}
struct edge {
int to;
ll cost;
edge(int t, ll c) { to = t, cost = c; }
};
vector<ll> dijkstra(vector<vector<edge>> &g, int start, int n) {
priority_queue<P, vector<P>, greater<P>> que;
vector<ll> dist(n, INF_LL);
dist[start] = 0;
que.push(P(0, start));
while (!que.empty()) {
P p = que.top();
que.pop();
int v = p.second;
if (dist[v] < p.first)
continue;
for (edge e : g[v]) {
if (dist[e.to] > dist[v] + e.cost) {
dist[e.to] = dist[v] + e.cost;
que.push(P(dist[e.to], e.to));
}
}
}
return dist;
}
signed main() {
int n, m;
cin >> n >> m;
vector<vector<edge>> g(n);
rep(i, n - 1) { g[i + 1].push_back({i, 0}); }
rep(i, m) {
int l, r;
ll c;
cin >> l >> r >> c;
g[l - 1].push_back({r - 1, c});
}
vl dist = dijkstra(g, 0, n);
if (dist[n - 1] == INF_LL) {
cout << -1 << endl;
} else {
cout << dist[n - 1] << endl;
}
return 0;
}
| #pragma target("avx")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define INF_LL 100000000000000000LL
#define INF 200000000
#define MOD 998244353
#define ll long long
#define all(x) x.begin(), x.end()
#define REP(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) REP(i, 0, n)
// typedef float double;
// typedef priority_queue prique;
typedef pair<ll, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<P> vp;
typedef vector<ll> vl;
typedef vector<vi> matrix;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int sign[2] = {1, -1};
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
ll modpow(ll a, ll b, ll m) {
if (b == 0)
return 1;
ll t = modpow(a, b / 2, m);
if (b & 1) {
return (t * t % m) * a % m;
} else {
return t * t % m;
}
}
struct edge {
int to;
ll cost;
edge(int t, ll c) { to = t, cost = c; }
};
vector<ll> dijkstra(vector<vector<edge>> &g, int start, int n) {
priority_queue<P, vector<P>, greater<P>> que;
vector<ll> dist(n, INF_LL);
dist[start] = 0;
que.push(P(0, start));
while (!que.empty()) {
P p = que.top();
que.pop();
int v = p.second;
if (dist[v] < p.first)
continue;
for (edge e : g[v]) {
if (dist[e.to] > dist[v] + e.cost) {
dist[e.to] = dist[v] + e.cost;
que.push(P(dist[e.to], e.to));
}
}
}
return dist;
}
signed main() {
int n, m;
cin >> n >> m;
vector<vector<edge>> g(n);
rep(i, n - 1) { g[i + 1].push_back({i, 0}); }
rep(i, m) {
int l, r;
ll c;
cin >> l >> r >> c;
g[l - 1].push_back({r - 1, c});
}
vl dist = dijkstra(g, 0, n);
if (dist[n - 1] == INF_LL) {
cout << -1 << endl;
} else {
cout << dist[n - 1] << endl;
}
return 0;
}
| replace | 14 | 15 | 14 | 15 | TLE | |
p02868 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MX = 100005;
const ll INF = 1000000000LL * 1000000000LL;
int n;
vector<pair<int, int>> neigh[4 * MX];
struct {
int L, R;
int pl, pr;
} T[2 * MX];
int nxt;
int buildTree1(int L, int R) {
if (L == R)
return L;
int cur = nxt++;
T[cur].L = L;
T[cur].R = R;
if (L < R) {
T[cur].pl = buildTree1(L, (L + R) / 2);
T[cur].pr = buildTree1((L + R) / 2 + 1, R);
neigh[cur].emplace_back(T[cur].pl, 0);
neigh[cur].emplace_back(T[cur].pr, 0);
}
return cur;
}
int buildTree2(int L, int R) {
if (L == R)
return L;
int cur = nxt++;
T[cur].L = L;
T[cur].R = R;
if (L < R) {
T[cur].pl = buildTree2(L, (L + R) / 2);
T[cur].pr = buildTree2((L + R) / 2 + 1, R);
neigh[T[cur].pl].emplace_back(cur, 0);
neigh[T[cur].pr].emplace_back(cur, 0);
}
return cur;
}
void add1(int L, int R, int to, int c, int cur) {
if (L <= T[cur].L && R >= T[cur].R) {
neigh[to].emplace_back(cur, 0);
return;
}
if (L <= T[T[cur].pl].R) {
add1(L, R, to, c, T[cur].pl);
}
if (T[T[cur].pr].L <= R) {
add1(L, R, to, c, T[cur].pr);
}
}
void add2(int L, int R, int to, int c, int cur) {
if (L <= T[cur].L && R >= T[cur].R) {
neigh[cur].emplace_back(to, c);
return;
}
if (L <= T[T[cur].pl].R) {
add2(L, R, to, c, T[cur].pl);
}
if (T[T[cur].pr].L <= R) {
add2(L, R, to, c, T[cur].pr);
}
}
ll d[4 * MX];
int main() {
int m;
ignore = scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++)
T[i].L = T[i].R = i;
nxt = n + 1;
int rt1 = buildTree1(1, n);
int rt2 = buildTree2(1, n);
while (m--) {
int l, r, c;
ignore = scanf("%d %d %d", &l, &r, &c);
add1(l, r, nxt, c, rt1);
add2(l, r, nxt, c, rt2);
nxt++;
}
/*
for (int v = 1; v < nxt; v++) {
printf("%d: ", v);
for (auto e : neigh[v]) {
printf("(%d %d) ", e.first, e.second);
}
printf("\n");
}
*/
set<pair<ll, int>> S;
for (int i = 1; i < 4 * MX; i++)
d[i] = INF;
d[1] = 0;
S.insert({0, 1});
while (!S.empty()) {
auto cur = *S.begin();
S.erase(S.begin());
int v = cur.second;
if (cur.first != d[v])
continue;
for (auto e : neigh[v]) {
if (d[e.first] > d[v] + e.second) {
d[e.first] = d[v] + e.second;
S.insert({d[e.first], e.first});
}
}
}
if (d[n] == INF) {
printf("-1\n");
return 0;
}
cout << d[n] << "\n";
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MX = 100005;
const ll INF = 1000000000LL * 1000000000LL;
int n;
vector<pair<int, int>> neigh[4 * MX];
struct {
int L, R;
int pl, pr;
} T[4 * MX];
int nxt;
int buildTree1(int L, int R) {
if (L == R)
return L;
int cur = nxt++;
T[cur].L = L;
T[cur].R = R;
if (L < R) {
T[cur].pl = buildTree1(L, (L + R) / 2);
T[cur].pr = buildTree1((L + R) / 2 + 1, R);
neigh[cur].emplace_back(T[cur].pl, 0);
neigh[cur].emplace_back(T[cur].pr, 0);
}
return cur;
}
int buildTree2(int L, int R) {
if (L == R)
return L;
int cur = nxt++;
T[cur].L = L;
T[cur].R = R;
if (L < R) {
T[cur].pl = buildTree2(L, (L + R) / 2);
T[cur].pr = buildTree2((L + R) / 2 + 1, R);
neigh[T[cur].pl].emplace_back(cur, 0);
neigh[T[cur].pr].emplace_back(cur, 0);
}
return cur;
}
void add1(int L, int R, int to, int c, int cur) {
if (L <= T[cur].L && R >= T[cur].R) {
neigh[to].emplace_back(cur, 0);
return;
}
if (L <= T[T[cur].pl].R) {
add1(L, R, to, c, T[cur].pl);
}
if (T[T[cur].pr].L <= R) {
add1(L, R, to, c, T[cur].pr);
}
}
void add2(int L, int R, int to, int c, int cur) {
if (L <= T[cur].L && R >= T[cur].R) {
neigh[cur].emplace_back(to, c);
return;
}
if (L <= T[T[cur].pl].R) {
add2(L, R, to, c, T[cur].pl);
}
if (T[T[cur].pr].L <= R) {
add2(L, R, to, c, T[cur].pr);
}
}
ll d[4 * MX];
int main() {
int m;
ignore = scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++)
T[i].L = T[i].R = i;
nxt = n + 1;
int rt1 = buildTree1(1, n);
int rt2 = buildTree2(1, n);
while (m--) {
int l, r, c;
ignore = scanf("%d %d %d", &l, &r, &c);
add1(l, r, nxt, c, rt1);
add2(l, r, nxt, c, rt2);
nxt++;
}
/*
for (int v = 1; v < nxt; v++) {
printf("%d: ", v);
for (auto e : neigh[v]) {
printf("(%d %d) ", e.first, e.second);
}
printf("\n");
}
*/
set<pair<ll, int>> S;
for (int i = 1; i < 4 * MX; i++)
d[i] = INF;
d[1] = 0;
S.insert({0, 1});
while (!S.empty()) {
auto cur = *S.begin();
S.erase(S.begin());
int v = cur.second;
if (cur.first != d[v])
continue;
for (auto e : neigh[v]) {
if (d[e.first] > d[v] + e.second) {
d[e.first] = d[v] + e.second;
S.insert({d[e.first], e.first});
}
}
}
if (d[n] == INF) {
printf("-1\n");
return 0;
}
cout << d[n] << "\n";
}
| replace | 14 | 15 | 14 | 15 | 0 | |
p02868 | C++ | Runtime Error | #include <bits/stdc++.h> //Written by ThiDaiLoc
using namespace std; // Team Three Wolves
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> trp;
typedef vector<ll> vi;
typedef vector<pll> vp;
#define fu(i, a, b) for (ll i = a; i <= b; i++)
#define f1(i, n) for (ll i = 1; i <= n; i++)
#define fs(i, s) for (ll i = 0; i + 1 <= s.length(); i++)
#define fd(i, b, a) for (ll i = b; i >= a; i--)
#define fuv(i, a) for (ll i = 0; i < a.size(); i++)
#define fdv(i, a) for (ll i = (ll)a.size() - 1; i >= 0; i--)
#define ms(a, x) memset(a, x, sizeof a)
#define prec(n) fixed << setprecision(n)
#define uni(a) (a).erase(unique(all(a)), (a).end())
#define pb(i) push_back(i)
#define popb() pop_back()
#define sc(a) cin >> a
#define sc2(a, b) cin >> a >> b
#define pr(a) cout << a << endl
#define pr2(a, b) cout << a << " " << b << endl
#define rpr(a) return cout << a << endl, 0
#define prY cout << "YES" << endl
#define prN cout << "NO" << endl
#define bit(n, i) (((n) >> (i)) & 1)
#define lowb(a, n, x) lower_bound(a, a + n, x) - a
#define lowb2(a, x) lower_bound(all(a), x) - a.begin()
#define all(x) (x).begin(), (x).end()
#define sz(a) (ll) a.size()
#define le(s) (ll) s.length()
#define ast(x, a, b) assert(x >= a and x <= b)
#define re return
#define mp(a, b) make_pair(a, b)
#define mp3(a, b, c) make_pair(a, make_pair(b, c))
#define se second
#define fi first
#define sse second.second
#define sfi second.first
#define debug(x) cerr << #x << " = " << x << endl
#define INPUT freopen("locin.txt", "r", stdin)
#define OUTPUT freopen("locout.txt", "w", stdout)
inline ll isqrt(ll k) {
ll r = sqrt(k) + 1;
while (r * r > k)
r--;
return r;
}
inline ll icbrt(ll k) {
ll r = cbrt(k) + 1;
while (r * r * r > k)
r--;
return r;
}
inline ll mnz(ll &a, ll b) { return a = (a > b ? b : a); }
inline ll mxz(ll &a, ll b) { return a = (a < b ? b : a); }
inline string toString(ll n) {
stringstream ss;
ss << n;
return ss.str();
}
double const eps = 1e-6;
ll const Base = 998244353, oo = 1e17, MAXN = 1e5;
class node {
public:
ll val, l, r;
};
node segtree[4 * MAXN + 5];
void Init(ll x, ll l, ll r) {
segtree[x].val = oo;
segtree[x].l = l;
segtree[x].r = r;
if (l == r)
re;
ll mid = (l + r) >> 1LL;
Init(x << 1, l, mid);
Init((x << 1) | 1, mid + 1, r);
}
void inline Upd(ll x, ll u, ll v, ll val) {
if (u > segtree[x].r or v < segtree[x].l)
re;
if (u <= segtree[x].l and v >= segtree[x].r) {
mnz(segtree[x].val, val);
re;
}
Upd(x << 1, u, v, val);
Upd((x << 1) | 1, u, v, val);
}
ll inline Get(ll x, ll p) {
if (segtree[x].l > p or segtree[x].r < p)
re oo;
re min(segtree[x].val, min(Get(x << 1, p), Get(((x << 1) | 1), p)));
}
vp store[MAXN + 5];
ll Solves() {
ll n, m, k, cnt = 0, ans = 1, x, y, q, c, sum = 0, v, t;
// PROCESS IN HERE
sc(n);
sc(m);
Init(1, 1, n);
Upd(1, 1, 1, 0);
while (m--) {
sc2(x, y);
sc(c);
store[x].pb(mp(y, c));
}
f1(i, n) {
v = Get(1, i);
fuv(j, store[i]) { Upd(1, i, store[i][j].fi, v + store[i][j].se); }
}
c = Get(1, n);
if (c == oo)
c = -1;
pr(c);
re 0;
// Hack it if you can :)
}
int main() {
// INPUT;
if (fopen("locin.txt", "r"))
INPUT;
ll JUDGE_ONLINE = 1;
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll test = 1;
// sc(test);
fu(T, 1, test) {
// cout<<"Case #"<<T<<": ";
Solves();
}
if (!JUDGE_ONLINE)
cout << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
} | #include <bits/stdc++.h> //Written by ThiDaiLoc
using namespace std; // Team Three Wolves
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ll, pll> trp;
typedef vector<ll> vi;
typedef vector<pll> vp;
#define fu(i, a, b) for (ll i = a; i <= b; i++)
#define f1(i, n) for (ll i = 1; i <= n; i++)
#define fs(i, s) for (ll i = 0; i + 1 <= s.length(); i++)
#define fd(i, b, a) for (ll i = b; i >= a; i--)
#define fuv(i, a) for (ll i = 0; i < a.size(); i++)
#define fdv(i, a) for (ll i = (ll)a.size() - 1; i >= 0; i--)
#define ms(a, x) memset(a, x, sizeof a)
#define prec(n) fixed << setprecision(n)
#define uni(a) (a).erase(unique(all(a)), (a).end())
#define pb(i) push_back(i)
#define popb() pop_back()
#define sc(a) cin >> a
#define sc2(a, b) cin >> a >> b
#define pr(a) cout << a << endl
#define pr2(a, b) cout << a << " " << b << endl
#define rpr(a) return cout << a << endl, 0
#define prY cout << "YES" << endl
#define prN cout << "NO" << endl
#define bit(n, i) (((n) >> (i)) & 1)
#define lowb(a, n, x) lower_bound(a, a + n, x) - a
#define lowb2(a, x) lower_bound(all(a), x) - a.begin()
#define all(x) (x).begin(), (x).end()
#define sz(a) (ll) a.size()
#define le(s) (ll) s.length()
#define ast(x, a, b) assert(x >= a and x <= b)
#define re return
#define mp(a, b) make_pair(a, b)
#define mp3(a, b, c) make_pair(a, make_pair(b, c))
#define se second
#define fi first
#define sse second.second
#define sfi second.first
#define debug(x) cerr << #x << " = " << x << endl
#define INPUT freopen("locin.txt", "r", stdin)
#define OUTPUT freopen("locout.txt", "w", stdout)
inline ll isqrt(ll k) {
ll r = sqrt(k) + 1;
while (r * r > k)
r--;
return r;
}
inline ll icbrt(ll k) {
ll r = cbrt(k) + 1;
while (r * r * r > k)
r--;
return r;
}
inline ll mnz(ll &a, ll b) { return a = (a > b ? b : a); }
inline ll mxz(ll &a, ll b) { return a = (a < b ? b : a); }
inline string toString(ll n) {
stringstream ss;
ss << n;
return ss.str();
}
double const eps = 1e-6;
ll const Base = 998244353, oo = 1e17, MAXN = 1e5;
class node {
public:
ll val, l, r;
};
node segtree[4 * MAXN + 5];
void Init(ll x, ll l, ll r) {
segtree[x].val = oo;
segtree[x].l = l;
segtree[x].r = r;
if (l == r)
re;
ll mid = (l + r) >> 1LL;
Init(x << 1, l, mid);
Init((x << 1) | 1, mid + 1, r);
}
void inline Upd(ll x, ll u, ll v, ll val) {
if (u > segtree[x].r or v < segtree[x].l)
re;
if (u <= segtree[x].l and v >= segtree[x].r) {
mnz(segtree[x].val, val);
re;
}
Upd(x << 1, u, v, val);
Upd((x << 1) | 1, u, v, val);
}
ll inline Get(ll x, ll p) {
if (segtree[x].l > p or segtree[x].r < p)
re oo;
if (segtree[x].r == segtree[x].l)
re segtree[x].val;
re min(segtree[x].val, min(Get(x << 1, p), Get(((x << 1) | 1), p)));
}
vp store[MAXN + 5];
ll Solves() {
ll n, m, k, cnt = 0, ans = 1, x, y, q, c, sum = 0, v, t;
// PROCESS IN HERE
sc(n);
sc(m);
Init(1, 1, n);
Upd(1, 1, 1, 0);
while (m--) {
sc2(x, y);
sc(c);
store[x].pb(mp(y, c));
}
f1(i, n) {
v = Get(1, i);
fuv(j, store[i]) { Upd(1, i, store[i][j].fi, v + store[i][j].se); }
}
c = Get(1, n);
if (c == oo)
c = -1;
pr(c);
re 0;
// Hack it if you can :)
}
int main() {
// INPUT;
if (fopen("locin.txt", "r"))
INPUT;
ll JUDGE_ONLINE = 1;
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
ll test = 1;
// sc(test);
fu(T, 1, test) {
// cout<<"Case #"<<T<<": ";
Solves();
}
if (!JUDGE_ONLINE)
cout << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
} | insert | 97 | 97 | 97 | 99 | 0 | |
p02868 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
#define mk make_pair
ll mod = 1000000007;
ll MOD = 998244353;
int inf = 1000001000;
ll INF = 100000000000000000;
#define Int long long
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
template <typename E> struct SegmentTree {
using H = function<E(E, E)>;
Int n, height;
H h;
E ei;
vector<E> laz;
SegmentTree(H h, E ei) : h(h), ei(ei) {}
void init(Int n_) {
n = 1;
height = 0;
while (n < n_)
n <<= 1, height++;
laz.assign(2 * n, ei);
}
inline void propagate(Int k) {
if (laz[k] == ei)
return;
laz[(k << 1) | 0] = h(laz[(k << 1) | 0], laz[k]);
laz[(k << 1) | 1] = h(laz[(k << 1) | 1], laz[k]);
laz[k] = ei;
}
inline void thrust(Int k) {
for (Int i = height; i; i--)
propagate(k >> i);
}
void update(Int a, Int b, E x) {
thrust(a += n);
thrust(b += n - 1);
for (Int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {
if (l & 1)
laz[l] = h(laz[l], x), l++;
if (r & 1)
--r, laz[r] = h(laz[r], x);
}
}
E get_val(Int a) {
thrust(a += n);
return laz[a];
}
void set_val(Int a, E x) {
thrust(a += n);
laz[a] = x;
}
};
// INSERT ABOVE HERE
int main() {
ll n, m;
cin >> n >> m;
auto h = [&](ll x, ll y) { return min(x, y); };
const ll INF = 1e18;
SegmentTree<ll> seg(h, INF);
seg.init(n);
seg.set_val(0, 0);
vector<ll> l(m), r(m), c(m);
vector<vector<ll>> G(n + 1, vector<ll>(0));
rep(i, m) {
cin >> l[i] >> r[i] >> c[i];
G[--l[i]].push_back(i);
}
rep(i, n) {
ll d = seg.get_val(i);
rep(j, G[i].size()) seg.update(l[i], r[i], d + c[i]);
}
ll ans = seg.get_val(n - 1);
if (ans >= INF)
ans = -1;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
#define mk make_pair
ll mod = 1000000007;
ll MOD = 998244353;
int inf = 1000001000;
ll INF = 100000000000000000;
#define Int long long
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
template <typename E> struct SegmentTree {
using H = function<E(E, E)>;
Int n, height;
H h;
E ei;
vector<E> laz;
SegmentTree(H h, E ei) : h(h), ei(ei) {}
void init(Int n_) {
n = 1;
height = 0;
while (n < n_)
n <<= 1, height++;
laz.assign(2 * n, ei);
}
inline void propagate(Int k) {
if (laz[k] == ei)
return;
laz[(k << 1) | 0] = h(laz[(k << 1) | 0], laz[k]);
laz[(k << 1) | 1] = h(laz[(k << 1) | 1], laz[k]);
laz[k] = ei;
}
inline void thrust(Int k) {
for (Int i = height; i; i--)
propagate(k >> i);
}
void update(Int a, Int b, E x) {
thrust(a += n);
thrust(b += n - 1);
for (Int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {
if (l & 1)
laz[l] = h(laz[l], x), l++;
if (r & 1)
--r, laz[r] = h(laz[r], x);
}
}
E get_val(Int a) {
thrust(a += n);
return laz[a];
}
void set_val(Int a, E x) {
thrust(a += n);
laz[a] = x;
}
};
// INSERT ABOVE HERE
int main() {
ll n, m;
cin >> n >> m;
auto h = [&](ll x, ll y) { return min(x, y); };
const ll INF = 1e18;
SegmentTree<ll> seg(h, INF);
seg.init(n);
seg.set_val(0, 0);
vector<ll> l(m), r(m), c(m);
vector<vector<ll>> G(n + 1, vector<ll>(0));
rep(i, m) {
cin >> l[i] >> r[i] >> c[i];
G[--l[i]].push_back(i);
}
rep(i, n) {
ll d = seg.get_val(i);
for (ll j : G[i])
seg.update(l[j], r[j], d + c[j]);
}
ll ans = seg.get_val(n - 1);
if (ans >= INF)
ans = -1;
cout << ans << endl;
}
| replace | 93 | 94 | 93 | 95 | 0 | |
p02868 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 2e18;
const ll MOD = 1e9 + 7;
ll N, M;
struct Edge {
ll to, cost;
};
vector<Edge> edgeList[100010];
ll d[100010];
int main() {
cin >> N >> M;
for (ll i = 0; i < M; i++) {
ll l, r, c;
cin >> l >> r >> c;
l--;
r--;
edgeList[l].push_back(Edge{r, c});
}
for (ll i = 1; i < N; i++) {
edgeList[i].push_back(Edge{i - 1, 0});
d[i] = INF;
}
d[0] = 0;
priority_queue<P> pq;
pq.push(P(0, 0));
while (!pq.empty()) {
ll now = pq.top().second;
ll nowC = pq.top().first;
pq.pop();
if (nowC > d[now])
continue;
for (auto e : edgeList[now]) {
ll newC = nowC + e.cost;
if (d[e.to] > newC) {
d[e.to] = newC;
pq.push(P(newC, e.to));
}
}
}
cout << ((d[N - 1] == INF) ? (-1) : d[N - 1]);
return 0;
} | #include <algorithm>
#include <cassert>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 2e18;
const ll MOD = 1e9 + 7;
ll N, M;
struct Edge {
ll to, cost;
};
vector<Edge> edgeList[100010];
ll d[100010];
int main() {
cin >> N >> M;
for (ll i = 0; i < M; i++) {
ll l, r, c;
cin >> l >> r >> c;
l--;
r--;
edgeList[l].push_back(Edge{r, c});
}
for (ll i = 1; i < N; i++) {
edgeList[i].push_back(Edge{i - 1, 0});
d[i] = INF;
}
d[0] = 0;
priority_queue<P, vector<P>, greater<P>> pq;
pq.push(P(0, 0));
while (!pq.empty()) {
ll now = pq.top().second;
ll nowC = pq.top().first;
pq.pop();
if (nowC > d[now])
continue;
for (auto e : edgeList[now]) {
ll newC = nowC + e.cost;
if (d[e.to] > newC) {
d[e.to] = newC;
pq.push(P(newC, e.to));
}
}
}
cout << ((d[N - 1] == INF) ? (-1) : d[N - 1]);
return 0;
} | replace | 41 | 42 | 41 | 42 | TLE | |
p02868 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define rrep(i, n) RREP(i, n - 1, 0)
#define REPL(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define repl(i, n) REPL(i, 0, n)
#define all(v) v.begin(), v.end()
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
struct edge {
int to;
ll cost;
edge(int t, ll c) : to(t), cost(c){};
};
using P = pair<int, ll>;
int N;
vector<vector<edge>> G;
vector<ll> d;
vector<int> par;
void dijkstra(int s) {
priority_queue<P, vector<P>, greater<P>> que;
d = vector<ll>(N, longinf);
par = vector<int>(N, -1);
d[s] = 0;
que.push(P(0, s));
while (!que.empty()) {
P p = que.top();
que.pop();
int v = p.second;
if (d[v] < p.first)
continue;
for (int i = 0; i < (int)G[v].size(); ++i) {
edge e = G[v][i];
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.push(P(d[e.to], e.to));
par[e.to] = v;
}
}
}
}
int main() {
int M;
cin >> N >> M;
G = vector<vector<edge>>(N);
rep(i, N) if (i) G[i].push_back(edge(i - 1, 0));
rep(i, M) {
int l, r;
ll c;
cin >> l >> r >> c;
--l;
--r;
G[l].push_back(edge(r, c));
}
dijkstra(0);
cout << (d[N - 1] == longinf ? -1 : d[N - 1]) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define rrep(i, n) RREP(i, n - 1, 0)
#define REPL(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define repl(i, n) REPL(i, 0, n)
#define all(v) v.begin(), v.end()
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
struct edge {
int to;
ll cost;
edge(int t, ll c) : to(t), cost(c){};
};
using P = pair<ll, int>;
int N;
vector<vector<edge>> G;
vector<ll> d;
vector<int> par;
void dijkstra(int s) {
priority_queue<P, vector<P>, greater<P>> que;
d = vector<ll>(N, longinf);
par = vector<int>(N, -1);
d[s] = 0;
que.push(P(0, s));
while (!que.empty()) {
P p = que.top();
que.pop();
int v = p.second;
if (d[v] < p.first)
continue;
for (int i = 0; i < (int)G[v].size(); ++i) {
edge e = G[v][i];
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.push(P(d[e.to], e.to));
par[e.to] = v;
}
}
}
}
int main() {
int M;
cin >> N >> M;
G = vector<vector<edge>>(N);
rep(i, N) if (i) G[i].push_back(edge(i - 1, 0));
rep(i, M) {
int l, r;
ll c;
cin >> l >> r >> c;
--l;
--r;
G[l].push_back(edge(r, c));
}
dijkstra(0);
cout << (d[N - 1] == longinf ? -1 : d[N - 1]) << endl;
return 0;
}
| replace | 18 | 19 | 18 | 19 | TLE | |
p02868 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define rrep(i, n) RREP(i, n - 1, 0)
#define all(v) v.begin(), v.end()
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
const ld eps = 1e-10;
struct edge {
int to;
ll cost;
edge(int t, ll c) : to(t), cost(c){};
};
using P = pair<ll, int>;
vector<ll> d;
vector<int> par;
void dijkstra(int s, int N, vector<vector<edge>> &G) {
priority_queue<P, vector<P>, greater<P>> que;
d = vector<ll>(N, longinf);
par = vector<int>(N, -1);
d[s] = 0;
que.push(P(0, s));
while (!que.empty()) {
P p = que.top();
que.pop();
int v = p.second;
if (d[v] < p.first)
continue;
for (int i = 0; i < (int)G[v].size(); i++) {
edge e = G[v][i];
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.push(P(d[e.to], e.to));
par[e.to] = v;
}
}
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<vector<edge>> G(n);
rep(i, n) REP(j, i + 1, n) { G[j].push_back({i, 0}); }
vector<int> L(m), R(m);
vector<ll> C(m);
rep(i, m) {
cin >> L[i] >> R[i] >> C[i];
G[--L[i]].push_back({--R[i], C[i]});
}
dijkstra(0, n, G);
cout << (d[n - 1] == longinf ? -1 : d[n - 1]) << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define rrep(i, n) RREP(i, n - 1, 0)
#define all(v) v.begin(), v.end()
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
const ld eps = 1e-10;
struct edge {
int to;
ll cost;
edge(int t, ll c) : to(t), cost(c){};
};
using P = pair<ll, int>;
vector<ll> d;
vector<int> par;
void dijkstra(int s, int N, vector<vector<edge>> &G) {
priority_queue<P, vector<P>, greater<P>> que;
d = vector<ll>(N, longinf);
par = vector<int>(N, -1);
d[s] = 0;
que.push(P(0, s));
while (!que.empty()) {
P p = que.top();
que.pop();
int v = p.second;
if (d[v] < p.first)
continue;
for (int i = 0; i < (int)G[v].size(); i++) {
edge e = G[v][i];
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.push(P(d[e.to], e.to));
par[e.to] = v;
}
}
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, m;
cin >> n >> m;
vector<vector<edge>> G(n);
rep(i, n - 1) G[i + 1].push_back({i, 0});
vector<int> L(m), R(m);
vector<ll> C(m);
rep(i, m) {
cin >> L[i] >> R[i] >> C[i];
G[--L[i]].push_back({--R[i], C[i]});
}
dijkstra(0, n, G);
cout << (d[n - 1] == longinf ? -1 : d[n - 1]) << "\n";
return 0;
}
| replace | 54 | 55 | 54 | 55 | TLE | |
p02868 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define debug(x) cerr << #x << " = " << x << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
const int maxN = 1e5 + 5;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
ll gcd(ll a, ll b) { return !b ? a : gcd(b, a % b); }
ll sq(ll x) { return (x * x) % MOD; }
ll modP(ll a, ll b) {
return (!b ? 1 : (sq(modP(a, b / 2)) * (b % 2 ? a : 1)) % MOD);
}
vector<pii> G[maxN];
ll cnt[maxN], dis[maxN];
set<pii> S;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
memset(dis, 63, sizeof dis);
int n, m;
cin >> n >> m;
while (m--) {
int l, r, c;
cin >> l >> r >> c;
G[l].push_back({r, c});
cnt[r]--;
cnt[l--]++;
}
for (int i = 0; i < n; i++) {
cnt[i + 1] += cnt[i];
if (cnt[i + 1] > 0)
G[i + 1].push_back({i, 0});
}
dis[1] = 0;
S.insert({0, 1});
while (!S.empty()) {
int v = (*S.begin()).second;
S.erase(S.begin());
for (auto pp : G[v]) {
int u = pp.first;
int w = pp.second;
if (dis[u] > dis[v] + w) {
dis[u] = dis[v] + w;
S.insert({dis[u], u});
}
}
}
cout << (dis[n] > INF ? -1 : dis[n]) << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define debug(x) cerr << #x << " = " << x << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
const int maxN = 1e5 + 5;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
ll gcd(ll a, ll b) { return !b ? a : gcd(b, a % b); }
ll sq(ll x) { return (x * x) % MOD; }
ll modP(ll a, ll b) {
return (!b ? 1 : (sq(modP(a, b / 2)) * (b % 2 ? a : 1)) % MOD);
}
vector<pii> G[maxN];
ll cnt[maxN], dis[maxN];
set<pll> S;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
memset(dis, 63, sizeof dis);
int n, m;
cin >> n >> m;
while (m--) {
int l, r, c;
cin >> l >> r >> c;
G[l].push_back({r, c});
cnt[r]--;
cnt[l--]++;
}
for (int i = 0; i < n; i++) {
cnt[i + 1] += cnt[i];
if (cnt[i + 1] > 0)
G[i + 1].push_back({i, 0});
}
dis[1] = 0;
S.insert({0, 1});
while (!S.empty()) {
int v = (*S.begin()).second;
S.erase(S.begin());
for (auto pp : G[v]) {
int u = pp.first;
int w = pp.second;
if (dis[u] > dis[v] + w) {
dis[u] = dis[v] + w;
S.insert({dis[u], u});
}
}
}
cout << (dis[n] > INF ? -1 : dis[n]) << endl;
return 0;
}
| replace | 32 | 33 | 32 | 33 | TLE | |
p02868 | C++ | Runtime Error | /// awoooooo
#include <bits/stdc++.h>
#define sz(x) (int)((x).size())
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
const int N = (int)2e5 + 5;
const int inf = (int)1e9 + 7;
const ll INF = (ll)1e18;
int n, m;
int l[N], r[N], c[N];
ll de[N];
vector<int> event[N];
int main() {
cin >> n >> m;
for (int i = 1; i <= m; ++i) {
cin >> l[i] >> r[i] >> c[i];
event[l[i]].push_back(i);
event[r[i] + 1].push_back(-i);
}
set<ll> cur;
for (int j = 1; j <= n; ++j) {
for (int i : event[j]) {
if (i < 0) {
if (de[-i] != INF)
cur.erase(cur.find(de[-i] + c[-i]));
}
}
for (int i : event[j]) {
if (i > 0) {
if (cur.empty() || l[i] == 1) {
if (l[i] == 1) {
de[i] = 0;
} else {
de[i] = INF;
}
} else {
de[i] = *cur.begin();
}
if (de[i] != INF) {
cur.insert(de[i] + c[i]);
}
}
}
}
ll ans = INF;
for (int i = 1; i <= m; ++i) {
if (r[i] == n) {
ans = min(ans, de[i] + c[i]);
}
}
if (ans == INF)
ans = -1;
cout << ans;
return 0;
}
| /// awoooooo
#include <bits/stdc++.h>
#define sz(x) (int)((x).size())
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
const int N = (int)2e5 + 5;
const int inf = (int)1e9 + 7;
const ll INF = (ll)1e18;
int n, m;
int l[N], r[N], c[N];
ll de[N];
vector<int> event[N];
int main() {
cin >> n >> m;
for (int i = 1; i <= m; ++i) {
cin >> l[i] >> r[i] >> c[i];
event[l[i]].push_back(i);
event[r[i] + 1].push_back(-i);
}
multiset<ll> cur;
for (int j = 1; j <= n; ++j) {
for (int i : event[j]) {
if (i < 0) {
if (de[-i] != INF)
cur.erase(cur.find(de[-i] + c[-i]));
}
}
for (int i : event[j]) {
if (i > 0) {
if (cur.empty() || l[i] == 1) {
if (l[i] == 1) {
de[i] = 0;
} else {
de[i] = INF;
}
} else {
de[i] = *cur.begin();
}
if (de[i] != INF) {
cur.insert(de[i] + c[i]);
}
}
}
}
ll ans = INF;
for (int i = 1; i <= m; ++i) {
if (r[i] == n) {
ans = min(ans, de[i] + c[i]);
}
}
if (ans == INF)
ans = -1;
cout << ans;
return 0;
}
| replace | 27 | 28 | 27 | 28 | 0 | |
p02868 | C++ | Time Limit Exceeded | #define DEBUG 0
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vll = vector<ll>;
using vvll = vector<vll>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
using vvpll = vector<vpll>;
using tll = tuple<ll, ll, ll>;
using vtll = vector<tll>;
using vvtll = vector<vtll>;
#define all(v) (v).begin(), (v).end()
#define for1(i, n) for (ll i = 0; i < (n); i++)
#define for2(i, m, n) for (ll i = (m); i < (n); i++)
#define for3(i, m, n, d) for (ll i = (m); i < (n); i += (d))
#define rfor2(i, m, n) for (ll i = (m); i > (n); i--)
#define rfor3(i, m, n, d) for (ll i = (m); i > (n); i += (d))
#define PI 3.1415926535897932384626433832795028841971693993751
#define INF 1111111111111111111LL
#define print(...) print_1(__VA_ARGS__)
#define in(...) in_1(__VA_ARGS__)
#if DEBUG
#define dump(...) dump_1(#__VA_ARGS__, __VA_ARGS__)
#define dumpa(...) dumpa_1(#__VA_ARGS__, __VA_ARGS__)
#else
#define dump(...)
#define dumpa(...)
#endif
template <typename Head> void dump_1(const char *str, Head &&h) {
cerr << str << ": " << h << '\n';
}
template <typename Head, typename... Tail>
void dump_1(const char *str, Head &&h, Tail &&...t) {
while (*str != ',') {
cerr << *str++;
}
cerr << ": " << h << ' ';
dump_1(str + 1, t...);
}
template <typename T>
void dumpa_1(const char *str, const T v[], const ll size) {
while (*str != ',') {
cerr << *str++;
}
cerr << ": ";
for1(i, size) {
if (i != 0) {
cerr << ' ';
}
cerr << v[i];
}
cerr << '\n';
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &v) {
os << v.first << ' ' << v.second;
return os;
}
template <typename T1, typename T2, typename T3>
ostream &operator<<(ostream &os, const tuple<T1, T2, T3> &v) {
os << get<0>(v) << ' ' << get<1>(v) << ' ' << get<2>(v);
return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) {
os << ' ';
}
os << *it;
}
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &v) {
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) {
os << ' ';
}
os << *it;
}
return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &v) {
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) {
os << ' ';
}
os << *it;
}
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const map<T1, T2> &v) {
os << '{';
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) {
os << ", ";
}
os << it->first << ':' << it->second;
}
os << '}';
return os;
}
void Yes(void) { cout << "Yes\n"; }
void No(void) { cout << "No\n"; }
void YES(void) { cout << "YES\n"; }
void NO(void) { cout << "NO\n"; }
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> void vin(vector<T> &v, ll len) {
for1(i, len) { cin >> v[i]; }
}
template <typename Head> void in_1(Head &h) { cin >> h; }
template <typename Head, typename... Tail> void in_1(Head &h, Tail &...t) {
cin >> h;
in_1(t...);
}
template <typename Head> void print_1(Head &&h) { cout << h << '\n'; }
template <typename Head, typename... Tail> void print_1(Head &&h, Tail &&...t) {
cout << h << ' ';
print_1(t...);
}
//---------------------------------------------------------
void solve() {
ll N, M;
in(N, M);
vll L(M);
vll R(M);
vll C(M);
vector<vector<pll>> to(N);
for1(i, M) {
ll l, r, c;
in(l, r, c);
--l;
--r;
to[l].emplace_back(r, c);
}
for2(i, 1, N) { to[i].emplace_back(i - 1, 0); }
vll dis(N, INF);
priority_queue<pair<ll, ll>> q;
q.push(make_pair(0, 0));
while (!q.empty()) {
ll cost, loc;
tie(cost, loc) = q.top();
q.pop();
cost = -cost;
if (dis[loc] < cost) {
continue;
}
dis[loc] = cost;
for (auto t : to[loc]) {
ll cost2 = cost + t.second;
ll loc2 = t.first;
q.push(make_pair(-cost2, loc2));
}
}
dump(dis);
if (dis[N - 1] == INF) {
print(-1);
} else {
print(dis[N - 1]);
}
}
//---------------------------------------------------------
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(16);
cerr << fixed << setprecision(16);
solve();
}
| #define DEBUG 0
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vll = vector<ll>;
using vvll = vector<vll>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
using vvpll = vector<vpll>;
using tll = tuple<ll, ll, ll>;
using vtll = vector<tll>;
using vvtll = vector<vtll>;
#define all(v) (v).begin(), (v).end()
#define for1(i, n) for (ll i = 0; i < (n); i++)
#define for2(i, m, n) for (ll i = (m); i < (n); i++)
#define for3(i, m, n, d) for (ll i = (m); i < (n); i += (d))
#define rfor2(i, m, n) for (ll i = (m); i > (n); i--)
#define rfor3(i, m, n, d) for (ll i = (m); i > (n); i += (d))
#define PI 3.1415926535897932384626433832795028841971693993751
#define INF 1111111111111111111LL
#define print(...) print_1(__VA_ARGS__)
#define in(...) in_1(__VA_ARGS__)
#if DEBUG
#define dump(...) dump_1(#__VA_ARGS__, __VA_ARGS__)
#define dumpa(...) dumpa_1(#__VA_ARGS__, __VA_ARGS__)
#else
#define dump(...)
#define dumpa(...)
#endif
template <typename Head> void dump_1(const char *str, Head &&h) {
cerr << str << ": " << h << '\n';
}
template <typename Head, typename... Tail>
void dump_1(const char *str, Head &&h, Tail &&...t) {
while (*str != ',') {
cerr << *str++;
}
cerr << ": " << h << ' ';
dump_1(str + 1, t...);
}
template <typename T>
void dumpa_1(const char *str, const T v[], const ll size) {
while (*str != ',') {
cerr << *str++;
}
cerr << ": ";
for1(i, size) {
if (i != 0) {
cerr << ' ';
}
cerr << v[i];
}
cerr << '\n';
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &v) {
os << v.first << ' ' << v.second;
return os;
}
template <typename T1, typename T2, typename T3>
ostream &operator<<(ostream &os, const tuple<T1, T2, T3> &v) {
os << get<0>(v) << ' ' << get<1>(v) << ' ' << get<2>(v);
return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) {
os << ' ';
}
os << *it;
}
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &v) {
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) {
os << ' ';
}
os << *it;
}
return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &v) {
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) {
os << ' ';
}
os << *it;
}
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const map<T1, T2> &v) {
os << '{';
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) {
os << ", ";
}
os << it->first << ':' << it->second;
}
os << '}';
return os;
}
void Yes(void) { cout << "Yes\n"; }
void No(void) { cout << "No\n"; }
void YES(void) { cout << "YES\n"; }
void NO(void) { cout << "NO\n"; }
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> void vin(vector<T> &v, ll len) {
for1(i, len) { cin >> v[i]; }
}
template <typename Head> void in_1(Head &h) { cin >> h; }
template <typename Head, typename... Tail> void in_1(Head &h, Tail &...t) {
cin >> h;
in_1(t...);
}
template <typename Head> void print_1(Head &&h) { cout << h << '\n'; }
template <typename Head, typename... Tail> void print_1(Head &&h, Tail &&...t) {
cout << h << ' ';
print_1(t...);
}
//---------------------------------------------------------
void solve() {
ll N, M;
in(N, M);
vll L(M);
vll R(M);
vll C(M);
vector<vector<pll>> to(N);
for1(i, M) {
ll l, r, c;
in(l, r, c);
--l;
--r;
to[l].emplace_back(r, c);
}
for2(i, 1, N) { to[i].emplace_back(i - 1, 0); }
vll dis(N, INF);
priority_queue<pair<ll, ll>> q;
q.push(make_pair(0, 0));
while (!q.empty()) {
ll cost, loc;
tie(cost, loc) = q.top();
q.pop();
cost = -cost;
if (dis[loc] <= cost) {
continue;
}
dis[loc] = cost;
for (auto t : to[loc]) {
ll cost2 = cost + t.second;
ll loc2 = t.first;
q.push(make_pair(-cost2, loc2));
}
}
dump(dis);
if (dis[N - 1] == INF) {
print(-1);
} else {
print(dis[N - 1]);
}
}
//---------------------------------------------------------
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(16);
cerr << fixed << setprecision(16);
solve();
}
| replace | 175 | 176 | 175 | 176 | TLE | |
p02868 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const long long int INF = 1e18;
// computational complexity : O(E*logV)
struct edge {
int to;
long long int cost;
};
int V, E; // number of (vertices, edges)
vector<vector<edge>> graph;
vector<long long int> d; // shortest distances
void Dijkstra(int s) { // s = starting point
priority_queue<
pair<int, int> // temporarily keeping (shortest distance, vertex)
,
vector<pair<int, int>>, greater<pair<int, int>> // shorter ones first
>
pq;
// initialize (INF)
for (int i = 0; i < V; i++) {
d[i] = INF;
}
d[s] = 0;
pq.push({0, s});
// search
pair<long long int, int> current; // (shortest-distance confirmed, vertex)
while (!pq.empty()) {
current = pq.top();
pq.pop();
int v = current.second;
if (d[v] < current.first) {
continue; // ignore (not the shortest path)
}
// else (need to check)
for (edge e : graph[v]) { // adjacent nodes
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost; // update minimum cost
pq.push({d[e.to], e.to});
}
}
}
}
int main() {
cin >> V >> E;
graph.resize(V);
d.resize(V);
for (int i = 0; i + 1 < V; i++) {
graph[i + 1].push_back({i, 0});
}
for (int i = 0; i < E; i++) {
int l, r, c;
cin >> l >> r >> c;
l -= 1;
r -= 1;
graph[l].push_back({r, c});
}
Dijkstra(0); // starting from s
if (d[V - 1] != INF)
cout << d[V - 1] << endl;
if (d[V - 1] == INF)
cout << -1 << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const long long int INF = 1e18;
// computational complexity : O(E*logV)
struct edge {
int to;
long long int cost;
};
int V, E; // number of (vertices, edges)
vector<vector<edge>> graph;
vector<long long int> d; // shortest distances
void Dijkstra(int s) { // s = starting point
priority_queue<pair<long long int, int> // temporarily keeping (shortest
// distance, vertex)
,
vector<pair<long long int, int>>,
greater<pair<long long int, int>> // shorter ones first
>
pq;
// initialize (INF)
for (int i = 0; i < V; i++) {
d[i] = INF;
}
d[s] = 0;
pq.push({0, s});
// search
pair<long long int, int> current; // (shortest-distance confirmed, vertex)
while (!pq.empty()) {
current = pq.top();
pq.pop();
int v = current.second;
if (d[v] < current.first) {
continue; // ignore (not the shortest path)
}
// else (need to check)
for (edge e : graph[v]) { // adjacent nodes
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost; // update minimum cost
pq.push({d[e.to], e.to});
}
}
}
}
int main() {
cin >> V >> E;
graph.resize(V);
d.resize(V);
for (int i = 0; i + 1 < V; i++) {
graph[i + 1].push_back({i, 0});
}
for (int i = 0; i < E; i++) {
int l, r, c;
cin >> l >> r >> c;
l -= 1;
r -= 1;
graph[l].push_back({r, c});
}
Dijkstra(0); // starting from s
if (d[V - 1] != INF)
cout << d[V - 1] << endl;
if (d[V - 1] == INF)
cout << -1 << endl;
return 0;
} | replace | 15 | 21 | 15 | 22 | TLE | |
p02868 | C++ | Runtime Error | #include <cstring>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
const int N = 100000 + 10;
typedef long long LL;
int n, m;
int nod[2][N], C, s, t;
vector<pair<int, int>> g[1300000 + 10];
void build(int id, int l, int r, int rt) {
nod[id][rt] = ++C;
// printf("id = %d, l = %d, r = %d, rt = %d, C = %d\n", id, l, r, rt, C);
if (l == r) {
if (id == 0 && l == 1)
s = nod[id][rt];
if (id == 1 && l == n)
t = nod[id][rt];
if (id == 1) {
g[nod[id][rt]].push_back(make_pair(nod[0][rt], 0));
}
return;
}
int mid = (l + r) >> 1;
build(id, l, mid, rt << 1);
build(id, mid + 1, r, rt << 1 | 1);
if (id == 0) {
g[nod[id][rt << 1]].push_back(make_pair(nod[id][rt], 0));
g[nod[id][rt << 1 | 1]].push_back(make_pair(nod[id][rt], 0));
} else {
g[nod[id][rt]].push_back(make_pair(nod[id][rt << 1], 0));
g[nod[id][rt]].push_back(make_pair(nod[id][rt << 1 | 1], 0));
}
}
void split(int id, int to, int l, int r, int rt, int L, int R) {
if (L <= l && r <= R) {
if (id == 0) {
// printf("[%d, %d], id = %d, rt = %d\n", l, r, id, rt);
// printf("link %d -> %d\n", nod[id][rt], to);
g[nod[id][rt]].push_back(make_pair(to, 0));
} else {
// printf("@ [%d, %d], id = %d, rt = %d\n", l, r, id, rt);
// printf("link %d -> %d\n", to, nod[id][rt]);
g[to].push_back(make_pair(nod[id][rt], 0));
}
return;
}
int mid = (l + r) >> 1;
if (L <= mid)
split(id, to, l, mid, rt << 1, L, R);
if (R > mid)
split(id, to, mid + 1, r, rt << 1 | 1, L, R);
}
struct Nod {
LL dis;
int u;
bool operator<(const Nod &o) const { return dis > o.dis; }
};
LL dis[1300000 + 10];
void dijkstra() {
priority_queue<Nod> q;
q.push((Nod){0, s});
memset(dis, -1, sizeof(dis));
dis[s] = 0;
while (q.size()) {
Nod tmp = q.top();
q.pop();
int u = tmp.u;
// printf("u = %d, %d\n", u, tmp.dis);
if (dis[u] < tmp.dis)
continue;
for (auto e : g[u]) {
int v = e.first;
if (dis[v] == -1 || dis[v] > dis[u] + e.second) {
dis[v] = dis[u] + e.second;
q.push((Nod){dis[v], v});
}
}
}
printf("%lld\n", dis[t]);
}
int main() {
scanf("%d%d", &n, &m);
build(0, 1, n, 1);
build(1, 1, n, 1);
for (int i = 1; i <= m; i++) {
int l, r, c;
scanf("%d%d%d", &l, &r, &c);
{
int x = ++C, y = ++C;
split(0, x, 1, n, 1, l, r);
g[x].push_back(make_pair(y, c));
split(1, y, 1, n, 1, l, r);
}
{
int x = ++C, y = ++C;
split(0, y, 1, n, 1, l, r);
g[y].push_back(make_pair(x, c));
split(1, x, 1, n, 1, l, r);
}
}
// printf("s = %d, t = %d\n", s, t);
dijkstra();
} | #include <cstring>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
const int N = 100000 + 10;
typedef long long LL;
int n, m;
int nod[2][N << 2], C, s, t;
vector<pair<int, int>> g[1300000 + 10];
void build(int id, int l, int r, int rt) {
nod[id][rt] = ++C;
// printf("id = %d, l = %d, r = %d, rt = %d, C = %d\n", id, l, r, rt, C);
if (l == r) {
if (id == 0 && l == 1)
s = nod[id][rt];
if (id == 1 && l == n)
t = nod[id][rt];
if (id == 1) {
g[nod[id][rt]].push_back(make_pair(nod[0][rt], 0));
}
return;
}
int mid = (l + r) >> 1;
build(id, l, mid, rt << 1);
build(id, mid + 1, r, rt << 1 | 1);
if (id == 0) {
g[nod[id][rt << 1]].push_back(make_pair(nod[id][rt], 0));
g[nod[id][rt << 1 | 1]].push_back(make_pair(nod[id][rt], 0));
} else {
g[nod[id][rt]].push_back(make_pair(nod[id][rt << 1], 0));
g[nod[id][rt]].push_back(make_pair(nod[id][rt << 1 | 1], 0));
}
}
void split(int id, int to, int l, int r, int rt, int L, int R) {
if (L <= l && r <= R) {
if (id == 0) {
// printf("[%d, %d], id = %d, rt = %d\n", l, r, id, rt);
// printf("link %d -> %d\n", nod[id][rt], to);
g[nod[id][rt]].push_back(make_pair(to, 0));
} else {
// printf("@ [%d, %d], id = %d, rt = %d\n", l, r, id, rt);
// printf("link %d -> %d\n", to, nod[id][rt]);
g[to].push_back(make_pair(nod[id][rt], 0));
}
return;
}
int mid = (l + r) >> 1;
if (L <= mid)
split(id, to, l, mid, rt << 1, L, R);
if (R > mid)
split(id, to, mid + 1, r, rt << 1 | 1, L, R);
}
struct Nod {
LL dis;
int u;
bool operator<(const Nod &o) const { return dis > o.dis; }
};
LL dis[1300000 + 10];
void dijkstra() {
priority_queue<Nod> q;
q.push((Nod){0, s});
memset(dis, -1, sizeof(dis));
dis[s] = 0;
while (q.size()) {
Nod tmp = q.top();
q.pop();
int u = tmp.u;
// printf("u = %d, %d\n", u, tmp.dis);
if (dis[u] < tmp.dis)
continue;
for (auto e : g[u]) {
int v = e.first;
if (dis[v] == -1 || dis[v] > dis[u] + e.second) {
dis[v] = dis[u] + e.second;
q.push((Nod){dis[v], v});
}
}
}
printf("%lld\n", dis[t]);
}
int main() {
scanf("%d%d", &n, &m);
build(0, 1, n, 1);
build(1, 1, n, 1);
for (int i = 1; i <= m; i++) {
int l, r, c;
scanf("%d%d%d", &l, &r, &c);
{
int x = ++C, y = ++C;
split(0, x, 1, n, 1, l, r);
g[x].push_back(make_pair(y, c));
split(1, y, 1, n, 1, l, r);
}
{
int x = ++C, y = ++C;
split(0, y, 1, n, 1, l, r);
g[y].push_back(make_pair(x, c));
split(1, x, 1, n, 1, l, r);
}
}
// printf("s = %d, t = %d\n", s, t);
dijkstra();
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02868 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long long
#define lld long double
#define ALL(x) x.begin(), x.end()
#ifdef DEBUG
#define line() cerr << "[" << __LINE__ << "] ";
#define dump(i) cerr << #i ": " << i << " ";
#define dumpl(i) cerr << #i ": " << i << endl;
#else
#define line(i)
#define dump(i)
#define dumpl(i)
#endif
#define INF 1ll << 60
using namespace std;
typedef map<int, vector<int>> Graph;
typedef map<int, map<int, ll>> WGraph;
#define int ll
vector<int> dijkstra(int v, WGraph &g, int r) {
vector<int> cost(v, INF);
cost[r] = 0;
priority_queue<pair<int, int>> pq;
pq.push({0, r});
while (!pq.empty()) {
// cerr << "-------------------------------" << endl;
auto t = pq.top();
pq.pop();
// cerr << t.second << "," << t.first << endl;
if (cost[t.second] < -t.first) {
continue;
}
for (auto x : g[t.second]) {
if (cost[x.first] > cost[t.second] + g[t.second][x.first]) {
cost[x.first] = cost[t.second] + g[t.second][x.first];
// cerr << "update cost[" << x.first << "] with " << cost[x.first] <<
// endl;
pq.push({-cost[x.first], x.first});
}
}
}
return cost;
}
signed main() {
int n, m;
cin >> n >> m;
int l[m], r[m], c[m];
rep(i, m) {
cin >> l[i] >> r[i] >> c[i];
l[i]--;
r[i]--;
}
WGraph g;
vector<int> p;
map<int, bool> mp;
rep(i, m) {
if (g[l[i]][r[i]] == 0) {
g[l[i]][r[i]] = INF;
g[r[i]][l[i]] = INF;
}
g[l[i]][r[i]] = min(c[i], g[l[i]][r[i]]);
g[r[i]][l[i]] = min(c[i], g[r[i]][l[i]]);
if (mp[l[i]] == false) {
p.push_back(l[i]);
mp[l[i]] = true;
}
if (mp[r[i]] == false) {
p.push_back(r[i]);
mp[r[i]] = true;
}
}
sort(ALL(p));
rep(i, m) {
auto itr = lower_bound(ALL(p), r[i]) - p.begin();
for (int ii = itr; ii >= 0 && p[ii] > l[i]; ii--) {
if (g[r[i]][p[ii]] == 0) {
g[r[i]][p[ii]] = INF;
g[p[ii]][r[i]] = INF;
}
g[r[i]][p[ii]] = min(g[r[i]][p[ii]], c[i]);
g[p[ii]][r[i]] = min(g[r[i]][p[ii]], c[i]);
// cerr<<"add "<<
}
}
auto cost = dijkstra(n, g, 0);
if (cost[n - 1] == INF) {
cout << -1 << endl;
} else {
cout << cost[n - 1] << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ll long long
#define lld long double
#define ALL(x) x.begin(), x.end()
#ifdef DEBUG
#define line() cerr << "[" << __LINE__ << "] ";
#define dump(i) cerr << #i ": " << i << " ";
#define dumpl(i) cerr << #i ": " << i << endl;
#else
#define line(i)
#define dump(i)
#define dumpl(i)
#endif
#define INF 1ll << 60
using namespace std;
typedef map<int, vector<int>> Graph;
typedef map<int, map<int, ll>> WGraph;
#define int ll
vector<int> dijkstra(int v, WGraph &g, int r) {
vector<int> cost(v, INF);
cost[r] = 0;
priority_queue<pair<int, int>> pq;
pq.push({0, r});
while (!pq.empty()) {
// cerr << "-------------------------------" << endl;
auto t = pq.top();
pq.pop();
// cerr << t.second << "," << t.first << endl;
if (cost[t.second] < -t.first) {
continue;
}
for (auto x : g[t.second]) {
if (cost[x.first] > cost[t.second] + g[t.second][x.first]) {
cost[x.first] = cost[t.second] + g[t.second][x.first];
// cerr << "update cost[" << x.first << "] with " << cost[x.first] <<
// endl;
pq.push({-cost[x.first], x.first});
}
}
}
return cost;
}
signed main() {
int n, m;
cin >> n >> m;
int l[m], r[m], c[m];
rep(i, m) {
cin >> l[i] >> r[i] >> c[i];
l[i]--;
r[i]--;
}
WGraph g;
vector<int> p;
map<int, bool> mp;
rep(i, m) {
if (g[l[i]][r[i]] == 0) {
g[l[i]][r[i]] = INF;
g[r[i]][l[i]] = INF;
}
g[l[i]][r[i]] = min(c[i], g[l[i]][r[i]]);
g[r[i]][l[i]] = min(c[i], g[r[i]][l[i]]);
if (mp[l[i]] == false) {
p.push_back(l[i]);
mp[l[i]] = true;
}
if (mp[r[i]] == false) {
p.push_back(r[i]);
mp[r[i]] = true;
}
}
sort(ALL(p));
rep(i, 1, m) { g[i][i - 1] = 0; }
auto cost = dijkstra(n, g, 0);
if (cost[n - 1] == INF) {
cout << -1 << endl;
} else {
cout << cost[n - 1] << endl;
}
return 0;
}
| replace | 79 | 93 | 79 | 80 | TLE | |
p02868 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
const int N = 110000;
typedef long long LL;
const LL mod = 1e9 + 7;
int l[N], r[N];
int a[N], b[N], c[N];
int n, m;
vector<int> g;
vector<pair<int, LL>> f[N * 8];
priority_queue<pair<LL, int>, vector<pair<LL, int>>, greater<pair<LL, int>>> q;
const LL INF = 1e15;
LL dis[N];
int pp[N];
int idx[N];
int maxx;
void dijkstra(int x, int n) {
int i, u;
for (i = 1; i <= n; ++i)
dis[i] = INF, pp[i] = 0;
dis[x] = 0;
for (i = 1; i <= n; ++i)
q.push(make_pair(dis[i], i));
while (!q.empty()) {
u = q.top().second;
q.pop();
if (pp[u])
continue;
pp[u] = 1;
for (i = 0; i < f[u].size(); i++)
if (dis[f[u][i].fi] > dis[u] + f[u][i].se) {
dis[f[u][i].fi] = dis[u] + f[u][i].se;
q.push(make_pair(dis[f[u][i].fi], f[u][i].fi));
}
}
}
void build(int k, int l, int r) {
maxx = max(maxx, k);
if (l == r) {
idx[l] = k;
return;
}
int mid = (l + r) / 2;
build(k << 1, l, mid);
build(k << 1 | 1, mid + 1, r);
}
void build2(int k, int l, int r) {
f[k + maxx].pb(mp(k, 0));
if (l == r) {
return;
}
int mid = (l + r) / 2;
build2(k << 1, l, mid), f[k << 1].pb(mp(k, 0)),
f[k + maxx].pb(mp((k << 1) + maxx, 0));
build2(k << 1 | 1, mid + 1, r), f[k << 1 | 1].pb(mp(k, 0)),
f[k + maxx].pb(mp((k << 1 | 1) + maxx, 0));
}
void add(int k, int l, int r, int a, int b, int c) {
if (l == a && r == b) {
g.pb(k);
return;
}
int mid = (l + r) / 2;
if (b <= mid)
add(k << 1, l, mid, a, b, c);
else if (a > mid)
add(k << 1 | 1, mid + 1, r, a, b, c);
else
add(k << 1, l, mid, a, mid, c), add(k << 1 | 1, mid + 1, r, mid + 1, b, c);
}
int main() {
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++)
l[i] = i - 1, r[i] = i + 1;
r[0] = 1, l[n + 1] = n;
build(1, 1, n);
build2(1, 1, n);
for (int i = 1; i <= m; i++) {
scanf("%d %d %d", &a[i], &b[i], &c[i]);
g.clear();
add(1, 1, n, a[i], b[i], i);
for (int j = 0; j < g.size(); j++)
for (int k = 0; k < g.size(); k++)
f[g[j]].pb(mp(g[k] + maxx, c[i]));
}
dijkstra(idx[1], maxx + maxx);
if (dis[idx[n]] == INF)
cout << -1 << endl;
else
cout << dis[idx[n]] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
const int N = 110000;
typedef long long LL;
const LL mod = 1e9 + 7;
int l[N], r[N];
int a[N], b[N], c[N];
int n, m;
vector<int> g;
vector<pair<int, LL>> f[N * 8];
priority_queue<pair<LL, int>, vector<pair<LL, int>>, greater<pair<LL, int>>> q;
const LL INF = 1e15;
LL dis[N * 8];
int pp[N * 8];
int idx[N];
int maxx;
void dijkstra(int x, int n) {
int i, u;
for (i = 1; i <= n; ++i)
dis[i] = INF, pp[i] = 0;
dis[x] = 0;
for (i = 1; i <= n; ++i)
q.push(make_pair(dis[i], i));
while (!q.empty()) {
u = q.top().second;
q.pop();
if (pp[u])
continue;
pp[u] = 1;
for (i = 0; i < f[u].size(); i++)
if (dis[f[u][i].fi] > dis[u] + f[u][i].se) {
dis[f[u][i].fi] = dis[u] + f[u][i].se;
q.push(make_pair(dis[f[u][i].fi], f[u][i].fi));
}
}
}
void build(int k, int l, int r) {
maxx = max(maxx, k);
if (l == r) {
idx[l] = k;
return;
}
int mid = (l + r) / 2;
build(k << 1, l, mid);
build(k << 1 | 1, mid + 1, r);
}
void build2(int k, int l, int r) {
f[k + maxx].pb(mp(k, 0));
if (l == r) {
return;
}
int mid = (l + r) / 2;
build2(k << 1, l, mid), f[k << 1].pb(mp(k, 0)),
f[k + maxx].pb(mp((k << 1) + maxx, 0));
build2(k << 1 | 1, mid + 1, r), f[k << 1 | 1].pb(mp(k, 0)),
f[k + maxx].pb(mp((k << 1 | 1) + maxx, 0));
}
void add(int k, int l, int r, int a, int b, int c) {
if (l == a && r == b) {
g.pb(k);
return;
}
int mid = (l + r) / 2;
if (b <= mid)
add(k << 1, l, mid, a, b, c);
else if (a > mid)
add(k << 1 | 1, mid + 1, r, a, b, c);
else
add(k << 1, l, mid, a, mid, c), add(k << 1 | 1, mid + 1, r, mid + 1, b, c);
}
int main() {
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++)
l[i] = i - 1, r[i] = i + 1;
r[0] = 1, l[n + 1] = n;
build(1, 1, n);
build2(1, 1, n);
for (int i = 1; i <= m; i++) {
scanf("%d %d %d", &a[i], &b[i], &c[i]);
g.clear();
add(1, 1, n, a[i], b[i], i);
for (int j = 0; j < g.size(); j++)
for (int k = 0; k < g.size(); k++)
f[g[j]].pb(mp(g[k] + maxx, c[i]));
}
dijkstra(idx[1], maxx + maxx);
if (dis[idx[n]] == INF)
cout << -1 << endl;
else
cout << dis[idx[n]] << endl;
return 0;
} | replace | 20 | 22 | 20 | 22 | 0 | |
p02868 | C++ | Runtime Error | //----------------------------templates
#pragma GCC optimize("Ofast")
#pragma GCC target("tune=native")
#pragma GCC target("avx")
//----------------------------
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define int ll
#define FOR(i, j, n) for (int i = (int)(j); i < (n); i++)
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPS(i, n) for (int i = 1; i <= (int)(n); i++)
#define REPN(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define REPNS(i, n) for (int i = (int)(n); i > 0; i--)
#define I(n) scanf("%lld", &(n))
#define LL(n) scanf("%lld", &(n))
#define pb(n) push_back((n))
#define mp(i, j) make_pair((i), (j))
#define eb(i, j) emplace_back((i), (j))
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define uniq(v) v.erase(unique(v.begin(), v.end()), v.end())
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef vector<pi> vpi;
typedef vector<vi> vvi;
typedef vector<vpi> vvpi;
typedef vector<vvi> vvvi;
const int mod = 1000000007;
//--------------------------------------------
int n, m;
vector<pair<pi, int>> q;
int l, r, c;
class segment_tree_beats {
// MEMO: values for queries (max, min, lazy_add, and lazy_update) already
// apply to the current node; but not for children
typedef struct {
int max;
int max_second;
int max_count;
int min;
int min_second;
int min_count;
int lazy_add;
int lazy_update;
int sum;
} value_type;
int n;
std::vector<value_type> a;
public:
segment_tree_beats() = default;
segment_tree_beats(int n_) {
n = 1;
while (n < n_)
n *= 2;
a.resize(2 * n - 1);
tag<UPDATE>(0, 0);
}
template <class InputIterator>
segment_tree_beats(InputIterator first, InputIterator last) {
int n_ = std::distance(first, last);
n = 1;
while (n < n_)
n *= 2;
a.resize(2 * n - 1);
REP(i, n_) { tag<UPDATE>(n - 1 + i, *(first + i)); }
FOR(i, n_, n) { tag<UPDATE>(n - 1 + i, 0); }
REPN(i, n - 1) { update(i); }
}
void range_chmin(int l, int r, int value) { // 0-based, [l, r)
assert(0 <= l and l <= r and r <= n);
range_apply<CHMIN>(0, 0, n, l, r, value);
}
void range_chmax(int l, int r, int value) { // 0-based, [l, r)
assert(0 <= l and l <= r and r <= n);
range_apply<CHMAX>(0, 0, n, l, r, value);
}
void range_add(int l, int r, int value) { // 0-based, [l, r)
assert(0 <= l and l <= r and r <= n);
range_apply<ADD>(0, 0, n, l, r, value);
}
void range_update(int l, int r, int value) { // 0-based, [l, r)
assert(0 <= l and l <= r and r <= n);
range_apply<UPDATE>(0, 0, n, l, r, value);
}
int range_min(int l, int r) { // 0-based, [l, r)
assert(0 <= l and l <= r and r <= n);
return range_get<MIN>(0, 0, n, l, r);
}
int range_max(int l, int r) { // 0-based, [l, r)
assert(0 <= l and l <= r and r <= n);
return range_get<MAX>(0, 0, n, l, r);
}
int range_sum(int l, int r) { // 0-based, [l, r)
assert(0 <= l and l <= r and r <= n);
return range_get<SUM>(0, 0, n, l, r);
}
private:
static constexpr char CHMIN = 0;
static constexpr char CHMAX = 1;
static constexpr char ADD = 2;
static constexpr char UPDATE = 3;
static constexpr char MIN = 10;
static constexpr char MAX = 11;
static constexpr char SUM = 12;
template <char TYPE>
void range_apply(int i, int il, int ir, int l, int r, int g) {
if (ir <= l or r <= il or break_condition<TYPE>(i, g)) {
// break
} else if (l <= il and ir <= r and tag_condition<TYPE>(i, g)) {
tag<TYPE>(i, g);
} else {
pushdown(i);
range_apply<TYPE>(2 * i + 1, il, (il + ir) / 2, l, r, g);
range_apply<TYPE>(2 * i + 2, (il + ir) / 2, ir, l, r, g);
update(i);
}
}
template <char TYPE> inline bool break_condition(int i, int g) {
switch (TYPE) {
case CHMIN:
return a[i].max <= g;
case CHMAX:
return g <= a[i].min;
case ADD:
return false;
case UPDATE:
return false;
default:
assert(false);
}
}
template <char TYPE> inline bool tag_condition(int i, int g) {
switch (TYPE) {
case CHMIN:
return a[i].max_second < g and g < a[i].max;
case CHMAX:
return a[i].min < g and g < a[i].min_second;
case ADD:
return true;
case UPDATE:
return true;
default:
assert(false);
}
}
template <char TYPE> inline void tag(int i, int g) {
int length = n >> (64 - __builtin_clz(i + 1) - 1);
if (TYPE == CHMIN) {
if (a[i].max == a[i].min or g <= a[i].min) {
tag<UPDATE>(i, g);
return;
}
if (a[i].max != INT64_MIN) {
a[i].sum -= a[i].max * a[i].max_count;
}
a[i].max = g;
a[i].min_second = std::min(a[i].min_second, g);
if (a[i].lazy_update != INT64_MAX) {
a[i].lazy_update = std::min(a[i].lazy_update, g);
}
a[i].sum += g * a[i].max_count;
} else if (TYPE == CHMAX) {
if (a[i].max == a[i].min or a[i].max <= g) {
tag<UPDATE>(i, g);
return;
}
if (a[i].min != INT64_MAX) {
a[i].sum -= a[i].min * a[i].min_count;
}
a[i].min = g;
a[i].max_second = std::max(a[i].max_second, g);
if (a[i].lazy_update != INT64_MAX) {
a[i].lazy_update = std::max(a[i].lazy_update, g);
}
a[i].sum += g * a[i].min_count;
} else if (TYPE == ADD) {
if (a[i].max != INT64_MAX) {
a[i].max += g;
}
if (a[i].max_second != INT64_MIN) {
a[i].max_second += g;
}
if (a[i].min != INT64_MIN) {
a[i].min += g;
}
if (a[i].min_second != INT64_MAX) {
a[i].min_second += g;
}
a[i].lazy_add += g;
if (a[i].lazy_update != INT64_MAX) {
a[i].lazy_update += g;
}
a[i].sum += g * length;
} else if (TYPE == UPDATE) {
a[i].max = g;
a[i].max_second = INT64_MIN;
a[i].max_count = length;
a[i].min = g;
a[i].min_second = INT64_MAX;
a[i].min_count = length;
a[i].lazy_add = 0;
a[i].lazy_update = INT64_MAX;
a[i].sum = g * length;
} else {
assert(false);
}
}
void pushdown(int i) {
int l = 2 * i + 1;
int r = 2 * i + 2;
// update
if (a[i].lazy_update != INT64_MAX) {
tag<UPDATE>(l, a[i].lazy_update);
tag<UPDATE>(r, a[i].lazy_update);
a[i].lazy_update = INT64_MAX;
return;
}
// add
if (a[i].lazy_add != 0) {
tag<ADD>(l, a[i].lazy_add);
tag<ADD>(r, a[i].lazy_add);
a[i].lazy_add = 0;
}
// chmin
if (a[i].max < a[l].max) {
tag<CHMIN>(l, a[i].max);
}
if (a[i].max < a[r].max) {
tag<CHMIN>(r, a[i].max);
}
// chmax
if (a[l].min < a[i].min) {
tag<CHMAX>(l, a[i].min);
}
if (a[r].min < a[i].min) {
tag<CHMAX>(r, a[i].min);
}
}
void update(int i) {
int l = 2 * i + 1;
int r = 2 * i + 2;
// chmin
std::vector<int> b{a[l].max, a[l].max_second, a[r].max, a[r].max_second};
std::sort(b.rbegin(), b.rend());
b.erase(std::unique(all(b)), b.end());
a[i].max = b[0];
a[i].max_second = b[1];
a[i].max_count = (b[0] == a[l].max ? a[l].max_count : 0) +
(b[0] == a[r].max ? a[r].max_count : 0);
// chmax
std::vector<int> c{a[l].min, a[l].min_second, a[r].min, a[r].min_second};
std::sort(all(c));
c.erase(std::unique(all(c)), c.end());
a[i].min = c[0];
a[i].min_second = c[1];
a[i].min_count = (c[0] == a[l].min ? a[l].min_count : 0) +
(c[0] == a[r].min ? a[r].min_count : 0);
// add
a[i].lazy_add = 0;
// update
a[i].lazy_update = INT64_MAX;
// sum
a[i].sum = a[l].sum + a[r].sum;
}
template <char TYPE> int range_get(int i, int il, int ir, int l, int r) {
if (ir <= l or r <= il) {
return 0;
} else if (l <= il and ir <= r) {
// base
switch (TYPE) {
case MIN:
return a[i].min;
case MAX:
return a[i].max;
case SUM:
return a[i].sum;
default:
assert(false);
}
} else {
pushdown(i);
int value_l = range_get<TYPE>(2 * i + 1, il, (il + ir) / 2, l, r);
int value_r = range_get<TYPE>(2 * i + 2, (il + ir) / 2, ir, l, r);
// mult
switch (TYPE) {
case MIN:
return std::min(value_l, value_r);
case MAX:
return std::max(value_l, value_r);
case SUM:
return value_l + value_r;
default:
assert(false);
}
}
}
};
signed main() {
I(n);
I(m);
REP(i, m) {
I(l);
I(r);
I(c);
l--;
r--;
q.eb(mp(l, c), r);
}
int inf = 1145141919810931LL;
segment_tree_beats sb(n + 2);
sb.range_chmax(0, n + 2, inf);
sb.range_update(0, 1, 0);
sort(all(q));
for (auto p : q) {
l = p.first.first;
c = p.first.second;
r = p.second;
int lc = sb.range_max(l, l + 1);
sb.range_chmin(l + 1, r + 1, lc + c);
}
int ret = sb.range_max(n - 1, n);
cout << (ret == inf ? -1 : ret) << endl;
} | //----------------------------templates
#pragma GCC optimize("Ofast")
#pragma GCC target("tune=native")
#pragma GCC target("avx")
//----------------------------
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define int ll
#define FOR(i, j, n) for (int i = (int)(j); i < (n); i++)
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REPS(i, n) for (int i = 1; i <= (int)(n); i++)
#define REPN(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define REPNS(i, n) for (int i = (int)(n); i > 0; i--)
#define I(n) scanf("%lld", &(n))
#define LL(n) scanf("%lld", &(n))
#define pb(n) push_back((n))
#define mp(i, j) make_pair((i), (j))
#define eb(i, j) emplace_back((i), (j))
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define uniq(v) v.erase(unique(v.begin(), v.end()), v.end())
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef vector<pi> vpi;
typedef vector<vi> vvi;
typedef vector<vpi> vvpi;
typedef vector<vvi> vvvi;
const int mod = 1000000007;
//--------------------------------------------
int n, m;
vector<pair<pi, int>> q;
int l, r, c;
class segment_tree_beats {
// MEMO: values for queries (max, min, lazy_add, and lazy_update) already
// apply to the current node; but not for children
typedef struct {
int max;
int max_second;
int max_count;
int min;
int min_second;
int min_count;
int lazy_add;
int lazy_update;
int sum;
} value_type;
int n;
std::vector<value_type> a;
public:
segment_tree_beats() = default;
segment_tree_beats(int n_) {
n = 1;
while (n < n_)
n *= 2;
a.resize(2 * n - 1);
tag<UPDATE>(0, 0);
}
template <class InputIterator>
segment_tree_beats(InputIterator first, InputIterator last) {
int n_ = std::distance(first, last);
n = 1;
while (n < n_)
n *= 2;
a.resize(2 * n - 1);
REP(i, n_) { tag<UPDATE>(n - 1 + i, *(first + i)); }
FOR(i, n_, n) { tag<UPDATE>(n - 1 + i, 0); }
REPN(i, n - 1) { update(i); }
}
void range_chmin(int l, int r, int value) { // 0-based, [l, r)
assert(0 <= l and l <= r and r <= n);
range_apply<CHMIN>(0, 0, n, l, r, value);
}
void range_chmax(int l, int r, int value) { // 0-based, [l, r)
assert(0 <= l and l <= r and r <= n);
range_apply<CHMAX>(0, 0, n, l, r, value);
}
void range_add(int l, int r, int value) { // 0-based, [l, r)
assert(0 <= l and l <= r and r <= n);
range_apply<ADD>(0, 0, n, l, r, value);
}
void range_update(int l, int r, int value) { // 0-based, [l, r)
assert(0 <= l and l <= r and r <= n);
range_apply<UPDATE>(0, 0, n, l, r, value);
}
int range_min(int l, int r) { // 0-based, [l, r)
assert(0 <= l and l <= r and r <= n);
return range_get<MIN>(0, 0, n, l, r);
}
int range_max(int l, int r) { // 0-based, [l, r)
assert(0 <= l and l <= r and r <= n);
return range_get<MAX>(0, 0, n, l, r);
}
int range_sum(int l, int r) { // 0-based, [l, r)
assert(0 <= l and l <= r and r <= n);
return range_get<SUM>(0, 0, n, l, r);
}
private:
static constexpr char CHMIN = 0;
static constexpr char CHMAX = 1;
static constexpr char ADD = 2;
static constexpr char UPDATE = 3;
static constexpr char MIN = 10;
static constexpr char MAX = 11;
static constexpr char SUM = 12;
template <char TYPE>
void range_apply(int i, int il, int ir, int l, int r, int g) {
if (ir <= l or r <= il or break_condition<TYPE>(i, g)) {
// break
} else if (l <= il and ir <= r and tag_condition<TYPE>(i, g)) {
tag<TYPE>(i, g);
} else {
pushdown(i);
range_apply<TYPE>(2 * i + 1, il, (il + ir) / 2, l, r, g);
range_apply<TYPE>(2 * i + 2, (il + ir) / 2, ir, l, r, g);
update(i);
}
}
template <char TYPE> inline bool break_condition(int i, int g) {
switch (TYPE) {
case CHMIN:
return a[i].max <= g;
case CHMAX:
return g <= a[i].min;
case ADD:
return false;
case UPDATE:
return false;
default:
assert(false);
}
}
template <char TYPE> inline bool tag_condition(int i, int g) {
switch (TYPE) {
case CHMIN:
return a[i].max_second < g and g < a[i].max;
case CHMAX:
return a[i].min < g and g < a[i].min_second;
case ADD:
return true;
case UPDATE:
return true;
default:
assert(false);
}
}
template <char TYPE> inline void tag(int i, int g) {
int length = n >> (64 - __builtin_clz(i + 1) - 1);
if (TYPE == CHMIN) {
if (a[i].max == a[i].min or g <= a[i].min) {
tag<UPDATE>(i, g);
return;
}
if (a[i].max != INT64_MIN) {
a[i].sum -= a[i].max * a[i].max_count;
}
a[i].max = g;
a[i].min_second = std::min(a[i].min_second, g);
if (a[i].lazy_update != INT64_MAX) {
a[i].lazy_update = std::min(a[i].lazy_update, g);
}
a[i].sum += g * a[i].max_count;
} else if (TYPE == CHMAX) {
if (a[i].max == a[i].min or a[i].max <= g) {
tag<UPDATE>(i, g);
return;
}
if (a[i].min != INT64_MAX) {
a[i].sum -= a[i].min * a[i].min_count;
}
a[i].min = g;
a[i].max_second = std::max(a[i].max_second, g);
if (a[i].lazy_update != INT64_MAX) {
a[i].lazy_update = std::max(a[i].lazy_update, g);
}
a[i].sum += g * a[i].min_count;
} else if (TYPE == ADD) {
if (a[i].max != INT64_MAX) {
a[i].max += g;
}
if (a[i].max_second != INT64_MIN) {
a[i].max_second += g;
}
if (a[i].min != INT64_MIN) {
a[i].min += g;
}
if (a[i].min_second != INT64_MAX) {
a[i].min_second += g;
}
a[i].lazy_add += g;
if (a[i].lazy_update != INT64_MAX) {
a[i].lazy_update += g;
}
a[i].sum += g * length;
} else if (TYPE == UPDATE) {
a[i].max = g;
a[i].max_second = INT64_MIN;
a[i].max_count = length;
a[i].min = g;
a[i].min_second = INT64_MAX;
a[i].min_count = length;
a[i].lazy_add = 0;
a[i].lazy_update = INT64_MAX;
a[i].sum = g * length;
} else {
assert(false);
}
}
void pushdown(int i) {
int l = 2 * i + 1;
int r = 2 * i + 2;
// update
if (a[i].lazy_update != INT64_MAX) {
tag<UPDATE>(l, a[i].lazy_update);
tag<UPDATE>(r, a[i].lazy_update);
a[i].lazy_update = INT64_MAX;
return;
}
// add
if (a[i].lazy_add != 0) {
tag<ADD>(l, a[i].lazy_add);
tag<ADD>(r, a[i].lazy_add);
a[i].lazy_add = 0;
}
// chmin
if (a[i].max < a[l].max) {
tag<CHMIN>(l, a[i].max);
}
if (a[i].max < a[r].max) {
tag<CHMIN>(r, a[i].max);
}
// chmax
if (a[l].min < a[i].min) {
tag<CHMAX>(l, a[i].min);
}
if (a[r].min < a[i].min) {
tag<CHMAX>(r, a[i].min);
}
}
void update(int i) {
int l = 2 * i + 1;
int r = 2 * i + 2;
// chmin
std::vector<int> b{a[l].max, a[l].max_second, a[r].max, a[r].max_second};
std::sort(b.rbegin(), b.rend());
b.erase(std::unique(all(b)), b.end());
a[i].max = b[0];
a[i].max_second = b[1];
a[i].max_count = (b[0] == a[l].max ? a[l].max_count : 0) +
(b[0] == a[r].max ? a[r].max_count : 0);
// chmax
std::vector<int> c{a[l].min, a[l].min_second, a[r].min, a[r].min_second};
std::sort(all(c));
c.erase(std::unique(all(c)), c.end());
a[i].min = c[0];
a[i].min_second = c[1];
a[i].min_count = (c[0] == a[l].min ? a[l].min_count : 0) +
(c[0] == a[r].min ? a[r].min_count : 0);
// add
a[i].lazy_add = 0;
// update
a[i].lazy_update = INT64_MAX;
// sum
a[i].sum = a[l].sum + a[r].sum;
}
template <char TYPE> int range_get(int i, int il, int ir, int l, int r) {
if (ir <= l or r <= il) {
return 0;
} else if (l <= il and ir <= r) {
// base
switch (TYPE) {
case MIN:
return a[i].min;
case MAX:
return a[i].max;
case SUM:
return a[i].sum;
default:
assert(false);
}
} else {
pushdown(i);
int value_l = range_get<TYPE>(2 * i + 1, il, (il + ir) / 2, l, r);
int value_r = range_get<TYPE>(2 * i + 2, (il + ir) / 2, ir, l, r);
// mult
switch (TYPE) {
case MIN:
return std::min(value_l, value_r);
case MAX:
return std::max(value_l, value_r);
case SUM:
return value_l + value_r;
default:
assert(false);
}
}
}
};
signed main() {
I(n);
I(m);
REP(i, m) {
I(l);
I(r);
I(c);
l--;
r--;
q.eb(mp(l, c), r);
}
int inf = 1145141919810931LL;
segment_tree_beats sb(n);
sb.range_update(1, n, inf);
sort(all(q));
for (auto p : q) {
l = p.first.first;
c = p.first.second;
r = p.second;
int lc = sb.range_max(l, l + 1);
sb.range_chmin(l + 1, r + 1, lc + c);
}
int ret = sb.range_max(n - 1, n);
cout << (ret == inf ? -1 : ret) << endl;
} | replace | 332 | 335 | 332 | 334 | 0 | |
p02868 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1e18;
int n, m;
vector<P> edge[100010];
vector<ll> dijkstra(int x) {
vector<ll> dist(n + 1, INF);
priority_queue<P, vector<P>, greater<P>> q;
dist[x] = 0;
q.push(P(0, x));
while (!q.empty()) {
ll d = q.top().first;
ll p = q.top().second;
q.pop();
if (dist[p] < d)
continue;
for (P next : edge[p]) {
ll to = next.first;
ll co = next.second;
if (dist[p] + co >= dist[to])
continue;
dist[to] = dist[p] + co;
q.push(P(dist[to], to));
}
}
return dist;
}
int main() {
cin >> n >> m;
rep(i, m) {
int l, r, c;
cin >> l >> r >> c;
edge[l].push_back(P(r, c));
}
rep(i, n - 1) { edge[i + 1].push_back(P(i, 0)); }
vector<ll> dist = dijkstra(1);
if (dist[n] != INF)
cout << dist[n] << endl;
else
cout << -1 << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1e18;
int n, m;
vector<P> edge[100010];
vector<ll> dijkstra(int x) {
vector<ll> dist(n + 1, INF);
priority_queue<P, vector<P>, greater<P>> q;
dist[x] = 0;
q.push(P(0, x));
while (!q.empty()) {
ll d = q.top().first;
ll p = q.top().second;
q.pop();
if (dist[p] < d)
continue;
for (P next : edge[p]) {
ll to = next.first;
ll co = next.second;
if (dist[p] + co >= dist[to])
continue;
dist[to] = dist[p] + co;
q.push(P(dist[to], to));
}
}
return dist;
}
int main() {
cin >> n >> m;
rep(i, m) {
int l, r, c;
cin >> l >> r >> c;
edge[l].push_back(P(r, c));
}
rep(i, n - 1) { edge[i + 1].push_back(P(i, 0)); }
vector<ll> dist = dijkstra(1);
if (dist[n] != INF)
cout << dist[n] << endl;
else
cout << -1 << endl;
} | replace | 4 | 5 | 4 | 5 | TLE | |
p02868 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(X, S, E) for (int(X) = (S); (X) < (E); ++(X))
#define rrep(X, S, E) for (int(X) = (E)-1; (X) >= (S); --(X))
#define itrep(X, Y) for (auto(X) = (Y).begin(); (X) != (Y).end(); (X)++)
#define all(X) (X).begin(), (X).end()
#define sortDecending(X) sort(all(X), greater<ll>()) // 降順
#define sortAscending(X) sort(all(X)) // 昇順
#define pb push_back
#define mp make_pair
#define fi first
#define sc second
#define print(x) cout << x << endl
#define printDouble(x) cout << fixed << setprecision(13) << x << endl
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef priority_queue<ll, vl> decendingQueue; // 降順
typedef priority_queue<ll, vl, greater<ll>> ascendingQueue; // 昇順
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const ll INF = 9 * 1e18;
const ll MOD = 1e9 + 7;
long long gcd(long long m, long long n) {
if (m < n)
return gcd(n, m);
if (n == 0)
return m;
return gcd(n, m % n);
}
long long lcm(long long m, long long n) {
// m * nでlong型のオーバフローを発生させないため、先に割り算から行う
return m * (n / gcd(m, n));
}
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
// combination mod prime
// https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
};
vector<long long> SieveOfEratosthenes(int max) {
vector<long long> sieve;
vector<long long> primes;
for (int i = 1; i < max + 1; ++i) {
sieve.push_back(i);
}
sieve[0] = 0;
for (int i = 2; i < max + 1; ++i) {
if (sieve[i - 1] != 0) {
primes.push_back(sieve[i - 1]);
for (int j = 2 * sieve[i - 1]; j < max + 1; j += sieve[i - 1]) {
sieve[j - 1] = 0;
}
}
}
return primes;
}
class UnionFindTree {
private:
vector<int> par;
vector<int> rnk;
vector<int> siz;
public:
UnionFindTree(int n) {
par.assign(n, -1);
rnk.assign(n, -1);
siz.assign(n, -1);
for (int i = 0; i < n; ++i) {
par[i] = i;
rnk[i] = 0;
siz[i] = 1;
}
}
int find(int x) {
if (par[x] == x)
return x;
else
return par[x] = find(par[x]);
}
bool same(int x, int y) { return find(x) == find(y); }
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (rnk[x] < rnk[y]) {
par[x] = y;
siz[y] += siz[x];
} else {
par[y] = x;
siz[x] += siz[y];
if (rnk[x] == rnk[y])
++rnk[x];
}
}
int size(int x) {
x = find(x);
return siz[x];
}
};
class Edge {
public:
ll from;
ll to;
ll cost;
Edge() {}
Edge(ll from, ll to, ll cost) {
this->from = from;
this->to = to;
this->cost = cost;
}
bool operator<(const Edge &edge) const {
return cost < edge.cost; // 昇順
}
};
class Graph {
public:
ll nodes; // ノード数
vector<Edge> edges;
Graph() {}
Graph(ll nodes) { this->nodes = nodes; }
void addEdge(ll from, ll to, ll cost) {
this->edges.push_back(Edge(from, to, cost));
}
};
// クラスカル法
// 連結グラフの最小全域木を求める
class Kruskal {
private:
Graph graph;
vector<Edge> MinimumSpanningTree;
ll minimumCost;
void searchMinimumSpanningTree() {
UnionFindTree uf(graph.nodes);
sort(all(graph.edges));
itrep(edge, graph.edges) {
if (!uf.same(edge->from, edge->to)) {
uf.unite(edge->from, edge->to);
MinimumSpanningTree.push_back(*edge);
}
}
}
public:
Kruskal(Graph graph) { this->graph = graph; }
ll getMinimumSpanningTreeCost() {
searchMinimumSpanningTree();
ll cost = 0;
itrep(it, MinimumSpanningTree) { cost += it->cost; }
return cost;
}
};
// ダイクストラ法 O((E+V)logV)
// 最小経路問題を解くためのアルゴリズム。辺の重みに負数を含む場合は利用不可
// 有向グラフ(無向グラフ)の場合はコメントアウト箇所をコメントイン
class Dijkstra {
private:
Graph graph;
map<ll, vector<Edge>> fromPaths;
vl distances;
vl srcs;
public:
Dijkstra(Graph &graph) {
this->graph = graph;
itrep(edge, graph.edges) {
fromPaths[edge->from].push_back(*edge);
// fromPaths[edge->to].push_back(Edge(edge->to, edge->from, edge->cost));
}
}
void searchMinimumPathFrom(ll src) {
// 複数回呼ばれる度に計算する
distances = vl(graph.nodes + 1, INF);
srcs = vl(graph.nodes + 1, INF);
priority_queue<ll> pq;
distances[src] = 0;
srcs[src] = -1;
pq.push(src);
while (!pq.empty()) {
int u = pq.top();
pq.pop();
itrep(edge, fromPaths[u]) {
int v = edge->to;
ll w = edge->cost;
if (distances[v] > distances[u] + w) {
distances[v] = distances[u] + w;
srcs[v] = u;
pq.push(v);
}
}
}
};
ll getDistance(ll n) { return distances[n]; }
ll getFrom(ll n) { return srcs[n]; }
};
// ベルマンフォード O(|V||E|)
// 負コストが含まれていても最短経路問題を解くためのアルゴリズム。閉路の検出も可能
// 有向グラフ
class BellmanFord {
private:
Graph graph;
// 閉路が含まれるかは個々のノードごとに管理する必要あり
vector<bool> hasNegativeCycles;
vector<ll> distances;
vl srcs;
public:
BellmanFord(Graph graph) {
ll nodes = graph.nodes + 1;
this->graph = graph;
distances = vector<ll>(nodes, INF);
hasNegativeCycles = vector<bool>(nodes, false);
}
void searchMinimumPathFrom(ll src) {
distances[src] = 0;
for (ll i = 0; i < graph.nodes - 1; i++) {
itrep(edge, graph.edges) {
ll u = edge->from;
ll v = edge->to;
ll w = edge->cost;
if (distances[u] != INF) {
chmin(distances[v], distances[u] + w);
}
}
}
itrep(edge, graph.edges) {
ll u = edge->from;
ll v = edge->to;
ll w = edge->cost;
if (distances[u] == INF) {
continue;
}
if (distances[u] + w < distances[v]) {
hasNegativeCycles[v] = true;
}
}
for (ll i = 0; i < graph.nodes; i++) {
itrep(edge, graph.edges) {
ll u = edge->from;
ll v = edge->to;
ll w = edge->cost;
if (distances[u] == INF) {
continue;
}
chmin(distances[v], distances[u] + w);
if (hasNegativeCycles[u] == true) {
hasNegativeCycles[v] = true;
}
}
}
}
ll getDistance(ll n) { return distances[n]; }
bool hasNegativeCycle(ll n) { return hasNegativeCycles[n]; }
ll getFrom(ll n) { return srcs[n]; }
};
// O(V^3) 有向グラフ
class WarshallFloyd {
private:
Graph graph;
int nodes = this->graph.nodes + 1;
vector<vector<ll>> distances;
public:
WarshallFloyd(Graph graph) {
this->graph = graph;
nodes = this->graph.nodes + 1;
this->distances = vector<vector<ll>>(nodes, vector<ll>(nodes, INF));
itrep(edge, graph.edges) {
int from = edge->from;
int to = edge->to;
int cost = edge->cost;
distances[from][to] = cost;
}
}
void searchMinimumPath() {
for (int k = 0; k < nodes; k++) {
for (int i = 0; i < nodes; i++) {
for (int j = 0; j < nodes; j++) {
if (distances[i][k] == INF || distances[k][j] == INF) {
continue;
}
if (distances[i][k] + distances[k][j] < distances[i][j]) {
distances[i][j] = distances[i][k] + distances[k][j];
}
}
}
}
}
ll getDistance(int from, int to) { return distances[from][to]; }
};
void solve(long long N, long long M, std::vector<long long> L,
std::vector<long long> R, std::vector<long long> C) {
// 1つ前の頂点に長さ0の辺を付与
Graph g(N);
rep(i, 1, N) { g.addEdge(i, i - 1, 0); }
rep(i, 0, M) { g.addEdge(--L[i], --R[i], C[i]); }
Dijkstra dikjstra(g);
dikjstra.searchMinimumPathFrom(0);
ll dist = dikjstra.getDistance(N - 1);
if (dist != INF) {
print(dist);
} else {
print(-1);
}
}
int main() {
long long N;
scanf("%lld", &N);
long long M;
scanf("%lld", &M);
std::vector<long long> L(M);
std::vector<long long> R(M);
std::vector<long long> C(M);
for (int i = 0; i < M; i++) {
scanf("%lld", &L[i]);
scanf("%lld", &R[i]);
scanf("%lld", &C[i]);
}
solve(N, M, std::move(L), std::move(R), std::move(C));
return 0;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(X, S, E) for (int(X) = (S); (X) < (E); ++(X))
#define rrep(X, S, E) for (int(X) = (E)-1; (X) >= (S); --(X))
#define itrep(X, Y) for (auto(X) = (Y).begin(); (X) != (Y).end(); (X)++)
#define all(X) (X).begin(), (X).end()
#define sortDecending(X) sort(all(X), greater<ll>()) // 降順
#define sortAscending(X) sort(all(X)) // 昇順
#define pb push_back
#define mp make_pair
#define fi first
#define sc second
#define print(x) cout << x << endl
#define printDouble(x) cout << fixed << setprecision(13) << x << endl
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef priority_queue<ll, vl> decendingQueue; // 降順
typedef priority_queue<ll, vl, greater<ll>> ascendingQueue; // 昇順
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const ll INF = 9 * 1e18;
const ll MOD = 1e9 + 7;
long long gcd(long long m, long long n) {
if (m < n)
return gcd(n, m);
if (n == 0)
return m;
return gcd(n, m % n);
}
long long lcm(long long m, long long n) {
// m * nでlong型のオーバフローを発生させないため、先に割り算から行う
return m * (n / gcd(m, n));
}
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
// combination mod prime
// https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
};
vector<long long> SieveOfEratosthenes(int max) {
vector<long long> sieve;
vector<long long> primes;
for (int i = 1; i < max + 1; ++i) {
sieve.push_back(i);
}
sieve[0] = 0;
for (int i = 2; i < max + 1; ++i) {
if (sieve[i - 1] != 0) {
primes.push_back(sieve[i - 1]);
for (int j = 2 * sieve[i - 1]; j < max + 1; j += sieve[i - 1]) {
sieve[j - 1] = 0;
}
}
}
return primes;
}
class UnionFindTree {
private:
vector<int> par;
vector<int> rnk;
vector<int> siz;
public:
UnionFindTree(int n) {
par.assign(n, -1);
rnk.assign(n, -1);
siz.assign(n, -1);
for (int i = 0; i < n; ++i) {
par[i] = i;
rnk[i] = 0;
siz[i] = 1;
}
}
int find(int x) {
if (par[x] == x)
return x;
else
return par[x] = find(par[x]);
}
bool same(int x, int y) { return find(x) == find(y); }
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (rnk[x] < rnk[y]) {
par[x] = y;
siz[y] += siz[x];
} else {
par[y] = x;
siz[x] += siz[y];
if (rnk[x] == rnk[y])
++rnk[x];
}
}
int size(int x) {
x = find(x);
return siz[x];
}
};
class Edge {
public:
ll from;
ll to;
ll cost;
Edge() {}
Edge(ll from, ll to, ll cost) {
this->from = from;
this->to = to;
this->cost = cost;
}
bool operator<(const Edge &edge) const {
return cost < edge.cost; // 昇順
}
};
class Graph {
public:
ll nodes; // ノード数
vector<Edge> edges;
Graph() {}
Graph(ll nodes) { this->nodes = nodes; }
void addEdge(ll from, ll to, ll cost) {
this->edges.push_back(Edge(from, to, cost));
}
};
// クラスカル法
// 連結グラフの最小全域木を求める
class Kruskal {
private:
Graph graph;
vector<Edge> MinimumSpanningTree;
ll minimumCost;
void searchMinimumSpanningTree() {
UnionFindTree uf(graph.nodes);
sort(all(graph.edges));
itrep(edge, graph.edges) {
if (!uf.same(edge->from, edge->to)) {
uf.unite(edge->from, edge->to);
MinimumSpanningTree.push_back(*edge);
}
}
}
public:
Kruskal(Graph graph) { this->graph = graph; }
ll getMinimumSpanningTreeCost() {
searchMinimumSpanningTree();
ll cost = 0;
itrep(it, MinimumSpanningTree) { cost += it->cost; }
return cost;
}
};
// ダイクストラ法 O((E+V)logV)
// 最小経路問題を解くためのアルゴリズム。辺の重みに負数を含む場合は利用不可
// 有向グラフ(無向グラフ)の場合はコメントアウト箇所をコメントイン
class Dijkstra {
private:
Graph graph;
map<ll, vector<Edge>> fromPaths;
vl distances;
vl srcs;
public:
Dijkstra(Graph &graph) {
this->graph = graph;
itrep(edge, graph.edges) {
fromPaths[edge->from].push_back(*edge);
// fromPaths[edge->to].push_back(Edge(edge->to, edge->from, edge->cost));
}
}
void searchMinimumPathFrom(ll src) {
// 複数回呼ばれる度に計算する
distances = vl(graph.nodes + 1, INF);
srcs = vl(graph.nodes + 1, INF);
ascendingQueue pq;
distances[src] = 0;
srcs[src] = -1;
pq.push(src);
while (!pq.empty()) {
int u = pq.top();
pq.pop();
itrep(edge, fromPaths[u]) {
int v = edge->to;
ll w = edge->cost;
if (distances[v] > distances[u] + w) {
distances[v] = distances[u] + w;
srcs[v] = u;
pq.push(v);
}
}
}
};
ll getDistance(ll n) { return distances[n]; }
ll getFrom(ll n) { return srcs[n]; }
};
// ベルマンフォード O(|V||E|)
// 負コストが含まれていても最短経路問題を解くためのアルゴリズム。閉路の検出も可能
// 有向グラフ
class BellmanFord {
private:
Graph graph;
// 閉路が含まれるかは個々のノードごとに管理する必要あり
vector<bool> hasNegativeCycles;
vector<ll> distances;
vl srcs;
public:
BellmanFord(Graph graph) {
ll nodes = graph.nodes + 1;
this->graph = graph;
distances = vector<ll>(nodes, INF);
hasNegativeCycles = vector<bool>(nodes, false);
}
void searchMinimumPathFrom(ll src) {
distances[src] = 0;
for (ll i = 0; i < graph.nodes - 1; i++) {
itrep(edge, graph.edges) {
ll u = edge->from;
ll v = edge->to;
ll w = edge->cost;
if (distances[u] != INF) {
chmin(distances[v], distances[u] + w);
}
}
}
itrep(edge, graph.edges) {
ll u = edge->from;
ll v = edge->to;
ll w = edge->cost;
if (distances[u] == INF) {
continue;
}
if (distances[u] + w < distances[v]) {
hasNegativeCycles[v] = true;
}
}
for (ll i = 0; i < graph.nodes; i++) {
itrep(edge, graph.edges) {
ll u = edge->from;
ll v = edge->to;
ll w = edge->cost;
if (distances[u] == INF) {
continue;
}
chmin(distances[v], distances[u] + w);
if (hasNegativeCycles[u] == true) {
hasNegativeCycles[v] = true;
}
}
}
}
ll getDistance(ll n) { return distances[n]; }
bool hasNegativeCycle(ll n) { return hasNegativeCycles[n]; }
ll getFrom(ll n) { return srcs[n]; }
};
// O(V^3) 有向グラフ
class WarshallFloyd {
private:
Graph graph;
int nodes = this->graph.nodes + 1;
vector<vector<ll>> distances;
public:
WarshallFloyd(Graph graph) {
this->graph = graph;
nodes = this->graph.nodes + 1;
this->distances = vector<vector<ll>>(nodes, vector<ll>(nodes, INF));
itrep(edge, graph.edges) {
int from = edge->from;
int to = edge->to;
int cost = edge->cost;
distances[from][to] = cost;
}
}
void searchMinimumPath() {
for (int k = 0; k < nodes; k++) {
for (int i = 0; i < nodes; i++) {
for (int j = 0; j < nodes; j++) {
if (distances[i][k] == INF || distances[k][j] == INF) {
continue;
}
if (distances[i][k] + distances[k][j] < distances[i][j]) {
distances[i][j] = distances[i][k] + distances[k][j];
}
}
}
}
}
ll getDistance(int from, int to) { return distances[from][to]; }
};
void solve(long long N, long long M, std::vector<long long> L,
std::vector<long long> R, std::vector<long long> C) {
// 1つ前の頂点に長さ0の辺を付与
Graph g(N);
rep(i, 1, N) { g.addEdge(i, i - 1, 0); }
rep(i, 0, M) { g.addEdge(--L[i], --R[i], C[i]); }
Dijkstra dikjstra(g);
dikjstra.searchMinimumPathFrom(0);
ll dist = dikjstra.getDistance(N - 1);
if (dist != INF) {
print(dist);
} else {
print(-1);
}
}
int main() {
long long N;
scanf("%lld", &N);
long long M;
scanf("%lld", &M);
std::vector<long long> L(M);
std::vector<long long> R(M);
std::vector<long long> C(M);
for (int i = 0; i < M; i++) {
scanf("%lld", &L[i]);
scanf("%lld", &R[i]);
scanf("%lld", &C[i]);
}
solve(N, M, std::move(L), std::move(R), std::move(C));
return 0;
}
| replace | 284 | 285 | 284 | 285 | TLE | |
p02868 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
const long long INF = 1e18;
struct Edge {
int from, to;
long long cost;
Edge(int _to, long long _cost) : from(-1), to(_to), cost(_cost) {}
Edge(int _from, int _to, long long _cost)
: from(_from), to(_to), cost(_cost) {}
};
template <class T>
vector<T> Dijkstra(const vector<vector<Edge>> &G, int s, T def) {
using P = pair<T, int>;
priority_queue<P, vector<P>, greater<P>> pq;
vector<T> dist((int)G.size(), def);
pq.push({0, s});
dist[s] = 0;
while (!pq.empty()) {
int cur = pq.top().second;
pq.pop();
for (auto &e : G[cur]) {
if (dist[e.to] > dist[cur] + e.cost) {
dist[e.to] = dist[cur] + e.cost;
pq.push({dist[e.to], e.to});
}
}
}
return dist;
}
void solve() {
int N, M;
cin >> N >> M;
vector<vector<Edge>> G(N);
for (int i = 0; i < M; ++i) {
int a, b;
long long c;
cin >> a >> b >> c;
a--, b--;
G[a].emplace_back(b, c);
G[b].emplace_back(a, c);
if (i)
G[i].emplace_back(i - 1, 0LL);
}
auto dist = Dijkstra(G, 0, INF);
if (dist[N - 1] == INF)
cout << -1 << '\n';
else
cout << dist[N - 1] << '\n';
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
const long long INF = 1e18;
struct Edge {
int from, to;
long long cost;
Edge(int _to, long long _cost) : from(-1), to(_to), cost(_cost) {}
Edge(int _from, int _to, long long _cost)
: from(_from), to(_to), cost(_cost) {}
};
template <class T>
vector<T> Dijkstra(const vector<vector<Edge>> &G, int s, T def) {
using P = pair<T, int>;
priority_queue<P, vector<P>, greater<P>> pq;
vector<T> dist((int)G.size(), def);
pq.push({0, s});
dist[s] = 0;
while (!pq.empty()) {
int cur = pq.top().second;
pq.pop();
for (auto &e : G[cur]) {
if (dist[e.to] > dist[cur] + e.cost) {
dist[e.to] = dist[cur] + e.cost;
pq.push({dist[e.to], e.to});
}
}
}
return dist;
}
void solve() {
int N, M;
cin >> N >> M;
vector<vector<Edge>> G(N);
for (int i = 0; i < M; ++i) {
int a, b;
long long c;
cin >> a >> b >> c;
a--, b--;
G[a].emplace_back(b, c);
G[b].emplace_back(a, c);
}
rep(i, N) {
if (i)
G[i].emplace_back(i - 1, 0LL);
}
auto dist = Dijkstra(G, 0, INF);
if (dist[N - 1] == INF)
cout << -1 << '\n';
else
cout << dist[N - 1] << '\n';
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
| insert | 44 | 44 | 44 | 46 | 0 | |
p02868 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const ll mod = 1000000007;
// const ll mod = 998244353;
const int inf = 1e9 + 10;
const ll INF = 1e18;
const ld EPS = 1e-10;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
typedef pair<ll, ll> P;
vector<P> G[100100];
vector<ll> d(100100, INF);
void dijkstra() {
d[0] = 0;
priority_queue<P, vector<P>, greater<P>> pq;
pq.push({0, 0});
while (!pq.empty()) {
ll dist = pq.top().first, v = pq.top().second;
pq.pop();
if (d[v] < dist)
continue;
for (auto e : G[v]) {
ll c = e.first, u = e.second;
if (chmin(d[u], d[v] + c)) {
pq.push(e);
}
}
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(25);
ll n, m;
cin >> n >> m;
rep(i, n - 1) G[i + 1].push_back({0, i});
rep(i, m) {
ll l, r, c;
cin >> l >> r >> c;
l--, r--;
G[l].push_back({c, r});
}
dijkstra();
cout << (d[n - 1] == INF ? -1 : d[n - 1]) << '\n';
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n); i >= 0; --i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const ll mod = 1000000007;
// const ll mod = 998244353;
const int inf = 1e9 + 10;
const ll INF = 1e18;
const ld EPS = 1e-10;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
typedef pair<ll, ll> P;
vector<P> G[100100];
vector<ll> d(100100, INF);
void dijkstra() {
d[0] = 0;
priority_queue<P, vector<P>, greater<P>> pq;
pq.push({0, 0});
while (!pq.empty()) {
ll dist = pq.top().first, v = pq.top().second;
pq.pop();
if (d[v] < dist)
continue;
for (auto e : G[v]) {
ll c = e.first, u = e.second;
if (chmin(d[u], d[v] + c)) {
pq.push({d[u], u});
}
}
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(25);
ll n, m;
cin >> n >> m;
rep(i, n - 1) G[i + 1].push_back({0, i});
rep(i, m) {
ll l, r, c;
cin >> l >> r >> c;
l--, r--;
G[l].push_back({c, r});
}
dijkstra();
cout << (d[n - 1] == INF ? -1 : d[n - 1]) << '\n';
return 0;
} | replace | 49 | 50 | 49 | 50 | TLE | |
p02868 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// container util
#define all(x) (x).begin(), (x).end()
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
// typedef
typedef long long lint;
typedef unsigned long long ull;
typedef complex<long double> Complex;
typedef pair<int, int> P;
typedef tuple<int, int, int> TP;
typedef vector<int> vec;
typedef vector<vec> mat;
// constant
const int MOD = (int)1e9 + 7;
const int INF = (int)1e18;
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
const int ddx[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[] = {1, 1, 0, -1, -1, -1, 0, 1};
// conversion
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
//
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;
}
//
template <typename T> struct edge {
int from, to;
T cost;
edge(int t, T c) { to = t, cost = c; }
edge(int f, int t, T c) { from = f, to = t, cost = c; }
};
template <typename T> using Edges = vector<edge<T>>;
template <typename T> using Graph = vector<Edges<T>>;
template <typename T> vector<T> dijkstra(Graph<T> &G, int s) {
const auto INF = numeric_limits<T>::max(); // Be careful not to overflow
vector<T> dist(G.size(), INF);
using Pli = pair<T, int>;
priority_queue<Pli, vector<Pli>, greater<Pli>> que;
dist[s] = 0;
que.emplace(dist[s], s); // cost, from
while (!que.empty()) {
Pli p = que.top();
que.pop();
T cost = p.first;
int cur = p.second;
if (dist[cur] < cost)
continue;
for (auto e : G[cur]) {
auto next_cost = dist[cur] + e.cost;
if (dist[e.to] <= next_cost)
continue;
dist[e.to] = next_cost;
que.emplace(dist[e.to], e.to);
}
}
return dist;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
Graph<lint> G(n);
int l, r;
lint c;
FOR(i, 1, m) G[i].emplace_back(i - 1, 0);
rep(i, m) {
cin >> l >> r >> c;
l--, r--;
G[l].emplace_back(r, c);
}
auto dist = dijkstra(G, 0);
if (dist[n - 1] == numeric_limits<lint>::max()) {
cout << -1 << endl;
} else {
cout << dist[n - 1] << endl;
}
return 0;
} | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// container util
#define all(x) (x).begin(), (x).end()
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
// typedef
typedef long long lint;
typedef unsigned long long ull;
typedef complex<long double> Complex;
typedef pair<int, int> P;
typedef tuple<int, int, int> TP;
typedef vector<int> vec;
typedef vector<vec> mat;
// constant
const int MOD = (int)1e9 + 7;
const int INF = (int)1e18;
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
const int ddx[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[] = {1, 1, 0, -1, -1, -1, 0, 1};
// conversion
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
//
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;
}
//
template <typename T> struct edge {
int from, to;
T cost;
edge(int t, T c) { to = t, cost = c; }
edge(int f, int t, T c) { from = f, to = t, cost = c; }
};
template <typename T> using Edges = vector<edge<T>>;
template <typename T> using Graph = vector<Edges<T>>;
template <typename T> vector<T> dijkstra(Graph<T> &G, int s) {
const auto INF = numeric_limits<T>::max(); // Be careful not to overflow
vector<T> dist(G.size(), INF);
using Pli = pair<T, int>;
priority_queue<Pli, vector<Pli>, greater<Pli>> que;
dist[s] = 0;
que.emplace(dist[s], s); // cost, from
while (!que.empty()) {
Pli p = que.top();
que.pop();
T cost = p.first;
int cur = p.second;
if (dist[cur] < cost)
continue;
for (auto e : G[cur]) {
auto next_cost = dist[cur] + e.cost;
if (dist[e.to] <= next_cost)
continue;
dist[e.to] = next_cost;
que.emplace(dist[e.to], e.to);
}
}
return dist;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
Graph<lint> G(n);
int l, r;
lint c;
FOR(i, 1, n) G[i].emplace_back(i - 1, 0);
rep(i, m) {
cin >> l >> r >> c;
l--, r--;
G[l].emplace_back(r, c);
}
auto dist = dijkstra(G, 0);
if (dist[n - 1] == numeric_limits<lint>::max()) {
cout << -1 << endl;
} else {
cout << dist[n - 1] << endl;
}
return 0;
} | replace | 109 | 110 | 109 | 110 | 0 | |
p02868 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
int n, m;
vector<P> to[100005];
vector<ll> dist(100005, LLONG_MAX);
ll solve() {
priority_queue<P, vector<P>, greater<P>> pq;
dist[0] = 0;
pq.push(P(0, 0));
while (pq.size() > 0) {
P cur = pq.top();
pq.pop();
ll d = cur.first;
ll u = cur.second;
if (d > dist[u])
continue;
for (P nx : to[u]) {
ll duv = nx.first;
ll v = nx.second;
if (dist[v] > d + duv) {
dist[v] = d + duv;
pq.push(P(dist[v], v));
}
}
}
return dist[n - 1] == LLONG_MAX ? -1 : dist[n - 1];
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
rep(i, m) {
ll l, r, c;
cin >> l >> r >> c;
--l, --r;
to[l].push_back(make_pair(c, r));
for (int j = l; j < r; j++) {
to[j + 1].push_back(make_pair(0, j));
}
}
cout << solve() << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
int n, m;
vector<P> to[100005];
vector<ll> dist(100005, LLONG_MAX);
ll solve() {
priority_queue<P, vector<P>, greater<P>> pq;
dist[0] = 0;
pq.push(P(0, 0));
while (pq.size() > 0) {
P cur = pq.top();
pq.pop();
ll d = cur.first;
ll u = cur.second;
if (d > dist[u])
continue;
for (P nx : to[u]) {
ll duv = nx.first;
ll v = nx.second;
if (dist[v] > d + duv) {
dist[v] = d + duv;
pq.push(P(dist[v], v));
}
}
}
return dist[n - 1] == LLONG_MAX ? -1 : dist[n - 1];
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m;
rep(i, m) {
ll l, r, c;
cin >> l >> r >> c;
--l, --r;
to[l].push_back(make_pair(c, r));
}
for (int j = 0; j < n; j++) {
to[j + 1].push_back(make_pair(0, j));
}
cout << solve() << endl;
return 0;
} | replace | 44 | 47 | 44 | 47 | TLE | |
p02868 | C++ | Runtime Error | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using ll = long long;
using namespace std;
template <typename T> vector<T> make_v(size_t a, T b) {
return vector<T>(a, b);
}
template <typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v(ts...))>(a, make_v(ts...));
}
template <class Monoid> class SegmentTree {
private:
using T = typename Monoid::T;
const size_t n;
vector<T> d;
void build() {
for (size_t b = n - 1; b > 0; b--)
d[b] = Monoid::op(d[b << 1], d[b << 1 | 1]);
}
public:
SegmentTree(size_t n) : n(n), d(2 * n, Monoid::identify()) {}
template <typename InputItr>
SegmentTree(InputItr first, InputItr last)
: n(distance(first, last)), d(2 * n, Monoid::identify()) {
copy(first, last, next(d.begin(), n));
build();
}
/* set one value */
void modify(size_t k, T v) {
for (d[k += n] = v; k > 1; k >>= 1)
d[k >> 1] = Monoid::op(d[k], d[k ^ 1]);
}
/* return [l, r) value */
T query(size_t l, size_t r) {
T res{Monoid::identify()};
for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
if (l & 1)
res = Monoid::op(res, d[l++]);
if (r & 1)
res = Monoid::op(res, d[--r]);
}
return res;
}
T get(size_t i) { return query(i, i + 1); }
};
template <typename U = ll> struct RMQ {
using T = U;
static T op(const T &a, const T &b) { return min<T>(a, b); }
static constexpr T identify() { return numeric_limits<T>::max(); }
};
int main() {
int n, m;
cin >> n >> m;
vector<int> l(n), r(n), c(n);
REP(i, m) {
cin >> l[i] >> r[i] >> c[i];
--l[i];
--r[i];
}
vector<int> o(m);
iota(o.begin(), o.end(), 0);
sort(o.begin(), o.end(), [&](int i, int j) { return r[i] < r[j]; });
SegmentTree<RMQ<>> tree(n);
tree.modify(0, 0);
REP(i, m) {
ll m = tree.query(l[o[i]], r[o[i]]);
if (m == RMQ<>::identify())
continue;
ll now = tree.get(r[o[i]]);
tree.modify(r[o[i]], min(now, m + c[o[i]]));
}
if (tree.get(n - 1) != RMQ<>::identify()) {
cout << tree.get(n - 1) << endl;
} else {
cout << -1 << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define bit(x) (1L << (x))
using ll = long long;
using namespace std;
template <typename T> vector<T> make_v(size_t a, T b) {
return vector<T>(a, b);
}
template <typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v(ts...))>(a, make_v(ts...));
}
template <class Monoid> class SegmentTree {
private:
using T = typename Monoid::T;
const size_t n;
vector<T> d;
void build() {
for (size_t b = n - 1; b > 0; b--)
d[b] = Monoid::op(d[b << 1], d[b << 1 | 1]);
}
public:
SegmentTree(size_t n) : n(n), d(2 * n, Monoid::identify()) {}
template <typename InputItr>
SegmentTree(InputItr first, InputItr last)
: n(distance(first, last)), d(2 * n, Monoid::identify()) {
copy(first, last, next(d.begin(), n));
build();
}
/* set one value */
void modify(size_t k, T v) {
for (d[k += n] = v; k > 1; k >>= 1)
d[k >> 1] = Monoid::op(d[k], d[k ^ 1]);
}
/* return [l, r) value */
T query(size_t l, size_t r) {
T res{Monoid::identify()};
for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
if (l & 1)
res = Monoid::op(res, d[l++]);
if (r & 1)
res = Monoid::op(res, d[--r]);
}
return res;
}
T get(size_t i) { return query(i, i + 1); }
};
template <typename U = ll> struct RMQ {
using T = U;
static T op(const T &a, const T &b) { return min<T>(a, b); }
static constexpr T identify() { return numeric_limits<T>::max(); }
};
int main() {
int n, m;
cin >> n >> m;
vector<int> l(m), r(m), c(m);
REP(i, m) {
cin >> l[i] >> r[i] >> c[i];
--l[i];
--r[i];
}
vector<int> o(m);
iota(o.begin(), o.end(), 0);
sort(o.begin(), o.end(), [&](int i, int j) { return r[i] < r[j]; });
SegmentTree<RMQ<>> tree(n);
tree.modify(0, 0);
REP(i, m) {
ll m = tree.query(l[o[i]], r[o[i]]);
if (m == RMQ<>::identify())
continue;
ll now = tree.get(r[o[i]]);
tree.modify(r[o[i]], min(now, m + c[o[i]]));
}
if (tree.get(n - 1) != RMQ<>::identify()) {
cout << tree.get(n - 1) << endl;
} else {
cout << -1 << endl;
}
return 0;
}
| replace | 67 | 68 | 67 | 68 | 0 | |
p02868 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define dbg(S) \
{ \
int f = 1; \
for (auto x : S) \
cerr << (f ? "[" : ", ") << x, f = 0; \
cerr << "]\n"; \
}
using namespace std;
using lint = long long;
const lint INF = 1LL << 61;
template <class T> class segment_tree {
static const int N_MAX = 1e5 + 10;
int n;
T dat[2 * N_MAX];
T query(int l, int r, int a, int b, int u) {
if (l <= a && b <= r)
return dat[u];
T res = INF;
int c = (a + b + 1) / 2;
if (l < c && a < r)
res = min(res, query(l, r, a, c, 2 * u));
if (l < b && c < r)
res = min(res, query(l, r, c, b, 2 * u + 1));
return res;
}
public:
void build(int N, T val) {
for (n = 1; n < N; n *= 2)
;
rep(u, 2 * n) dat[u] = val;
}
void update(int u, T v) {
u += n;
dat[u] = min(dat[u], v);
for (u /= 2; u >= 1; u /= 2)
dat[u] = min(dat[2 * u], dat[2 * u + 1]);
}
T query(int l, int r) { return query(l, r, 0, n, 1); }
};
struct interval {
int l, r;
lint wt;
bool operator<(const interval &I) const { return r < I.r; }
};
int main() {
int n, m;
scanf("%d%d", &n, &m);
vector<interval> I(m);
rep(i, m) {
scanf("%d%d%lld", &I[i].l, &I[i].r, &I[i].wt);
I[i].l--;
}
sort(I.begin(), I.end());
segment_tree<lint> S;
S.build(n, INF);
S.update(0, 0);
rep(i, m) {
lint d = S.query(I[i].l, I[i].r);
S.update(I[i].r - 1, d + I[i].wt);
}
lint ans = S.query(n - 1, n);
printf("%lld\n", ans < INF ? ans : -1);
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define dbg(S) \
{ \
int f = 1; \
for (auto x : S) \
cerr << (f ? "[" : ", ") << x, f = 0; \
cerr << "]\n"; \
}
using namespace std;
using lint = long long;
const lint INF = 1LL << 61;
template <class T> class segment_tree {
static const int N_MAX = 1e5 + 10;
int n;
T dat[4 * N_MAX];
T query(int l, int r, int a, int b, int u) {
if (l <= a && b <= r)
return dat[u];
T res = INF;
int c = (a + b + 1) / 2;
if (l < c && a < r)
res = min(res, query(l, r, a, c, 2 * u));
if (l < b && c < r)
res = min(res, query(l, r, c, b, 2 * u + 1));
return res;
}
public:
void build(int N, T val) {
for (n = 1; n < N; n *= 2)
;
rep(u, 2 * n) dat[u] = val;
}
void update(int u, T v) {
u += n;
dat[u] = min(dat[u], v);
for (u /= 2; u >= 1; u /= 2)
dat[u] = min(dat[2 * u], dat[2 * u + 1]);
}
T query(int l, int r) { return query(l, r, 0, n, 1); }
};
struct interval {
int l, r;
lint wt;
bool operator<(const interval &I) const { return r < I.r; }
};
int main() {
int n, m;
scanf("%d%d", &n, &m);
vector<interval> I(m);
rep(i, m) {
scanf("%d%d%lld", &I[i].l, &I[i].r, &I[i].wt);
I[i].l--;
}
sort(I.begin(), I.end());
segment_tree<lint> S;
S.build(n, INF);
S.update(0, 0);
rep(i, m) {
lint d = S.query(I[i].l, I[i].r);
S.update(I[i].r - 1, d + I[i].wt);
}
lint ans = S.query(n - 1, n);
printf("%lld\n", ans < INF ? ans : -1);
return 0;
}
| replace | 19 | 20 | 19 | 20 | 0 | |
p02868 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<vector<pair<ll, ll>>> vvpll;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define exrep(i, a, b) for (ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 1000000007;
const ll INF = 1e16;
const ll MAX_N = 100010;
int main() {
ll n, m;
cin >> n >> m;
vvpll G(n);
rep(v, n - 1) { G[v + 1].pb(make_pair(v, 0)); }
rep(loop, m) {
ll L, R, c;
cin >> L >> R >> c;
L--;
R--;
G[L].pb(make_pair(R, c));
G[R].pb(make_pair(L, c));
}
// ダイクストラ法。計算量はO((V+E)*log(V))
const ll sv = 0; // 始点となる頂点。デフォルトでは0
vl dist(n, INF); // dist[v] : 頂点svから頂点vへの最短距離
priority_queue<P, vector<P>, greater<P>> prQ;
dist[sv] = 0;
prQ.push(make_pair(sv, 0)); // (頂点番号, 頂点svからの最短距離)
while (!prQ.empty()) {
auto p1 = prQ.top();
prQ.pop();
ll v = p1.first;
if (dist[v] < p1.second) {
continue;
}
for (auto p2 : G[v]) {
ll u = p2.first;
ll cost = p2.second;
if (dist[u] > dist[v] + cost) {
dist[u] = dist[v] + cost;
prQ.push(make_pair(u, dist[u]));
}
}
}
if (dist[n - 1] == INF) {
out(-1);
} else {
out(dist[n - 1]);
}
re0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<vector<pair<ll, ll>>> vvpll;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define exrep(i, a, b) for (ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 1000000007;
const ll INF = 1e16;
const ll MAX_N = 100010;
int main() {
ll n, m;
cin >> n >> m;
vvpll G(n);
rep(v, n - 1) { G[v + 1].pb(make_pair(v, 0)); }
rep(loop, m) {
ll L, R, c;
cin >> L >> R >> c;
L--;
R--;
G[L].pb(make_pair(R, c));
}
// ダイクストラ法。計算量はO((V+E)*log(V))
const ll sv = 0; // 始点となる頂点。デフォルトでは0
vl dist(n, INF); // dist[v] : 頂点svから頂点vへの最短距離
priority_queue<P, vector<P>, greater<P>> prQ;
dist[sv] = 0;
prQ.push(make_pair(sv, 0)); // (頂点番号, 頂点svからの最短距離)
while (!prQ.empty()) {
auto p1 = prQ.top();
prQ.pop();
ll v = p1.first;
if (dist[v] < p1.second) {
continue;
}
for (auto p2 : G[v]) {
ll u = p2.first;
ll cost = p2.second;
if (dist[u] > dist[v] + cost) {
dist[u] = dist[v] + cost;
prQ.push(make_pair(u, dist[u]));
}
}
}
if (dist[n - 1] == INF) {
out(-1);
} else {
out(dist[n - 1]);
}
re0;
} | delete | 43 | 44 | 43 | 43 | TLE | |
p02868 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>>
q;
int n, m, l, r;
vector<pair<pair<int, int>, ll>> e;
ll c, dis[100001];
scanf("%d%d", &n, &m);
for (int i = 0; i < m; i++) {
scanf("%d%d%lld", &l, &r, &c);
e.push_back({{l, r}, c});
}
sort(e.begin(), e.end());
for (int i = 0; i <= n; i++) {
dis[i] = 1000000000000000;
}
dis[1] = 0;
int p = 0;
l = 0;
q.push({0LL, -1});
while (!q.empty() && l < n && p < m) {
while (!q.empty() && -q.top().second <= l) {
q.pop();
}
l = -q.top().second;
q.pop();
while (e[p].first.first <= l && p < m) {
if (dis[e[p].first.second] > dis[l] + e[p].second) {
dis[e[p].first.second] = dis[l] + e[p].second;
// printf("%lld %lld %lld\n",dis[e[p].first.second],dis[l],e[p].second);
q.push({dis[e[p].first.second], -e[p].first.second});
}
p++;
}
}
if (dis[n] == 1000000000000000) {
printf("-1\n");
} else {
printf("%lld\n", dis[n]);
}
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>>
q;
int n, m, l, r;
vector<pair<pair<int, int>, ll>> e;
ll c, dis[100001];
scanf("%d%d", &n, &m);
for (int i = 0; i < m; i++) {
scanf("%d%d%lld", &l, &r, &c);
e.push_back({{l, r}, c});
}
sort(e.begin(), e.end());
for (int i = 0; i <= n; i++) {
dis[i] = 1000000000000000;
}
dis[1] = 0;
int p = 0;
l = 0;
q.push({0LL, -1});
while (!q.empty() && l < n && p < m) {
while (!q.empty() && -q.top().second <= l) {
q.pop();
}
if (q.empty()) {
break;
}
l = -q.top().second;
q.pop();
while (e[p].first.first <= l && p < m) {
if (dis[e[p].first.second] > dis[l] + e[p].second) {
dis[e[p].first.second] = dis[l] + e[p].second;
// printf("%lld %lld %lld\n",dis[e[p].first.second],dis[l],e[p].second);
q.push({dis[e[p].first.second], -e[p].first.second});
}
p++;
}
}
if (dis[n] == 1000000000000000) {
printf("-1\n");
} else {
printf("%lld\n", dis[n]);
}
} | insert | 33 | 33 | 33 | 36 | TLE | |
p02868 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n; i >= 0; --i)
const int inf = 1e9 + 7;
const ll mod = 1e9 + 7;
const ll big = 1e18;
const double PI = 2 * asin(1);
int main() {
int N, M;
cin >> N >> M;
vector<vector<pair<int, ll>>> edge(N);
int L, R;
ll C;
for (int i = 0; i < M; ++i) {
cin >> L >> R >> C;
L--;
R--;
edge[L].push_back(mp(R, C));
}
for (int i = 0; i < N - 1; ++i) {
edge[i + 1].push_back(mp(i, 0));
}
priority_queue<pair<ll, int>> que;
que.push(mp(0, 0));
pair<ll, int> state;
ll cost;
int node;
map<int, ll> amap;
for (int i = 0; i < N; ++i) {
amap[i] = big;
}
while (!que.empty()) {
state = que.top();
que.pop();
node = state.se;
cost = state.fi;
if (amap[node] <= cost)
continue;
amap[node] = cost;
for (int i = 0; i < edge[node].size(); ++i) {
if (amap[edge[node][i].fi] <= cost + edge[node][i].se)
continue;
que.push(mp(cost + edge[node][i].se, edge[node][i].fi));
}
}
if (amap[N - 1] == big)
cout << -1 << endl;
else
cout << amap[N - 1] << endl;
}
| #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n; i >= 0; --i)
const int inf = 1e9 + 7;
const ll mod = 1e9 + 7;
const ll big = 1e18;
const double PI = 2 * asin(1);
int main() {
int N, M;
cin >> N >> M;
vector<vector<pair<int, ll>>> edge(N);
int L, R;
ll C;
for (int i = 0; i < M; ++i) {
cin >> L >> R >> C;
L--;
R--;
edge[L].push_back(mp(R, C));
}
for (int i = 0; i < N - 1; ++i) {
edge[i + 1].push_back(mp(i, 0));
}
priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>>
que;
que.push(mp(0, 0));
pair<ll, int> state;
ll cost;
int node;
map<int, ll> amap;
for (int i = 0; i < N; ++i) {
amap[i] = big;
}
while (!que.empty()) {
state = que.top();
que.pop();
node = state.se;
cost = state.fi;
if (amap[node] <= cost)
continue;
amap[node] = cost;
for (int i = 0; i < edge[node].size(); ++i) {
if (amap[edge[node][i].fi] <= cost + edge[node][i].se)
continue;
que.push(mp(cost + edge[node][i].se, edge[node][i].fi));
}
}
if (amap[N - 1] == big)
cout << -1 << endl;
else
cout << amap[N - 1] << endl;
}
| replace | 39 | 40 | 39 | 41 | TLE | |
p02868 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n; i >= 0; --i)
const int inf = 1e9 + 7;
const ll mod = 1e9 + 7;
const ll mod1 = 998244353;
const ll big = 1e18;
const double PI = 2 * asin(1);
int main() {
int N, M;
cin >> N >> M;
vector<vector<pair<int, int>>> edge(N);
for (int i = 1; i < N; ++i) {
edge[i].push_back(mp(i - 1, 0));
}
int L, R, C;
for (int i = 0; i < M; ++i) {
cin >> L >> R >> C;
L--;
R--;
edge[L].push_back(mp(R, C));
}
priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>>
que;
pair<ll, int> state;
que.push(mp(0, 0));
map<int, ll> amap;
for (int i = 0; i < N; ++i)
amap[i] = -1;
int node, cost;
while (!que.empty()) {
state = que.top();
que.pop();
node = state.se;
cost = state.fi;
if (amap[node] > -1)
continue;
amap[node] = cost;
for (int i = 0; i < edge[node].size(); ++i) {
if (amap[edge[node][i].fi] > -1 &&
amap[edge[node][i].fi] <= cost + edge[node][i].se)
continue;
que.push(mp(cost + edge[node][i].se, edge[node][i].fi));
}
}
cout << amap[N - 1] << endl;
}
| #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n; i >= 0; --i)
const int inf = 1e9 + 7;
const ll mod = 1e9 + 7;
const ll mod1 = 998244353;
const ll big = 1e18;
const double PI = 2 * asin(1);
int main() {
int N, M;
cin >> N >> M;
vector<vector<pair<int, int>>> edge(N);
for (int i = 1; i < N; ++i) {
edge[i].push_back(mp(i - 1, 0));
}
int L, R, C;
for (int i = 0; i < M; ++i) {
cin >> L >> R >> C;
L--;
R--;
edge[L].push_back(mp(R, C));
}
priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>>
que;
pair<ll, int> state;
que.push(mp(0, 0));
map<int, ll> amap;
for (int i = 0; i < N; ++i)
amap[i] = -1;
ll node, cost;
while (!que.empty()) {
state = que.top();
que.pop();
node = state.se;
cost = state.fi;
if (amap[node] > -1)
continue;
amap[node] = cost;
for (int i = 0; i < edge[node].size(); ++i) {
if (amap[edge[node][i].fi] > -1 &&
amap[edge[node][i].fi] <= cost + edge[node][i].se)
continue;
que.push(mp(cost + edge[node][i].se, edge[node][i].fi));
}
}
cout << amap[N - 1] << endl;
}
| replace | 46 | 47 | 46 | 47 | TLE | |
p02868 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<pair<int, int>, ll> P;
const ll MOD = 1e9 + 7;
struct segtree {
int N;
ll dat[2 * 100000];
segtree() {}
segtree(int n) {
N = 1;
while (N < n)
N *= 2;
for (int i = 0; i < 2 * N - 1; i++)
dat[i] = 1e14 - 1;
}
// update k th element
void update(int k, ll a) {
k += N - 1; // leaf
dat[k] = min(a, dat[k]);
while (k > 0) {
k = (k - 1) / 2;
dat[k] = min(dat[k * 2 + 1], dat[k * 2 + 2]);
}
}
// min [a, b)
ll query(int a, int b) { return query(a, b, 0, 0, N); }
ll query(int a, int b, int k, int l, int r) {
if (r <= a || b <= l)
return 1e14 - 1;
if (a <= l && r <= b)
return dat[k];
int m = (l + r) / 2;
return min(query(a, b, k * 2 + 1, l, m), query(a, b, k * 2 + 2, m, r));
}
ll get(int i) { return dat[i + N - 1]; }
};
// bool operator<(P &lhs,P &rhs)
// {
// if(lhs.first.first==rhs.first.first)
// return lhs.second<rhs.second;
// else
// return lhs.first<rhs.first;
// }
P p[100000];
int main() {
int n, m;
ll ans = 0;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int l, r;
ll c;
cin >> l >> r >> c;
l--;
r--;
p[i] = P(make_pair(l, r), c);
}
sort(p, p + m);
segtree t = segtree(n);
t.update(0, 0);
for (int i = 0; i < m; i++) {
// cerr<<p[i].first.first<<endl;
ll s = t.query(p[i].first.first, p[i].first.second + 1);
if (s == 1e14 - 1)
continue;
t.update(p[i].first.second, s + p[i].second);
}
ans = t.get(n - 1);
if (ans == 1e14 - 1)
ans = -1;
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<pair<int, int>, ll> P;
const ll MOD = 1e9 + 7;
struct segtree {
int N;
ll dat[2 * 400000];
segtree() {}
segtree(int n) {
N = 1;
while (N < n)
N *= 2;
for (int i = 0; i < 2 * N - 1; i++)
dat[i] = 1e14 - 1;
}
// update k th element
void update(int k, ll a) {
k += N - 1; // leaf
dat[k] = min(a, dat[k]);
while (k > 0) {
k = (k - 1) / 2;
dat[k] = min(dat[k * 2 + 1], dat[k * 2 + 2]);
}
}
// min [a, b)
ll query(int a, int b) { return query(a, b, 0, 0, N); }
ll query(int a, int b, int k, int l, int r) {
if (r <= a || b <= l)
return 1e14 - 1;
if (a <= l && r <= b)
return dat[k];
int m = (l + r) / 2;
return min(query(a, b, k * 2 + 1, l, m), query(a, b, k * 2 + 2, m, r));
}
ll get(int i) { return dat[i + N - 1]; }
};
// bool operator<(P &lhs,P &rhs)
// {
// if(lhs.first.first==rhs.first.first)
// return lhs.second<rhs.second;
// else
// return lhs.first<rhs.first;
// }
P p[100000];
int main() {
int n, m;
ll ans = 0;
cin >> n >> m;
for (int i = 0; i < m; i++) {
int l, r;
ll c;
cin >> l >> r >> c;
l--;
r--;
p[i] = P(make_pair(l, r), c);
}
sort(p, p + m);
segtree t = segtree(n);
t.update(0, 0);
for (int i = 0; i < m; i++) {
// cerr<<p[i].first.first<<endl;
ll s = t.query(p[i].first.first, p[i].first.second + 1);
if (s == 1e14 - 1)
continue;
t.update(p[i].first.second, s + p[i].second);
}
ans = t.get(n - 1);
if (ans == 1e14 - 1)
ans = -1;
cout << ans << endl;
return 0;
} | replace | 14 | 15 | 14 | 15 | 0 | |
p02868 | C++ | Runtime Error | #include <bits/stdc++.h>
#define INF 1e18
#define int long long
#define Rep(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) Rep(i, 0, n)
#define all(a) (a).begin(), (a).end()
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> PP;
const int mod = 1000000007;
struct edge {
int to, cost;
};
typedef pair<int, int> P; // firstは最短距離,secondは頂点の番号
#define V 100
vector<edge> G[V];
int d[V];
void dijkstra(int s) {
priority_queue<P, vector<P>, greater<P>> que;
fill(d, d + V, INF);
d[s] = 0;
que.push(P(0, s));
while (!que.empty()) {
P p = que.top();
que.pop();
int v = p.second;
if (d[v] < p.first)
continue;
for (int i = 0; i < G[v].size(); i++) {
edge e = G[v][i];
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.push(P(d[e.to], e.to));
}
}
}
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
rep(i, m) {
int l, r, c;
cin >> l >> r >> c;
l--, r--;
G[l].push_back({r, c});
}
Rep(i, 1, n) { G[i].push_back({i - 1, 0}); }
dijkstra(0);
int ans = d[n - 1];
if (ans == INF)
ans = -1;
cout << ans << endl;
} | #include <bits/stdc++.h>
#define INF 1e18
#define int long long
#define Rep(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) Rep(i, 0, n)
#define all(a) (a).begin(), (a).end()
using namespace std;
typedef pair<int, int> P;
typedef pair<int, P> PP;
const int mod = 1000000007;
struct edge {
int to, cost;
};
typedef pair<int, int> P; // firstは最短距離,secondは頂点の番号
#define V 100010
vector<edge> G[V];
int d[V];
void dijkstra(int s) {
priority_queue<P, vector<P>, greater<P>> que;
fill(d, d + V, INF);
d[s] = 0;
que.push(P(0, s));
while (!que.empty()) {
P p = que.top();
que.pop();
int v = p.second;
if (d[v] < p.first)
continue;
for (int i = 0; i < G[v].size(); i++) {
edge e = G[v][i];
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.push(P(d[e.to], e.to));
}
}
}
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
rep(i, m) {
int l, r, c;
cin >> l >> r >> c;
l--, r--;
G[l].push_back({r, c});
}
Rep(i, 1, n) { G[i].push_back({i - 1, 0}); }
dijkstra(0);
int ans = d[n - 1];
if (ans == INF)
ans = -1;
cout << ans << endl;
} | replace | 15 | 16 | 15 | 16 | 0 | |
p02868 | C++ | Runtime Error | #include <bits/stdc++.h>
using i64 = long long;
int main() {
constexpr i64 inf = std::numeric_limits<i64>::max() / 2;
int n, m;
std::cin >> n >> m;
std::vector<std::tuple<int, int, i64, int>> evs;
for (int i = 0; i < m; i++) {
int l, r;
i64 c;
std::cin >> l >> r >> c;
evs.emplace_back(l - 1, 0, c, i);
evs.emplace_back(r - 1, 1, c, i);
}
std::sort(evs.begin(), evs.end());
std::vector<i64> dist(n, inf), rr(n);
dist[0] = 0;
auto it = evs.begin();
std::set<std::pair<i64, int>> ss;
for (int i = 0; i < n; i++) {
if (i) {
if (ss.empty()) {
std::cout << -1 << std::endl;
return 0;
}
dist[i] = ss.begin()->first;
}
while (it != evs.end() && std::get<0>(*it) == i) {
int index = std::get<3>(*it);
if (std::get<1>(*it) == 0) {
i64 cc = dist[i] + std::get<2>(*it);
ss.emplace(cc, index);
rr[index] = cc;
} else {
ss.erase(ss.lower_bound(std::make_pair(rr[index], index)));
}
it++;
}
}
std::cout << dist[n - 1] << std::endl;
return 0;
}
| #include <bits/stdc++.h>
using i64 = long long;
int main() {
constexpr i64 inf = std::numeric_limits<i64>::max() / 2;
int n, m;
std::cin >> n >> m;
std::vector<std::tuple<int, int, i64, int>> evs;
for (int i = 0; i < m; i++) {
int l, r;
i64 c;
std::cin >> l >> r >> c;
evs.emplace_back(l - 1, 0, c, i);
evs.emplace_back(r - 1, 1, c, i);
}
std::sort(evs.begin(), evs.end());
std::vector<i64> dist(n, inf), rr(m);
dist[0] = 0;
auto it = evs.begin();
std::set<std::pair<i64, int>> ss;
for (int i = 0; i < n; i++) {
if (i) {
if (ss.empty()) {
std::cout << -1 << std::endl;
return 0;
}
dist[i] = ss.begin()->first;
}
while (it != evs.end() && std::get<0>(*it) == i) {
int index = std::get<3>(*it);
if (std::get<1>(*it) == 0) {
i64 cc = dist[i] + std::get<2>(*it);
ss.emplace(cc, index);
rr[index] = cc;
} else {
ss.erase(ss.lower_bound(std::make_pair(rr[index], index)));
}
it++;
}
}
std::cout << dist[n - 1] << std::endl;
return 0;
}
| replace | 18 | 19 | 18 | 19 | 0 | |
p02868 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <fstream>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_set>
#include <vector>
#define MOD_BIG 1000000007
#define MOD_BIG2 998244353
using std::cerr;
using std::cin;
using std::cout;
using std::endl;
using std::string;
using ll = long long;
using pint = std::pair<int, int>;
using pll = std::pair<ll, ll>;
using std::vector;
#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)
//////////////////////////////////////
enum Status {
Not = 0,
Now,
End,
};
template <typename T> struct Edge {
int to;
int from;
T weight;
Edge(int from, int to, T weight) : from(from), to(to), weight(weight) {}
};
template <typename T, typename D> struct Graph {
int n;
vector<vector<Edge<T>>> g;
vector<D> data;
vector<Status> s;
Graph(int N) : n(N), g(N + 1), data(N + 1), s(N + 1) {}
void add_edge(int from, Edge<T> e) { g[from].push_back(e); }
void add_edge(int from, int to, T weight) {
g[from].push_back(Edge<T>(from, to, weight));
}
void set_data(int node, D value) { data[node] = value; }
// 幅優先探索による最短経路
// weightが全て同一の場合線形
std::pair<vector<T>, vector<vector<Edge<T>>>> bfs_spp(int start) {
vector<T> d(n + 1, -1);
vector<vector<Edge<T>>> route(n + 1);
std::queue<int> q;
d[start] = 0;
q.push(start);
while (!q.empty()) {
int v = q.front();
q.pop();
for (auto e : g[v]) {
if (d[e.to] != -1 && d[e.to] != 0) {
// 到達済み
continue;
}
d[e.to] = d[e.from] + 1;
auto tmp = route[e.from];
tmp.push_back(e);
route[e.to] = tmp;
q.push(e.to);
}
}
return std::make_pair(d, route);
}
// ダイクストラ法
// weightが非負の場合の最短経路
// 経路が存在しない場合、INFが返るのでオーバーフローに注意
std::pair<vector<T>, vector<vector<Edge<T>>>> dijkstra(int start) {
using P = std::pair<T, int>;
std::priority_queue<P, vector<P>, std::greater<P>> que;
T T_MAX = std::numeric_limits<T>::max();
vector<T> d(n + 1, T_MAX);
vector<vector<Edge<T>>> route(n + 1);
d[start] = 0;
que.push(P((T)0, start));
while (!que.empty()) {
P p = que.top();
que.pop();
int v = p.second;
if (d[v] < p.first)
continue;
for (Edge<T> e : g[v]) {
if (d[e.to] > d[v] + e.weight) {
d[e.to] = d[v] + e.weight;
auto tmp = route[e.from];
tmp.push_back(e);
route[e.to] = tmp;
que.push(P(d[e.to], e.to));
}
}
}
return std::make_pair(d, route);
}
// ベルマン-フォード法
// weightを負を含む距離として最短経路を求める
// 無限ループが存在する場合、trueを1つ目に返す
std::pair<bool, vector<T>> bellman_ford(int start) {
T T_INF = std::numeric_limits<T>::max();
vector<T> d(n + 1, T_INF);
vector<Edge<T>> E;
for (int i = 0; i <= n; i++) {
for (auto e : g[i]) {
E.push_back(e);
}
}
d[start] = 0;
for (int i = 0; i <= n; i++) {
for (auto e : E) {
if (d[e.from] != T_INF && d[e.from] + e.weight < d[e.to]) {
// 最初or別のstartからe.toへの最短路を発見
d[e.to] = d[e.from] + e.weight;
// std::cout << "new route find, to: " << e.to << ", distance: " <<
// d[e.to] << std::endl;
if (i == n) {
// もう全ての辺はチェック済みのはずなのにまだ更新がある：無限ループあり
return std::make_pair(true, d);
}
}
}
}
return std::make_pair(false, d);
}
// あるノードに到達できるか
// 逆方向はグラフ自体逆で構成することで可能
vector<bool> can_reach_from(int start) {
vector<bool> reached(n + 1, false);
dfs_reach_from(start, reached);
return reached;
}
void dfs_reach_from(int now, vector<bool> &reached) {
if (reached[now])
return;
reached[now] = true;
for (auto e : g[now]) {
dfs_reach_from(e.to, reached);
}
}
// 出力
void print() {
for (auto v : g) {
for (auto e : v) {
std::cout << e.from << "-(" << e.weight << ")->" << e.to << ", ";
}
std::cout << std::endl;
}
}
};
//////////////////////////////////////
int main() {
int N, M;
cin >> N >> M;
Graph<ll, ll> g(N);
FOR(i, 1, N) { g.add_edge(i + 1, i, 0); }
REP(i, M) {
int l, r;
ll c;
cin >> l >> r;
cin >> c;
g.add_edge(l, r, c);
}
auto res = g.dijkstra(1);
auto ans = res.first[N];
if (ans == std::numeric_limits<ll>::max()) {
cout << -1 << endl;
} else {
cout << ans << endl;
}
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <fstream>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_set>
#include <vector>
#define MOD_BIG 1000000007
#define MOD_BIG2 998244353
using std::cerr;
using std::cin;
using std::cout;
using std::endl;
using std::string;
using ll = long long;
using pint = std::pair<int, int>;
using pll = std::pair<ll, ll>;
using std::vector;
#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)
//////////////////////////////////////
enum Status {
Not = 0,
Now,
End,
};
template <typename T> struct Edge {
int to;
int from;
T weight;
Edge(int from, int to, T weight) : from(from), to(to), weight(weight) {}
};
template <typename T, typename D> struct Graph {
int n;
vector<vector<Edge<T>>> g;
vector<D> data;
vector<Status> s;
Graph(int N) : n(N), g(N + 1), data(N + 1), s(N + 1) {}
void add_edge(int from, Edge<T> e) { g[from].push_back(e); }
void add_edge(int from, int to, T weight) {
g[from].push_back(Edge<T>(from, to, weight));
}
void set_data(int node, D value) { data[node] = value; }
// 幅優先探索による最短経路
// weightが全て同一の場合線形
std::pair<vector<T>, vector<vector<Edge<T>>>> bfs_spp(int start) {
vector<T> d(n + 1, -1);
vector<vector<Edge<T>>> route(n + 1);
std::queue<int> q;
d[start] = 0;
q.push(start);
while (!q.empty()) {
int v = q.front();
q.pop();
for (auto e : g[v]) {
if (d[e.to] != -1 && d[e.to] != 0) {
// 到達済み
continue;
}
d[e.to] = d[e.from] + 1;
auto tmp = route[e.from];
tmp.push_back(e);
route[e.to] = tmp;
q.push(e.to);
}
}
return std::make_pair(d, route);
}
// ダイクストラ法
// weightが非負の場合の最短経路
// 経路が存在しない場合、INFが返るのでオーバーフローに注意
std::pair<vector<T>, vector<vector<Edge<T>>>> dijkstra(int start) {
using P = std::pair<T, int>;
std::priority_queue<P, vector<P>, std::greater<P>> que;
T T_MAX = std::numeric_limits<T>::max();
vector<T> d(n + 1, T_MAX);
vector<vector<Edge<T>>> route(n + 1);
d[start] = 0;
que.push(P((T)0, start));
while (!que.empty()) {
P p = que.top();
que.pop();
int v = p.second;
if (d[v] < p.first)
continue;
for (Edge<T> e : g[v]) {
if (d[e.to] > d[v] + e.weight) {
d[e.to] = d[v] + e.weight;
que.push(P(d[e.to], e.to));
}
}
}
return std::make_pair(d, route);
}
// ベルマン-フォード法
// weightを負を含む距離として最短経路を求める
// 無限ループが存在する場合、trueを1つ目に返す
std::pair<bool, vector<T>> bellman_ford(int start) {
T T_INF = std::numeric_limits<T>::max();
vector<T> d(n + 1, T_INF);
vector<Edge<T>> E;
for (int i = 0; i <= n; i++) {
for (auto e : g[i]) {
E.push_back(e);
}
}
d[start] = 0;
for (int i = 0; i <= n; i++) {
for (auto e : E) {
if (d[e.from] != T_INF && d[e.from] + e.weight < d[e.to]) {
// 最初or別のstartからe.toへの最短路を発見
d[e.to] = d[e.from] + e.weight;
// std::cout << "new route find, to: " << e.to << ", distance: " <<
// d[e.to] << std::endl;
if (i == n) {
// もう全ての辺はチェック済みのはずなのにまだ更新がある：無限ループあり
return std::make_pair(true, d);
}
}
}
}
return std::make_pair(false, d);
}
// あるノードに到達できるか
// 逆方向はグラフ自体逆で構成することで可能
vector<bool> can_reach_from(int start) {
vector<bool> reached(n + 1, false);
dfs_reach_from(start, reached);
return reached;
}
void dfs_reach_from(int now, vector<bool> &reached) {
if (reached[now])
return;
reached[now] = true;
for (auto e : g[now]) {
dfs_reach_from(e.to, reached);
}
}
// 出力
void print() {
for (auto v : g) {
for (auto e : v) {
std::cout << e.from << "-(" << e.weight << ")->" << e.to << ", ";
}
std::cout << std::endl;
}
}
};
//////////////////////////////////////
int main() {
int N, M;
cin >> N >> M;
Graph<ll, ll> g(N);
FOR(i, 1, N) { g.add_edge(i + 1, i, 0); }
REP(i, M) {
int l, r;
ll c;
cin >> l >> r;
cin >> c;
g.add_edge(l, r, c);
}
auto res = g.dijkstra(1);
auto ans = res.first[N];
if (ans == std::numeric_limits<ll>::max()) {
cout << -1 << endl;
} else {
cout << ans << endl;
}
return 0;
}
| delete | 108 | 111 | 108 | 108 | TLE | |
p02868 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define rep(i, x) for (ll i = 0; i < (ll)(x); i++)
#define rrep(i, x) for (ll i = (ll)(x)-1; 0 <= i; i--)
#define reps(i, x) for (ll i = 1; i < (ll)(x) + 1; i++)
#define rreps(i, x) for (ll i = (ll)(x); 1 <= i; i--)
#define debug(x) cerr << #x << ": " << (x) << "\n";
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<vector<vector<ll>>> vvvl;
const ll INF = numeric_limits<ll>::max() / 4;
const int n_max = 1e5 + 10;
// nはサイズ，fはfunction, M1はMonoidの単位元
// SegmentTree(n, f, M1):= サイズ n の初期化。
// ここで f は2つの区間の要素をマージする二項演算, M1 はモノイドの単位元である。
// set(k, x):= k 番目の要素に x を代入する。
// build():= セグメント木を構築する。
// query(a, b):= 区間 [a,b) に対して二項演算した結果を返す。
// update(k, x):= k 番目の要素を x に変更する。
// operator[k] := k 番目の要素を返す。
// find_first(a, check) := [a,x) が check を満たす最初の要素位置 x を返す。
// find_last(b, check) := [x,b) が check を満たす最後の要素位置 x を返す。
template <typename Monoid> struct SegmentTree {
using F = function<Monoid(Monoid, Monoid)>;
int sz;
vector<Monoid> seg;
const F f;
const Monoid M1;
SegmentTree(vector<Monoid> &vec, const F f, const Monoid &M1) : f(f), M1(M1) {
int n = vec.size();
sz = 1;
while (sz < n)
sz <<= 1;
seg.assign(2 * sz, M1);
}
void set(int k, const Monoid &x) { seg[k + sz] = x; }
void build(vector<Monoid> &vec) {
for (int i = 0; i < vec.size(); i++)
set(i, vec[i]);
for (int k = sz - 1; k > 0; k--) {
seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
}
}
void update(int k, const Monoid &x) {
k += sz;
seg[k] = x;
while (k >>= 1) {
seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
}
}
Monoid query(int a, int b) {
Monoid L = M1, R = M1;
for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
if (a & 1)
L = f(L, seg[a++]);
if (b & 1)
R = f(seg[--b], R);
}
return f(L, R);
}
Monoid operator[](const int &k) const { return seg[k + sz]; }
void print() {
rep(i, sz) cout << seg[i + sz] << " ";
cout << endl;
}
template <typename C>
int find_subtree(int a, const C &check, Monoid &M, bool type) {
while (a < sz) {
Monoid nxt = type ? f(seg[2 * a + type], M) : f(M, seg[2 * a + type]);
if (check(nxt))
a = 2 * a + type;
else
M = nxt, a = 2 * a + 1 - type;
}
return a - sz;
}
template <typename C> int find_first(int a, const C &check) {
Monoid L = M1;
if (a <= 0) {
if (check(f(L, seg[1])))
return find_subtree(1, check, L, false);
return -1;
}
int b = sz;
for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
if (a & 1) {
Monoid nxt = f(L, seg[a]);
if (check(nxt))
return find_subtree(a, check, L, false);
L = nxt;
++a;
}
}
return -1;
}
template <typename C> int find_last(int b, const C &check) {
Monoid R = M1;
if (b >= sz) {
if (check(f(seg[1], R)))
return find_subtree(1, check, R, true);
return -1;
}
int a = sz;
for (b += sz; a < b; a >>= 1, b >>= 1) {
if (b & 1) {
Monoid nxt = f(seg[--b], R);
if (check(nxt))
return find_subtree(b, check, R, true);
R = nxt;
}
}
return -1;
}
};
struct edge {
ll l, r;
ll c;
edge(){};
edge(ll l, ll r, ll c) : l(l), r(r), c(c){};
void print() { cout << l << " " << r << " " << c << endl; }
};
int main() {
ll n, m;
cin >> n >> m;
vector<edge> vec(n);
rep(i, m) {
ll l, r, c;
cin >> l >> r >> c;
l--;
r--;
vec[i] = {l, r, c};
}
sort(all(vec), [](const auto &a, const auto &b) {
return a.r > b.r || (a.r == b.r && a.l < b.l);
});
vector<ll> dp(n, INF);
dp[n - 1] = 0;
auto f = [](auto const &a, auto const &b) { return min(a, b); };
SegmentTree<ll> seg(dp, f, INF);
seg.build(dp);
rep(i, m) {
auto e = vec[i];
// debug(seg.query(0, 2));
dp[e.l] = min(dp[e.l], seg.query(e.l, e.r + 1) + e.c);
seg.update(e.l, dp[e.l]);
// seg.print();
// e.print();
// debug(dp[e.l]);
}
cout << (dp[0] >= INF ? -1 : dp[0]) << endl;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
#define rep(i, x) for (ll i = 0; i < (ll)(x); i++)
#define rrep(i, x) for (ll i = (ll)(x)-1; 0 <= i; i--)
#define reps(i, x) for (ll i = 1; i < (ll)(x) + 1; i++)
#define rreps(i, x) for (ll i = (ll)(x); 1 <= i; i--)
#define debug(x) cerr << #x << ": " << (x) << "\n";
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef vector<vector<vector<ll>>> vvvl;
const ll INF = numeric_limits<ll>::max() / 4;
const int n_max = 1e5 + 10;
// nはサイズ，fはfunction, M1はMonoidの単位元
// SegmentTree(n, f, M1):= サイズ n の初期化。
// ここで f は2つの区間の要素をマージする二項演算, M1 はモノイドの単位元である。
// set(k, x):= k 番目の要素に x を代入する。
// build():= セグメント木を構築する。
// query(a, b):= 区間 [a,b) に対して二項演算した結果を返す。
// update(k, x):= k 番目の要素を x に変更する。
// operator[k] := k 番目の要素を返す。
// find_first(a, check) := [a,x) が check を満たす最初の要素位置 x を返す。
// find_last(b, check) := [x,b) が check を満たす最後の要素位置 x を返す。
template <typename Monoid> struct SegmentTree {
using F = function<Monoid(Monoid, Monoid)>;
int sz;
vector<Monoid> seg;
const F f;
const Monoid M1;
SegmentTree(vector<Monoid> &vec, const F f, const Monoid &M1) : f(f), M1(M1) {
int n = vec.size();
sz = 1;
while (sz < n)
sz <<= 1;
seg.assign(2 * sz, M1);
}
void set(int k, const Monoid &x) { seg[k + sz] = x; }
void build(vector<Monoid> &vec) {
for (int i = 0; i < vec.size(); i++)
set(i, vec[i]);
for (int k = sz - 1; k > 0; k--) {
seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
}
}
void update(int k, const Monoid &x) {
k += sz;
seg[k] = x;
while (k >>= 1) {
seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
}
}
Monoid query(int a, int b) {
Monoid L = M1, R = M1;
for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
if (a & 1)
L = f(L, seg[a++]);
if (b & 1)
R = f(seg[--b], R);
}
return f(L, R);
}
Monoid operator[](const int &k) const { return seg[k + sz]; }
void print() {
rep(i, sz) cout << seg[i + sz] << " ";
cout << endl;
}
template <typename C>
int find_subtree(int a, const C &check, Monoid &M, bool type) {
while (a < sz) {
Monoid nxt = type ? f(seg[2 * a + type], M) : f(M, seg[2 * a + type]);
if (check(nxt))
a = 2 * a + type;
else
M = nxt, a = 2 * a + 1 - type;
}
return a - sz;
}
template <typename C> int find_first(int a, const C &check) {
Monoid L = M1;
if (a <= 0) {
if (check(f(L, seg[1])))
return find_subtree(1, check, L, false);
return -1;
}
int b = sz;
for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
if (a & 1) {
Monoid nxt = f(L, seg[a]);
if (check(nxt))
return find_subtree(a, check, L, false);
L = nxt;
++a;
}
}
return -1;
}
template <typename C> int find_last(int b, const C &check) {
Monoid R = M1;
if (b >= sz) {
if (check(f(seg[1], R)))
return find_subtree(1, check, R, true);
return -1;
}
int a = sz;
for (b += sz; a < b; a >>= 1, b >>= 1) {
if (b & 1) {
Monoid nxt = f(seg[--b], R);
if (check(nxt))
return find_subtree(b, check, R, true);
R = nxt;
}
}
return -1;
}
};
struct edge {
ll l, r;
ll c;
edge(){};
edge(ll l, ll r, ll c) : l(l), r(r), c(c){};
void print() { cout << l << " " << r << " " << c << endl; }
};
int main() {
ll n, m;
cin >> n >> m;
vector<edge> vec(m);
rep(i, m) {
ll l, r, c;
cin >> l >> r >> c;
l--;
r--;
vec[i] = {l, r, c};
}
sort(all(vec), [](const auto &a, const auto &b) {
return a.r > b.r || (a.r == b.r && a.l < b.l);
});
vector<ll> dp(n, INF);
dp[n - 1] = 0;
auto f = [](auto const &a, auto const &b) { return min(a, b); };
SegmentTree<ll> seg(dp, f, INF);
seg.build(dp);
rep(i, m) {
auto e = vec[i];
// debug(seg.query(0, 2));
dp[e.l] = min(dp[e.l], seg.query(e.l, e.r + 1) + e.c);
seg.update(e.l, dp[e.l]);
// seg.print();
// e.print();
// debug(dp[e.l]);
}
cout << (dp[0] >= INF ? -1 : dp[0]) << endl;
} | replace | 149 | 150 | 149 | 150 | 0 | |
p02868 | C++ | Runtime Error | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdalign>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
#include <algorithm>
#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>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <unordered_map>
#include <unordered_set>
#endif
#define y0 qvya13579
#define y1 qvyb24680
#define j0 qvja13579
#define j1 qvjb24680
#define next qvne13579xt
#define prev qvpr13579ev
#define INF 1000000007
#define MOD 1000000007
#define endl "\n"
#define PI acos(-1.0)
#define IOS \
cin.tie(0); \
ios::sync_with_stdio(false)
#if __cplusplus < 201103L
#define stoi(argument_string) atoi((argument_string).c_str())
#define stoll(argument_string) atoll((argument_string).c_str())
#endif
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP_R(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define FOR(i, m, n) for (int i = ((int)(m)); i < (int)(n); ++i)
#define FOR_R(i, m, n) for (int i = ((int)(m)-1); i >= (int)(n); --i)
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define SIZ(x) ((int)(x).size())
#define CIN(x) cin >> (x)
#define CIN2(x, y) cin >> (x) >> (y)
#define CIN3(x, y, z) cin >> (x) >> (y) >> (z)
#define CIN4(x, y, z, w) cin >> (x) >> (y) >> (z) >> (w)
#define CIN5(x, y, z, w, u) cin >> (x) >> (y) >> (z) >> (w) >> (u)
#define SCAND(x) scanf("%d", &(x))
#define SCAND2(x, y) scanf("%d%d", &(x), &(y))
#define SCAND3(x, y, z) scanf("%d%d%d", &(x), &(y), &(z))
#define SCAND4(x, y, z, w) scanf("%d%d%d%d", &(x), &(y), &(z), &(w))
#define SCAND5(x, y, z, w, u) scanf("%d%d%d%d%d", &(x), &(y), &(z), &(w), &(u))
#define SCANLLD(x) scanf("%lld", &(x))
#define SCANLLD2(x, y) scanf("%lld%lld", &(x), &(y))
#define SCANLLD3(x, y, z) scanf("%lld%lld%lld", &(x), &(y), &(z))
#define SCANLLD4(x, y, z, w) scanf("%lld%lld%lld%lld", &(x), &(y), &(z), &(w))
#define SCANLLD5(x, y, z, w, u) \
scanf("%lld%lld%lld%lld%lld", &(x), &(y), &(z), &(w), &(u))
#define I64DSCAN(x) scanf("%I64d", &(x))
#define I64DSCAN2(x, y) scanf("%I64d%I64d", &(x), &(y))
#define I64DSCAN3(x, y, z) scanf("%I64d%I64d%I64d", &(x), &(y), &(z))
#define I64DSCAN4(x, y, z, w) \
scanf("%I64d%I64d%I64d%I64d", &(x), &(y), &(z), &(w))
#define I64DSCAN5(x, y, z, w, u) \
scanf("%I64d%I64d%I64d%I64d%I64d", &(x), &(y), &(z), &(w), &(u))
#define PRINTD(x) printf("%d\n", (x))
#define PRINTLLD(x) printf("%lld\n", (x))
#define PRINTI64D(x) printf("%I64d\n", (x))
#define DEBUG(argument) cerr << (#argument) << " : " << (argument) << "\n"
typedef long long lli;
typedef unsigned long long ulli;
using namespace std;
int ctoi(char c) {
if (c >= '0' and c <= '9') {
return (int)(c - '0');
}
return -1;
}
int alphabet_pos(char c) {
if (c >= 'a' and c <= 'z') {
return (int)(c - 'a');
}
return -1;
}
int alphabet_pos_capital(char c) {
if (c >= 'A' and c <= 'Z') {
return (int)(c - 'A');
}
return -1;
}
vector<string> split(string str, char ch) {
int first = 0;
int last = str.find_first_of(ch);
if (last == string::npos) {
last = SIZ(str);
}
vector<string> result;
while (first < SIZ(str)) {
string Ssubstr(str, first, last - first);
result.push_back(Ssubstr);
first = last + 1;
last = str.find_first_of(ch, first);
if (last == string::npos) {
last = SIZ(str);
}
}
return result;
}
int gcd(int a, int b) // assuming a,b >= 1
{
if (a < b) {
swap(a, b);
}
if (b == 0) {
return a;
}
if (a % b == 0) {
return b;
}
return gcd(b, a % b);
}
long long gcd(long long a, long long b) // assuming a,b >= 1
{
if (a < b) {
swap(a, b);
}
if (b == 0LL) {
return a;
}
if (a % b == 0) {
return b;
}
return gcd(b, a % b);
}
int lcm(int a, int b) // assuming a,b >= 1
{
return a * b / gcd(a, b);
}
long long lcm(long long a, long long b) // assuming a,b >= 1
{
return a * b / gcd(a, b);
}
long long pow_fast(long long x, long long n_power, long long modulus) {
if (n_power == 0) {
return 1;
}
if (n_power % 2 == 0) {
return pow_fast(x * x % modulus, n_power / 2, modulus);
}
return x * pow_fast(x, n_power - 1, modulus) % modulus;
}
struct CombinationTable {
vector<vector<long long>> val;
CombinationTable(int size)
: val(size + 1, vector<long long>(size + 1)) // constructor
{
for (int i = 0; i <= size; ++i) // note that 0 <= i <= size
{
for (int j = 0; j <= i; ++j) {
if (j == 0 or j == i) {
val[i][j] = 1LL;
} else {
val[i][j] = val[i - 1][j - 1] + val[i - 1][j];
}
}
}
}
};
void print_vector(vector<int> h, bool verbose = true) {
int L = h.size();
for (int i = 0; i < L; ++i) {
if (verbose) {
printf("%d", h[i]);
} else {
cerr << h[i];
}
if (i != L - 1) {
if (verbose) {
printf(" ");
} else {
cerr << " ";
}
} else {
if (verbose) {
printf("\n");
} else {
cerr << "\n";
}
}
}
}
void print_vector(vector<long long> h, bool verbose = true) {
int L = h.size();
for (int i = 0; i < L; ++i) {
if (verbose) {
printf("%lld", h[i]);
} else {
cerr << h[i];
}
if (i != L - 1) {
if (verbose) {
printf(" ");
} else {
cerr << " ";
}
} else {
if (verbose) {
printf("\n");
} else {
cerr << "\n";
}
}
}
}
void print_matrix2D(vector<vector<int>> h, bool verbose = true) {
int Ly = h.size();
for (int i = 0; i < Ly; ++i) {
int Lx = h[i].size();
for (int j = 0; j < Lx; ++j) {
if (verbose) {
printf("%d", h[i][j]);
} else {
cerr << h[i][j];
}
if (j != Lx - 1) {
if (verbose) {
printf(" ");
} else {
cerr << " ";
}
} else {
if (verbose) {
printf("\n");
} else {
cerr << "\n";
}
}
}
}
}
void print_matrix2D(vector<vector<long long>> h, bool verbose = true) {
int Ly = h.size();
for (int i = 0; i < Ly; ++i) {
int Lx = h[i].size();
for (int j = 0; j < Lx; ++j) {
if (verbose) {
printf("%lld", h[i][j]);
} else {
cerr << h[i][j];
}
if (j != Lx - 1) {
if (verbose) {
printf(" ");
} else {
cerr << " ";
}
} else {
if (verbose) {
printf("\n");
} else {
cerr << "\n";
}
}
}
}
}
void print_matrix2D(vector<string> h, bool verbose = true) {
int Ly = h.size();
for (int i = 0; i < Ly; ++i) {
int Lx = h[i].size();
for (int j = 0; j < Lx; ++j) {
if (verbose) {
printf("%c", h[i][j]);
} else {
cerr << h[i][j];
}
}
if (verbose) {
printf("\n");
} else {
cerr << "\n";
}
}
}
void print_binary(int val, int num_digit = 31, bool verbose = false) {
for (int k = num_digit - 1; k >= 0; --k) {
if (verbose) {
printf("%d", (val >> k) & 1);
} else {
cerr << ((val >> k) & 1);
}
}
if (verbose) {
printf("\n");
} else {
cerr << "\n";
}
}
void print_binary(long long val, int num_digit = 63, bool verbose = false) {
for (int k = num_digit - 1; k >= 0; --k) {
if (verbose) {
printf("%lld", ((val >> k) & 1));
} else {
cerr << ((val >> k) & 1);
}
}
if (verbose) {
printf("\n");
} else {
cerr << "\n";
}
}
struct UnionFind // size-based
{
vector<int> parent, treesize;
UnionFind(int size)
: parent(size), treesize(size, 1) // constructor
{
for (int i = 0; i < size; ++i) {
parent[i] = i;
}
}
int root(int x) {
if (parent[x] == x) {
return x;
}
return parent[x] = root(parent[x]);
}
void unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y) {
return;
}
if (treesize[x] < treesize[y]) {
parent[x] = y;
treesize[y] += treesize[x];
} else {
parent[y] = x;
treesize[x] += treesize[y];
}
}
bool sametree(int x, int y) { return root(x) == root(y); }
int gettreesize(int x) { return treesize[root(x)]; }
};
template <typename Type_value>
struct SegmentTree // Range Minimum Query (RMQ)
{
private:
int n;
vector<Type_value> node;
Type_value identity_element_segmenttree;
public:
SegmentTree(vector<Type_value> v,
Type_value identity_element_st) // constructor
{
int sz = v.size();
identity_element_segmenttree = identity_element_st;
n = 1;
while (n < sz) {
n <<= 1;
}
node.resize(2 * n - 1, identity_element_segmenttree);
for (int i = 0; i < sz; ++i) {
node[i + n - 1] = v[i];
}
for (int i = n - 2; i >= 0; --i) {
node[i] = min(node[2 * i + 1], node[2 * i + 2]);
}
}
void update(int x, Type_value val) {
x += (n - 1);
node[x] = val;
while (x > 0) {
x = (x - 1) / 2;
node[x] = min(node[2 * x + 1], node[2 * x + 2]);
}
}
Type_value getmin(int a, int b, int k = 0, int l = 0,
int r = -1) // getting minimum value in [a,b)
{
// k : index of the referred node
// [l,r) : range covered by the k-th node
if (r < 0) {
r = n;
}
if (r <= a or b <= l) {
return identity_element_segmenttree;
}
if (a <= l and r <= b) {
return node[k];
}
Type_value vl = getmin(a, b, 2 * k + 1, l, (l + r) / 2);
Type_value vr = getmin(a, b, 2 * k + 2, (l + r) / 2, r);
return min(vl, vr);
}
};
template <typename Type_value>
struct BinaryIndexedTree // Range Sum Query (RSQ), 0-indexed
{
private:
int size_;
vector<Type_value> data;
public:
BinaryIndexedTree(int sz, Type_value identity_element_binaryindexedtree =
0.0) // constructor
{
size_ = sz;
data.resize(sz + 1, identity_element_binaryindexedtree);
}
Type_value sum(int i) // sum within [0,i)
{
if (i <= 0) {
return (Type_value)0.0;
}
if (i > size_) {
i = size_;
}
Type_value sm = 0.0;
while (i > 0) {
sm += data[i];
i -= i & -i;
}
return sm;
}
void add(int i, Type_value x) {
if (i < 0 or i >= size_) {
return;
}
++i;
while (i <= size_) {
data[i] += x;
i += i & -i;
}
}
};
struct RollingHash {
/*
10 primes near 1e9(for other mod(s)):
{
1000000007,
1000000009,
1000000021,
1000000033,
1000000087,
1000000093,
1000000097,
1000000103,
1000000123,
1000000181
}
10 primes near 1e5(for other base(s)):
{100003,
100019,
100043,
100049,
100057,
100069,
100103,
100109,
100129,
100151}
*/
private:
vector<unsigned long long> hash;
vector<unsigned long long> base_pow;
unsigned long long base, modulus;
const unsigned long long MODULUS_DEFAULT = (1ULL << 61) - 1;
const unsigned long long MASK30 = (1ULL << 30) - 1;
const unsigned long long MASK31 = (1ULL << 31) - 1;
const unsigned long long BASE_MIN = 1e7;
unsigned long long Modulus_2pow61m1(unsigned long long val) {
val = (val & MODULUS_DEFAULT) + (val >> 61);
if (MODULUS_DEFAULT < val) {
val -= MODULUS_DEFAULT;
}
return val;
}
unsigned long long Multiple_2pow61m1(unsigned long long a,
unsigned long long b) {
unsigned long long au = a >> 31;
unsigned long long ad = a & MASK31;
unsigned long long bu = b >> 31;
unsigned long long bd = b & MASK31;
unsigned long long mid = ad * bu + au * bd;
unsigned long long midu = mid >> 30;
unsigned long long midd = mid & MASK30;
return Modulus_2pow61m1(((au * bu) << 1) + midu + (midd << 31) + ad * bd);
}
void initialize(string &S) {
int N = S.size();
vector<int> s(N);
for (int i = 0; i < N; ++i) {
s[i] = S[i];
}
initialize(s);
}
void initialize(vector<int> &S) {
hash.resize(S.size() + 1);
base_pow.resize(S.size() + 1);
hash[0] = 0;
base_pow[0] = 1;
if (modulus == MODULUS_DEFAULT) {
for (int i = 1; i <= S.size(); ++i) {
hash[i] =
Modulus_2pow61m1(Multiple_2pow61m1(hash[i - 1], base) + S[i - 1]);
base_pow[i] = Multiple_2pow61m1(base_pow[i - 1], base);
}
} else {
for (int i = 1; i <= S.size(); ++i) {
hash[i] = (hash[i - 1] * base + S[i - 1]) % modulus;
base_pow[i] = (base_pow[i - 1] * base) % modulus;
}
}
}
public:
RollingHash(string S = "", unsigned long long base_ = 0,
unsigned long long modulus_ = 0) {
if (0 < modulus_) {
modulus = modulus_;
} else {
modulus = MODULUS_DEFAULT;
}
if (0 < base_) {
base = base_;
} else {
mt19937_64 mt64(static_cast<unsigned int>(time(nullptr)));
uniform_int_distribution<unsigned long long> rand_uniform(
BASE_MIN, modulus - BASE_MIN);
base = rand_uniform(mt64);
}
if (S.size() > 0) {
initialize(S);
}
}
// 0-indexed, [a, b)
unsigned long long between(int a, int b) {
if (modulus == MODULUS_DEFAULT) {
return Modulus_2pow61m1(modulus + hash[b] -
Multiple_2pow61m1(hash[a], base_pow[b - a]));
}
return (modulus + hash[b] - (hash[a] * base_pow[b - a]) % modulus) %
modulus;
}
};
/*------------------ the end of the template -----------------------*/
signed main() {
IOS; /* making cin faster */
int N, M;
vector<vector<pair<int, int>>> G(N);
REP(_, M) {
int l, r, c;
SCAND3(l, r, c);
--l;
--r;
G[l].push_back(make_pair(r, c));
}
REP(i, N - 1) { G[i + 1].push_back(make_pair(i, 0)); }
const lli LINF = 1e18;
vector<bool> cango(N, true);
vector<lli> d(N, LINF);
priority_queue<pair<lli, int>> pq;
d[0] = 0;
pq.push(make_pair(0LL, 0));
while (not pq.empty()) {
pair<lli, int> r = pq.top();
pq.pop();
int u = r.second;
if (-r.first < d[u]) {
continue;
}
cango[u] = false;
for (auto elem : G[u]) {
int v = elem.first;
int c = elem.second;
if (cango[v] and d[u] + c < d[v]) {
d[v] = d[u] + c;
pq.push(make_pair(-d[v], v));
}
}
}
if (d[N - 1] == LINF) {
PRINTD(-1);
} else {
PRINTLLD(d[N - 1]);
}
}
| #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdalign>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
#include <algorithm>
#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>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <unordered_map>
#include <unordered_set>
#endif
#define y0 qvya13579
#define y1 qvyb24680
#define j0 qvja13579
#define j1 qvjb24680
#define next qvne13579xt
#define prev qvpr13579ev
#define INF 1000000007
#define MOD 1000000007
#define endl "\n"
#define PI acos(-1.0)
#define IOS \
cin.tie(0); \
ios::sync_with_stdio(false)
#if __cplusplus < 201103L
#define stoi(argument_string) atoi((argument_string).c_str())
#define stoll(argument_string) atoll((argument_string).c_str())
#endif
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define REP_R(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define FOR(i, m, n) for (int i = ((int)(m)); i < (int)(n); ++i)
#define FOR_R(i, m, n) for (int i = ((int)(m)-1); i >= (int)(n); --i)
#define ALL(v) (v).begin(), (v).end()
#define RALL(v) (v).rbegin(), (v).rend()
#define SIZ(x) ((int)(x).size())
#define CIN(x) cin >> (x)
#define CIN2(x, y) cin >> (x) >> (y)
#define CIN3(x, y, z) cin >> (x) >> (y) >> (z)
#define CIN4(x, y, z, w) cin >> (x) >> (y) >> (z) >> (w)
#define CIN5(x, y, z, w, u) cin >> (x) >> (y) >> (z) >> (w) >> (u)
#define SCAND(x) scanf("%d", &(x))
#define SCAND2(x, y) scanf("%d%d", &(x), &(y))
#define SCAND3(x, y, z) scanf("%d%d%d", &(x), &(y), &(z))
#define SCAND4(x, y, z, w) scanf("%d%d%d%d", &(x), &(y), &(z), &(w))
#define SCAND5(x, y, z, w, u) scanf("%d%d%d%d%d", &(x), &(y), &(z), &(w), &(u))
#define SCANLLD(x) scanf("%lld", &(x))
#define SCANLLD2(x, y) scanf("%lld%lld", &(x), &(y))
#define SCANLLD3(x, y, z) scanf("%lld%lld%lld", &(x), &(y), &(z))
#define SCANLLD4(x, y, z, w) scanf("%lld%lld%lld%lld", &(x), &(y), &(z), &(w))
#define SCANLLD5(x, y, z, w, u) \
scanf("%lld%lld%lld%lld%lld", &(x), &(y), &(z), &(w), &(u))
#define I64DSCAN(x) scanf("%I64d", &(x))
#define I64DSCAN2(x, y) scanf("%I64d%I64d", &(x), &(y))
#define I64DSCAN3(x, y, z) scanf("%I64d%I64d%I64d", &(x), &(y), &(z))
#define I64DSCAN4(x, y, z, w) \
scanf("%I64d%I64d%I64d%I64d", &(x), &(y), &(z), &(w))
#define I64DSCAN5(x, y, z, w, u) \
scanf("%I64d%I64d%I64d%I64d%I64d", &(x), &(y), &(z), &(w), &(u))
#define PRINTD(x) printf("%d\n", (x))
#define PRINTLLD(x) printf("%lld\n", (x))
#define PRINTI64D(x) printf("%I64d\n", (x))
#define DEBUG(argument) cerr << (#argument) << " : " << (argument) << "\n"
typedef long long lli;
typedef unsigned long long ulli;
using namespace std;
int ctoi(char c) {
if (c >= '0' and c <= '9') {
return (int)(c - '0');
}
return -1;
}
int alphabet_pos(char c) {
if (c >= 'a' and c <= 'z') {
return (int)(c - 'a');
}
return -1;
}
int alphabet_pos_capital(char c) {
if (c >= 'A' and c <= 'Z') {
return (int)(c - 'A');
}
return -1;
}
vector<string> split(string str, char ch) {
int first = 0;
int last = str.find_first_of(ch);
if (last == string::npos) {
last = SIZ(str);
}
vector<string> result;
while (first < SIZ(str)) {
string Ssubstr(str, first, last - first);
result.push_back(Ssubstr);
first = last + 1;
last = str.find_first_of(ch, first);
if (last == string::npos) {
last = SIZ(str);
}
}
return result;
}
int gcd(int a, int b) // assuming a,b >= 1
{
if (a < b) {
swap(a, b);
}
if (b == 0) {
return a;
}
if (a % b == 0) {
return b;
}
return gcd(b, a % b);
}
long long gcd(long long a, long long b) // assuming a,b >= 1
{
if (a < b) {
swap(a, b);
}
if (b == 0LL) {
return a;
}
if (a % b == 0) {
return b;
}
return gcd(b, a % b);
}
int lcm(int a, int b) // assuming a,b >= 1
{
return a * b / gcd(a, b);
}
long long lcm(long long a, long long b) // assuming a,b >= 1
{
return a * b / gcd(a, b);
}
long long pow_fast(long long x, long long n_power, long long modulus) {
if (n_power == 0) {
return 1;
}
if (n_power % 2 == 0) {
return pow_fast(x * x % modulus, n_power / 2, modulus);
}
return x * pow_fast(x, n_power - 1, modulus) % modulus;
}
struct CombinationTable {
vector<vector<long long>> val;
CombinationTable(int size)
: val(size + 1, vector<long long>(size + 1)) // constructor
{
for (int i = 0; i <= size; ++i) // note that 0 <= i <= size
{
for (int j = 0; j <= i; ++j) {
if (j == 0 or j == i) {
val[i][j] = 1LL;
} else {
val[i][j] = val[i - 1][j - 1] + val[i - 1][j];
}
}
}
}
};
void print_vector(vector<int> h, bool verbose = true) {
int L = h.size();
for (int i = 0; i < L; ++i) {
if (verbose) {
printf("%d", h[i]);
} else {
cerr << h[i];
}
if (i != L - 1) {
if (verbose) {
printf(" ");
} else {
cerr << " ";
}
} else {
if (verbose) {
printf("\n");
} else {
cerr << "\n";
}
}
}
}
void print_vector(vector<long long> h, bool verbose = true) {
int L = h.size();
for (int i = 0; i < L; ++i) {
if (verbose) {
printf("%lld", h[i]);
} else {
cerr << h[i];
}
if (i != L - 1) {
if (verbose) {
printf(" ");
} else {
cerr << " ";
}
} else {
if (verbose) {
printf("\n");
} else {
cerr << "\n";
}
}
}
}
void print_matrix2D(vector<vector<int>> h, bool verbose = true) {
int Ly = h.size();
for (int i = 0; i < Ly; ++i) {
int Lx = h[i].size();
for (int j = 0; j < Lx; ++j) {
if (verbose) {
printf("%d", h[i][j]);
} else {
cerr << h[i][j];
}
if (j != Lx - 1) {
if (verbose) {
printf(" ");
} else {
cerr << " ";
}
} else {
if (verbose) {
printf("\n");
} else {
cerr << "\n";
}
}
}
}
}
void print_matrix2D(vector<vector<long long>> h, bool verbose = true) {
int Ly = h.size();
for (int i = 0; i < Ly; ++i) {
int Lx = h[i].size();
for (int j = 0; j < Lx; ++j) {
if (verbose) {
printf("%lld", h[i][j]);
} else {
cerr << h[i][j];
}
if (j != Lx - 1) {
if (verbose) {
printf(" ");
} else {
cerr << " ";
}
} else {
if (verbose) {
printf("\n");
} else {
cerr << "\n";
}
}
}
}
}
void print_matrix2D(vector<string> h, bool verbose = true) {
int Ly = h.size();
for (int i = 0; i < Ly; ++i) {
int Lx = h[i].size();
for (int j = 0; j < Lx; ++j) {
if (verbose) {
printf("%c", h[i][j]);
} else {
cerr << h[i][j];
}
}
if (verbose) {
printf("\n");
} else {
cerr << "\n";
}
}
}
void print_binary(int val, int num_digit = 31, bool verbose = false) {
for (int k = num_digit - 1; k >= 0; --k) {
if (verbose) {
printf("%d", (val >> k) & 1);
} else {
cerr << ((val >> k) & 1);
}
}
if (verbose) {
printf("\n");
} else {
cerr << "\n";
}
}
void print_binary(long long val, int num_digit = 63, bool verbose = false) {
for (int k = num_digit - 1; k >= 0; --k) {
if (verbose) {
printf("%lld", ((val >> k) & 1));
} else {
cerr << ((val >> k) & 1);
}
}
if (verbose) {
printf("\n");
} else {
cerr << "\n";
}
}
struct UnionFind // size-based
{
vector<int> parent, treesize;
UnionFind(int size)
: parent(size), treesize(size, 1) // constructor
{
for (int i = 0; i < size; ++i) {
parent[i] = i;
}
}
int root(int x) {
if (parent[x] == x) {
return x;
}
return parent[x] = root(parent[x]);
}
void unite(int x, int y) {
x = root(x);
y = root(y);
if (x == y) {
return;
}
if (treesize[x] < treesize[y]) {
parent[x] = y;
treesize[y] += treesize[x];
} else {
parent[y] = x;
treesize[x] += treesize[y];
}
}
bool sametree(int x, int y) { return root(x) == root(y); }
int gettreesize(int x) { return treesize[root(x)]; }
};
template <typename Type_value>
struct SegmentTree // Range Minimum Query (RMQ)
{
private:
int n;
vector<Type_value> node;
Type_value identity_element_segmenttree;
public:
SegmentTree(vector<Type_value> v,
Type_value identity_element_st) // constructor
{
int sz = v.size();
identity_element_segmenttree = identity_element_st;
n = 1;
while (n < sz) {
n <<= 1;
}
node.resize(2 * n - 1, identity_element_segmenttree);
for (int i = 0; i < sz; ++i) {
node[i + n - 1] = v[i];
}
for (int i = n - 2; i >= 0; --i) {
node[i] = min(node[2 * i + 1], node[2 * i + 2]);
}
}
void update(int x, Type_value val) {
x += (n - 1);
node[x] = val;
while (x > 0) {
x = (x - 1) / 2;
node[x] = min(node[2 * x + 1], node[2 * x + 2]);
}
}
Type_value getmin(int a, int b, int k = 0, int l = 0,
int r = -1) // getting minimum value in [a,b)
{
// k : index of the referred node
// [l,r) : range covered by the k-th node
if (r < 0) {
r = n;
}
if (r <= a or b <= l) {
return identity_element_segmenttree;
}
if (a <= l and r <= b) {
return node[k];
}
Type_value vl = getmin(a, b, 2 * k + 1, l, (l + r) / 2);
Type_value vr = getmin(a, b, 2 * k + 2, (l + r) / 2, r);
return min(vl, vr);
}
};
template <typename Type_value>
struct BinaryIndexedTree // Range Sum Query (RSQ), 0-indexed
{
private:
int size_;
vector<Type_value> data;
public:
BinaryIndexedTree(int sz, Type_value identity_element_binaryindexedtree =
0.0) // constructor
{
size_ = sz;
data.resize(sz + 1, identity_element_binaryindexedtree);
}
Type_value sum(int i) // sum within [0,i)
{
if (i <= 0) {
return (Type_value)0.0;
}
if (i > size_) {
i = size_;
}
Type_value sm = 0.0;
while (i > 0) {
sm += data[i];
i -= i & -i;
}
return sm;
}
void add(int i, Type_value x) {
if (i < 0 or i >= size_) {
return;
}
++i;
while (i <= size_) {
data[i] += x;
i += i & -i;
}
}
};
struct RollingHash {
/*
10 primes near 1e9(for other mod(s)):
{
1000000007,
1000000009,
1000000021,
1000000033,
1000000087,
1000000093,
1000000097,
1000000103,
1000000123,
1000000181
}
10 primes near 1e5(for other base(s)):
{100003,
100019,
100043,
100049,
100057,
100069,
100103,
100109,
100129,
100151}
*/
private:
vector<unsigned long long> hash;
vector<unsigned long long> base_pow;
unsigned long long base, modulus;
const unsigned long long MODULUS_DEFAULT = (1ULL << 61) - 1;
const unsigned long long MASK30 = (1ULL << 30) - 1;
const unsigned long long MASK31 = (1ULL << 31) - 1;
const unsigned long long BASE_MIN = 1e7;
unsigned long long Modulus_2pow61m1(unsigned long long val) {
val = (val & MODULUS_DEFAULT) + (val >> 61);
if (MODULUS_DEFAULT < val) {
val -= MODULUS_DEFAULT;
}
return val;
}
unsigned long long Multiple_2pow61m1(unsigned long long a,
unsigned long long b) {
unsigned long long au = a >> 31;
unsigned long long ad = a & MASK31;
unsigned long long bu = b >> 31;
unsigned long long bd = b & MASK31;
unsigned long long mid = ad * bu + au * bd;
unsigned long long midu = mid >> 30;
unsigned long long midd = mid & MASK30;
return Modulus_2pow61m1(((au * bu) << 1) + midu + (midd << 31) + ad * bd);
}
void initialize(string &S) {
int N = S.size();
vector<int> s(N);
for (int i = 0; i < N; ++i) {
s[i] = S[i];
}
initialize(s);
}
void initialize(vector<int> &S) {
hash.resize(S.size() + 1);
base_pow.resize(S.size() + 1);
hash[0] = 0;
base_pow[0] = 1;
if (modulus == MODULUS_DEFAULT) {
for (int i = 1; i <= S.size(); ++i) {
hash[i] =
Modulus_2pow61m1(Multiple_2pow61m1(hash[i - 1], base) + S[i - 1]);
base_pow[i] = Multiple_2pow61m1(base_pow[i - 1], base);
}
} else {
for (int i = 1; i <= S.size(); ++i) {
hash[i] = (hash[i - 1] * base + S[i - 1]) % modulus;
base_pow[i] = (base_pow[i - 1] * base) % modulus;
}
}
}
public:
RollingHash(string S = "", unsigned long long base_ = 0,
unsigned long long modulus_ = 0) {
if (0 < modulus_) {
modulus = modulus_;
} else {
modulus = MODULUS_DEFAULT;
}
if (0 < base_) {
base = base_;
} else {
mt19937_64 mt64(static_cast<unsigned int>(time(nullptr)));
uniform_int_distribution<unsigned long long> rand_uniform(
BASE_MIN, modulus - BASE_MIN);
base = rand_uniform(mt64);
}
if (S.size() > 0) {
initialize(S);
}
}
// 0-indexed, [a, b)
unsigned long long between(int a, int b) {
if (modulus == MODULUS_DEFAULT) {
return Modulus_2pow61m1(modulus + hash[b] -
Multiple_2pow61m1(hash[a], base_pow[b - a]));
}
return (modulus + hash[b] - (hash[a] * base_pow[b - a]) % modulus) %
modulus;
}
};
/*------------------ the end of the template -----------------------*/
signed main() {
IOS; /* making cin faster */
int N, M;
SCAND2(N, M);
vector<vector<pair<int, int>>> G(N);
REP(_, M) {
int l, r, c;
SCAND3(l, r, c);
--l;
--r;
G[l].push_back(make_pair(r, c));
}
REP(i, N - 1) { G[i + 1].push_back(make_pair(i, 0)); }
const lli LINF = 1e18;
vector<bool> cango(N, true);
vector<lli> d(N, LINF);
priority_queue<pair<lli, int>> pq;
d[0] = 0;
pq.push(make_pair(0LL, 0));
while (not pq.empty()) {
pair<lli, int> r = pq.top();
pq.pop();
int u = r.second;
if (-r.first < d[u]) {
continue;
}
cango[u] = false;
for (auto elem : G[u]) {
int v = elem.first;
int c = elem.second;
if (cango[v] and d[u] + c < d[v]) {
d[v] = d[u] + c;
pq.push(make_pair(-d[v], v));
}
}
}
if (d[N - 1] == LINF) {
PRINTD(-1);
} else {
PRINTLLD(d[N - 1]);
}
}
| insert | 712 | 712 | 712 | 713 | -6 | terminate called after throwing an instance of 'std::length_error'
what(): cannot create std::vector larger than max_size()
|
p02868 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
class Edge {
public:
long long to;
long long cost;
Edge() {}
Edge(long long _to, long long _cost) {
to = _to;
cost = _cost;
}
};
class Mov {
public:
long long id;
long long cost;
Mov(long long _id, long long _cost) {
id = _id;
cost = _cost;
}
Mov(const Mov &m) {
id = m.id;
cost = m.cost;
}
};
class Node {
public:
long long cost;
vector<Edge> edge;
Node() { cost = LLONG_MAX / 2; }
};
bool has_larger_cost(const Mov &a, const Mov &b) { return a.cost > b.cost; }
int main() {
long long nnode, nedge;
cin >> nnode >> nedge;
vector<Node> node(nnode);
for (long long x = 0; x < nnode; x++) {
for (long long y = 1; y < x; y++) {
node.at(x).edge.emplace_back(y, 0);
}
}
for (long long i = 0; i < nedge; i++) {
long long from, to, cost;
cin >> from >> to >> cost;
from--;
to--;
node.at(from).edge.emplace_back(to, cost);
}
priority_queue<Mov, vector<Mov>, decltype(&has_larger_cost)> pq(
&has_larger_cost);
pq.emplace(0LL, 0LL);
while (!pq.empty()) {
auto mov = pq.top();
pq.pop();
if (node.at(mov.id).cost <= mov.cost) {
continue;
}
node.at(mov.id).cost = mov.cost;
for (const auto &e : node.at(mov.id).edge) {
pq.emplace(e.to, e.cost + mov.cost);
}
}
if (node.back().cost == LLONG_MAX / 2) {
cout << "-1\n";
} else {
cout << node.back().cost << '\n';
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
class Edge {
public:
long long to;
long long cost;
Edge() {}
Edge(long long _to, long long _cost) {
to = _to;
cost = _cost;
}
};
class Mov {
public:
long long id;
long long cost;
Mov(long long _id, long long _cost) {
id = _id;
cost = _cost;
}
Mov(const Mov &m) {
id = m.id;
cost = m.cost;
}
};
class Node {
public:
long long cost;
vector<Edge> edge;
Node() { cost = LLONG_MAX / 2; }
};
bool has_larger_cost(const Mov &a, const Mov &b) { return a.cost > b.cost; }
int main() {
long long nnode, nedge;
cin >> nnode >> nedge;
vector<Node> node(nnode);
for (long long x = 1; x < nnode; x++) {
node.at(x).edge.emplace_back(x - 1, 0);
}
for (long long i = 0; i < nedge; i++) {
long long from, to, cost;
cin >> from >> to >> cost;
from--;
to--;
node.at(from).edge.emplace_back(to, cost);
}
priority_queue<Mov, vector<Mov>, decltype(&has_larger_cost)> pq(
&has_larger_cost);
pq.emplace(0LL, 0LL);
while (!pq.empty()) {
auto mov = pq.top();
pq.pop();
if (node.at(mov.id).cost <= mov.cost) {
continue;
}
node.at(mov.id).cost = mov.cost;
for (const auto &e : node.at(mov.id).edge) {
pq.emplace(e.to, e.cost + mov.cost);
}
}
if (node.back().cost == LLONG_MAX / 2) {
cout << "-1\n";
} else {
cout << node.back().cost << '\n';
}
return 0;
}
| replace | 41 | 45 | 41 | 43 | TLE | |
p02868 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define reps(i, n) for (int i = 1; i <= (int)(n); ++i)
#define repd(i, n) for (int i = (int)(n - 1); i >= 0; --i)
#define repds(i, n) for (int i = (int)(n); i > 0; --i)
#define loop(i, x, n) for (int i = (int)(x); i < (n); ++i)
#define loops(i, x, n) for (int i = (int)(x); i <= (n); ++i)
#define loopd(i, x, n) for (int i = (int)(x); i > (n); --i)
#define loopds(i, x, n) for (int i = (int)(x); i >= (n); --i)
#define itrep(i, s) for (auto i = begin(s); i != end(s); ++i)
#define itrepd(i, s) for (auto i = --end(s); i != begin(s); --i)
#define all(f, x, ...) \
[&](decltype(x) &whole) { \
return (f)(begin(whole), end(whole), ##__VA_ARGS__); \
}(x)
#define rall(f, x, ...) \
[&](decltype(x) &whole) { \
return (f)(rbegin(whole), rend(whole), ##__VA_ARGS__); \
}(x)
using ll = long long;
using ld = long double;
constexpr ll inf = static_cast<ll>(1e17);
constexpr int iinf = static_cast<int>(1e9);
constexpr double dinf = 1e10;
constexpr ld ldinf = 1e17;
ll mod = static_cast<ll>(1e9 + 7);
std::ostream &endn(std::ostream &os) { return os.put(os.widen('\n')); }
template <class T> constexpr int sz(const T &a) { return (int)a.size(); }
template <class T, class... Args> constexpr T mins(T &a, Args... args) {
return a = min<T>({a, args...});
}
template <class T, class... Args> constexpr T maxs(T &a, Args... args) {
return a = max<T>({a, args...});
}
int n, m;
vector<pair<int, ll>> g[100005];
ll d[100005];
void solve() {
cin >> n >> m;
rep(i, n - 1) g[i + 1].emplace_back(i, 0);
rep(i, m) {
int l, r;
ll c;
cin >> l >> r >> c;
--l;
--r;
g[l].emplace_back(r, c);
}
fill(d, d + n, inf);
priority_queue<pair<ll, int>> que;
que.emplace(0LL, 0);
d[0] = 0;
while (!que.empty()) {
auto p = que.top();
que.pop();
auto v = p.second;
if (d[v] < p.first)
continue;
rep(i, g[v].size()) {
auto e = g[v][i];
if (d[v] + e.second < d[e.first]) {
d[e.first] = d[v] + e.second;
que.emplace(d[e.first], e.first);
}
}
}
if (d[n - 1] != inf)
cout << d[n - 1] << endn;
else
cout << -1 << endn;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
solve();
cout << flush;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define reps(i, n) for (int i = 1; i <= (int)(n); ++i)
#define repd(i, n) for (int i = (int)(n - 1); i >= 0; --i)
#define repds(i, n) for (int i = (int)(n); i > 0; --i)
#define loop(i, x, n) for (int i = (int)(x); i < (n); ++i)
#define loops(i, x, n) for (int i = (int)(x); i <= (n); ++i)
#define loopd(i, x, n) for (int i = (int)(x); i > (n); --i)
#define loopds(i, x, n) for (int i = (int)(x); i >= (n); --i)
#define itrep(i, s) for (auto i = begin(s); i != end(s); ++i)
#define itrepd(i, s) for (auto i = --end(s); i != begin(s); --i)
#define all(f, x, ...) \
[&](decltype(x) &whole) { \
return (f)(begin(whole), end(whole), ##__VA_ARGS__); \
}(x)
#define rall(f, x, ...) \
[&](decltype(x) &whole) { \
return (f)(rbegin(whole), rend(whole), ##__VA_ARGS__); \
}(x)
using ll = long long;
using ld = long double;
constexpr ll inf = static_cast<ll>(1e17);
constexpr int iinf = static_cast<int>(1e9);
constexpr double dinf = 1e10;
constexpr ld ldinf = 1e17;
ll mod = static_cast<ll>(1e9 + 7);
std::ostream &endn(std::ostream &os) { return os.put(os.widen('\n')); }
template <class T> constexpr int sz(const T &a) { return (int)a.size(); }
template <class T, class... Args> constexpr T mins(T &a, Args... args) {
return a = min<T>({a, args...});
}
template <class T, class... Args> constexpr T maxs(T &a, Args... args) {
return a = max<T>({a, args...});
}
int n, m;
vector<pair<int, ll>> g[100005];
ll d[100005];
void solve() {
cin >> n >> m;
rep(i, n - 1) g[i + 1].emplace_back(i, 0);
rep(i, m) {
int l, r;
ll c;
cin >> l >> r >> c;
--l;
--r;
g[l].emplace_back(r, c);
}
fill(d, d + n, inf);
priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<>> que;
que.emplace(0LL, 0);
d[0] = 0;
while (!que.empty()) {
auto p = que.top();
que.pop();
auto v = p.second;
if (d[v] < p.first)
continue;
rep(i, g[v].size()) {
auto e = g[v][i];
if (d[v] + e.second < d[e.first]) {
d[e.first] = d[v] + e.second;
que.emplace(d[e.first], e.first);
}
}
}
if (d[n - 1] != inf)
cout << d[n - 1] << endn;
else
cout << -1 << endn;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
solve();
cout << flush;
return 0;
}
| replace | 57 | 58 | 57 | 58 | TLE | |
p02868 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N, M;
vector<tuple<ll, ll, ll>> E;
typedef pair<ll, ll> P;
ll solve() {
ll v = 0, d = 0, e = 0;
priority_queue<P, vector<P>, greater<P>> que;
while (v != N - 1) {
for (; get<0>(E[e]) <= v; ++e) {
ll l, r, c;
tie(l, r, c) = E[e];
que.push(make_pair(d + c, r));
}
if (que.empty())
return -1;
ll dx, r;
tie(dx, r) = que.top();
que.pop();
d = dx;
v = r;
}
return d;
}
int main() {
cin >> N >> M;
for (ll i = 0; i < M; ++i) {
ll l, r, c;
cin >> l >> r >> c;
--l;
--r;
E.push_back(make_tuple(l, r, c));
}
sort(E.begin(), E.end());
cout << solve() << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N, M;
vector<tuple<ll, ll, ll>> E;
typedef pair<ll, ll> P;
ll solve() {
ll v = 0, d = 0, e = 0;
priority_queue<P, vector<P>, greater<P>> que;
while (v != N - 1) {
for (; e < E.size() && get<0>(E[e]) <= v; ++e) {
ll l, r, c;
tie(l, r, c) = E[e];
que.push(make_pair(d + c, r));
}
if (que.empty())
return -1;
ll dx, r;
tie(dx, r) = que.top();
que.pop();
d = dx;
v = r;
}
return d;
}
int main() {
cin >> N >> M;
for (ll i = 0; i < M; ++i) {
ll l, r, c;
cin >> l >> r >> c;
--l;
--r;
E.push_back(make_tuple(l, r, c));
}
sort(E.begin(), E.end());
cout << solve() << endl;
return 0;
}
| replace | 13 | 14 | 13 | 14 | 0 | |
p02868 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 5;
int n, m;
ll t[N << 2], lz[N << 2];
vector<pair<int, int>> v[N];
void build(int l, int r, int k) {
t[k] = lz[k] = 1e18;
if (l == r && l == 1)
t[k] = 0;
if (l == r)
return;
int m = l + r >> 1;
build(l, m, k << 1);
build(m + 1, r, k << 1 | 1);
}
void update(int k) {
t[k << 1] = min(t[k << 1], lz[k]);
t[k << 1 | 1] = min(t[k << 1 | 1], lz[k]);
lz[k << 1] = min(lz[k << 1], lz[k]);
lz[k << 1 | 1] = min(lz[k << 1 | 1], lz[k]);
lz[k] = 1e18;
}
ll query(int l, int r, int k, int x) {
if (l != r)
update(k);
if (l == r)
return t[k];
int m = l + r >> 1;
if (x <= m)
return query(l, m, k << 1, x);
else
return query(m + 1, r, k << 1 | 1, x);
}
void fix(int l, int r, int k, int x, int y, ll v) {
if (r < x || l > y)
return;
if (l != r)
update(k);
if (l >= x && r <= y) {
t[k] = min(t[k], v);
lz[k] = min(lz[k], v);
update(k);
return;
}
int m = l + r >> 1;
fix(l, m, k << 1, x, y, v);
fix(m + 1, r, k << 1 | 1, x, y, v);
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= m; i++) {
int l, r, c;
scanf("%d%d%d", &l, &r, &c);
v[l].push_back({r, c});
}
build(1, n, 1);
for (int i = 1; i <= n; i++) {
ll mn = query(1, n, 1, i);
for (int j = 0; j < v[i].size(); j++)
fix(1, n, 1, i, v[i][j].first, mn + v[i][j].second);
}
ll ans = query(1, n, 1, n);
if (ans == 1e18)
ans = -1;
printf("%lld\n", ans);
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 5;
int n, m;
ll t[N << 2], lz[N << 2];
vector<pair<int, int>> v[N];
void build(int l, int r, int k) {
t[k] = lz[k] = 1e18;
if (l == r && l == 1)
t[k] = 0;
if (l == r)
return;
int m = l + r >> 1;
build(l, m, k << 1);
build(m + 1, r, k << 1 | 1);
}
void update(int k) {
t[k << 1] = min(t[k << 1], lz[k]);
t[k << 1 | 1] = min(t[k << 1 | 1], lz[k]);
lz[k << 1] = min(lz[k << 1], lz[k]);
lz[k << 1 | 1] = min(lz[k << 1 | 1], lz[k]);
lz[k] = 1e18;
}
ll query(int l, int r, int k, int x) {
if (l != r)
update(k);
if (l == r)
return t[k];
int m = l + r >> 1;
if (x <= m)
return query(l, m, k << 1, x);
else
return query(m + 1, r, k << 1 | 1, x);
}
void fix(int l, int r, int k, int x, int y, ll v) {
if (r < x || l > y)
return;
if (l != r)
update(k);
if (l >= x && r <= y) {
t[k] = min(t[k], v);
lz[k] = min(lz[k], v);
if (l != r)
update(k);
return;
}
int m = l + r >> 1;
fix(l, m, k << 1, x, y, v);
fix(m + 1, r, k << 1 | 1, x, y, v);
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= m; i++) {
int l, r, c;
scanf("%d%d%d", &l, &r, &c);
v[l].push_back({r, c});
}
build(1, n, 1);
for (int i = 1; i <= n; i++) {
ll mn = query(1, n, 1, i);
for (int j = 0; j < v[i].size(); j++)
fix(1, n, 1, i, v[i][j].first, mn + v[i][j].second);
}
ll ans = query(1, n, 1, n);
if (ans == 1e18)
ans = -1;
printf("%lld\n", ans);
}
| replace | 43 | 44 | 43 | 45 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.