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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02326 | C++ | Runtime Error | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
template <class T> using Table = vector<vector<T>>;
const ld eps = 1e-9;
// < "D:\D_Download\Visual Studio
// 2015\Projects\programing_contest_c++\Debug\a.txt" > "D:\D... | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
template <class T> using Table = vector<vector<T>>;
const ld eps = 1e-9;
// < "D:\D_Download\Visual Studio
// 2015\Projects\programing_contest_c++\Debug\a.txt" > "D:\D... | replace | 109 | 110 | 109 | 110 | -11 | |
p02326 | C++ | Runtime Error | #include <iostream>
#define HMAX 140
#define WMAX 140
using namespace std;
int main() {
int H, W, ms = 0;
int dp[HMAX + 10][WMAX + 10] = {};
cin >> H >> W;
for (int i = 1; i < H + 1; ++i) {
for (int j = 1; j < W + 1; ++j) {
cin >> dp[i][j];
if (dp[i][j] == 0) {
dp[i][j] = 1;
} else... | #include <iostream>
#define HMAX 1400
#define WMAX 1400
using namespace std;
int main() {
int H, W, ms = 0;
int dp[HMAX + 10][WMAX + 10] = {};
cin >> H >> W;
for (int i = 1; i < H + 1; ++i) {
for (int j = 1; j < W + 1; ++j) {
cin >> dp[i][j];
if (dp[i][j] == 0) {
dp[i][j] = 1;
} el... | replace | 1 | 3 | 1 | 3 | 0 | |
p02326 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define mo 1005
int a[mo][mo], dp[mo][mo];
int n, m;
int main() {
while (cin >> n >> m) {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin >> a[i][j];
}
}
int maxs = 0;
for (int i = 1; i <= n; i++) {
for (int j = ... | #include <bits/stdc++.h>
using namespace std;
#define mo 1505
int a[mo][mo], dp[mo][mo];
int n, m;
int main() {
while (cin >> n >> m) {
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
cin >> a[i][j];
}
}
int maxs = 0;
for (int i = 1; i <= n; i++) {
for (int j = ... | replace | 2 | 3 | 2 | 3 | 0 | |
p02326 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
using namespace std;
int tate[1005][1005] = {};
int yoko[1005][1005] = {};
int dp[1005][1005] = {};
int c[1005][1005];
int main() {
int h, w;
scanf("%d %d", &h, &w);
for (int i = 1; i <= h; i++) {
for (int j = 1; j <= w; j++)
scanf("%d", &c[i][j]);
}
int ans = ... | #include <algorithm>
#include <cstdio>
using namespace std;
int tate[1405][1405] = {};
int yoko[1405][1405] = {};
int dp[1405][1405] = {};
int c[1405][1405];
int main() {
int h, w;
scanf("%d %d", &h, &w);
for (int i = 1; i <= h; i++) {
for (int j = 1; j <= w; j++)
scanf("%d", &c[i][j]);
}
int ans = ... | replace | 3 | 7 | 3 | 7 | 0 | |
p02326 | C++ | Runtime Error | #include <algorithm>
#include <stdio.h>
using namespace std;
const int MAX = 140;
int main() {
int H, W;
int tile[MAX][MAX];
int ans = 0;
scanf("%d%d", &H, &W);
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
scanf("%d", &tile[i][j]);
}
}
for (int y = 0; y < H; y++) {
for... | #include <algorithm>
#include <stdio.h>
using namespace std;
const int MAX = 1400;
int main() {
int H, W;
int tile[MAX][MAX];
int ans = 0;
scanf("%d%d", &H, &W);
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
scanf("%d", &tile[i][j]);
}
}
for (int y = 0; y < H; y++) {
fo... | replace | 4 | 5 | 4 | 5 | 0 | |
p02327 | C++ | Runtime Error | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
template <class T> using Table = vector<vector<T>>;
const ld eps = 1e-9;
// < "D:\D_Download\Visual Studio
// 2015\Projects\programing_contest_c++\Debug\a.txt" > "D:\D... | #include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>
#pragma warning(disable : 4996)
using namespace std;
using ld = long double;
template <class T> using Table = vector<vector<T>>;
const ld eps = 1e-9;
// < "D:\D_Download\Visual Studio
// 2015\Projects\programing_contest_c++\Debug\a.txt" > "D:\D... | replace | 100 | 101 | 100 | 101 | -11 | |
p02327 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// #define int long long
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned __int128 HASH;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll, int> plli;
typedef pair<double, int> pdbi;
typedef pair<int... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned __int128 HASH;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pullull;
typedef pair<ll, int> plli;
typedef pair<double, int> pdbi;
typedef pair<int... | replace | 39 | 40 | 39 | 40 | 0 | |
p02327 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w;
char c;
int mp[1010][1010] = {0};
int ans = 0;
cin >> h >> w;
for (int i = 1; i <= h; i++) {
for (int j = 1; j <= w; j++) {
scanf(" %c", &c);
if (c == '1')
mp[i][j] = 0;
if (c == '0')
mp[i][j] = mp[i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w;
char c;
int mp[1410][1410] = {0};
int ans = 0;
cin >> h >> w;
for (int i = 1; i <= h; i++) {
for (int j = 1; j <= w; j++) {
scanf(" %c", &c);
if (c == '1')
mp[i][j] = 0;
if (c == '0')
mp[i][j] = mp[i... | replace | 6 | 7 | 6 | 7 | 0 | |
p02327 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
#define MAX_N 2000
int x[MAX_N][MAX_N];
int H, W;
int main() {
cin >> H >> W;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cin >> x[i][j];
}
if (x[i][0] == 1) {
x[i][0] = 0;
} else {
x[i][0] = 1;
}
... | #include <algorithm>
#include <iostream>
using namespace std;
#define MAX_N 2000
int x[MAX_N][MAX_N];
int H, W;
int main() {
cin >> H >> W;
for (int i = 0; i < H; i++) {
for (int j = 0; j < W; j++) {
cin >> x[i][j];
}
if (x[i][0] == 1) {
x[i][0] = 0;
} else {
x[i][0] = 1;
}
... | replace | 35 | 36 | 35 | 36 | TLE | |
p02328 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long int
#define MOD(x) ((x % MOD_N) + MOD_N) % MOD_N
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORE(i, a, b) for (int i = (a); i <= (b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define RFORE(i, a, b) for (int i = (b); i >= (a); --i)
#de... | #include <bits/stdc++.h>
#define int long long int
#define MOD(x) ((x % MOD_N) + MOD_N) % MOD_N
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORE(i, a, b) for (int i = (a); i <= (b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define RFORE(i, a, b) for (int i = (b); i >= (a); --i)
#de... | replace | 106 | 107 | 106 | 110 | -11 | |
p02329 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long int
#define MOD(x) ((x % MOD_N) + MOD_N) % MOD_N
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORE(i, a, b) for (int i = (a); i <= (b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define RFORE(i, a, b) for (int i = (b); i >= (a); --i)
#de... | #include <bits/stdc++.h>
#define int long long int
#define MOD(x) ((x % MOD_N) + MOD_N) % MOD_N
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORE(i, a, b) for (int i = (a); i <= (b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define RFORE(i, a, b) for (int i = (b); i >= (a); --i)
#de... | replace | 117 | 118 | 117 | 118 | 0 | ans = 9
|
p02330 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int N, K;
ll L, R;
ll a[41];
ll bitsum(int b, int offset) {
ll s = 0;
for (int i = 1; b > 0; b >>= 1, i += 1) {
if (b & 1) {
s += a[offset + i];
}
}
return s;
}
ll solve() {
int M = N / 2;
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int N, K;
ll L, R;
ll a[41];
ll bitsum(int b, int offset) {
ll s = 0;
for (int i = 1; b > 0; b >>= 1, i += 1) {
if (b & 1) {
s += a[offset + i];
}
}
return s;
}
ll solve() {
int M = N / 2;
... | replace | 36 | 37 | 36 | 37 | -11 | |
p02335 | C++ | Runtime Error | #include <iostream>
#include <stack>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7; // 1e9+9
ll add(ll x, ll y) { return (x + y) % mod; }
ll mul(ll x, ll y) { return (x * y) % mod; }
ll mpow(ll x, ll y) {
ll v = 1;
for (; y; x = mul(x, x), y >>= 1)
if (y & 1)
v = mul(v, x);
return v;
}
... | #include <iostream>
#include <stack>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7; // 1e9+9
ll add(ll x, ll y) { return (x + y) % mod; }
ll mul(ll x, ll y) { return (x * y) % mod; }
ll mpow(ll x, ll y) {
ll v = 1;
for (; y; x = mul(x, x), y >>= 1)
if (y & 1)
v = mul(v, x);
return v;
}
... | insert | 21 | 21 | 21 | 23 | -11 | |
p02336 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <chrono>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <thread>
#include <utilit... | #include <algorithm>
#include <cassert>
#include <chrono>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <thread>
#include <utilit... | insert | 52 | 52 | 52 | 56 | 0 | |
p02343 | C++ | Runtime Error | #include <bits/stdc++.h>
#ifndef LOCAL_
#define fprintf \
if (false) \
fprintf
#endif // LOCAL_
#define dump() fprintf(stderr, "#%s.%d\n", __func__, __LINE__);
#define dumpl(x1) ... | #include <bits/stdc++.h>
#ifndef LOCAL_
#define fprintf \
if (false) \
fprintf
#endif // LOCAL_
#define dump() fprintf(stderr, "#%s.%d\n", __func__, __LINE__);
#define dumpl(x1) ... | insert | 53 | 53 | 53 | 55 | 0 | |
p02343 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <vector>
using namespace std;
const int num = 5000;
vector<int> v[num];
int cnt = -1;
inline void merge(int a, int b) {
int m = -1, n = -1;
for (int i = 0; i <= cnt; i++) {
for (int j = 0; j < v[i].size(); j++) {
if (m ... | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <vector>
using namespace std;
const int num = 5000;
vector<int> v[num];
int cnt = -1;
inline void merge(int a, int b) {
int m = -1, n = -1;
for (int i = 0; i <= cnt; i++) {
for (int j = 0; j < v[i].size(); j++) {
if (m ... | replace | 25 | 27 | 25 | 27 | -6 | double free or corruption (out)
|
p02343 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
struct edge {
int dest;
int weight; // = dest minus curr
};
class UF {
public:
vector<edge> v;
UF(int n) { v = vector<edge>(n, {-1, 0}); }
void unite(int x, int y, int y_minus_x) {
int loc_x = find(x);
int loc_y = find(y);
if (v[loc_x].... | #include <iostream>
#include <vector>
using namespace std;
struct edge {
int dest;
int weight; // = dest minus curr
};
class UF {
public:
vector<edge> v;
UF(int n) { v = vector<edge>(n, {-1, 0}); }
void unite(int x, int y, int y_minus_x) {
int loc_x = find(x);
int loc_y = find(y);
if (loc_x == ... | insert | 17 | 17 | 17 | 19 | TLE | |
p02343 | C++ | Runtime Error | // Created by Vignesh Manoharan
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int... | // Created by Vignesh Manoharan
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int... | replace | 51 | 52 | 51 | 52 | 0 | |
p02343 | C++ | Runtime Error | #include <cstdio>
#include <vector>
typedef struct node {
int number;
node *parent;
} node;
node *root;
node *find(node *x) {
if (x->parent == root)
return x;
else {
x->parent = find(x->parent);
return x->parent;
}
}
int main(void) {
int n, q;
scanf("%d %d", &n, &q);
std::vector<node> n... | #include <cstdio>
#include <vector>
typedef struct node {
int number;
node *parent;
} node;
node *root;
node *find(node *x) {
if (x->parent == root)
return x;
else {
x->parent = find(x->parent);
return x->parent;
}
}
int main(void) {
int n, q;
scanf("%d %d", &n, &q);
std::vector<node> n... | replace | 37 | 38 | 37 | 38 | 0 | |
p02343 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
struct UF {
vector<int> a;
vector<int> size;
UF(int n) {
a.assign(n, 0);
size.assign(n, 1);
for (int i = 0; i < n; i++) {
a[i] = i;
}
}
int root(int u) {
int parent = u;
while (a[parent] != parent) {
parent = a[... | #include <iostream>
#include <vector>
using namespace std;
struct UF {
vector<int> a;
vector<int> size;
UF(int n) {
a.assign(n, 0);
size.assign(n, 1);
for (int i = 0; i < n; i++) {
a[i] = i;
}
}
int root(int u) {
int parent = u;
while (a[parent] != parent) {
parent = a[... | replace | 20 | 21 | 20 | 21 | TLE | |
p02343 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
using namespace std;
struct union_find_tree {
vector<ll> par;
union_find_tree(ll n) {
par.resize(n);
for (ll i = 0; i < n; i++) {
par[i] = i;
}
}
ll find(ll a) {
if (par[a] == a)
return a;
return par[a] = find(par[a]);
}
void... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
struct union_find_tree {
vector<ll> par;
union_find_tree(ll n) {
par.resize(n);
for (ll i = 0; i < n; i++) {
par[i] = i;
}
}
ll find(ll a) {
if (par[a] == a)
return a;
return par[a] = find(par[a]);
}
void... | replace | 21 | 22 | 21 | 22 | 0 | |
p02343 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <cstdio>
#include <functional>
#include <iostream>
#include <list>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define _USE_MATH_DEFINES
#include <map>
#include <math.h>
#define SENTINEL 1... | #include <algorithm>
#include <array>
#include <cstdio>
#include <functional>
#include <iostream>
#include <list>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define _USE_MATH_DEFINES
#include <map>
#include <math.h>
#define SENTINEL 1... | replace | 49 | 51 | 49 | 51 | 0 | |
p02343 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define INT_MAX 2147483647
#de... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define INT_MAX 2147483647
#de... | insert | 42 | 42 | 42 | 44 | TLE | |
p02343 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define Rep(b, e, i) for (int i = b; i <= e... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define Rep(b, e, i) for (int i = b; i <= e... | delete | 75 | 76 | 75 | 75 | -6 | double free or corruption (out)
|
p02343 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)
#define each(a, b) for (auto(a) : (b... | #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = (int)(s); i < (int)(t); ++i)
#define each(a, b) for (auto(a) : (b... | insert | 179 | 179 | 179 | 181 | TLE | |
p02343 | C++ | Runtime Error | #include <iostream>
#include <list>
#include <vector>
using namespace std;
void makeset(int n, vector<list<int>> &set) {
set.resize(n);
for (int i = 0; i < n; i++) {
set[i].push_back(i);
}
}
void unite(vector<list<int>> &set, int x, int y, int n) {
list<int>::iterator itr;
int idx1 = -1, idx2 = -1;
fo... | #include <iostream>
#include <list>
#include <vector>
using namespace std;
void makeset(int n, vector<list<int>> &set) {
set.resize(n);
for (int i = 0; i < n; i++) {
set[i].push_back(i);
}
}
void unite(vector<list<int>> &set, int x, int y, int n) {
list<int>::iterator itr;
int idx1 = -1, idx2 = -1;
fo... | insert | 27 | 27 | 27 | 29 | 0 | |
p02343 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#ifndef LOCAL_
#define fprintf \
if (false) \
fprintf
#endif // LOCAL_
// #define dump() fprintf(stderr, "#%s.%d\n", __func__, __LINE__);
#define dumpl(x1) ... | #include <bits/stdc++.h>
#ifndef LOCAL_
#define fprintf \
if (false) \
fprintf
#endif // LOCAL_
// #define dump() fprintf(stderr, "#%s.%d\n", __func__, __LINE__);
#define dumpl(x1) ... | replace | 55 | 56 | 55 | 57 | TLE | |
p02343 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <nmmintrin.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#inclu... | #include <algorithm>
#include <array>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <nmmintrin.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#inclu... | replace | 210 | 211 | 210 | 211 | 0 | |
p02343 | C++ | Time Limit Exceeded | #include <stdio.h>
#define N 10010
int n;
int father[N];
int findfather(int x) { return x == father[x] ? x : findfather(father[x]); }
void init() {
for (int i = 0; i < n; i++)
father[i] = i;
}
int main() {
int m;
scanf("%d %d", &n, &m);
init();
for (int i = 0; i < m; i++) {
int a, b, c;
scanf("%d ... | #include <stdio.h>
#define N 10010
int n;
int father[N];
int findfather(int x) { return x == father[x] ? x : findfather(father[x]); }
void init() {
for (int i = 0; i < n; i++)
father[i] = i;
}
int main() {
int m;
scanf("%d %d", &n, &m);
init();
for (int i = 0; i < m; i++) {
int a, b, c;
scanf("%d ... | replace | 17 | 18 | 17 | 18 | TLE | |
p02343 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(I, A, B) for (int I = (A); I < (B); ++I)
#define CLR(mat) memset(mat, -1, sizeof(mat))
#define N 101
struct edge {
int to, cost;
};
int par[N];
int q, n;
void init(int n) { FOR(i, 0, n) par[i] = i; }
int root(int x) {
if (par[x] == x)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(I, A, B) for (int I = (A); I < (B); ++I)
#define CLR(mat) memset(mat, -1, sizeof(mat))
#define N 10000
struct edge {
int to, cost;
};
int par[N];
int q, n;
void init(int n) { FOR(i, 0, n) par[i] = i; }
int root(int x) {
if (par[x] == ... | replace | 5 | 6 | 5 | 6 | 0 | |
p02343 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define DEBUG(x) cout << #x << ": " << x << endl
#define PB push_back
#define MP make_pair
#define F fi... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define DEBUG(x) cout << #x << ": " << x << endl
#define PB push_back
#define MP make_pair
#define F fi... | replace | 45 | 52 | 45 | 52 | TLE | |
p02343 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long signed int ll;
constexpr ll NIL = -20000000000;
int u[10010];
int main() {
for (int i = 0; i < 10010; i++)
u[i] = -1;
int n, q, x, y, com;
... | #include <algorithm>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long signed int ll;
constexpr ll NIL = -20000000000;
int u[10010];
int main() {
for (int i = 0; i < 10010; i++)
u[i] = -1;
int n, q, x, y, com;
... | replace | 39 | 40 | 39 | 41 | TLE | |
p02343 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
#define MAX_N 114514
vector<int> X[MAX_N];
int Group[MAX_N], N, Q, A, B, C;
int main() {
cin >> N >> Q;
for (int i = 0; i < MAX_N; i++) {
X[i].push_back(i);
Group[i] = i;
}
for (int i = 0; i < Q; i++) {
cin >> A >> B >> C;
int D = Group[... | #include <iostream>
#include <vector>
using namespace std;
#define MAX_N 114514
vector<int> X[MAX_N];
int Group[MAX_N], N, Q, A, B, C;
int main() {
cin >> N >> Q;
for (int i = 0; i < MAX_N; i++) {
X[i].push_back(i);
Group[i] = i;
}
for (int i = 0; i < Q; i++) {
cin >> A >> B >> C;
int D = Group[... | replace | 15 | 16 | 15 | 16 | 0 | |
p02343 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define int long long
#define MOD7 1000000007
#define... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define int long long
#define MOD7 1000000007
#define... | replace | 83 | 84 | 83 | 84 | TLE | |
p02344 | C++ | Time Limit Exceeded | #include <stack>
#include <stdio.h>
using namespace std;
const int N = 1e5 + 10;
int p[N], val[N];
stack<int> s[N];
int find(int n) {
if (p[n] == n)
return n;
return p[n] = find(p[n]);
}
int main() {
int n, q, l, r, temp, a, b;
scanf("%d%d", &n, &q);
for (int i = 0; i < n; i++) {
p[i] = i;
val[i] ... | #include <stack>
#include <stdio.h>
using namespace std;
const int N = 1e5 + 10;
int p[N], val[N];
stack<int> s[N];
int find(int n) {
if (p[n] == n)
return n;
return p[n] = find(p[n]);
}
int main() {
int n, q, l, r, temp, a, b;
scanf("%d%d", &n, &q);
for (int i = 0; i < n; i++) {
p[i] = i;
val[i] ... | insert | 30 | 30 | 30 | 32 | TLE | |
p02345 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
using ll = long long;
using vi = vector<int>;
using vl = vector<long long>;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define ITR(i, c) for (auto i = begin(c); i != end(c); ++i)
#define FORE(x, c) for (auto &x : c)
#define FOR... | #include <bits/stdc++.h>
using namespace std;
#define int long long
using ll = long long;
using vi = vector<int>;
using vl = vector<long long>;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define ITR(i, c) for (auto i = begin(c); i != end(c); ++i)
#define FORE(x, c) for (auto &x : c)
#define FOR... | replace | 49 | 64 | 49 | 61 | 0 | [7m'int' is 'long long'[m
|
p02345 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utili... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utili... | replace | 62 | 63 | 62 | 63 | 0 | |
p02345 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template ... | replace | 72 | 75 | 72 | 77 | 0 | |
p02345 | C++ | Runtime Error | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
//
// ?????¢
// XCode??§???EOF??\??????Ctrl+D
// ?\???Alt+\
// ans???????§?INT?????????2,147,483,647????¶????????????¨??????????????§long
// long?????£???????????????????????????
////////////////////... | ////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
//
// ?????¢
// XCode??§???EOF??\??????Ctrl+D
// ?\???Alt+\
// ans???????§?INT?????????2,147,483,647????¶????????????¨??????????????§long
// long?????£???????????????????????????
////////////////////... | replace | 104 | 105 | 104 | 105 | 0 | |
p02345 | C++ | Runtime Error | #include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, a) range(i, 0, a)
using namespace std;
int n, dat[(1LL << 17) - 1];
void init(int _n) {
n = 1;
while (n < _n)
n *= 2;
for (int i = 0; i < n * 2 - 1; i++)
dat[i] = (1LL << 31) - 1;
}
void updata(int k, long lo... | #include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, a) range(i, 0, a)
using namespace std;
int n, dat[10000000];
void init(int _n) {
n = 1;
while (n < _n)
n *= 2;
for (int i = 0; i < n * 2 - 1; i++)
dat[i] = (1LL << 31) - 1;
}
void updata(int k, long long v) {... | replace | 5 | 6 | 5 | 6 | 0 | |
p02345 | C++ | Runtime Error | #include <bits/stdc++.h>
// Shrotening
#define fst first
#define snd second
#define pb push_back
// Loop
#define FOR(i, a, b) for (long i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (long i = (a); i >= (b); --i)
#define REP(i, a) FOR(i, 0, a)
#define RREP(i, a) RFOR(i, a, 0)
#define EACH(i, a) for (auto(i) = (a)... | #include <bits/stdc++.h>
// Shrotening
#define fst first
#define snd second
#define pb push_back
// Loop
#define FOR(i, a, b) for (long i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (long i = (a); i >= (b); --i)
#define REP(i, a) FOR(i, 0, a)
#define RREP(i, a) RFOR(i, a, 0)
#define EACH(i, a) for (auto(i) = (a)... | replace | 97 | 98 | 97 | 98 | 0 | |
p02345 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <cstdint>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <utility>
#include <vector>
#define INF 1000000000
#define MOD 1000000007... | #include <algorithm>
#include <array>
#include <cstdint>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <utility>
#include <vector>
#define INF 1000000000
#define MOD 1000000007... | replace | 394 | 398 | 394 | 395 | TLE | |
p02345 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define rep(i, n) FOR(i, 0, n)
#define DEBUG(x) cout << #x << ": " << x << endl
#define vint vector<int>
#define vdouble ve... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define rep(i, n) FOR(i, 0, n)
#define DEBUG(x) cout << #x << ": " << x << endl
#define vint vector<int>
#define vdouble ve... | replace | 30 | 31 | 30 | 31 | 0 | |
p02345 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <vect... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <vect... | replace | 23 | 24 | 23 | 24 | 0 | |
p02345 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
const int INF = (1LL << 31) - 1;
struct SegmentTree {
int n;
vector<int> v;
SegmentTree(int n_, int x) : v(n_ * 4) {
for (int i = 0; (1 << i) <= n_; ++i, n = 1 << i)
;
for (int i = 0; i < n * 4; ++i)
v[i] = x;
}... | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
const int INF = (1LL << 31) - 1;
struct SegmentTree {
int n;
vector<int> v;
SegmentTree(int n_, int x) : v(n_ * 4) {
for (int i = 0; (1 << i) <= n_; ++i, n = 1 << i)
;
for (int i = 0; i < n_ * 4; ++i)
v[i] = x;
... | replace | 14 | 15 | 14 | 15 | -6 | malloc(): corrupted top size
|
p02345 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
#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 fore(i, a) for (auto &i : a)
#pragma GCC optimize("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
_main();
}
//----------------------... | #include <bits/stdc++.h>
#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 fore(i, a) for (auto &i : a)
#pragma GCC optimize("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
_main();
}
//----------------------... | replace | 15 | 16 | 15 | 16 | MLE | |
p02345 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <class T> struct treap {
#define treapInf INT_MAX
public:
struct node {
T val;
node *lch, *rch;
int pri, sz;
T sum, mini;
node(T val, int pri) : val(val), pri(pri), sz(1), sum(val), mini(val) {
lch = rch = NULL;
}
};
node *ro... | #include <bits/stdc++.h>
using namespace std;
template <class T> struct treap {
#define treapInf INT_MAX
public:
struct node {
T val;
node *lch, *rch;
int pri, sz;
T sum, mini;
node(T val, int pri) : val(val), pri(pri), sz(1), sum(val), mini(val) {
lch = rch = NULL;
}
};
node *ro... | replace | 27 | 28 | 27 | 29 | 0 | |
p02345 | C++ | Runtime Error | #include <algorithm>
#include <cfloat>
#include <cmath>
#include <queue>
#include <stack>
#include <stdio.h>
#include <vector>
typedef long long int ll;
#define BIG_NUM 2000000000
#define MOD 1000000007
#define EPS 0.000001
using namespace std;
#define NUM 2147483647
int N;
int *table;
void init(int first_N) {
whi... | #include <algorithm>
#include <cfloat>
#include <cmath>
#include <queue>
#include <stack>
#include <stdio.h>
#include <vector>
typedef long long int ll;
#define BIG_NUM 2000000000
#define MOD 1000000007
#define EPS 0.000001
using namespace std;
#define NUM 2147483647
int N;
int *table;
void init(int first_N) {
whi... | replace | 65 | 66 | 65 | 66 | 0 | |
p02345 | C++ | Runtime Error | #include <iostream>
using namespace std;
#define INF 2147483647
int n, q, rmq[200000];
void update(int a, int b) {
a += n - 1;
rmq[a] = b;
while (a > 0) {
a = (a - 1) / 2;
rmq[a] = min(rmq[2 * a + 1], rmq[2 * a + 2]);
}
}
int query(int a, int b, int k, int s, int t) {
if (a <= s && t <= b)
return ... | #include <iostream>
using namespace std;
#define INF 2147483647
int n, q, rmq[262144];
void update(int a, int b) {
a += n - 1;
rmq[a] = b;
while (a > 0) {
a = (a - 1) / 2;
rmq[a] = min(rmq[2 * a + 1], rmq[2 * a + 2]);
}
}
int query(int a, int b, int k, int s, int t) {
if (a <= s && t <= b)
return ... | replace | 3 | 4 | 3 | 4 | 0 | |
p02345 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
using namespace std;
int main() {
long n, q;
scanf("%d %d", &n, &q);
long A[100000];
for (long i = 0; i < n; i++)
A[i] = pow(2, 31) - 1;
for (long i = 0; i < q; i++) {
long c, x, y;
scanf("%ld %ld %ld", &c, &x, &y);
if (c == 0)
A[x... | #include <algorithm>
#include <cmath>
#include <cstdio>
using namespace std;
int main() {
int n, q;
scanf("%d %d", &n, &q);
long A[100000];
for (long i = 0; i < n; i++)
A[i] = pow(2, 31) - 1;
for (long i = 0; i < q; i++) {
long c, x, y;
scanf("%ld %ld %ld", &c, &x, &y);
if (c == 0)
A[x]... | replace | 6 | 7 | 6 | 7 | TLE | |
p02345 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int N, dat[200000];
void init(int n_) {
N = 1;
while (N < n_)
N *= 2;
for (int i = 0; i < 2 * N - 1; i++)
dat[i] = INT_MAX;
}
void update(int k, int a) {
k += N - 1;
dat[k] = a;
while (k > 0) {
k = (k - ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int N, dat[300000];
void init(int n_) {
N = 1;
while (N < n_)
N *= 2;
for (int i = 0; i < 2 * N - 1; i++)
dat[i] = INT_MAX;
}
void update(int k, int a) {
k += N - 1;
dat[k] = a;
while (k > 0) {
k = (k - ... | replace | 4 | 5 | 4 | 5 | 0 | |
p02345 | C++ | Runtime Error | #include <climits>
#include <iostream>
using namespace std;
const int max_n = 1 << 16;
const int max_array = max_n * 2 - 1;
const int INF = 2147483647;
int dat[max_array];
void init() {
for (int i = 0; i < max_array; i++) {
dat[i] = INF;
}
}
void update(int k, int x) {
k += max_n - 1;
dat[k] = x;
w... | #include <climits>
#include <iostream>
using namespace std;
const int max_n = 1 << 17;
const int max_array = max_n * 2 - 1;
const int INF = 2147483647;
int dat[max_array];
void init() {
for (int i = 0; i < max_array; i++) {
dat[i] = INF;
}
}
void update(int k, int x) {
k += max_n - 1;
dat[k] = x;
w... | replace | 5 | 6 | 5 | 6 | 0 | |
p02345 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) ... | insert | 135 | 135 | 135 | 136 | 0 | |
p02345 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repb(i, a, b) for (int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define int long long
using namespace std;
typedef pair<int, int> P;
const int inf = 2147483647;
const int MAX = 1e5 + 10;
// RMQ
struct segtree {
int N, dat... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repb(i, a, b) for (int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define int long long
using namespace std;
typedef pair<int, int> P;
const int inf = 2147483647;
const int MAX = 2e5 + 10;
// RMQ
struct segtree {
int N, dat... | replace | 9 | 10 | 9 | 10 | 0 | |
p02345 | 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)
typedef ll V;
const V INF_V = INT_MAX;
const int ME = ... | #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)
typedef ll V;
const V INF_V = INT_MAX;
const int ME = ... | replace | 13 | 14 | 13 | 14 | 0 | |
p02345 | C++ | Runtime Error | #include <climits>
#include <cstdio>
#include <iostream>
#define MAX 200000
#define INF INT_MAX
using namespace std;
int D[MAX];
int n = 1;
int inf;
void initRMQ(int n_) {
while (n < n_)
n *= 2;
for (int i = 0; i < 2 * n - 1; i++) {
D[i] = INF;
}
}
int query(int a, int b, int k, int l, int r) {
if (r... | #include <climits>
#include <cstdio>
#include <iostream>
#define MAX 300000
#define INF INT_MAX
using namespace std;
int D[MAX];
int n = 1;
int inf;
void initRMQ(int n_) {
while (n < n_)
n *= 2;
for (int i = 0; i < 2 * n - 1; i++) {
D[i] = INF;
}
}
int query(int a, int b, int k, int l, int r) {
if (r... | replace | 3 | 4 | 3 | 4 | 0 | |
p02345 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
const int N = 100000;
const int INF = (1LL << 31LL) - 1;
int dat[2 * N - 1];
int n, q;
void init(int n_) {
n = 1;
while (n_ > n)
n *= 2;
for (int i = 0; i < 2 * n - 1; ++i)
dat[i] = INF;
}
void update(int k, int a) {
k += n - 1;
dat[k] ... | #include <algorithm>
#include <iostream>
using namespace std;
const int N = 1 << 17;
const int INF = (1LL << 31LL) - 1;
int dat[2 * N - 1];
int n, q;
void init(int n_) {
n = 1;
while (n_ > n)
n *= 2;
for (int i = 0; i < 2 * n - 1; ++i)
dat[i] = INF;
}
void update(int k, int a) {
k += n - 1;
dat[k]... | replace | 4 | 5 | 4 | 5 | 0 | |
p02345 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
using namespace std;
const int INF = (1 << 31) - 1;
struct segtree {
int n;
int data[2620]; // 143];
segtree(int n_) {
n = 1;
while (n_ > n)
n *= 2;
for (int i = 0; i < n * 2 - 1; i++)
data[i] = INF;
}
void update(int k, int a) {
k += n - 1;... | #include <algorithm>
#include <cstdio>
using namespace std;
const int INF = (1 << 31) - 1;
struct segtree {
int n;
int data[262143];
segtree(int n_) {
n = 1;
while (n_ > n)
n *= 2;
for (int i = 0; i < n * 2 - 1; i++)
data[i] = INF;
}
void update(int k, int a) {
k += n - 1;
da... | replace | 8 | 9 | 8 | 9 | 0 | |
p02345 | C++ | Runtime Error | // #define LOCAL
#include <algorithm>
#include <assert.h>
#include <climits>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <memory.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i,... | // #define LOCAL
#include <algorithm>
#include <assert.h>
#include <climits>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <memory.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i,... | replace | 26 | 27 | 26 | 27 | 0 | |
p02345 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
const int MAX_N = 100000;
int n;
vector<int> dat(2 * MAX_N - 1, INT_MAX);
void init(int N) {
n = 1;
while (n < N) {
n *= 2;
}
}
void update(int i, int y) {
int k;
k = n - 1 + i;
dat[k]... | #include <algorithm>
#include <climits>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
const int MAX_N = 100000;
int n;
vector<int> dat(4 * MAX_N, INT_MAX);
void init(int N) {
n = 1;
while (n < N) {
n *= 2;
}
}
void update(int i, int y) {
int k;
k = n - 1 + i;
dat[k] = y... | replace | 9 | 10 | 9 | 10 | 0 | |
p02345 | C++ | Runtime Error | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define INF 100000000
#define MAXN 100010
#defin... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define INF 100000000
#define MAXN 100010
#defin... | replace | 21 | 22 | 21 | 22 | 0 | |
p02345 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
const long long Mx = 0x7FFFFFFF;
long long n, q, x, y, m = 1;
long long a[200000];
void ud(long long x, long long y) {
long long k = m + x - 1;
a[k] = y;
while (k > 0) {
k = (k - 1) / 2;
a[k] = min(a[k * 2 + 1], a[k * 2 + 2]);
}
}
long lon... | #include <algorithm>
#include <iostream>
using namespace std;
const long long Mx = 0x7FFFFFFF;
long long n, q, x, y, m = 1;
long long a[300000];
void ud(long long x, long long y) {
long long k = m + x - 1;
a[k] = y;
while (k > 0) {
k = (k - 1) / 2;
a[k] = min(a[k * 2 + 1], a[k * 2 + 2]);
}
}
long lon... | replace | 6 | 7 | 6 | 7 | 0 | |
p02345 | C++ | Time Limit Exceeded | #define _CRT_SECURE_NO_WARNINGS
// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// #define int ll
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
#define all(c) begin(c), end(c)
#define range(i, a, b) for (ll i = a; i < ll(b); i++)
#define rep(i,... | #define _CRT_SECURE_NO_WARNINGS
// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// #define int ll
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
#define all(c) begin(c), end(c)
#define range(i, a, b) for (ll i = a; i < ll(b); i++)
#define rep(i,... | insert | 80 | 80 | 80 | 82 | TLE | |
p02345 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
const int MAX_N = 100010;
const int inf = 2147483647;
int dat[MAX_N * 2];
int n;
void init(int n_) {
n = 1;
while (n < n_)
n *= 2; // 2のn乗に切り上げる
// 全て inf で初期化したいとき
for (int i = 0; i < n * 2; i++) {
dat[i] = inf;
}
// ... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
const int MAX_N = 100010;
const int inf = 2147483647;
int dat[MAX_N * 4];
int n;
void init(int n_) {
n = 1;
while (n < n_)
n *= 2; // 2のn乗に切り上げる
// 全て inf で初期化したいとき
for (int i = 0; i < n * 2; i++) {
dat[i] = inf;
}
// ... | replace | 8 | 9 | 8 | 9 | 0 | |
p02345 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define mind(a, b) (a > b ? b : a)
#define ma... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define mind(a, b) (a > b ? b : a)
#define ma... | replace | 60 | 61 | 60 | 61 | 0 | |
p02345 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
struct RMQ {
static const int MAXN = 100000;
int n;
int dat[2 * MAXN - 1];
RMQ(int n_) { init(n_); }
void init(int n_) {
n = 1;
while (n < n_)
n *= 2;
for (int i = 0; i < 2 * n - 1; i++)
dat[i] = INT_MAX;
}
void update(int k, int a) {
... | #include <bits/stdc++.h>
using namespace std;
struct RMQ {
static const int MAX_N = 1 << 17;
int n, dat[2 * MAX_N - 1];
// RMQ(){}
RMQ(int n_) { init(n_); }
void init(int n_) {
n = 1;
while (n < n_)
n *= 2;
for (int i = 0; i < 2 * n - 1; i++)
dat[i] = INT_MAX;
}
void update(int k,... | replace | 4 | 7 | 4 | 7 | 0 | |
p02345 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <cstdint>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <vector>
#define INF 1000000000
#define MOD 1000000007
#define ll long long
#define rep(i, a, b) for (int i ... | #include <algorithm>
#include <array>
#include <cstdint>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <vector>
#define INF 1000000000
#define MOD 1000000007
#define ll long long
#define rep(i, a, b) for (int i ... | replace | 37 | 39 | 37 | 40 | -11 | |
p02345 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#define N (1 << 18)
#define INF 2147483647
using namespace std;
void Update(int, int);
int Find(int, int, int, int, int);
int tree[N], n, N1 = N;
int main() {
int q, com, x, y;
if (N1 % 2 == 1)
N1 -= 1;
cin >> n >> q;
for (int i = 0; i < 2 * n - 1; i... | #include <algorithm>
#include <cmath>
#include <iostream>
#define N (1 << 19)
#define INF 2147483647
using namespace std;
void Update(int, int);
int Find(int, int, int, int, int);
int tree[N], n, N1 = N;
int main() {
int q, com, x, y;
if (N1 % 2 == 1)
N1 -= 1;
cin >> n >> q;
for (int i = 0; i < 2 * n - 1; i... | replace | 3 | 4 | 3 | 4 | 0 | |
p02345 | C++ | Time Limit Exceeded | #include <cmath>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <vector>
#define DATA_MAX 100000
#define QUERY_MAX 100000
#define LEFT 0
#define RIGHT 1
using namespace std;
class SegTree {
struct Node {
int value;
int high;
int low;
};
private:
vector<vector<Node>> Tree;
co... | #include <cmath>
#include <cstdlib>
#include <fstream>
#include <iostream>
#include <vector>
#define DATA_MAX 100000
#define QUERY_MAX 100000
#define LEFT 0
#define RIGHT 1
using namespace std;
class SegTree {
struct Node {
int value;
int high;
int low;
};
private:
vector<vector<Node>> Tree;
co... | replace | 81 | 82 | 81 | 82 | TLE | |
p02345 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <utility>
#include ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <utility>
#include ... | replace | 38 | 39 | 38 | 39 | 0 | |
p02345 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <typename T> struct SegmentTree {
struct Node {
T v;
Node(T v) : v(v) {}
Node operator*(const Node &r) const { return Node(min(v, r.v)); }
};
Node e = Node((1ll << 31) - 1);
size_t n;
vector<Node> seg;
SegmentTree(size_t size)
: n(1... | #include <bits/stdc++.h>
using namespace std;
template <typename T> struct SegmentTree {
struct Node {
T v;
Node(T v) : v(v) {}
Node operator*(const Node &r) const { return Node(min(v, r.v)); }
};
Node e = Node((1ll << 31) - 1);
size_t n;
vector<Node> seg;
SegmentTree(size_t size)
: n(1... | replace | 18 | 19 | 18 | 19 | -11 | |
p02345 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
#define all(c) (c).begin(), (c).end()
#define loop(i, a, b) for (ll i = a; i < ll(b); i++)
#define rep(i, b) loop(i, 0... | #define _CRT_SECURE_NO_WARNINGS
// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
#define all(c) (c).begin(), (c).end()
#define loop(i, a, b) for (ll i = a; i < ll(b); i++)
#define rep(i, b) loop(i, 0... | replace | 74 | 75 | 74 | 75 | 0 | |
p02345 | C++ | Time Limit Exceeded | #define _CRT_SECURE_NO_WARNINGS
// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// #define int ll
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
#define all(c) begin(c), end(c)
#define range(i, a, b) for (ll i = a; i < ll(b); i++)
#define rep(i,... | #define _CRT_SECURE_NO_WARNINGS
// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// #define int ll
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
#define all(c) begin(c), end(c)
#define range(i, a, b) for (ll i = a; i < ll(b); i++)
#define rep(i,... | replace | 76 | 77 | 76 | 77 | TLE | |
p02345 | C++ | Time Limit Exceeded | #define _CRT_SECURE_NO_WARNINGS
// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// #define int ll
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
#define all(c) begin(c), end(c)
#define range(i, a, b) for (ll i = a; i < ll(b); i++)
#define rep(i,... | #define _CRT_SECURE_NO_WARNINGS
// #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// #define int ll
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
#define all(c) begin(c), end(c)
#define range(i, a, b) for (ll i = a; i < ll(b); i++)
#define rep(i,... | replace | 76 | 77 | 76 | 77 | TLE | |
p02345 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int n, q;
const int N = 100010;
const int INF = (1LL << 31LL) - 1;
int dat[2 * N - 1];
void init(int n_) {
n = 1;
while (n_ > n)
n *= 2;
for (int i = 0; i < n * 2 - 1; ++i)
dat[i] = INF;
}
void update(int k, int a) {
k += n - 1;
dat[k] =... | #include <algorithm>
#include <iostream>
using namespace std;
int n, q;
const int N = 1 << 17;
const int INF = (1LL << 31LL) - 1;
int dat[2 * N - 1];
void init(int n_) {
n = 1;
while (n_ > n)
n *= 2;
for (int i = 0; i < n * 2 - 1; ++i)
dat[i] = INF;
}
void update(int k, int a) {
k += n - 1;
dat[k] ... | replace | 5 | 6 | 5 | 6 | 0 | |
p02345 | C++ | Runtime Error | #include <algorithm>
#include <stdio.h>
using namespace std;
int n, q;
int a[400005], b[400005], com[400005], c[400005], d[400005];
int N = 2147483648 - 1;
int sa;
void update(int x, int y) {
x += sa;
a[x] = y;
while (x > 0) {
x = (x - 1) / 2;
a[x] = min(a[x * 2 + 1], a[x * 2 + 2]);
}
}
int find(int ... | #include <algorithm>
#include <stdio.h>
using namespace std;
int n, q;
int a[4000005], com[4000005], c[4000005], d[4000005];
int N = 2147483648 - 1;
int sa;
void update(int x, int y) {
x += sa;
a[x] = y;
while (x > 0) {
x = (x - 1) / 2;
a[x] = min(a[x * 2 + 1], a[x * 2 + 2]);
}
}
int find(int x, int ... | replace | 5 | 6 | 5 | 6 | 0 | |
p02345 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int INF = 0x7fffffff;
int st[1 << 17];
void init(int n) {
int nn = 1;
while (nn < n)
nn *= 2;
fill(st, st + 2 * nn - 1, INF);
}
void update(int i, int a, int k, int l, int r) {
if (i < l || r <= i)
return;
if (r - l == 1)
st[k] = a;
else {
... | #include <bits/stdc++.h>
using namespace std;
const int INF = 0x7fffffff;
int st[1 << 18];
void init(int n) {
int nn = 1;
while (nn < n)
nn *= 2;
fill(st, st + 2 * nn - 1, INF);
}
void update(int i, int a, int k, int l, int r) {
if (i < l || r <= i)
return;
if (r - l == 1)
st[k] = a;
else {
... | replace | 5 | 6 | 5 | 6 | 0 | |
p02345 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <typename T, int M> struct RMQ {
T arr[M];
T INF;
int N;
RMQ(int N_, T INF_) {
INF = INF_;
for (int j = 0; j < 2 * M; ++j) {
arr[j] = INF;
}
N = 1;
while (N < N_)
N *= 2;
}
void update(int x, int a) {
int ind = N ... | #include <bits/stdc++.h>
using namespace std;
template <typename T, int M> struct RMQ {
T arr[M];
T INF;
int N;
RMQ(int N_, T INF_) {
INF = INF_;
for (int j = 0; j < M; ++j) {
arr[j] = INF;
}
N = 1;
while (N < N_)
N *= 2;
}
void update(int x, int a) {
int ind = N - 1 ... | replace | 10 | 11 | 10 | 11 | -11 | |
p02345 | C++ | Runtime Error | #include <bits/stdc++.h>
#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; i >= 0; i--)
#define INF 100000005
#define MAX 100001
#define ll long long
#define dmp make_pair
#define dpb push_back
#define P pair<int, int>
#define fi first
#defi... | #include <bits/stdc++.h>
#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; i >= 0; i--)
#define INF 100000005
#define MAX 100001
#define ll long long
#define dmp make_pair
#define dpb push_back
#define P pair<int, int>
#define fi first
#defi... | replace | 16 | 17 | 16 | 17 | 0 | |
p02345 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
#define MAX_N 100001
int N, dat[2 * MAX_N - 1];
static const int maxi = pow(2, 31) - 1;
void init(int n) {
N = 1... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
#define MAX_N 200000
int N, dat[2 * MAX_N - 1];
static const int maxi = pow(2, 31) - 1;
void init(int n) {
N = 1... | replace | 13 | 14 | 13 | 14 | 0 | |
p02345 | C++ | Runtime Error | #include <iostream>
#include <limits.h>
using namespace std;
int inf = INT_MAX;
int dat[200001];
int n, q;
void init(int n_) {
n = 1;
while (n < n_)
n *= 2;
for (int i = 0; i < 2 * n - 1; i++)
dat[i] = inf;
}
void update(int k, int a) {
k += n - 1;
dat[k] = a;
while (k > 0) {
k = (k - 1) / 2;
... | #include <iostream>
#include <limits.h>
using namespace std;
int inf = INT_MAX;
int dat[400004];
int n, q;
void init(int n_) {
n = 1;
while (n < n_)
n *= 2;
for (int i = 0; i < 2 * n - 1; i++)
dat[i] = inf;
}
void update(int k, int a) {
k += n - 1;
dat[k] = a;
while (k > 0) {
k = (k - 1) / 2;
... | replace | 4 | 5 | 4 | 5 | 0 | |
p02345 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, s, n) for (int i = s;... | #include <algorithm>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
#define pb push_back
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, s, n) for (int i = s;... | replace | 27 | 28 | 27 | 28 | 0 | |
p02345 | C++ | Runtime Error | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typede... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typede... | replace | 35 | 36 | 35 | 36 | 0 | |
p02345 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
struct node {
int num, l, r, ls, rs;
node(int _l, int _r) {
num = INT_MAX;
l = _l;
r = _r;
}
};
vector<node> T;
int make(int l, int r) {
int id = T.size();
T.push_back(node(l, r));
T[id].ls = (l + 1 == r ? -1 : make(l, (l + r) / 2));
T[id].rs =... | #include <bits/stdc++.h>
using namespace std;
struct node {
int num, l, r, ls, rs;
node(int _l, int _r) {
num = INT_MAX;
l = _l;
r = _r;
}
};
vector<node> T;
int make(int l, int r) {
int id = T.size();
T.push_back(node(l, r));
T[id].ls = (l + 1 == r ? -1 : make(l, (l + r) / 2));
T[id].rs =... | replace | 51 | 52 | 51 | 52 | -11 | |
p02345 | C++ | Runtime Error | #include <algorithm>
#include <complex>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
#define fs first
#define sc second
... | #include <algorithm>
#include <complex>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
#define fs first
#define sc second
... | replace | 24 | 25 | 24 | 25 | 0 | |
p02345 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#define INF 2147483647
using namespace std;
int n, q;
int com;
int tree[211111];
void init();
void update(int i, int x);
int segtree_find(int x, int y, int now, int left, int right);
int main() {
scanf(" %d %d", &n, &q);
init();
for (int i = 0; i < q; i++) {
scanf(... | #include <algorithm>
#include <cstdio>
#define INF 2147483647
using namespace std;
int n, q;
int com;
int tree[2111111];
void init();
void update(int i, int x);
int segtree_find(int x, int y, int now, int left, int right);
int main() {
scanf(" %d %d", &n, &q);
init();
for (int i = 0; i < q; i++) {
scanf... | replace | 7 | 8 | 7 | 8 | 0 | |
p02345 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#define INF 2147483647
using namespace std;
int n, q;
int com;
int tree[251111];
void init();
void update(int i, int x);
int segtree_find(int x, int y, int now, int left, int right);
int main() {
scanf(" %d %d", &n, &q);
init();
for (int i = 0; i < q; i++) {
scanf(... | #include <algorithm>
#include <cstdio>
#define INF 2147483647
using namespace std;
int n, q;
int com;
int tree[411111];
void init();
void update(int i, int x);
int segtree_find(int x, int y, int now, int left, int right);
int main() {
scanf(" %d %d", &n, &q);
init();
for (int i = 0; i < q; i++) {
scanf(... | replace | 7 | 8 | 7 | 8 | 0 | |
p02345 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <limits.h>
using namespace std;
#define INF (2147483647)
int n, q;
int com;
int pos, num;
int b, e;
int tree[211111];
void init();
int find(int x, int y, int now, int left, int right);
void update(int i, int x);
int main() {
scanf(" %d %d", &n,... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <limits.h>
using namespace std;
#define INF (2147483647)
int n, q;
int com;
int pos, num;
int b, e;
int tree[555555];
void init();
int find(int x, int y, int now, int left, int right);
void update(int i, int x);
int main() {
scanf(" %d %d", &n,... | replace | 13 | 14 | 13 | 14 | 0 | |
p02345 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
struct sqrt_decomposition {
using F = function<int(int, int)>;
int n, sz, len;
vector<int> v;
vector<int> w;
F f;
int e;
sqrt_decomposition(vector<int> _v, F _f, int _e) : v(_v), f(_f), e(_e) {
n = v.size();
sz = 1;
while ((sz + 1) * (sz + 1) < n)... | #include <bits/stdc++.h>
using namespace std;
struct sqrt_decomposition {
using F = function<int(int, int)>;
int n, sz, len;
vector<int> v;
vector<int> w;
F f;
int e;
sqrt_decomposition(vector<int> _v, F _f, int _e) : v(_v), f(_f), e(_e) {
n = v.size();
sz = 1;
while ((sz + 1) * (sz + 1) < n)... | replace | 26 | 27 | 26 | 27 | 0 | |
p02345 | C++ | Runtime Error | // Segment Tree
// RMQ
#include <climits>
#include <cstdio>
#include <iostream>
using namespace std;
// const int MAX_N = 1 << 17;
const int MAX_N = 100022;
int n, dat[2 * MAX_N - 1];
int init(int n_) {
n = 1;
while (n < n_)
n *= 2;
for (int i = 0; i < 2 * n - 1; i++)
dat[i] = INT_MAX;
return n;
}... | // Segment Tree
// RMQ
#include <climits>
#include <cstdio>
#include <iostream>
using namespace std;
// const int MAX_N = 1 << 17;
const int MAX_N = 200022;
int n, dat[2 * MAX_N - 1];
int init(int n_) {
n = 1;
while (n < n_)
n *= 2;
for (int i = 0; i < 2 * n - 1; i++)
dat[i] = INT_MAX;
return n;
}... | replace | 7 | 8 | 7 | 8 | 0 | |
p02345 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int dp[200010], n, q, r, x, y, i;
int m(int l, int r, int k) {
if (x <= l && r <= y)
return dp[k];
if (y <= l || r <= x)
return 2147483647;
return min(m(l, (l + r) / 2, k * 2 + 1), m((l + r) / 2, r, k * 2 + 2));
}
int main() {
cin >> n >> q;
... | #include <algorithm>
#include <iostream>
using namespace std;
int dp[270000], n, q, r, x, y, i;
int m(int l, int r, int k) {
if (x <= l && r <= y)
return dp[k];
if (y <= l || r <= x)
return 2147483647;
return min(m(l, (l + r) / 2, k * 2 + 1), m((l + r) / 2, r, k * 2 + 2));
}
int main() {
cin >> n >> q;
... | replace | 3 | 4 | 3 | 4 | 0 | |
p02345 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int INF = 2147483647;
class Backet {
int n, sqrtN, B;
vector<int> val, backet;
public:
Backet(vector<int> a) : val(a) {
n = a.size();
sqrtN = ceil(sqrt(n));
B = (n + sqrtN - 1) / sqrtN;
backet.resize(B, INF);
for (int i = 0; i < B; i++) {... | #include <bits/stdc++.h>
using namespace std;
const int INF = 2147483647;
class Backet {
int n, sqrtN, B;
vector<int> val, backet;
public:
Backet(vector<int> a) : val(a) {
n = a.size();
sqrtN = ceil(sqrt(n));
B = (n + sqrtN - 1) / sqrtN;
backet.resize(B, INF);
for (int i = 0; i < B; i++) {... | insert | 49 | 49 | 49 | 51 | 0 | |
p02345 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// http://hos.ac/slides/20140319_bit.pdf
template <class T, int MAX_N> struct FenwickTree { // 0-indexed
int N;
T data[MAX_N];
void init(int n) {
N = n;
memset(data, 0, sizeof(data));
}
T sum(int j) { //[0, j)
T ret = 0;
for (int x = j - 1; x >= 0... | #include <bits/stdc++.h>
using namespace std;
// http://hos.ac/slides/20140319_bit.pdf
template <class T, int MAX_N> struct FenwickTree { // 0-indexed
int N;
T data[MAX_N];
void init(int n) {
N = n;
memset(data, 0, sizeof(data));
}
T sum(int j) { //[0, j)
T ret = 0;
for (int x = j - 1; x >= 0... | replace | 58 | 59 | 58 | 59 | 0 | |
p02345 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
#define max_n (1 << 17)
using namespace std;
int dat[max_n], n;
int get(int k) { return dat[k + n]; }
void update(int k, int a) {
for (k += n, dat[k] = a; k > 1; k >>= 1)
dat[k >> 1] = min(dat[k], dat[k ^ 1]);
}
int rmq(int a, int... | #include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
#define max_n (1 << 18)
using namespace std;
int dat[max_n], n;
int get(int k) { return dat[k + n]; }
void update(int k, int a) {
for (k += n, dat[k] = a; k > 1; k >>= 1)
dat[k >> 1] = min(dat[k], dat[k ^ 1]);
}
int rmq(int a, int... | replace | 5 | 6 | 5 | 6 | 0 | |
p02345 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
#define MAX_V 100002
#define INF INT_MAX
using namespace std;
int dat[MAX_V * 2], sz;
void update(int k, int x) {
k += sz - 1;
dat[k] = x;
while (k > 0) {
k = (k - 1) / 2;
dat[k] = min(dat[k * 2 + 1], dat[k * 2 + 2]);
}
}
... | #include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
#define MAX_V (1 << 17)
#define INF INT_MAX
using namespace std;
int dat[MAX_V * 2], sz;
void update(int k, int x) {
k += sz - 1;
dat[k] = x;
while (k > 0) {
k = (k - 1) / 2;
dat[k] = min(dat[k * 2 + 1], dat[k * 2 + 2]);
}... | replace | 5 | 6 | 5 | 6 | 0 | |
p02345 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int A[(1 << 17)];
int n, Q;
int N;
void init() {
N = 1;
while (N < n)
N *= 2;
for (int i = 0; i < 2 * N - 1; i++)
A[i] = 2147483647;
}
int find(int a, int b, int k, int l, int r) {
if (a <= l && r <= b)
return A[k];
if... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int A[(1 << 20)];
int n, Q;
int N;
void init() {
N = 1;
while (N < n)
N *= 2;
for (int i = 0; i < 2 * N - 1; i++)
A[i] = 2147483647;
}
int find(int a, int b, int k, int l, int r) {
if (a <= l && r <= b)
return A[k];
if... | replace | 4 | 5 | 4 | 5 | 0 | |
p02345 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
int n, q, data[200010];
int INF = (1LL << 31) - 1;
void init(int &n_) {
int n = 1;
while (n < n_)
n *= 2;
n_ = n;
for (int i = 0; i < 2 * n - 1; i++)
data[i] = INF;
}
void update(int k, int x) {
k += n - 1;
data[k] = x;
while (k > 0) {
k = (k - 1) / 2;... | #include <algorithm>
#include <iostream>
int n, q, data[300010];
int INF = (1LL << 31) - 1;
void init(int &n_) {
int n = 1;
while (n < n_)
n *= 2;
n_ = n;
for (int i = 0; i < 2 * n - 1; i++)
data[i] = INF;
}
void update(int k, int x) {
k += n - 1;
data[k] = x;
while (k > 0) {
k = (k - 1) / 2;... | replace | 2 | 3 | 2 | 3 | 0 | |
p02345 | C++ | Runtime Error | #include <climits>
#include <iostream>
using namespace std;
#define DEBUG 0
void update(int x, int y);
int find(int index, int x, int y, int l, int r);
void initRMQ();
void printTree();
const int infinit = INT_MAX;
int n, q;
const int SIZE = 100000;
int segmenttree[SIZE * 2 + 10];
int main() {
cin >> n >> q;
... | #include <climits>
#include <iostream>
using namespace std;
#define DEBUG 0
void update(int x, int y);
int find(int index, int x, int y, int l, int r);
void initRMQ();
void printTree();
const int infinit = INT_MAX;
int n, q;
const int SIZE = 1000000;
int segmenttree[SIZE * 2 + 10];
int main() {
cin >> n >> q;
... | replace | 13 | 14 | 13 | 14 | 0 | |
p02345 | C++ | Runtime Error | // ???????????????
#include <cassert>
#include <climits>
#include <vector>
// ?????°
const int INF = INT_MAX;
// ?????????
class RangeMinimumQuery {
public:
explicit RangeMinimumQuery(int s);
void update(int i, int v);
int index(int left, int right) const;
int value(int left, int right) const;
private:
int p... | // ???????????????
#include <cassert>
#include <climits>
#include <vector>
// ?????°
const int INF = INT_MAX;
// ?????????
class RangeMinimumQuery {
public:
explicit RangeMinimumQuery(int s);
void update(int i, int v);
int index(int left, int right) const;
int value(int left, int right) const;
private:
int p... | replace | 57 | 58 | 57 | 58 | -6 | 4f4839fd-dd81-4185-97b9-1774c359f366.out: /home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02345/C++/s906043922.cpp:51: int RangeMinimumQuery::query(int, int, int, int, int) const: Assertion `size_ < right' failed.
|
p02345 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <s... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <s... | replace | 43 | 44 | 43 | 44 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.