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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03178 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
#define rep(i, x, y) \
for (i64 i = i64(x), i##_max_for_repmacro = i64(y); \
i < i##_max_for_repmacro; ++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#de... | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
#define rep(i, x, y) \
for (i64 i = i64(x), i##_max_for_repmacro = i64(y); \
i < i##_max_for_repmacro; ++i)
#define debug(x) #x << "=" << (x)
#ifdef DEBUG
#de... | replace | 101 | 102 | 101 | 102 | 0 | |
p03178 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define ll long l... | #include "bits/stdc++.h"
using namespace std;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define ll long l... | replace | 34 | 35 | 34 | 35 | 0 | |
p03178 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mod(n, k) ((((n) % (k)) + (k)) % (k))
#define forn(i, a, b) for (int i = a; i < b; i++)
#define forr(i, a, b) for (int i = a; i >= b; i--)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef l... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mod(n, k) ((((n) % (k)) + (k)) % (k))
#define forn(i, a, b) for (int i = a; i < b; i++)
#define forr(i, a, b) for (int i = a; i >= b; i--)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef l... | replace | 46 | 47 | 46 | 47 | -11 | |
p03178 | C++ | Time Limit Exceeded | #include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define vv(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define vvi std::vector<std::vector<int>>
#define vvl std::vector<std::vector<ll>>
#define MODs 1000000007;
typedef lo... | #include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define vv(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define vvi std::vector<std::vector<int>>
#define vvl std::vector<std::vector<ll>>
#define MODs 1000000007;
typedef lo... | replace | 26 | 37 | 26 | 27 | TLE | |
p03178 | C++ | Runtime Error | #include <bits/stdc++.h>
#define dbg(x) cout << #x << ": " << (x) << '\n'
#define ff first
#define ss second
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
const int idx = 20, sum = 1e5 + 10, tight = 2;
int mod = 1e9 + 7;
int dp[idx][sum][tight];
int main() {
ios::sync_with... | #include <bits/stdc++.h>
#define dbg(x) cout << #x << ": " << (x) << '\n'
#define ff first
#define ss second
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
const int idx = 1e5 + 10, sum = 101, tight = 2;
int mod = 1e9 + 7;
int dp[idx][sum][tight];
int main() {
ios::sync_wit... | replace | 8 | 9 | 8 | 9 | 0 | |
p03178 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
/*
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
return 0;
}
*/
// problem - M
/* int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freope... | #include <bits/stdc++.h>
#define mod 1000000007
using namespace std;
/*
int main(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
return 0;
}
*/
// problem - M
/* int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freope... | replace | 315 | 316 | 315 | 316 | TLE | |
p03178 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// #define int long long
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<string> vst;
typedef vector<bool> vb;
typedef vector<ld> vld;
typedef vector<pii> vpii;... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<string> vst;
typedef vector<bool> vb;
typedef vector<ld> vld;
typedef vector<pii> vpii;... | replace | 239 | 240 | 239 | 240 | 0 | |
p03178 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ll long long
#define pb push_back
#define vi vector<ll int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define rs(v, n) v.resize(n)
#define hell 100000... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ll long long
#define pb push_back
#define vi vector<ll int>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define rs(v, n) v.resize(n)
#define hell 100000... | replace | 69 | 73 | 69 | 71 | TLE | |
p03178 | C++ | Runtime Error | #include <bits/stdc++.h>
const long long mod = 1000000007;
int main() {
std::string s;
long long D, n;
std::cin >> s >> D;
n = s.size();
// dp[i][j][k] := i文字目まで見た時にmodDでkで、未満フラグがjの数
std::vector<std::vector<std::vector<long long>>> dp(
n + 10,
std::vector<std::vector<long long>>(2, std::vecto... | #include <bits/stdc++.h>
const long long mod = 1000000007;
int main() {
std::string s;
long long D, n;
std::cin >> s >> D;
n = s.size();
// dp[i][j][k] := i文字目まで見た時にmodDでkで、未満フラグがjの数
std::vector<std::vector<std::vector<long long>>> dp(
n + 10,
std::vector<std::vector<long long>>(2, std::vecto... | replace | 31 | 34 | 31 | 37 | -6 | 39a5a408-fdc4-4aef-b660-db8c4e51878c.out: /home/alex/Documents/bug-detection/input/Project_CodeNet/data/p03178/C++/s984366602.cpp:32: int main(): Assertion `0' failed.
|
p03178 | C++ | Runtime Error | #include <algorithm>
#include <complex>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define INF 100000000
#define MOD (int)(1e9 + 7)
#define rep(i, a) for (int i = 0; i < (a); i++)
using namespace std;
int main() ... | #include <algorithm>
#include <complex>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define INF 100000000
#define MOD (int)(1e9 + 7)
#define rep(i, a) for (int i = 0; i < (a); i++)
using namespace std;
int main() ... | replace | 21 | 22 | 21 | 22 | -11 | |
p03178 | C++ | Runtime Error |
// Problem : S - Digit Sum
// Contest : AtCoder - Educational DP Contest
// URL : https://atcoder.jp/contests/dp/tasks/dp_s
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/p... |
// Problem : S - Digit Sum
// Contest : AtCoder - Educational DP Contest
// URL : https://atcoder.jp/contests/dp/tasks/dp_s
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/p... | replace | 116 | 117 | 116 | 117 | 0 | |
p03178 | C++ | Runtime Error | #include <bits/stdc++.h>
#ifdef ONLINE_JUDGE
#define endl "\n"
#endif
using namespace std;
typedef unsigned long long int lu;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> v;
typedef vector<lu> vu;
typedef vector<v> vv;
typedef vector<vu> vvu;
typedef vector<ld> vld;
typedef vector<bool> vb;
type... | #include <bits/stdc++.h>
#ifdef ONLINE_JUDGE
#define endl "\n"
#endif
using namespace std;
typedef unsigned long long int lu;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> v;
typedef vector<lu> vu;
typedef vector<v> vv;
typedef vector<vu> vvu;
typedef vector<ld> vld;
typedef vector<bool> vb;
type... | replace | 81 | 82 | 81 | 82 | 0 | |
p03178 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <iostream>
#include <numeric>
#define ll long long
#define mod 1000000007
#define mod1 998244353
using namespace std;
// vector<int>adj[200000+1];
int cnt = 0;
vector<int> cand;
bool prime[100006];
void SieveOfEratosthenes(int n) {
memset(prime, true, sizeof(prime));
for (int p =... | #include <bits/stdc++.h>
#include <iostream>
#include <numeric>
#define ll long long
#define mod 1000000007
#define mod1 998244353
using namespace std;
// vector<int>adj[200000+1];
int cnt = 0;
vector<int> cand;
bool prime[100006];
void SieveOfEratosthenes(int n) {
memset(prime, true, sizeof(prime));
for (int p =... | replace | 155 | 156 | 155 | 156 | TLE | |
p03178 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
// #define int ll
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
// #define int ll
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs... | replace | 77 | 78 | 77 | 78 | 0 | |
p03178 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// MY TOOLS
#define let long long int
#define async \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
//
int dp[90001][101][2];
int mod = 1e9 + 7;
void self... | #include <bits/stdc++.h>
using namespace std;
// MY TOOLS
#define let long long int
#define async \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
//
int dp[10001][101][2];
int mod = 1e9 + 7;
void self... | replace | 11 | 12 | 11 | 12 | TLE | |
p03178 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<ii> vii;
typedef v... | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
typedef unsigned int uint;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<ii> vii;
typedef v... | replace | 91 | 92 | 91 | 92 | 0 | |
p03178 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long int
#define L_T_S_K \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
using namesp... | #include <bits/stdc++.h>
#define int long long int
#define L_T_S_K \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
using namesp... | replace | 11 | 12 | 11 | 12 | 0 | |
p03178 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
ll mod = 1e9 + 7;
int main() {
/*#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output1.txt", "w", stdout);
#endif*/
// cout << std::fixed;
// cout << std::setprecision(10);
ios_base::sync_with_stdi... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
ll mod = 1e9 + 7;
int main() {
/*#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output1.txt", "w", stdout);
#endif*/
// cout << std::fixed;
// cout << std::setprecision(10);
ios_base::sync_with_stdi... | delete | 23 | 24 | 23 | 23 | 0 | |
p03179 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#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 fi first
#define se second
#define mp make_pair
#define itrfor(itr, A) for (auto itr = A.begin(); itr != A.end(); itr++)
te... | #include <bits/stdc++.h>
using namespace std;
#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 fi first
#define se second
#define mp make_pair
#define itrfor(itr, A) for (auto itr = A.begin(); itr != A.end(); itr++)
te... | replace | 47 | 48 | 47 | 48 | 0 | |
p03179 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define per(i, a, b) for (auto i = (b)-1; i >= (a); --i)
#define trav(x, v) for (auto &x : v)
#define sz(x) int((x).size())
#define eb(x...) emplace_back(x)
#define... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define per(i, a, b) for (auto i = (b)-1; i >= (a); --i)
#define trav(x, v) for (auto &x : v)
#define sz(x) int((x).size())
#define eb(x...) emplace_back(x)
#define... | replace | 46 | 48 | 46 | 49 | 0 | |
p03179 | C++ | Runtime Error | #include <stdio.h>
const int MAXN = 3005;
const int MOD = (int)1e9 + 7;
char s[MAXN];
int dp[MAXN][MAXN];
int get_ans(int i, int l, int r) {
int ans = dp[i][r];
if (l > 0)
ans -= dp[i][l - 1];
return (ans % MOD + MOD) % MOD;
}
int main(void) {
int n;
scanf(" %d", &n);
scanf(" %s", s);
dp[0][0] ... | #include <stdio.h>
const int MAXN = 3005;
const int MOD = (int)1e9 + 7;
char s[MAXN];
int dp[MAXN][MAXN];
int get_ans(int i, int l, int r) {
int ans = dp[i][r];
if (l > 0)
ans -= dp[i][l - 1];
return (ans % MOD + MOD) % MOD;
}
int main(void) {
int n;
scanf(" %d", &n);
scanf(" %s", s);
dp[0][0] ... | insert | 25 | 25 | 25 | 28 | 0 | |
p03179 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define sz(v) (int)v.size()
#define MOO(i, a, b) for (int i = a; i < b; i++)
#define M00(i, a) for (int i = 0; i < a; i++)
#define MOOd(i, a, b) for (int i = (b)-... | #include <bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define sz(v) (int)v.size()
#define MOO(i, a, b) for (int i = a; i < b; i++)
#define M00(i, a) for (int i = 0; i < a; i++)
#define MOOd(i, a, b) for (int i = (b)-... | delete | 52 | 53 | 52 | 52 | TLE | |
p03179 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) <<... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) <<... | replace | 71 | 72 | 71 | 72 | 0 | |
p03179 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
const int maxn = 3010;
ll dp[maxn][maxn];
int main() {
ios_base::sync_with_stdio(false);
int n;
string s;
cin >> n >> s;
dp[1][1] = 1;
for (int i = 2; i <= n; i++) {
ll pref[i];
pref[0] = 0;
for (int j... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
const int maxn = 3010;
ll dp[maxn][maxn];
int main() {
ios_base::sync_with_stdio(false);
int n;
string s;
cin >> n >> s;
dp[1][1] = 1;
for (int i = 2; i <= n; i++) {
ll pref[i];
pref[0] = 0;
for (int j... | replace | 21 | 22 | 21 | 22 | 0 | |
p03179 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr int64 P = 1000000007;
// Verified: ABC133E, ABC132D, ABC130E
struct FiniteField {
private:
int64 x;
public:
FiniteField(int64 input_x) : x(input_x) {}
FiniteField() : x(0) {}
int64 Value() { return x; }
inline FiniteField op... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr int64 P = 1000000007;
// Verified: ABC133E, ABC132D, ABC130E
struct FiniteField {
private:
int64 x;
public:
FiniteField(int64 input_x) : x(input_x) {}
FiniteField() : x(0) {}
int64 Value() { return x; }
inline FiniteField op... | replace | 73 | 75 | 73 | 75 | -11 | |
p03179 | C++ | Runtime Error | /******************************************
* AUTHOR: Atharva Sarage *
* INSTITUITION: IIT HYDERABAD *
******************************************/
#include <bits/stdc++.h>
#warning Check Max_Limit,Overflows
using namespace std;
#define IOS ... | /******************************************
* AUTHOR: Atharva Sarage *
* INSTITUITION: IIT HYDERABAD *
******************************************/
#include <bits/stdc++.h>
#warning Check Max_Limit,Overflows
using namespace std;
#define IOS ... | replace | 19 | 20 | 19 | 20 | 0 | |
p03179 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using vl = vector<ll>;
using Map = map<ll, ll>;
using T = tuple<ll, ll, ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define print(v) cout << v << endl;
#define fi(v) get<0>(v)
#define se(v) get<1>(v)
#... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using vl = vector<ll>;
using Map = map<ll, ll>;
using T = tuple<ll, ll, ll>;
using vvl = vector<vector<ll>>;
#define all(v) v.begin(), v.end()
#define print(v) cout << v << endl;
#define fi(v) get<0>(v)
#define se(v) get<1>(v)
#... | replace | 47 | 53 | 47 | 58 | TLE | |
p03179 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 2e3 + 1, MOD = 1e9 + 7;
char c[N];
int val[N][N];
signed main() {
/*
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
*/
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
val[0][0] = 1;
int n... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e4, MOD = 1e9 + 7;
char c[N];
int val[N][N];
signed main() {
/*
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
*/
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
val[0][0] = 1;
int n;
... | replace | 4 | 5 | 4 | 5 | 0 | |
p03179 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MOD = 1000 * 1000 * 1000 + 7;
const int N = 1000;
ll dp[N + 1][N + 1];
int main() {
int n;
cin >> n;
string s;
cin >> s;
for (int i = 1; i <= n; ++i) {
dp[i][0] = 0;
}
dp[1][1] = 1;
for (int i = 0; i < s.length()... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MOD = 1000 * 1000 * 1000 + 7;
const int N = 3000;
ll dp[N + 1][N + 1];
int main() {
int n;
cin >> n;
string s;
cin >> s;
for (int i = 1; i <= n; ++i) {
dp[i][0] = 0;
}
dp[1][1] = 1;
for (int i = 0; i < s.length()... | replace | 6 | 7 | 6 | 7 | 0 | |
p03179 | C++ | Runtime Error | // {{{ by unolight
#include <bits/stdc++.h>
#include <unistd.h>
#pragma GCC diagnostic ignored "-Wunused-result"
#define SZ(x) ((int)(x).size())
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REP1(i, a, b) for (int i = (a); i <= int(b); i++)... | // {{{ by unolight
#include <bits/stdc++.h>
#include <unistd.h>
#pragma GCC diagnostic ignored "-Wunused-result"
#define SZ(x) ((int)(x).size())
#define ALL(x) begin(x), end(x)
#define RALL(x) rbegin(x), rend(x)
#define REP(i, n) for (int i = 0; i < int(n); i++)
#define REP1(i, a, b) for (int i = (a); i <= int(b); i++)... | replace | 193 | 194 | 193 | 194 | -11 | |
p03179 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory.h>
#include <queue>
#include <set>
#include <time.h>
#include <unordered_map>
#inc... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory.h>
#include <queue>
#include <set>
#include <time.h>
#include <unordered_map>
#inc... | insert | 74 | 74 | 74 | 78 | 0 | |
p03179 | C++ | Runtime Error | // #define LOCAL
// #define BUG
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#in... | // #define LOCAL
// #define BUG
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#in... | replace | 65 | 66 | 65 | 66 | 0 | |
p03179 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define st first
#define nd second
#define turbo \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | #include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define st first
#define nd second
#define turbo \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | replace | 19 | 20 | 19 | 20 | 0 | |
p03179 | C++ | Time Limit Exceeded | // HTTF.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#include "bits/stdc++.h"
#define YES "YES"
#define NO "NO"
#define YESNO OUT(three(solve(), YES, NO))
#define ECHO OUT(solve())
#define three(A, B, C) ((A) ? (B) : (C))
#define FOR(i, a, b) for (LL i = (a); i < (LL)(b); i++)
#define EFOR(i, a, b) f... | // HTTF.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#include "bits/stdc++.h"
#define YES "YES"
#define NO "NO"
#define YESNO OUT(three(solve(), YES, NO))
#define ECHO OUT(solve())
#define three(A, B, C) ((A) ? (B) : (C))
#define FOR(i, a, b) for (LL i = (a); i < (LL)(b); i++)
#define EFOR(i, a, b) f... | replace | 91 | 92 | 91 | 92 | TLE | |
p03179 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define For(i, n) for (int i = 0; i < n; i++)
#define mem(a, b) memset(a, b, sizeof(a))
#define int long long int
#define ld long double
#define fio ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#d... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
#define For(i, n) for (int i = 0; i < n; i++)
#define mem(a, b) memset(a, b, sizeof(a))
#define int long long int
#define ld long double
#define fio ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#d... | replace | 37 | 41 | 37 | 38 | -11 | |
p03179 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
const long long INF = 1000000007;
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef pair<pii, pii> piiii;
int n... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
const long long INF = 1000000007;
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, pii> piii;
typedef pair<pii, pii> piiii;
int n... | replace | 39 | 50 | 39 | 50 | TLE | |
p03179 | C++ | Runtime Error | // :'(((((((((((((
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define M 1000000007LL
#define rep(i, a, b) for (ll i = (ll)a; i < (ll)b; i++)
#define sep(i, a, b) for (ll i = (ll)a; i >= (ll)... | // :'(((((((((((((
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define M 1000000007LL
#define rep(i, a, b) for (ll i = (ll)a; i < (ll)b; i++)
#define sep(i, a, b) for (ll i = (ll)a; i >= (ll)... | replace | 26 | 27 | 26 | 27 | 0 | |
p03179 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> VI;
typedef long long LL;
typedef pair<int, int> PI;
typedef pair<LL, LL> PLL;
typedef unsigned long long ULL;
typedef pair<double, double> PD;
#define FOR(x, b, e) for (int x = b; x <= (e); x++)
#define FORD(x, b, e) for (int x = b; x >= (e); x--)
#de... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> VI;
typedef long long LL;
typedef pair<int, int> PI;
typedef pair<LL, LL> PLL;
typedef unsigned long long ULL;
typedef pair<double, double> PD;
#define FOR(x, b, e) for (int x = b; x <= (e); x++)
#define FORD(x, b, e) for (int x = b; x >= (e); x--)
#de... | replace | 39 | 50 | 39 | 54 | TLE | |
p03179 | C++ | Runtime Error | #pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int n;
string s;
const LL MOD = 1e9 + 7;
LL memo[4005][4005][5];
LL dp(int l, int r... | #pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int n;
string s;
const LL MOD = 1e9 + 7;
LL memo[4005][4005][5];
LL dp(int l, int r... | insert | 44 | 44 | 44 | 50 | -11 | |
p03180 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define reprrev(i, a, b) for (int i = b - 1; i >= a; i--) // [a, b)
#define reprev(i, n) reprrev(i, 0, n)
typedef long long ll;
typedef unsigned long long ull;
template <class T>... | #include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define reprrev(i, a, b) for (int i = b - 1; i >= a; i--) // [a, b)
#define reprev(i, n) reprrev(i, 0, n)
typedef long long ll;
typedef unsigned long long ull;
template <class T>... | replace | 84 | 85 | 84 | 85 | -11 | |
p03180 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef long long LL;
typedef pair<int, int> PI;
typedef pair<LL, LL> PLL;
typedef unsigned long long ULL;
typedef pair<double, double> PD;
#define FOR(x, b, e) for (int x = b; x <= (e); x++)
#define FORD(x, b, e) for (int x... | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef long long LL;
typedef pair<int, int> PI;
typedef pair<LL, LL> PLL;
typedef unsigned long long ULL;
typedef pair<double, double> PD;
#define FOR(x, b, e) for (int x = b; x <= (e); x++)
#define FORD(x, b, e) for (int x... | replace | 45 | 47 | 45 | 47 | TLE | |
p03180 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define MOD 1000000007
typedef long long ll;
using namespace std;
int N;
ll a[20][20];
ll score[(1 << 16)];
ll dp[(1 << 16)];
const ll INF = 1e18;
ll solve(int state) {
i... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define MOD 1000000007
typedef long long ll;
using namespace std;
int N;
ll a[20][20];
ll score[(1 << 16)];
ll dp[(1 << 16)];
const ll INF = 1e18;
ll solve(int state) {
i... | insert | 27 | 27 | 27 | 29 | -11 | |
p03180 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define INF 2000000000000000000LL
#define EPS 1e-9
#define debug(a) cerr << #a << "=" << (a) << "\n"
#define FastSlowInput \
ios_base::s... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define INF 2000000000000000000LL
#define EPS 1e-9
#define debug(a) cerr << #a << "=" << (a) << "\n"
#define FastSlowInput \
ios_base::s... | replace | 51 | 56 | 51 | 53 | TLE | |
p03180 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int N = 16;
const int N2 = (1 << N);
int n, a[N][N];
long long cost[N2], dp[N2];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> a[i][j];
}
}
int p2n = (1... | #include <bits/stdc++.h>
using namespace std;
const int N = 16;
const int N2 = (1 << N);
int n, a[N][N];
long long cost[N2], dp[N2];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> a[i][j];
}
}
int p2n = (1... | replace | 35 | 36 | 35 | 36 | TLE | |
p03180 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<double> vd;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<pi> vp;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<double> vd;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<pi> vp;
... | replace | 21 | 24 | 21 | 23 | TLE | |
p03180 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define yn ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define yn ... | replace | 27 | 47 | 27 | 30 | TLE | |
p03180 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define inf 1 << 60
int dp[(1 << 16)];
int sum[(1 << 16)];
int calculate(vector<vector<int>> &score, int mask) {
int ans = 0;
for (int i = 0; i < 17; i++) {
for (int j = i + 1; j < 17; j++) {
if (((mask & (1 << i)) != 0) && ((mask & (1 <... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define inf (int)1 << 60
int dp[(1 << 16)];
int sum[(1 << 16)];
int calculate(vector<vector<int>> &score, int mask) {
int ans = 0;
for (int i = 0; i < 17; i++) {
for (int j = i + 1; j < 17; j++) {
if (((mask & (1 << i)) != 0) && ((mask &... | replace | 3 | 4 | 3 | 4 | TLE | |
p03180 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
#define endl '\n'
using namespace std;
const int MAXN = 16;
long long points[MAXN][MAXN], dp[(1 << MAXN) + 3], total[(1 << MAXN) + 3];
void calc_dp(int mask, int curr, int ind, vector<int> missing) {
if (ind == (int)missing.size()) {
int new_mask = (mask | curr);
dp[n... | #include <iostream>
#include <vector>
#define endl '\n'
using namespace std;
const int MAXN = 16;
long long points[MAXN][MAXN], dp[(1 << MAXN) + 3], total[(1 << MAXN) + 3];
void calc_dp(int mask, int curr, int ind, const vector<int> &missing) {
if (ind == (int)missing.size()) {
int new_mask = (mask | curr);
... | replace | 10 | 11 | 10 | 11 | TLE | |
p03180 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long LL;
typedef unsigned int uii;
typedef pair<int, int> pii;
typedef unsigned long long uLL;
typedef vector<int> vii... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long LL;
typedef unsigned int uii;
typedef pair<int, int> pii;
typedef unsigned long long uLL;
typedef vector<int> vii... | replace | 27 | 28 | 27 | 28 | TLE | |
p03180 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vll>;
using vb = vector<bool>;
const int INF = 2e... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vll>;
using vb = vector<bool>;
const int INF = 2e... | replace | 60 | 65 | 60 | 62 | TLE | |
p03180 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define lint long long
const int N = 16;
lint cost[N][N];
int n;
lint subsetCost[1 << N];
lint dp[1 << N];
lint solve(int mask) {
if (__builtin_popcount(mask) == n)
return 0;
if (dp[mask] != -1)
return dp[mask];
lint sum = 0;
vector<int> indices;
indic... | #include <bits/stdc++.h>
using namespace std;
#define lint long long
const int N = 16;
lint cost[N][N];
int n;
lint subsetCost[1 << N];
lint dp[1 << N];
lint solve(int mask) {
if (__builtin_popcount(mask) == n)
return 0;
if (dp[mask] != -1)
return dp[mask];
lint sum = 0;
vector<int> indices;
indic... | replace | 56 | 58 | 56 | 78 | TLE | |
p03180 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 16;
int matrix[MAXN + 7][MAXN + 7];
long long cost[MAXN + 7];
long long dp[(1 << MAXN) + 7];
vector<int> masks_by_size[MAXN + 7];
int N;
bool checkbit(int mask, int i) { return (mask >> i) & 1; }
void precalc() {
for (int mask = 1; mask < (1 << N); ... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 16;
int matrix[MAXN + 7][MAXN + 7];
long long cost[(1 << MAXN) + 7];
long long dp[(1 << MAXN) + 7];
vector<int> masks_by_size[MAXN + 7];
int N;
bool checkbit(int mask, int i) { return (mask >> i) & 1; }
void precalc() {
for (int mask = 1; mask < (1 ... | replace | 7 | 8 | 7 | 8 | 0 | |
p03180 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long pair[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> pair[i][j];
}
}
vector<long long> dp((1 << n), 0);
for (int bit = 0; bit < (1 << n); bit++) {
bitset<16> b = bit;
for ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
long long pair[n][n];
for (int i = 0; i < n; i++) {
for (int j = 0; j < n; j++) {
cin >> pair[i][j];
}
}
vector<long long> dp((1 << n), 0);
for (int bit = 0; bit < (1 << n); bit++) {
bitset<16> b = bit;
for ... | replace | 28 | 31 | 28 | 29 | TLE | |
p03180 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll MOD = 1e9 + 7;
const static ll INF = 1e14;
ll N;
vector<vector<ll>> V(17, vector<ll>(17));
vector<ll> DP;
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
cin >> V[i][j];
}
}
DP.... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll MOD = 1e9 + 7;
const static ll INF = 1e14;
ll N;
vector<vector<ll>> V(17, vector<ll>(17));
vector<ll> DP;
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
cin >> V[i][j];
}
}
DP.... | replace | 32 | 33 | 32 | 33 | TLE | |
p03180 | C++ | Time Limit Exceeded | #define taskname ""
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define long long long
const int N = 16 + 10;
const int MOD = 1e9 + 7;
int n, a[N][N], mark[1 << N];
long dp[1 << N];
inline int bit(int i, int mask) { return (mask >> i) & 1; }
void cre_dp() {
for (int mask = 1; ... | #define taskname ""
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define long long long
const int N = 16 + 10;
const int MOD = 1e9 + 7;
int n, a[N][N], mark[1 << N];
long dp[1 << N];
inline int bit(int i, int mask) { return (mask >> i) & 1; }
void cre_dp() {
for (int mask = 1; ... | replace | 29 | 43 | 29 | 31 | TLE | |
p03180 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define int long long
#define rep(i, n) for (i = 0; i < n; i++)
using namespace std;
void chmax(int &a, ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define int long long
#define rep(i, n) for (i = 0; i < n; i++)
using namespace std;
void chmax(int &a, ... | insert | 56 | 56 | 56 | 58 | TLE | |
p03180 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long solve() {
int n;
cin >> n;
long long A[n][n];
long long dp[(1 << n)];
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
cin >> A[i][j];
for (int i = 1; i < 1 << 16; i++) {
dp[i] = 0;
for (int j = 0; j < n; j++) {
if (i & (... | #include <bits/stdc++.h>
using namespace std;
long long solve() {
int n;
cin >> n;
long long A[n][n];
long long dp[(1 << n)];
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
cin >> A[i][j];
dp[0] = 0;
for (int i = 1; i < 1 << n; i++) {
dp[i] = 0;
for (int j = 0; j < n; j++) {
... | replace | 10 | 11 | 10 | 12 | TLE | |
p03181 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define debug(v) \
cout << #v << ":"; \
for (auto x : v) { ... | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define debug(v) \
cout << #v << ":"; \
for (auto x : v) { ... | insert | 76 | 76 | 76 | 80 | 0 | |
p03181 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define INFLL 2000000000000000000... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define INFLL 2000000000000000000... | replace | 44 | 45 | 44 | 45 | 0 | |
p03181 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const long long INF = 1e18;
const int MaxN = 1e5;
int n, mod;
vector<int> v[MaxN];
int dp[MaxN];
vector<int> pref[MaxN], suf[MaxN];
int ans[MaxN];
int pDP[MaxN];
void add(int &x, int y) {
x += y;
if (x >= MOD)
x -= MOD;
}
void prod(in... | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const long long INF = 1e18;
const int MaxN = 1e5 + 15;
int n, mod;
vector<int> v[MaxN];
int dp[MaxN];
vector<int> pref[MaxN], suf[MaxN];
int ans[MaxN];
int pDP[MaxN];
void add(int &x, int y) {
x += y;
if (x >= MOD)
x -= MOD;
}
void pr... | replace | 6 | 7 | 6 | 7 | 0 | |
p03181 | C++ | Runtime Error | // https://atcoder.jp/contests/dp/tasks/dp_v
// V - Subtree
#include <algorithm>
#include <cassert>
#include <iostream>
#include <vector>
#include <stdio.h>
using namespace std;
vector<vector<int>> adj;
vector<vector<int>> adj_count;
vector<long long> ans;
vector<bool> visited;
int M;
long long dfs1(int u) {
//... | // https://atcoder.jp/contests/dp/tasks/dp_v
// V - Subtree
#include <algorithm>
#include <cassert>
#include <iostream>
#include <vector>
#include <stdio.h>
using namespace std;
vector<vector<int>> adj;
vector<vector<int>> adj_count;
vector<long long> ans;
vector<bool> visited;
int M;
long long dfs1(int u) {
//... | replace | 64 | 65 | 64 | 65 | 0 | |
p03181 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
const int NNODES = 1e5 + 6;
vector<int> v[NNODES];
int fatherOf[NNODES];
ll down[NNODES];
ll up[NNODES];
ll prefix[NNODES], ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
const int NNODES = 1e5 + 6;
vector<int> v[NNODES];
int fatherOf[NNODES];
ll down[NNODES];
ll up[NNODES];
ll prefix[NNODES], ... | replace | 66 | 67 | 66 | 67 | 0 | |
p03181 | C++ | Runtime Error | #include <bits/stdc++.h>
#define M_PI 3.14159265358979323846 // pi
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> VI;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
#define rep(a, n) for (ll ... | #include <bits/stdc++.h>
#define M_PI 3.14159265358979323846 // pi
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> VI;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
#define rep(a, n) for (ll ... | insert | 105 | 105 | 105 | 107 | 0 | |
p03181 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
ll n, mod;
const int nax = 1e5 + 5;
ll down[nax];
vector<vector<int>> v(nax);
ll up[nax];
int vis[nax] = {0};
ll ans[nax];
void dfs2(int ci) {
vis[ci] = 1;
ll g = up[ci];
for (auto x : v[ci]) {
if (vis[x] == 1)
con... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
ll n, mod;
const int nax = 1e5 + 5;
ll down[nax];
vector<vector<int>> v(nax);
ll up[nax];
int vis[nax] = {0};
ll ans[nax];
void dfs2(int ci) {
vis[ci] = 1;
ll g = up[ci];
for (auto x : v[ci]) {
if (vis[x] == 1)
con... | replace | 67 | 71 | 67 | 73 | -8 | |
p03181 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int n, m;
int a, b;
vector<int> v[100005];
int dp[100005];
int out[100005];
void dfs(int node, int prev) {
dp[node] = 1;
for (auto it : v[node]) {
if (it != prev) {
dfs(it, node);
dp[node] = 1LL * dp[node] * (dp[it] + 1) % m;
}
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int n, m;
int a, b;
vector<int> v[100005];
int dp[100005];
int out[100005];
void dfs(int node, int prev) {
dp[node] = 1;
for (auto it : v[node]) {
if (it != prev) {
dfs(it, node);
dp[node] = 1LL * dp[node] * (dp[it] + 1) % m;
}
... | replace | 18 | 21 | 18 | 22 | 0 | |
p03181 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned int uint;
typedef unsigned char uchar;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned int uint;
typedef unsigned char uchar;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
#define REP(i, x) for (int i = 0; i < (int)(x); i++)
#define REPS(i, x) for (int ... | insert | 185 | 185 | 185 | 189 | TLE | |
p03181 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// #define P pair<ll,ll>
#define FOR(I, A, B) for (ll I = ll(A); I < ll(B); ++I)
#define FORR(I, A, B) for (ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x, t, f) ((x) ? (t) : (f))
#define SORT(x) (sort(x.begin(), x.end())) // 0 2 2 3 4 5 8 9
#define P... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// #define P pair<ll,ll>
#define FOR(I, A, B) for (ll I = ll(A); I < ll(B); ++I)
#define FORR(I, A, B) for (ll I = ll((B)-1); I >= ll(A); --I)
#define TO(x, t, f) ((x) ? (t) : (f))
#define SORT(x) (sort(x.begin(), x.end())) // 0 2 2 3 4 5 8 9
#define P... | insert | 123 | 123 | 123 | 128 | 0 | |
p03181 | 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 maxs(x, y) (x = ma... | #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 maxs(x, y) (x = ma... | insert | 200 | 200 | 200 | 204 | 0 | |
p03181 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define f first
#define s second
#define pb push_back
ll mod;
long long binpow(long long a, long long b, long long m = mod) {
a %= m;
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a % m;
a = a * a % m;
b >>= 1;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define f first
#define s second
#define pb push_back
ll mod;
long long binpow(long long a, long long b, long long m = mod) {
a %= m;
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a % m;
a = a * a % m;
b >>= 1;
... | delete | 86 | 90 | 86 | 86 | -11 | |
p03181 | C++ | Runtime Error | /*********************
* Author: xuziyuan *
*********************/
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
#define LL long long
#define pii pair<int, int>
#define fi first
#define se second
#define pb push_back
#define mpr make_pair
u... | /*********************
* Author: xuziyuan *
*********************/
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
#define LL long long
#define pii pair<int, int>
#define fi first
#define se second
#define pb push_back
#define mpr make_pair
u... | replace | 33 | 35 | 33 | 35 | 0 | |
p03181 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#pragma region Macros
#define ll long long
#define ld long double
#define FOR(i, l, r) for (int i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FOR(i, 1, n + 1)
#define RFOR(i, l, r) for (int i = (l); i >= (r); --i)
#define RREP(i, n) RFOR(i, n - 1,... | #include <bits/stdc++.h>
using namespace std;
#pragma region Macros
#define ll long long
#define ld long double
#define FOR(i, l, r) for (int i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FOR(i, 1, n + 1)
#define RFOR(i, l, r) for (int i = (l); i >= (r); --i)
#define RREP(i, n) RFOR(i, n - 1,... | insert | 218 | 218 | 218 | 219 | -11 | |
p03181 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n, m;
int cnt = 0, head[100005], to[100005], nxt[100005];
ll f[100005], ans[100005];
ll p[100005], a[100005], b[100005], dp[100005];
void add(int x, int y) {
to[++cnt] = y;
nxt[cnt] = head[x];
head[x] = cnt;
}
void dfs(int x, int par = -1) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int n, m;
int cnt = 0, head[200005], to[200005], nxt[200005];
ll f[200005], ans[200005];
ll p[200005], a[200005], b[200005], dp[200005];
void add(int x, int y) {
to[++cnt] = y;
nxt[cnt] = head[x];
head[x] = cnt;
}
void dfs(int x, int par = -1) {
... | replace | 4 | 7 | 4 | 7 | 0 | |
p03181 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep2(i, a, b) for (ll i = (a); i < (b); ++i)
#define debug(x) cout << #x << '=' << x << endl
#define all(v) (v).begin(), (v).end()
const ll MOD... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep2(i, a, b) for (ll i = (a); i < (b); ++i)
#define debug(x) cout << #x << '=' << x << endl
#define all(v) (v).begin(), (v).end()
const ll MOD... | replace | 50 | 51 | 50 | 51 | 0 | |
p03181 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb(x) emplace_back(x)
#define forn(i, N) for (int i = 0; i < N; i++)
#define rep(i, x, N) for (int i = x; i <= N; i++)
#define revrep(i, x, N) for (int i = x; i >= N; i--)
#define ar array
using namespace std;
usin... | #include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb(x) emplace_back(x)
#define forn(i, N) for (int i = 0; i < N; i++)
#define rep(i, x, N) for (int i = x; i <= N; i++)
#define revrep(i, x, N) for (int i = x; i >= N; i--)
#define ar array
using namespace std;
usin... | delete | 71 | 74 | 71 | 71 | TLE | |
p03181 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<long>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvb = vector<vector<bool>>;
using vvc = vector<vector<char>>;
using vvl = vector<vector<long>>;
using pii = pair<int, int>;
using pil ... | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<long>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvb = vector<vector<bool>>;
using vvc = vector<vector<char>>;
using vvl = vector<vector<long>>;
using pii = pair<int, int>;
using pil ... | replace | 55 | 56 | 55 | 56 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 99) >= this->size() (which is 1)
|
p03181 | C++ | Runtime Error | #include <bits/stdc++.h>
#define all(cont) cont.begin(), cont.end()
#define pb push_back
#define fi first
#define se second
#define DEBUG(x) cerr << (#x) << ": " << (x) << '\n'
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef long long ll;
typedef unsigned long long ull;
template <cla... | #include <bits/stdc++.h>
#define all(cont) cont.begin(), cont.end()
#define pb push_back
#define fi first
#define se second
#define DEBUG(x) cerr << (#x) << ": " << (x) << '\n'
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef long long ll;
typedef unsigned long long ull;
template <cla... | replace | 65 | 66 | 65 | 66 | 0 | |
p03181 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define ll long long
#define pq priority_queue
#define mp make_pair
#define pii pair<int, int>
#define mod 998244353
int lowbit(int x) { return x & (-x); }
int n, m;
vector<int> edge[100010];
int ans[100010];
int ANS... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define ll long long
#define pq priority_queue
#define mp make_pair
#define pii pair<int, int>
#define mod 998244353
int lowbit(int x) { return x & (-x); }
int n, m;
vector<int> edge[100010];
int ans[100010];
int ANS... | replace | 39 | 40 | 39 | 41 | 0 | |
p03181 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> G(n), x(n);
vector<int> dp(n, 1), par(n);
for (int i = 0; i < n - 1; i++) {
int u, v;
cin >> u >> v;
u--;
v--;
G[u].push_back(v);
G[v].push_back(u);
}
function<void(int, int)> d... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> G(n), x(n);
vector<int> dp(n, 1), par(n);
for (int i = 0; i < n - 1; i++) {
int u, v;
cin >> u >> v;
u--;
v--;
G[u].push_back(v);
G[v].push_back(u);
}
function<void(int, int)> d... | replace | 37 | 38 | 37 | 38 | 0 | |
p03181 | C++ | Runtime Error | //~ while (clock()<=69*CLOCKS_PER_SEC)
//~ #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
//~ #pragma GCC target ("avx2")
//~ #pragma GCC optimize("Ofast")
//~ #pragma GCC
//target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") ~ #pragma
//GCC optimize("unroll-loops")
#include <bits/... | //~ while (clock()<=69*CLOCKS_PER_SEC)
//~ #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
//~ #pragma GCC target ("avx2")
//~ #pragma GCC optimize("Ofast")
//~ #pragma GCC
//target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") ~ #pragma
//GCC optimize("unroll-loops")
#include <bits/... | replace | 61 | 62 | 61 | 62 | 0 | |
p03181 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> ii;
const int len = 1e5 + 5;
int n, m;
int par[len];
vector<ii> adj[len];
vector<int> dp[len], pref[len], suf[len];
int add(int a, int b) { return (a... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> ii;
const int len = 1e5 + 5;
int n, m;
int par[len];
vector<ii> adj[len];
vector<int> dp[len], pref[len], suf[len];
int add(int a, int b) { return (a... | replace | 71 | 72 | 71 | 72 | 0 | |
p03181 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <ext/pb_ds/tree_policy.hpp>
// #include <ext/pb_ds/assoc_container.hpp>
#include <chrono>
using namespace std;
using namespace std::chrono;
// using namespace __gnu_pbds;
#define fastio \
ios_base::sync_with_stdio(0);... | #include <bits/stdc++.h>
// #include <ext/pb_ds/tree_policy.hpp>
// #include <ext/pb_ds/assoc_container.hpp>
#include <chrono>
using namespace std;
using namespace std::chrono;
// using namespace __gnu_pbds;
#define fastio \
ios_base::sync_with_stdio(0);... | insert | 101 | 101 | 101 | 105 | -11 | |
p03181 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define int long long
// int MOD = 1000000007;
int N, M;
vector<vector<int>> g;
vector<vector<int>> dp;
vector<vector<in... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define int long long
// int MOD = 1000000007;
int N, M;
vector<vector<int>> g;
vector<vector<int>> dp;
vector<vector<in... | replace | 36 | 37 | 36 | 37 | TLE | |
p03182 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include ... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include ... | replace | 156 | 157 | 156 | 157 | 0 | |
p03182 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct LazySeg {
using T = ll;
static T op(const T &a, const T &b) { return max(a, b); }
static constexpr T e() { return -1e14; }
using U = ll;
static void ap(const U &f, T &a) { a += f; }
static void cp(const U &g, U &f) { f += g; }
st... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct LazySeg {
using T = ll;
static T op(const T &a, const T &b) { return max(a, b); }
static constexpr T e() { return -1e14; }
using U = ll;
static void ap(const U &f, T &a) { a += f; }
static void cp(const U &g, U &f) { f += g; }
st... | replace | 85 | 86 | 85 | 86 | 0 | |
p03182 | C++ | Runtime Error | #include <bits/stdc++.h>
int N;
int M;
struct segtree {
int n;
long long v[500000];
long long lazy[500000];
segtree(int n_) {
n = 1;
while (n < n_)
n *= 2;
for (int i = 0; i < 2 * n - 1; ++i) {
v[i] = 0;
lazy[i] = 0;
}
}
long long query(int a, int b, long long add) {
... | #include <bits/stdc++.h>
int N;
int M;
struct segtree {
int n;
long long v[1000000];
long long lazy[1000000];
segtree(int n_) {
n = 1;
while (n < n_)
n *= 2;
for (int i = 0; i < 2 * n - 1; ++i) {
v[i] = 0;
lazy[i] = 0;
}
}
long long query(int a, int b, long long add) {... | replace | 8 | 10 | 8 | 10 | 0 | |
p03182 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mx = 2e5;
vector<ll> lazy(2 * mx + 100);
vector<ll> segtree(2 * mx + 100);
void push(int k, int l, int r) {
if (l != r) {
lazy[2 * k] += lazy[k];
lazy[2 * k + 1] += lazy[k];
}
segtree[k] += lazy[k];
lazy[k] = 0;
}
void pull(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mx = 2e5;
vector<ll> lazy(3 * mx + 5);
vector<ll> segtree(3 * mx + 5);
void push(int k, int l, int r) {
if (l != r) {
lazy[2 * k] += lazy[k];
lazy[2 * k + 1] += lazy[k];
}
segtree[k] += lazy[k];
lazy[k] = 0;
}
void pull(int ... | replace | 4 | 6 | 4 | 6 | 0 | |
p03182 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mx = 2e5;
vector<ll> lazy(2 * mx + 5);
vector<ll> segtree(2 * mx + 5);
void push(int k, int l, int r) {
if (l != r) {
lazy[2 * k] += lazy[k];
lazy[2 * k + 1] += lazy[k];
}
segtree[k] += lazy[k];
lazy[k] = 0;
}
void pull(int ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mx = 2e5;
vector<ll> lazy(4 * mx + 5);
vector<ll> segtree(4 * mx + 5);
void push(int k, int l, int r) {
if (l != r) {
lazy[2 * k] += lazy[k];
lazy[2 * k + 1] += lazy[k];
}
segtree[k] += lazy[k];
lazy[k] = 0;
}
void pull(int ... | replace | 4 | 6 | 4 | 6 | 0 | |
p03182 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define fi first
#define se second
#define maxn 2000003
#define pb push_back
using namespace std;
typedef long long LL;
typedef pair<int, int> pi;
int n, m;
LL total;
LL tree[4 * maxn];
LL lazy[4 * maxn];
vector<pi> v[maxn];
void proc(int tx, int ty, int id) {
if (lazy[id]) {
tree[id] +... | #include <bits/stdc++.h>
#define fi first
#define se second
#define maxn 2000003
#define pb push_back
using namespace std;
typedef long long LL;
typedef pair<int, int> pi;
int n, m;
LL total;
LL tree[4 * maxn];
LL lazy[4 * maxn];
vector<pi> v[maxn];
void proc(int tx, int ty, int id) {
if (lazy[id]) {
tree[id] +... | replace | 42 | 43 | 42 | 43 | TLE | |
p03182 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fir first
#define sec second
#define MAX_N 100000
#define mid ((s + t) >> 1)
using namespace std;
typedef long long lnt;
typedef pair<int, int> pii;
template <class T> inline void read(T &x) {
x = 0;
int c = getchar(), f = 1;
for (; !isdigit(c); c = getchar())
if (c == 45)
... | #include <bits/stdc++.h>
#define fir first
#define sec second
#define MAX_N 200000
#define mid ((s + t) >> 1)
using namespace std;
typedef long long lnt;
typedef pair<int, int> pii;
template <class T> inline void read(T &x) {
x = 0;
int c = getchar(), f = 1;
for (; !isdigit(c); c = getchar())
if (c == 45)
... | replace | 3 | 4 | 3 | 4 | 0 | |
p03182 | C++ | Time Limit Exceeded | #pragma region Macros
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define rep2(i, a, b) for (ll i = a; i <= b; ++i)
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep3(i, a, b) for (ll i = a; i >= b; i--)
#define pii pair<int, int>
#define pll pair<ll, ll>
#defi... | #pragma region Macros
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define rep2(i, a, b) for (ll i = a; i <= b; ++i)
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep3(i, a, b) for (ll i = a; i >= b; i--)
#define pii pair<int, int>
#define pll pair<ll, ll>
#defi... | delete | 263 | 264 | 263 | 263 | TLE | |
p03182 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define int long long
#define ar array<int, 2>
#define inf 1000000000000000000
int mod = 1e9 + 7;
int min(int a, int b) { return (a < b) ? a : b; }
int max(int a, int b) { return (a > b) ? a : b; }
int fp(int a, int b) {
if (b == 0)
return 1;
int x... | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define int long long
#define ar array<int, 2>
#define inf 1000000000000000000
int mod = 1e9 + 7;
int min(int a, int b) { return (a < b) ? a : b; }
int max(int a, int b) { return (a > b) ? a : b; }
int fp(int a, int b) {
if (b == 0)
return 1;
int x... | replace | 19 | 20 | 19 | 20 | 0 | |
p03182 | C++ | Time Limit Exceeded | // #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize(3)
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #pragma GCC target("sse3","sse2","sse")
// #pragma GCC target("avx","sse4","sse4.1","sse4.2","ssse3")
// #pragma GCC target("f16c... | // #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize(3)
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #pragma GCC target("sse3","sse2","sse")
// #pragma GCC target("avx","sse4","sse4.1","sse4.2","ssse3")
// #pragma GCC target("f16c... | delete | 312 | 314 | 312 | 312 | TLE | |
p03182 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
std::pair<int, int> DR[] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1},
{-1, 1}, {-1, -1}, {1, 1}, {1, -1}};
#define ll long long
#define clock (clock() * 1000.0 / CLOCK... | #pragma GCC optimize("Ofast")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
std::pair<int, int> DR[] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1},
{-1, 1}, {-1, -1}, {1, 1}, {1, -1}};
#define ll long long
#define clock (clock() * 1000.0 / CLOCKS_PER_SEC)
#define rc(s) return cou... | delete | 1 | 2 | 1 | 1 | 0 | |
p03182 | C++ | Runtime Error | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define ll long long
#define N 100010
using namespace std;
struct query {
ll l, r, v;
} a[N];
ll n, m, cnt, t[N << 2], lt[N << 2];
bool cmp(query a, query b) { return a.r < b.r; }
void push(int x) {
t[x << 1] += lt[x];
lt[x << 1] += ... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define ll long long
#define N 200010
using namespace std;
struct query {
ll l, r, v;
} a[N];
ll n, m, cnt, t[N << 2], lt[N << 2];
bool cmp(query a, query b) { return a.r < b.r; }
void push(int x) {
t[x << 1] += lt[x];
lt[x << 1] += ... | replace | 3 | 4 | 3 | 4 | 0 | |
p03182 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using P = pair<ll, ll>;
const ll INF = 5e15;
const ll MOD = 1e9 + 7;
/*
* This LazySegmentTree is tree for query "ADD".
* If you want to change query, you have to change the function "eval".
* Too show where you have to change, I wrote the comment "!... | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using P = pair<ll, ll>;
const ll INF = 5e15;
const ll MOD = 1e9 + 7;
/*
* This LazySegmentTree is tree for query "ADD".
* If you want to change query, you have to change the function "eval".
* Too show where you have to change, I wrote the comment "!... | replace | 175 | 176 | 175 | 176 | 0 | |
p03182 | C++ | Runtime Error | #include "algorithm"
#include "cstdio"
#include "iostream"
#define LC (x << 1)
#define RC (x << 1 | 1)
using namespace std;
const int maxm = 2e5 + 10;
const long long Inf = 1ll << 50;
int N, M;
struct Segment_Tree {
int Left;
int Right;
long long Max;
long long Lazy;
#define Left(x) Tree[x].Left
#define Rig... | #include "algorithm"
#include "cstdio"
#include "iostream"
#define LC (x << 1)
#define RC (x << 1 | 1)
using namespace std;
const int maxm = 2e5 + 10;
const long long Inf = 1ll << 50;
int N, M;
struct Segment_Tree {
int Left;
int Right;
long long Max;
long long Lazy;
#define Left(x) Tree[x].Left
#define Rig... | replace | 22 | 23 | 22 | 23 | 0 | |
p03182 | C++ | Runtime Error | // in the name of Allah
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define ll long long
#define double long double
#define sz(x) ((int)(x.size()))
#define fr first
#define se second
#define inf 1e18
#define max_n 200002
#define mod 1000000007
ll add(ll a, ll b) {
a += b;... | // in the name of Allah
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define ll long long
#define double long double
#define sz(x) ((int)(x.size()))
#define fr first
#define se second
#define inf 1e18
#define max_n 200002
#define mod 1000000007
ll add(ll a, ll b) {
a += b;... | replace | 72 | 74 | 72 | 74 | -11 | |
p03182 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define oo 666666666
vector<array<ll, 2>> A[200005];
ll seg[400005][2];
void lazy(int c, int l, int r) {
seg[c][0] += seg[c][1];
if (l != r) {
seg[2 * c][1] += seg[c][1];
seg[2 * c + 1][1] += seg[c][1];
}
seg[c][... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define oo 666666666
vector<array<ll, 2>> A[200005];
ll seg[800005][2];
void lazy(int c, int l, int r) {
seg[c][0] += seg[c][1];
if (l != r) {
seg[2 * c][1] += seg[c][1];
seg[2 * c + 1][1] += seg[c][1];
}
seg[c][... | replace | 7 | 8 | 7 | 8 | 0 | |
p03182 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
using PII = pair<int, int>;
using ll = long long;
using DBL = double;
using VI = vector<int>;
using VD = vector<DBL>;
using VVI = vector<VI>;
using VVD = vector<VD>;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, n) FOR(i, 0, n)
#de... | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
using PII = pair<int, int>;
using ll = long long;
using DBL = double;
using VI = vector<int>;
using VD = vector<DBL>;
using VVI = vector<VI>;
using VVD = vector<VD>;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, n) FOR(i, 0, n)
#de... | replace | 68 | 69 | 68 | 69 | 0 | |
p03182 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct P {
int l;
ll a;
};
ll L[200000], ans;
vector<P> R[200000];
const ll LINF = 1e18;
// BEGIN CUT HERE
template <typename T, typename E> struct SegmentTree {
using F = function<T(T, T)>;
using G = function<T(T, E)>;
using H = function<E... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
struct P {
int l;
ll a;
};
ll L[200001], ans;
vector<P> R[200001];
const ll LINF = 1e18;
// BEGIN CUT HERE
template <typename T, typename E> struct SegmentTree {
using F = function<T(T, T)>;
using G = function<T(T, E)>;
using H = function<E... | replace | 8 | 10 | 8 | 10 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.