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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02745 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
using namespace std;
using ll = long long;
using ii = pair<int, int>;
const int N = 2005;
int dp[3][3][N];
int ok(string t, string p, int ini, int a, int b) {
if (ini < 0) {
swap(t, p);
swap(a, b);
ini = abs(ini);
}
... | #include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
using namespace std;
using ll = long long;
using ii = pair<int, int>;
const int N = 2005;
int dp[3][3][N];
int ok(string t, string p, int ini, int a, int b) {
if (ini < 0) {
swap(t, p);
swap(a, b);
ini = abs(ini);
}
... | delete | 55 | 66 | 55 | 55 | TLE | |
p02745 | C++ | Runtime Error | //
// Created by Hideaki Imamura on 2020-03-14.
//
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline boo... | //
// Created by Hideaki Imamura on 2020-03-14.
//
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline boo... | replace | 38 | 39 | 38 | 39 | 0 | |
p02745 | C++ | Runtime Error | #include <bits/stdc++.h>
#define LL long long
#define mem(i, j) memset(i, j, sizeof(i))
#define rep(i, j, k) for (int i = j; i <= k; i++)
#define dep(i, j, k) for (int i = k; i >= j; i--)
#define pb push_back
#define make make_pair
#define INF INT_MAX
#define inf LLONG_MAX
#define PI acos(-1)
using namespace std;
cons... | #include <bits/stdc++.h>
#define LL long long
#define mem(i, j) memset(i, j, sizeof(i))
#define rep(i, j, k) for (int i = j; i <= k; i++)
#define dep(i, j, k) for (int i = k; i >= j; i--)
#define pb push_back
#define make make_pair
#define INF INT_MAX
#define inf LLONG_MAX
#define PI acos(-1)
using namespace std;
cons... | replace | 37 | 38 | 37 | 38 | TLE | |
p02745 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int maxN = 4005;
int ans, tot;
int len[3];
bool f[3][3][maxN + 1];
char s[3][maxN + 1];
int main() {
for (int i = 0; i < 3; i++)
scanf("%s", s[i] + 1), len[i] = strlen(s[i] + 1);
tot = ans = len[0] + len[1] + len[2];
for (int i = 0; i < 3; i++)
for (... | #include <bits/stdc++.h>
using namespace std;
const int maxN = 6005;
int ans, tot;
int len[3];
bool f[3][3][maxN + 1];
char s[3][maxN + 1];
int main() {
for (int i = 0; i < 3; i++)
scanf("%s", s[i] + 1), len[i] = strlen(s[i] + 1);
tot = ans = len[0] + len[1] + len[2];
for (int i = 0; i < 3; i++)
for (... | replace | 3 | 4 | 3 | 4 | 0 | |
p02745 | C++ | Runtime Error | #include <iostream>
using namespace std;
int ab[10000], bc[10000], ac[10000], ans = 6000, na, nb, nc, L, R;
string a, b, c;
bool ch(char a, char b) { return (a == b || a == '?' || b == '?'); }
int main(void) {
cin >> a >> b >> c;
na = a.size();
nb = b.size();
nc = c.size();
for (int i = 0; i < na; i++) {
... | #include <iostream>
using namespace std;
int ab[10000], bc[10000], ac[10000], ans = 6000, na, nb, nc, L, R;
string a, b, c;
bool ch(char a, char b) { return (a == b || a == '?' || b == '?'); }
int main(void) {
cin >> a >> b >> c;
na = a.size();
nb = b.size();
nc = c.size();
for (int i = 0; i < na; i++) {
... | replace | 30 | 31 | 30 | 31 | -11 | |
p02745 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int ok[6][4002]; // 0:(a,b),1:(b,a),2:(a,c),3:(c,a),4:(b,c),5:(c,b)
void CompStr(string a, string b, int i) {
rep(j, a.size()) for (int k = j; k < a.size(); k++) {
if ((a.at(k) != '?') && (b.at(k ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int ok[6][4002]; // 0:(a,b),1:(b,a),2:(a,c),3:(c,a),4:(b,c),5:(c,b)
void CompStr(string a, string b, int i) {
rep(j, a.size()) for (int k = j; k < min(a.size(), b.size() + j); k++) {
if ((a.at(k) ... | replace | 8 | 9 | 8 | 9 | 0 | |
p02745 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (ll i = a; i <= b; i++)
#define repr(i, a, b) for (ll i = a; i >= b; i--)
int main() {
// your code goes here
char a[5][2005];
ll l[5], r[5] = {0}, ans = 100000000;
bool z[5015][5][5] = {0};
cin >> a[0] >> a[1] >> a[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (ll i = a; i <= b; i++)
#define repr(i, a, b) for (ll i = a; i >= b; i--)
int main() {
// your code goes here
char a[5][2005];
ll l[5], r[5] = {0}, ans = 100000000;
bool z[5015][5][5] = {0};
cin >> a[0] >> a[1] >> a[... | replace | 39 | 41 | 39 | 41 | 0 | |
p02745 | C++ | Runtime Error | /* _
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
... | /* _
_ooOoo_
o8888888o
88" . "88
(| -_- |)
O\ = /O
____/`---'\____
.' \\| |// `.
/ \\||| : |||// \
... | replace | 151 | 153 | 151 | 153 | 0 | |
p02745 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
vector<string> x;
void gen(string a, string b) {
int n = a.size();
int m = b.size();
for (int i = 0; i <= n; i++) {
bool ok = 1;
for (int j = 0; j < m; j++) {
if (i + j >= n || a[i + j] == '?' || b[j] == '?')
continue;
if (a[i + j] != b[... | #include <bits/stdc++.h>
using namespace std;
vector<string> x;
void gen(string a, string b) {
int n = a.size();
int m = b.size();
for (int i = 0; i <= n; i++) {
bool ok = 1;
for (int j = 0; j < m; j++) {
if (i + j >= n || a[i + j] == '?' || b[j] == '?')
continue;
if (a[i + j] != b[... | replace | 69 | 70 | 69 | 71 | TLE | |
p02745 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
std::string str_join(const std::string &s1, const std::string &s2) {
std::string r{s1};
auto n = s1.size();
for (auto i = 0ul; i < n; ++i) {
if (s2[i] == '?') {
continue;
}
if (r[i] == '?') {
r[... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
std::string str_join(const std::string &s1, const std::string &s2) {
std::string r{s1};
auto n = s1.size();
for (auto i = 0ul; i < n; ++i) {
if (s2[i] == '?') {
continue;
}
if (r[i] == '?') {
r[... | replace | 55 | 56 | 55 | 56 | TLE | |
p02745 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cassert>
typedef long long int ll;
using namespace std;
// @@ !! LIM(debug)
// --> f:<< debug
// ---- inserted function << from util.cc
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << "(" << p.first << ", " << p.second << ")";
r... | #include <bits/stdc++.h>
#include <cassert>
typedef long long int ll;
using namespace std;
// @@ !! LIM(debug)
// --> f:<< debug
// ---- inserted function << from util.cc
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << "(" << p.first << ", " << p.second << ")";
r... | replace | 133 | 134 | 133 | 134 | 0 | |
p02745 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#define maxn 2010
using namespace std;
char a[maxn], b[maxn], c[maxn];
bool ab[maxn + maxn + maxn + maxn + maxn], ac[5 * maxn], bc[5 * maxn];
int match(char a, char b) {
if (a == b || a == '?' || b == '?')
return 1;
return 0;
}
int main() {
int i, j, A... | #include <algorithm>
#include <cstdio>
#include <cstring>
#define maxn 2010
using namespace std;
char a[maxn], b[maxn], c[maxn];
bool ab[maxn + maxn + maxn + maxn + maxn], ac[5 * maxn], bc[5 * maxn];
int match(char a, char b) {
if (a == b || a == '?' || b == '?')
return 1;
return 0;
}
int main() {
int i, j, A... | replace | 28 | 30 | 28 | 30 | 0 | |
p02745 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <s... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <s... | replace | 66 | 67 | 66 | 67 | TLE | |
p02745 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int... | replace | 50 | 51 | 50 | 51 | TLE | |
p02745 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
#define _USE_MATH_DEFINES
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#in... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <vector>
#define _USE_MATH_DEFINES
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#in... | replace | 104 | 105 | 104 | 105 | 0 | |
p02745 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#define lson rt << 1
#define rson rt << 1 | 1
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> PP;
const int maxn... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#define lson rt << 1
#define rson rt << 1 | 1
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> PP;
const int maxn... | replace | 15 | 16 | 15 | 16 | 0 | |
p02745 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include ... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <random>
#include ... | replace | 32 | 33 | 32 | 33 | 0 | |
p02745 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, x, y) for (int i = (x); i < (y); ++i)
#define REP(i, x, y) for (int i = (x); i <= (y); ++i)
#define MP make_pair
#define PB push_back
#define PH push
#define fst first
#define snd second
typedef long long ll;
typedef unsigned long long ull;
typedef double d... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, x, y) for (int i = (x); i < (y); ++i)
#define REP(i, x, y) for (int i = (x); i <= (y); ++i)
#define MP make_pair
#define PB push_back
#define PH push
#define fst first
#define snd second
typedef long long ll;
typedef unsigned long long ull;
typedef double d... | insert | 26 | 26 | 26 | 28 | 0 | |
p02745 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
constexpr ld EPS = 1e-15;
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr int MOD = 1e9 + 7;
template <typename T> void printv(const vector<T> &v) {
int sz = v.size();
for (int i = ... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
constexpr ld EPS = 1e-15;
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr int MOD = 1e9 + 7;
template <typename T> void printv(const vector<T> &v) {
int sz = v.size();
for (int i = ... | replace | 82 | 84 | 82 | 83 | TLE | |
p02746 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
const ll s = pow(3, 29);
ll solve(ll a1, ll a2, ll b1, ll b2) {
if (a2 > b2) {
swap(a1, b1);
swap(a2, b2);
}
ll res = abs(a1 - b1) + abs(a2 - b2);
for (ll ss = s; ss >= 0; ss /= ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
const ll s = pow(3, 29);
ll solve(ll a1, ll a2, ll b1, ll b2) {
if (a2 > b2) {
swap(a1, b1);
swap(a2, b2);
}
ll res = abs(a1 - b1) + abs(a2 - b2);
for (ll ss = s; ss > 0; ss /= 3... | replace | 12 | 13 | 12 | 13 | -8 | |
p02746 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stac... | #include <algorithm>
#include <array>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stac... | insert | 1,079 | 1,079 | 1,079 | 1,080 | TLE | |
p02746 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int64_t len(int64_t a, int64_t b, int64_t c, int64_t d, int64_t p) {
if (a / p != c / p && b / p != d / p)
return abs(c - a) + abs(d - b);
if (a / p == c / p && b / p == d / p)
return len(a % p, b % p, c % p, d % p, p / 3);
if (a / p == c / p)
return len(c... | #include <bits/stdc++.h>
using namespace std;
int64_t len(int64_t a, int64_t b, int64_t c, int64_t d, int64_t p) {
if (a / p != c / p && b / p != d / p)
return abs(c - a) + abs(d - b);
if (a / p == c / p && b / p == d / p)
return len(a % p, b % p, c % p, d % p, p / 3);
if (a / p == c / p)
return len(b... | replace | 8 | 9 | 8 | 9 | 0 | |
p02747 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
int main() {
string s;
cin >> s;
bool flag = true;
for (int i = 0; i < s.length(); i = i + 2) {
if (s.at(i) != 'h' || s.at(i + 1) != 'i') {
flag = false;
}
}
if (s.... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
int main() {
string s;
cin >> s;
bool flag = true;
for (int i = 0; i < s.length() - 1; i = i + 2) {
if (s.at(i) != 'h' || s.at(i + 1) != 'i') {
flag = false;
}
}
if... | replace | 11 | 12 | 11 | 12 | 0 | |
p02747 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long llong;
typedef unsigned long long ullong;
using namespace std;
int main() {
string s;
cin >> s;
bool h = true;
for (auto &it : s)... | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long llong;
typedef unsigned long long ullong;
using namespace std;
int main() {
string s;
cin >> s;
bool h = true;
for (auto &it : s)... | replace | 25 | 26 | 25 | 26 | 0 | |
p02747 | C++ | Runtime Error | // BUGSBUNNY
// IIT ROORKEE
// _,add8ba,
// ,d888888888b,
// d8888888888888b _,ad8ba,_
// d888888888888888) ,d888888888b,
// I88888888888888... | // BUGSBUNNY
// IIT ROORKEE
// _,add8ba,
// ,d888888888b,
// d8888888888888b _,ad8ba,_
// d888888888888888) ,d888888888b,
// I88888888888888... | replace | 94 | 100 | 94 | 100 | -11 | |
p02747 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string ans = "Yes";
string s;
cin >> s;
for (int i = 0; i < s.size(); i = i + 2) {
if (!(s.at(i) == 'h' && s.at(i + 1) == 'i'))
ans = "No";
}
cout << ans << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string ans = "Yes";
string s;
cin >> s;
if (s.size() % 2 == 1) {
ans = "No";
cout << ans << "\n";
return 0;
}
for (int i = 0; i < s.size(); i = i + 2) {
if (!(s.at(i) == 'h' && s.at(i + 1) == 'i'))
ans = "No";
}
cout <... | insert | 9 | 9 | 9 | 15 | 0 | |
p02747 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
while (S.size() != 0) {
if (S.at(0) == 'h' && S.at(1) == 'i') {
S = S.substr(2);
} else {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
if (S.size() % 2 != 0) {
cout << "No" << endl;
return 0;
}
while (S.size() != 0) {
if (S.at(0) == 'h' && S.at(1) == 'i') {
S = S.substr(2);
} else {
cout << "No" << endl;
return 0;
}
}
cou... | insert | 6 | 6 | 6 | 10 | 0 | |
p02747 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string S;
cin >> S;
string ans = "Yes", hi = "hi";
while (S.length() > 0) {
if (S.substr(S.length() - 2, 2) == hi) {
S = S.substr(0, S.length() - 2);
} else {
ans = "No";
break;
}
}
cout << a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
string S;
cin >> S;
string ans = "Yes", hi = "hi";
while (S.length() > 0) {
if (S.length() % 2 == 1) {
ans = "No";
break;
}
if (S.substr(S.length() - 2, 2) == hi) {
S = S.substr(0, S.length() - 2)... | insert | 13 | 13 | 13 | 17 | 0 | |
p02747 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int c = 1;
for (int i = 0; i <= (s.length() - 1) / 2; i++) {
if ((s.at(i * 2) == 'h') && (s.at(i * 2 + 1) == 'i')) {
c = c * 1;
} else {
c = 0;
}
}
if (c > 0 && s.length() % 2 == 0) {
cout << "Yes";
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
if (s == "hi" || s == "hihi" || s == "hihihi" || s == "hihihihi" ||
s == "hihihihihi") {
cout << "Yes";
} else {
cout << "No";
}
} | replace | 6 | 16 | 6 | 8 | 0 | |
p02747 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define f first
#define s second
#define inf 1e18 + 9
using namespace std;
int32_t main() {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
ios::sync_with_stdio(0), cin.tie(0);
string st;
cin >> st;
int n = st.size();
if (n % 2) {
co... | #include <bits/stdc++.h>
#define int long long
#define f first
#define s second
#define inf 1e18 + 9
using namespace std;
int32_t main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
ios::sync_with_stdio(0), cin.tie(0);
string st;
cin >> st;
int n = st.size();
if (n % 2) {
... | replace | 7 | 9 | 7 | 9 | 0 | |
p02747 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int main(void) {
char S[10];
cin >> S;
int flag = 0;
int result = 1;
int i = 0;
while (S[i] != NULL) {
if (i % 2 == 0) {
if (S[i] != 'h') {
result = 0;
break;
} else
flag = 1;
} else {
if (S[i] != ... | #include <iostream>
#include <string>
using namespace std;
int main(void) {
char S[11];
cin >> S;
int flag = 0;
int result = 1;
int i = 0;
while (S[i] != NULL) {
if (i % 2 == 0) {
if (S[i] != 'h') {
result = 0;
break;
} else
flag = 1;
} else {
if (S[i] != ... | replace | 5 | 6 | 5 | 6 | 0 | |
p02747 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
for (int i = 0; i < 4; i++) {
if (S.at(2 * i) != 'h' || S.at(2 * i + 1) != 'i') {
cout << "No" << endl;
return 0;
}
}
cout << "Yes" << endl;
} | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
int n = 0;
n = (S.size()) / 2;
if (S.size() % 2 != 0) {
cout << "No" << endl;
return 0;
}
if (S.size() == 0) {
cout << "No" << endl;
return 0;
}
if (S.size() == 1) {
cout << "No" <<... | replace | 7 | 9 | 7 | 23 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 4) >= this->size() (which is 4)
|
p02747 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool flag = true;
if (S.size() > 10) {
cout << "No";
return 0;
}
for (int i = 0; i < S.size(); i += 2) {
if (S.at(i) != 'h' || S.at(i + 1) != 'i')
flag = false;
}
if (flag)
cout << "Yes";
else
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
bool flag = true;
if (S.size() % 2 != 0) {
cout << "No";
return 0;
}
for (int i = 0; i < S.size(); i += 2) {
if (S.at(i) != 'h' || S.at(i + 1) != 'i')
flag = false;
}
if (flag)
cout << "Yes";
else
... | replace | 8 | 9 | 8 | 9 | 0 | |
p02747 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
// #include<bits/stdc++.h>
#define int long long
#define mod 1000000007
#define for0(i, n) for (int i = 0; i < (n); i++)
#define for1(i, n) for (int i = 1; i <= (n); i++)
#define mp make_pair
#define all(x) x.begin(), x.end()
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
// #include<bits/stdc++.h>
#define int long long
#define mod 1000000007
#define for0(i, n) for (int i = 0; i < (n); i++)
#define for1(i, n) for (int i = 1; i <= (n); i++)
#define mp make_pair
#define all(x) x.begin(), x.end()
... | insert | 20 | 20 | 20 | 22 | TLE | |
p02747 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
freopen("Input.txt", "r", stdin);
freopen("Output.txt", "w", stdout);
string S;
cin >> S;
// cout<<S.length()<<endl;
if (S.length() % 2 == 0) {
int flag = 1;
fo... | #include <bits/stdc++.h>
#define ll long long;
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
string S;
cin >> S;
// cout<<S.length()<<endl;
if (S.length() % 2 == 0) {
int flag = 1;
for (int i = 0; i < S.length(); i++) {
if (i % 2 == 0) {
if (S[i... | delete | 7 | 11 | 7 | 7 | 0 | |
p02747 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool at = false;
for (int i = 0; i < s.size() - 2; i++) {
if (s[i] == 'h' && s[i + 1] == 'i') {
at = true;
break;
}
}
if (at == true)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
bool at = true;
if (s.size() % 2 != 0) {
cout << "No" << endl;
return 0;
}
for (int i = 0; i < s.size() - 1; i += 2) {
if (s[i] != 'h' || s[i + 1] != 'i') {
at = false;
break;
}
}
if (at == true)
... | replace | 6 | 10 | 6 | 14 | 0 | |
p02747 | C++ | Time Limit Exceeded | // A.cpp
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
bool flag;
cin >> s;
if (s.size() % 2 == 1) {
cout << "No" << endl;
return 0;
}
string st;
for (int i = 0; i != s.size(); i = +2) {
st += "hi";
}
if (s == st) {
cout << "Yes" << endl;
} else {... | // A.cpp
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
bool flag;
cin >> s;
if (s.size() % 2 == 1) {
cout << "No" << endl;
return 0;
}
string st;
for (int i = 0; i != s.size(); i += 2) {
st += "hi";
}
if (s == st) {
cout << "Yes" << endl;
} else {... | replace | 14 | 15 | 14 | 15 | TLE | |
p02747 | C++ | Runtime Error | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iomanip>
#include <iostream>
#... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iomanip>
#include <iostream>
#... | replace | 27 | 30 | 27 | 30 | 0 | |
p02747 | Python | Runtime Error | S = input()
ok = True
for i in range(0, len(S), 2):
if not (S[i] == "h" and S[i + 1] == "i"):
ok = False
break
print("Yes" if ok else "No")
| S = input()
ok = True
for i in range(0, len(S), 2):
try:
if not (S[i] == "h" and S[i + 1] == "i"):
ok = False
break
except IndexError:
ok = False
break
print("Yes" if ok else "No")
| replace | 3 | 4 | 3 | 8 | 0 | |
p02748 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int a, b, m;
cin >> a >> b >> m;
vector<int> va(a);
vector<int> vb(b);
for (int i = 0; i < a; i++)
cin >> va.at(i);
for (int i = 0; i < b; i++)
cin >> vb.at(i);
int a... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int a, b, m;
cin >> a >> b >> m;
vector<int> va(a);
vector<int> vb(b);
for (int i = 0; i < a; i++)
cin >> va.at(i);
for (int i = 0; i < b; i++)
cin >> vb.at(i);
int a... | replace | 21 | 24 | 21 | 24 | TLE | |
p02748 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
signed main(void) {
int A, B, m;
cin >> A >> B >> m;
int a[A], b[B];
int x[m], y[m], c[m];
int ans = 1e9;
rep(i, A) cin >> a[i];
rep(i, B) cin >> b[i];
rep(i, A) rep(j, B) ans = min(ans, a[i] + b[j]);
rep(i,... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
signed main(void) {
int A, B, m;
cin >> A >> B >> m;
int a[A], b[B];
int x[m], y[m], c[m];
int ans, min_a, min_b;
min_a = min_b = 1e9;
rep(i, A) {
cin >> a[i];
min_a = min(a[i], min_a);
}
rep(i, B) {... | replace | 9 | 13 | 9 | 20 | TLE | |
p02748 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, m, z;
int a[10010], b[10010];
int out = 1000000, min2 = 1000000;
int main() {
cin >> n >> m >> z;
for (int i = 1; i <= n; i++) {
cin >> a[i];
out = min(out, a[i]);
}
for (int i = 1; i <= m; i++) {
cin >> b[i];
min2 = min(min2, b[i]);
}
o... | #include <bits/stdc++.h>
using namespace std;
int n, m, z;
int a[100010], b[100010];
int out = 1000000, min2 = 1000000;
int main() {
cin >> n >> m >> z;
for (int i = 1; i <= n; i++) {
cin >> a[i];
out = min(out, a[i]);
}
for (int i = 1; i <= m; i++) {
cin >> b[i];
min2 = min(min2, b[i]);
}
... | replace | 4 | 5 | 4 | 5 | 0 | |
p02748 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, a, B, b, M;
cin >> A >> B >> M;
a = 100000;
b = 100000;
vector<int> vA(A + 1);
for (int i = 1; i <= A; i++) {
cin >> vA.at(i);
}
vector<int> vB(B + 1);
for (int i = 1; i <= B; i++) {
cin >> vB.at(i);
}
for (int i = 1; i < A... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, a, B, b, M;
cin >> A >> B >> M;
a = 100000;
b = 100000;
vector<int> vA(A + 1);
for (int i = 1; i <= A; i++) {
cin >> vA.at(i);
}
vector<int> vB(B + 1);
for (int i = 1; i <= B; i++) {
cin >> vB.at(i);
}
for (int i = 1; i < A... | replace | 26 | 27 | 26 | 27 | 0 | |
p02748 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define all... | #include <bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define all... | replace | 87 | 89 | 87 | 89 | 0 | |
p02748 | Python | Runtime Error | A, B, M = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
s = []
s.append(min(a) + min(b))
for i in range(M):
x_i, y_i, c_i = map(int, input().split())
minus = a[x_i - 1] + a[y_i - 1] - c_i
s.append(minus)
print(min(s))
| A, B, M = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
s = []
s.append(min(a) + min(b))
for i in range(M):
x_i, y_i, c_i = map(int, input().split())
minus = a[x_i - 1] + b[y_i - 1] - c_i
s.append(minus)
print(min(s))
| replace | 9 | 10 | 9 | 10 | 0 | |
p02748 | Python | Runtime Error | A, B, M = map(int, input().split())
x, y, c = [0] * M, [0] * M, [0] * M
a = list(map(int, input().split()))
b = list(map(int, input().split()))
for i in range(M):
x[i], y[i], c[i] = map(int, input().split())
ans = 0
sav = 0
maxc = max(c)
ci = c.index(maxc)
disc = a[ci - 1] + b[ci - 1] - maxc
print(min(disc, min(a) ... | A, B, M = map(int, input().split())
x, y, c = [0] * M, [0] * M, [0] * M
a = list(map(int, input().split()))
b = list(map(int, input().split()))
for i in range(M):
x[i], y[i], c[i] = map(int, input().split())
ans, sav = float("inf"), 0
for j in range(M):
sav = a[x[j] - 1] + b[y[j] - 1] - c[j]
if ans > sav:
... | replace | 6 | 12 | 6 | 13 | 0 | |
p02748 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#defin... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#defin... | replace | 488 | 489 | 488 | 489 | -11 | |
p02748 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
void s... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 1e9;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
void s... | replace | 23 | 26 | 23 | 26 | TLE | |
p02748 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, B, M;
int ans = 1000000;
int x, y, c;
int a_min = 100000;
int b_min = 100000;
cin >> A >> B >> M;
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, B, M;
int ans = 1000000;
int x, y, c;
int a_min = 100000;
int b_min = 100000;
cin >> A >> B >> M;
... | replace | 24 | 25 | 24 | 25 | 0 | |
p02748 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int lld;
int T;
int N, P;
int check[1000001];
int A, B, M;
vector<int> a;
vector<int> b;
int m1 = 1e9;
... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int lld;
int T;
int N, P;
int check[1000001];
int A, B, M;
vector<int> a;
vector<int> b;
int m1 = 1e9;
... | replace | 41 | 42 | 41 | 42 | 0 | |
p02748 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, m;
cin >> A >> B >> m;
vector<int> a(A);
for (int i = 0; i < A; i++)
cin >> a.at(i);
vector<int> b(B);
for (int i = 0; i < B; i++)
cin >> b.at(i);
int money = 200000;
for (int i = 0; i < m; i++) {
int x, y, z;
cin >>... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, m;
cin >> A >> B >> m;
vector<int> a(A);
for (int i = 0; i < A; i++)
cin >> a.at(i);
vector<int> b(B);
for (int i = 0; i < B; i++)
cin >> b.at(i);
int money = 200000;
for (int i = 0; i < m; i++) {
int x, y, z;
cin >>... | replace | 20 | 26 | 20 | 23 | 0 | |
p02748 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using ll = long long;
template <class T> using vt = vector<T>;
using vvi = vector<vector<int>>;
int main() {
int A, B, M;
cin >> A >> B >> M;
vt<int> a(A), b(B), x(M), y(M), c(M);
rep(i, A) cin >> a[i];
rep(i, B... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using ll = long long;
template <class T> using vt = vector<T>;
using vvi = vector<vector<int>>;
int main() {
int A, B, M;
cin >> A >> B >> M;
vt<int> a(A), b(B), x(M), y(M), c(M);
rep(i, A) cin >> a[i];
rep(i, B... | replace | 16 | 24 | 16 | 19 | TLE | |
p02748 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repd(i, a, b) for (int i = (a); i < (b); i++)
typedef long long ll;
using namespace std;
int main() {
int A, B, M;
cin >> A >> B >> M;
int a[A], b[B];
rep(i, A) { cin >> a[i]; }
rep(i, B) { cin >> b[i]; }
int x[M], y[M], c[M... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repd(i, a, b) for (int i = (a); i < (b); i++)
typedef long long ll;
using namespace std;
int main() {
int A, B, M;
cin >> A >> B >> M;
int a[A], b[B];
rep(i, A) { cin >> a[i]; }
rep(i, B) { cin >> b[i]; }
int x[M], y[M], c[M... | replace | 22 | 25 | 22 | 33 | 0 | |
p02748 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define invrep(i, n) for (int64_t i = n - 1; i >= 0; i--)
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int64_t a, b, m;
cin >> a >> b >> m;
vector<int64_t> av(a), bv(b);
rep(i, a) { cin >> av[i]; }
rep(i, b) { c... | #include <bits/stdc++.h>
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define invrep(i, n) for (int64_t i = n - 1; i >= 0; i--)
#define _GLIBCXX_DEBUG
using namespace std;
int main() {
int64_t a, b, m;
cin >> a >> b >> m;
vector<int64_t> av(a), bv(b);
rep(i, a) { cin >> av[i]; }
rep(i, b) { c... | replace | 13 | 19 | 13 | 15 | TLE | |
p02748 | C++ | Runtime Error | // #include <tourist>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18) + 1;
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1},
Dy[8] = {-1, -... | // #include <tourist>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18) + 1;
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1},
Dy[8] = {-1, -... | replace | 63 | 64 | 63 | 64 | 0 | |
p02748 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <climits>
using namespace std;
int main() {
long long int n, m, i, k, l, p = 0, j, sum, x = 1;
p = INT_MAX;
int t = INT_MAX;
cin >> n >> m >> k;
int a[n], b[m], c[k], d[k], e[k];
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 0; i < m; i++) {
cin >> b[i];
}... | #include <bits/stdc++.h>
#include <climits>
using namespace std;
int main() {
long long int n, m, i, k, l, p = 0, j, sum, x = 1;
p = INT_MAX;
int t = INT_MAX;
cin >> n >> m >> k;
int a[n], b[m], c[k], d[k], e[k];
for (i = 0; i < n; i++) {
cin >> a[i];
}
for (i = 0; i < m; i++) {
cin >> b[i];
}... | replace | 22 | 30 | 22 | 25 | TLE | |
p02748 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, M;
cin >> A >> B >> M;
int s = 200000, t = 200000;
vector<int> p(A + 1), q(B + 1);
for (int i = 1; i <= A; i++) {
cin >> p[i];
s = min(s, p[i]);
}
for (int i = 1; i <= B; i++) {
cin >> q.at(i);
t = min(t, q[i]);
}
in... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, M;
cin >> A >> B >> M;
int s = 200000, t = 200000;
vector<int> p(A + 1), q(B + 1);
for (int i = 1; i <= A; i++) {
cin >> p[i];
s = min(s, p[i]);
}
for (int i = 1; i <= B; i++) {
cin >> q.at(i);
t = min(t, q[i]);
}
in... | delete | 22 | 27 | 22 | 22 | TLE | |
p02748 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repm(i, m, n) for (int i = m; i < (n); i++)
#define eps (1e-7)
#define inf (1e9)
#define pi (acos(-1))
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repm(i, m, n) for (int i = m; i < (n); i++)
#define eps (1e-7)
#define inf (1e9)
#define pi (acos(-1))
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair... | replace | 26 | 38 | 26 | 48 | TLE | |
p02748 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long lint;
using namespace std;
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int a, b, m;
vector<int> r, d;
vector<int> x, y, c;
int main() {
vector<int> hoge(LLONG_MAX);
cin >> a >> b >> m;
r.resize(a), d.resi... | #include <bits/stdc++.h>
typedef long long lint;
using namespace std;
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int a, b, m;
vector<int> r, d;
vector<int> x, y, c;
int main() {
vector<int> hoge(100000000);
cin >> a >> b >> m;
r.resize(a), d.resi... | replace | 17 | 18 | 17 | 18 | -6 | terminate called after throwing an instance of 'std::length_error'
what(): cannot create std::vector larger than max_size()
|
p02748 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, M;
cin >> A >> B >> M;
vector<int> a(A), b(B);
for (int i = 0; i < A; i++)
cin >> a.at(i);
for (int i = 0; i < B; i++)
cin >> b.at(i);
int minA = *min_element(a.begin(), a.end());
int minB = *min_element(b.begin(), b.end());
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, M;
cin >> A >> B >> M;
vector<int> a(A), b(B);
for (int i = 0; i < A; i++)
cin >> a.at(i);
for (int i = 0; i < B; i++)
cin >> b.at(i);
int minA = *min_element(a.begin(), a.end());
int minB = *min_element(b.begin(), b.end());
... | replace | 20 | 21 | 20 | 21 | 0 | |
p02748 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); i++)
#define FOR(i, a, b) for (int(i) = a; (i) < (int)b; i++)
#define RREP(i, n) for (int(i) = ((int)(n)-1); (i) >= 0; i--)
#define RFOR(i, a, b) for (int(i) = ((int)(b)-1); (i) >= (int)a; i--)
#define ALL(v) (v).begin(), (v).end()
#define MOD ... | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); i++)
#define FOR(i, a, b) for (int(i) = a; (i) < (int)b; i++)
#define RREP(i, n) for (int(i) = ((int)(n)-1); (i) >= 0; i--)
#define RFOR(i, a, b) for (int(i) = ((int)(b)-1); (i) >= (int)a; i--)
#define ALL(v) (v).begin(), (v).end()
#define MOD ... | insert | 56 | 56 | 56 | 57 | -11 | |
p02748 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int A, B, M, a[100], b[100], i, j, m[100], x[100], y[100];
cin >> A >> B >> M;
for (i = 1; i <= A; i++)
cin >> a[i];
for (i = 1; i <= B; i++)
cin >> b[i];
for (i = 1; i <= M; i++) {
cin >> x[i] >> y[i] >> m[i];
}
int mina = a[1], minb = b[1... | #include <iostream>
using namespace std;
int main() {
int A, B, M, a[100005], b[100005], i, j, m[100005], x[100005], y[100005];
cin >> A >> B >> M;
for (i = 1; i <= A; i++)
cin >> a[i];
for (i = 1; i <= B; i++)
cin >> b[i];
for (i = 1; i <= M; i++) {
cin >> x[i] >> y[i] >> m[i];
}
int mina = a... | replace | 3 | 4 | 3 | 4 | 0 | |
p02748 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int ha[10005] = {0};
int hb[10005] = {0};
int main() {
int A, B, M;
cin >> A >> B >> M;
ha[0] = 100000000;
hb[0] = 100000000;
for (int i = 1; i <= A; i++) {
cin >> ha[i];
... | #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int ha[100005] = {0};
int hb[100005] = {0};
int main() {
int A, B, M;
cin >> A >> B >> M;
ha[0] = 100000000;
hb[0] = 100000000;
for (int i = 1; i <= A; i++) {
cin >> ha[i];... | replace | 8 | 10 | 8 | 10 | 0 | |
p02748 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long LL;
using namespace std;
int main() {
int a, b, m;
cin >> a >> b >> m;
vector<int> A(a);
int mia = 1001001;
rep(i, a... | #include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long LL;
using namespace std;
int main() {
int a, b, m;
cin >> a >> b >> m;
vector<int> A(a);
int mia = 1001001;
rep(i, a... | replace | 23 | 24 | 23 | 24 | 0 | |
p02748 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#define int long long int
int a, b, m, ans = INT_MAX;
cin >> a >> b >> m;
int p[a], q[b];
int x, y, c;
for (int i = 0; i < a; i++)
cin >> p[i];
for (int i = 0; i < b; i++)
cin >> q[i];... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#define int long long int
int a, b, m, ans = INT_MAX;
cin >> a >> b >> m;
int p[a], q[b];
int x, y, c;
for (int i = 0; i < a; i++)
cin >> p[i];
for (int i = 0; i < b; i++)
cin >> q[i];... | replace | 22 | 28 | 22 | 26 | TLE | |
p02748 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int A, B, M;
cin >> A >> B >> M;
vector<int> a(A), b(B);
rep(i, A) cin >> a[i];
rep(i, B) cin >> b[i];
int ans = *min_element(a.begin(), b.end()) + *min... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int A, B, M;
cin >> A >> B >> M;
vector<int> a(A), b(B);
rep(i, A) cin >> a[i];
rep(i, B) cin >> b[i];
int ans = *min_element(a.begin(), a.end()) + *min... | replace | 12 | 13 | 12 | 13 | 0 | |
p02748 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, M;
cin >> A >> B >> M;
vector<int> a(A);
for (int i = 0; i < A; i++) {
cin >> a.at(i);
}
vector<int> b(B);
for (int j = 0; j < B; j++) {
cin >> b.at(j);
}
vector<int> x(M), y(M), c(M);
for (int i = 0; i < M; i++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, M;
cin >> A >> B >> M;
vector<int> a(A);
for (int i = 0; i < A; i++) {
cin >> a.at(i);
}
vector<int> b(B);
for (int j = 0; j < B; j++) {
cin >> b.at(j);
}
vector<int> x(M), y(M), c(M);
for (int i = 0; i < M; i++) {
... | insert | 20 | 20 | 20 | 22 | 0 | |
p02748 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
const ll INF = ll(1e18) + 1;
const double PI = 3.14159265358979323846;
int mai... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
const ll INF = ll(1e18) + 1;
const double PI = 3.14159265358979323846;
int mai... | replace | 28 | 33 | 28 | 31 | TLE | |
p02748 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P... | replace | 32 | 33 | 32 | 34 | 0 | |
p02748 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long int lli;
typedef pair<lli, lli> pll;
const lli mod = 998244353;
const lli inf = 1e18;
int main() {
int a, b, m;
cin >> a >> b >> m;
vector<int> aa(m), bb(m);
for (int i = 0; i < a; i++) {
cin >>... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long int lli;
typedef pair<lli, lli> pll;
const lli mod = 998244353;
const lli inf = 1e18;
int main() {
int a, b, m;
cin >> a >> b >> m;
vector<int> aa(a), bb(b);
for (int i = 0; i < a; i++) {
cin >>... | replace | 13 | 14 | 13 | 14 | 0 | |
p02748 | C++ | Time Limit Exceeded | #define _DEBUG 1
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef _DEBUG
#define dump(x) cerr << #x << "=" << x << endl
#define dump2(x, y) cerr << #x << "=" << x << "," << #y << "=" << y << endl
#define check(s) cerr << s << endl
#else
#define dump(x)
#define dump2(x, y)
#define check(s)
#... | #define _DEBUG 1
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef _DEBUG
#define dump(x) cerr << #x << "=" << x << endl
#define dump2(x, y) cerr << #x << "=" << x << "," << #y << "=" << y << endl
#define check(s) cerr << s << endl
#else
#define dump(x)
#define dump2(x, y)
#define check(s)
#... | replace | 32 | 40 | 32 | 39 | TLE | |
p02748 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int A, B, M;
cin >> A >> B >> M;
vector<int> a(A, 0);
vector<int> b(B, 0);
int tmp_a = 10e9 + 1, tmp_b = 10e9 + 1;
for (int i = 0; i < A; ++i) {
cin >> a[i];
tmp_a = min(tmp_a, a[i]);
}
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int A, B, M;
cin >> A >> B >> M;
vector<int> a(A, 0);
vector<int> b(B, 0);
int tmp_a = 10e9 + 1, tmp_b = 10e9 + 1;
for (int i = 0; i < A; ++i) {
cin >> a[i];
tmp_a = min(tmp_a, a[i]);
}
... | delete | 20 | 25 | 20 | 20 | TLE | |
p02748 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP2(i, n) for (int i = 1; i <= (int)(n); i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define SORT(x) sort(x.begin(), x.end())
#define REVE(x) reverse(x.begin(), x.end())
#define AL... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP2(i, n) for (int i = 1; i <= (int)(n); i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define SORT(x) sort(x.begin(), x.end())
#define REVE(x) reverse(x.begin(), x.end())
#define AL... | replace | 54 | 60 | 54 | 59 | TLE | |
p02748 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, M, Min_a = 100000, Min_b = 100000, ans;
cin >> A >> B >> M;
vector<int> a(A), b(B), x(M), y(M), c(M);
for (int i = 0; i < A; i++) {
cin >> a.at(i);
if (Min_a > a.at(i)) {
Min_a = a.at(i);
}
}
for (int i = 0; i < B; i++) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, M, Min_a = 100000, Min_b = 100000, ans;
cin >> A >> B >> M;
vector<int> a(A), b(B), x(M), y(M), c(M);
for (int i = 0; i < A; i++) {
cin >> a.at(i);
if (Min_a > a.at(i)) {
Min_a = a.at(i);
}
}
for (int i = 0; i < B; i++) ... | replace | 24 | 26 | 24 | 26 | 0 | |
p02748 | C++ | Runtime Error | #include <iostream>
int main() {
int an, bn, mn;
int min;
int min_a = 99999;
int min_b = 99999;
int a[10000];
int b[10000];
for (int i = 0; i < 10000; i++)
a[i] = b[i] = 0;
std::cin >> an >> bn >> mn;
for (int i = 0; i < an; i++) {
std::cin >> a[i];
if (min_a > a[i])
min_a = a[i];
... | #include <iostream>
int main() {
int an, bn, mn;
int min;
int min_a = 999999;
int min_b = 999999;
int a[100000];
int b[100000];
for (int i = 0; i < 100000; i++)
a[i] = b[i] = 0;
std::cin >> an >> bn >> mn;
for (int i = 0; i < an; i++) {
std::cin >> a[i];
if (min_a > a[i])
min_a = a[... | replace | 5 | 10 | 5 | 10 | 0 | |
p02748 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
#define ll long long
const int inf = 1000000000;
int main() {
int a, b, m;
cin >> a >> b >> m;
vector<int> A(a);
vector<int> B(b);
vector<int> x(m);
vector<int> y(m);
vector<int> c(m);
rep(i, a) { cin >> A[i]... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
#define ll long long
const int inf = 1000000000;
int main() {
int a, b, m;
cin >> a >> b >> m;
vector<int> A(a);
vector<int> B(b);
vector<int> x(m);
vector<int> y(m);
vector<int> c(m);
rep(i, a) { cin >> A[i]... | replace | 23 | 32 | 23 | 27 | TLE | |
p02748 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int A, B, M;
cin >> A >> B >> M;
vector<int> aa(A), bb(B);
for (int i = 0; i < A; i++) {
cin >> aa.at(i);
}... | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int A, B, M;
cin >> A >> B >> M;
vector<int> aa(A), bb(B);
for (int i = 0; i < A; i++) {
cin >> aa.at(i);
}... | replace | 30 | 37 | 30 | 36 | TLE | |
p02748 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
long a, b, m, temp = LONG_MAX, ans = LONG_MAX;
cin >> a >> b >> m;
vector<long> va(a), vb(b);
rep(i, a) {
cin >> va.at(i);
if (ans > va.at(i))
ans = va.at(i);
}
rep(i, b) {
cin >> vb.a... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
long a, b, m, temp = LONG_MAX, ans = LONG_MAX;
cin >> a >> b >> m;
vector<long> va(a), vb(b);
rep(i, a) {
cin >> va.at(i);
if (ans > va.at(i))
ans = va.at(i);
}
rep(i, b) {
cin >> vb.a... | replace | 15 | 17 | 15 | 17 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 2) >= this->size() (which is 2)
|
p02748 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, M;
cin >> A >> B >> M;
vector<int> a(A);
for (int i = 0; i < A; i++)
cin >> a[i];
vector<int> b(B);
for (int i = 0; i < B; i++)
cin >> b[i];
int minA = *min_element(a.begin(), a.end());
int minB = *min_element(b.begin(), b.end... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, M;
cin >> A >> B >> M;
vector<int> a(A);
for (int i = 0; i < A; i++)
cin >> a[i];
vector<int> b(B);
for (int i = 0; i < B; i++)
cin >> b[i];
int minA = *min_element(a.begin(), a.end());
int minB = *min_element(b.begin(), b.end... | replace | 17 | 18 | 17 | 18 | 0 | |
p02748 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, M;
vector<int> a(A);
vector<int> b(B);
for (int i = 0; i < A; i++)
cin >> a[i];
for (int i = 0; i < B; i++)
cin >> b[i];
int ans = *min_element(a.begin(), a.end()) + *min_element(b.begin(), b.end());
for (int i = 0; i < M; i++) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, M;
cin >> A >> B >> M;
vector<int> a(A);
vector<int> b(B);
for (int i = 0; i < A; i++)
cin >> a[i];
for (int i = 0; i < B; i++)
cin >> b[i];
int ans = *min_element(a.begin(), a.end()) + *min_element(b.begin(), b.end());
for (i... | insert | 5 | 5 | 5 | 6 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02748 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, m;
cin >> a >> b >> m;
vector<int> cost_a(a), cost_b(b);
for (int i = 0; i < a; i++)
cin >> cost_a.at(i);
for (int i = 0; i < b; i++)
cin >> cost_b.at(i);
int ans = *min_element(cost_a.begin(), cost_a.end()) +
*min_ele... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, m;
cin >> a >> b >> m;
vector<int> cost_a(a), cost_b(b);
for (int i = 0; i < a; i++)
cin >> cost_a.at(i);
for (int i = 0; i < b; i++)
cin >> cost_b.at(i);
int ans = *min_element(cost_a.begin(), cost_a.end()) +
*min_ele... | replace | 18 | 19 | 18 | 19 | 0 | |
p02748 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, m;
cin >> a >> b >> m;
vector<int> A(a);
vector<int> B(b);
vector<vector<int>> C(a, vector<int>(b, 0));
for (int i = 0; i < a; i++)
cin >> A[i];
for (int j = 0; j < b; j++)
cin >> B[j];
int ans = 0;
int minA = *min_element(A... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, m;
cin >> a >> b >> m;
vector<int> A(a);
vector<int> B(b);
for (int i = 0; i < a; i++)
cin >> A[i];
for (int j = 0; j < b; j++)
cin >> B[j];
int ans = 0;
int minA = *min_element(A.begin(), A.end());
int minB = *min_element(B... | delete | 8 | 9 | 8 | 8 | 0 | |
p02748 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ifor(i, n) for (i = 0; i < n; i++)
#define ll long long
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int i, n, t = INT_MAX, p = INT_MAX, j = 0, x, a = 0, b, l = 0, r = 0, c, y, m,
q;
string s;
cin >> a >> b >> m;
int ara[a];
... | #include <bits/stdc++.h>
using namespace std;
#define ifor(i, n) for (i = 0; i < n; i++)
#define ll long long
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int i, n, t = INT_MAX, p = INT_MAX, j = 0, x, a = 0, b, l = 0, r = 0, c, y, m,
q;
string s;
cin >> a >> b >> m;
int ara[a];
... | replace | 25 | 31 | 25 | 28 | TLE | |
p02748 | C++ | Runtime Error | // BUGSBUNNY
// IIT ROORKEE
// _,add8ba,
// ,d888888888b,
// d8888888888888b _,ad8ba,_
// d888888888888888) ,d888888888b,
// I88888888888888... | // BUGSBUNNY
// IIT ROORKEE
// _,add8ba,
// ,d888888888b,
// d8888888888888b _,ad8ba,_
// d888888888888888) ,d888888888b,
// I88888888888888... | replace | 94 | 100 | 94 | 100 | -11 | |
p02748 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define rep(i, l, r) for (int(i) = (l); (i) < (r); (i)++)
using namespace std;
int main() {
ll A, B, M;
cin >> A >> B >> M;
vector<ll> a(A), b(B);
ll mia, mib = 1e9;
rep(i, 0, A) {
cin >> a[i];
mia = min(mia, a[i]);
}
rep(i, 0, B) {
cin >> b[i];
... | #include <bits/stdc++.h>
#define ll long long
#define rep(i, l, r) for (int(i) = (l); (i) < (r); (i)++)
using namespace std;
int main() {
ll A, B, M;
cin >> A >> B >> M;
vector<ll> a(A), b(B);
ll mia, mib = 1e9;
rep(i, 0, A) {
cin >> a[i];
mia = min(mia, a[i]);
}
rep(i, 0, B) {
cin >> b[i];
... | replace | 20 | 25 | 20 | 23 | TLE | |
p02748 | C++ | Runtime Error | #include <bits/stdc++.h>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return sum;
}
int main() {
int A, B, M;
cin >> A >> B >> M;
vector<long ... | #include <bits/stdc++.h>
const double PI = acos(-1);
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int findSumOfDigits(int n) {
int sum = 0;
while (n > 0) { // n が 0 になるまで
sum += n % 10;
n /= 10;
}
return sum;
}
int main() {
int A, B, M;
cin >> A >> B >> M;
vector<long ... | replace | 22 | 23 | 22 | 23 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 18446744073709551615) >= this->size() (which is 1)
|
p02748 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using vec = vector<int>;
using intk = int64_t;
int main() {
int A, B, M;
cin >> A >> B >> M;
vec a(A);
vec b(B);
for (int i = 0; i < A; i++)
cin >> a[i];
for (int i = 0; i < B; i++)
cin >> b[i];
vec x(M), y(M), c(M);
for (int i = 0; i < M; i++)
... | #include <bits/stdc++.h>
using namespace std;
using vec = vector<int>;
using intk = int64_t;
int main() {
int A, B, M;
cin >> A >> B >> M;
vec a(A);
vec b(B);
for (int i = 0; i < A; i++)
cin >> a[i];
for (int i = 0; i < B; i++)
cin >> b[i];
vec x(M), y(M), c(M);
for (int i = 0; i < M; i++)
... | replace | 22 | 28 | 22 | 26 | TLE | |
p02748 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
typedef long long ll;
using namespace std;
#define INF 0x3f3f3f3f
int r;
int a[10005], b[10005], c[10005], d[10005], e[10005];
int main() {
int n, i, j, t, k, l, o, m, q, w;
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
typedef long long ll;
using namespace std;
#define INF 0x3f3f3f3f
int r;
int a[100005], b[100005], c[100005], d[100005], e[100005];
int main() {
int n, i, j, t, k, l, o, m, q... | replace | 12 | 13 | 12 | 13 | 0 | |
p02748 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <iostream>
#include <math.h>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int A, B, M;
cin >> A >> B >> M;
vector<int> valueA(A);
vector<int> valueB(B);
vector<int> setx;
vector<int> sety;
vector<int> waribiki;
for (int a = 0; ... | #include <algorithm>
#include <climits>
#include <iostream>
#include <math.h>
#include <numeric>
#include <vector>
using namespace std;
int main() {
int A, B, M;
cin >> A >> B >> M;
vector<int> valueA(A);
vector<int> valueB(B);
vector<int> setx(M);
vector<int> sety(M);
vector<int> waribiki(M);
for (in... | replace | 14 | 17 | 14 | 17 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 0) >= this->size() (which is 0)
|
p02749 | C++ | Runtime Error | #include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <bitset>
#include <chrono>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <... | #include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <bitset>
#include <chrono>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <... | replace | 44 | 45 | 44 | 45 | 0 | |
p02749 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define RFOR(i, n, m) for (int i = (int)(n); i >= (int)(m); i--)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define RITR(x, c) for (__typeof(c.... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define RFOR(i, n, m) for (int i = (int)(n); i >= (int)(m); i--)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define RITR(x, c) for (__typeof(c.... | replace | 81 | 82 | 81 | 82 | 0 | |
p02749 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define x first
#define y second
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define sz(a) (int)(a.size())
const int INF = 1000 * 1000 * 1000 + 7;
const ll LINF = INF * (ll)INF;
const int mod = INF;
const int MAX = 1 << 25;
int... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define x first
#define y second
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define sz(a) (int)(a.size())
const int INF = 1000 * 1000 * 1000 + 7;
const ll LINF = INF * (ll)INF;
const int mod = INF;
const int MAX = 1 << 25;
int... | replace | 13 | 16 | 13 | 16 | 0 | |
p02749 | C++ | Runtime Error | #include <bits/stdc++.h> // clang-format off
using namespace std;
using Int = long long;
#define REP_(i, a_, b_, a, b, ...) for (int i = (a), lim_i = (b); i < lim_i; i++)
#define REP(i, ...) REP_((i), __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
struct SetupIO { SetupIO() { cin.tie(nullptr), ios::sync_with_stdio(false), c... | #include <bits/stdc++.h> // clang-format off
using namespace std;
using Int = long long;
#define REP_(i, a_, b_, a, b, ...) for (int i = (a), lim_i = (b); i < lim_i; i++)
#define REP(i, ...) REP_((i), __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
struct SetupIO { SetupIO() { cin.tie(nullptr), ios::sync_with_stdio(false), c... | replace | 53 | 55 | 53 | 54 | 0 | |
p02749 | C++ | Runtime Error | //@formatter:off
#include <bits/stdc++.h>
#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 rep2(i, s, n) for (int i = int(s); i < int(n); ++i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define eb emplace... | //@formatter:off
#include <bits/stdc++.h>
#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 rep2(i, s, n) for (int i = int(s); i < int(n); ++i)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define eb emplace... | replace | 111 | 112 | 111 | 112 | 0 | |
p02749 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> ii;
typedef tuple<ll, ll, ll> iii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
#define REP(i, n) for (ll i = 0; i < n; ++i)
#de... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> ii;
typedef tuple<ll, ll, ll> iii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
#define REP(i, n) for (ll i = 0; i < n; ++i)
#de... | replace | 142 | 148 | 142 | 146 | TLE | |
p02749 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
vector<int> G[200010];
int col[100010];
void dfs(int v, int p, int c) {
col[v] = c;
for (int u : G[v]) {
if (u == p)
continue;
dfs(u, v, c ^ 1);
}
}
int main() {
scanf("%d", &n);
for (int i = 0; i < n - 1; i++) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
vector<int> G[200010];
int col[200010];
void dfs(int v, int p, int c) {
col[v] = c;
for (int u : G[v]) {
if (u == p)
continue;
dfs(u, v, c ^ 1);
}
}
int main() {
scanf("%d", &n);
for (int i = 0; i < n - 1; i++) {
... | replace | 8 | 9 | 8 | 9 | 0 | |
p02749 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define SZ(x) ((int)(x).size())
typedef long long ll;
const int MAXN = 2e5 + 1;
vector<int> G[MAXN];
vector<int> side[2];
vector<int> colors[3];
int choice[MAXN];
void dfs(int u, int p, int s) {
side[s].push_back(u);
for (auto v : G[u])
if (v != p)
dfs(v, ... | #include <bits/stdc++.h>
using namespace std;
#define SZ(x) ((int)(x).size())
typedef long long ll;
const int MAXN = 2e5 + 1;
vector<int> G[MAXN];
vector<int> side[2];
vector<int> colors[3];
int choice[MAXN];
void dfs(int u, int p, int s) {
side[s].push_back(u);
for (auto v : G[u])
if (v != p)
dfs(v, ... | replace | 58 | 59 | 58 | 59 | 0 | |
p02749 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define all... | #include <bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define all... | replace | 124 | 125 | 124 | 125 | 0 | |
p02749 | C++ | Runtime Error | #include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
#define N 100010
inline int read() {
int x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = (x << 1) + (x << 3... | #include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
#define N 200010
inline int read() {
int x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = (x << 1) + (x << 3... | replace | 5 | 6 | 5 | 6 | 0 | |
p02749 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
const int N = 1e5 + 5, INF = 0x3f3f3f3f;
inline int read() {
int x = 0, f = 0;
char ch = 0;
while (!isdigit(ch))
f |= ch == '-', ch = getchar();
while (isdigit(ch))
x = (x << 3) + (x << 1) + (ch ^ 48), ch = getchar();
return f ? -x : x... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
const int N = 2e5 + 5, INF = 0x3f3f3f3f;
inline int read() {
int x = 0, f = 0;
char ch = 0;
while (!isdigit(ch))
f |= ch == '-', ch = getchar();
while (isdigit(ch))
x = (x << 3) + (x << 1) + (ch ^ 48), ch = getchar();
return f ? -x : x... | replace | 3 | 4 | 3 | 4 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.