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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02689 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + (ch ^ 48);
c... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = x * 10 + (ch ^ 48);
c... | replace | 44 | 45 | 44 | 45 | 2 | |
p02689 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
#define rep3(i, i0, n) for (int i = i0; i < (n); i++)
#define pb push_back
#define mod 1000000007
#define INF 200000000000
template <class T> bool chmax(T... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
#define rep3(i, i0, n) for (int i = i0; i < (n); i++)
#define pb push_back
#define mod 1000000007
#define INF 200000000000
template <class T> bool chmax(T... | replace | 84 | 103 | 84 | 95 | TLE | |
p02689 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
long long n, m;
bool check[10001];
long long H[10001];
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> H[i];
check[i] = true;
}
int A, B;
for (int i = 0; i < m; i++) {
cin >> A >> B;
if (H[A] > H[B]) {
check[B] = false;
... | #include <iostream>
using namespace std;
int main() {
long long n, m;
bool check[100001];
long long H[100001];
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> H[i];
check[i] = true;
}
int A, B;
for (int i = 0; i < m; i++) {
cin >> A >> B;
if (H[A] > H[B]) {
check[B] = false;
... | replace | 5 | 7 | 5 | 7 | 0 | |
p02689 | C++ | Runtime Error | #include <iostream>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int N, M, a, b;
vector<int> ma(M, 0), h(M, 0);
cin >> N >> M;
for (int i = 1; i <= N; i++) {
cin >> h[i];
}
for (int i = 0; i < M; i++) {
cin >> a >> b;
ma[a] = max(ma[a], h[b]);
m... | #include <iostream>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
int main() {
int N, M, a, b;
vector<int> ma(1000000, 0), h(1000000, 0);
cin >> N >> M;
for (int i = 1; i <= N; i++) {
cin >> h[i];
}
for (int i = 0; i < M; i++) {
cin >> a >> b;
ma[a] = max(ma[a], ... | replace | 8 | 9 | 8 | 9 | 0 | |
p02689 | C++ | Runtime Error | //
//
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define is_in(i, s) (s.find(i) != s.end())
#define all(x) (x).begin(), (x).end()
#define outl(x) cout << x << endl
#define outsp(x) cout << x << " "
typedef long long ll;
typedef pair<int, int> P;
#define MAX_N 100... | //
//
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define is_in(i, s) (s.find(i) != s.end())
#define all(x) (x).begin(), (x).end()
#define outl(x) cout << x << endl
#define outsp(x) cout << x << " "
typedef long long ll;
typedef pair<int, int> P;
#define MAX_N 100... | replace | 12 | 13 | 12 | 13 | 0 | |
p02689 | C++ | Runtime Error | /* ______
_______ /\ |``\ | | /
| / \ |__/ |____ |/
| / _ _\ | \ | |\
| / \ | \ |______ | \
Dept. of CSE
Comilla University
*/
#include <bits/stdc++.h>
#define pi 2 * acos(0.0)
#define ll long long
#defin... | /* ______
_______ /\ |``\ | | /
| / \ |__/ |____ |/
| / _ _\ | \ | |\
| / \ | \ |______ | \
Dept. of CSE
Comilla University
*/
#include <bits/stdc++.h>
#define pi 2 * acos(0.0)
#define ll long long
#defin... | replace | 33 | 34 | 33 | 34 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
#endif
int n, m;
cin >> n >> m;
vector<int> a(n + 1);
for (int i = 1; i < n; i++) {
cin >> a[i];
}
vector<bool> a... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
#endif
int n, m;
cin >> n >> m;
vector<int> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
vector<bool> ... | replace | 13 | 14 | 13 | 14 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 10005;
int H[MAXN];
bool Bad[MAXN];
int main() {
int N, M;
cin >> N >> M;
for (int i = 1; i <= N; ++i)
cin >> H[i];
for (int i = 1; i <= M; ++i) {
int u, v;
cin >> u >> v;
if (H[u] <= H[v])
Bad[u] = true;
if (H[v] <= H[u... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 100005;
int H[MAXN];
bool Bad[MAXN];
int main() {
int N, M;
cin >> N >> M;
for (int i = 1; i <= N; ++i)
cin >> H[i];
for (int i = 1; i <= M; ++i) {
int u, v;
cin >> u >> v;
if (H[u] <= H[v])
Bad[u] = true;
if (H[v] <= H[... | replace | 2 | 3 | 2 | 3 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define pb push_back
#define pi pair<int, int>
#define vi vector<int>
#define vpi vector<pi>
#define IOS ios_base::sync_with_stdio(false), cin.tie(NULL)
const int N = 102, M = 11;
int a[N], h[N];
vi v[N];
int main() {
int n, m,... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define pb push_back
#define pi pair<int, int>
#define vi vector<int>
#define vpi vector<pi>
#define IOS ios_base::sync_with_stdio(false), cin.tie(NULL)
const int N = 100002, M = 11;
int a[N], h[N];
vi v[N];
int main() {
int n,... | replace | 10 | 11 | 10 | 11 | 0 | |
p02689 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
vector<long long> h(n);
vector<long long> ma(n);
for (int i = 1; i <= n; i++) {
cin >> h[i];
ma[i] = 0;
}... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
vector<long long> h(n + 1);
vector<long long> ma(n + 1);
for (int i = 1; i <= n; i++) {
cin >> h[i];
ma[i] ... | replace | 14 | 16 | 14 | 16 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a[10005];
int t[10005];
int n, m;
int i, j, k, ans;
cin >> n >> m;
for (i = 1; i <= n; i++)
cin >> a[i];
for (i = 1; i <= n; i++)
t[i] = 1;
for (i = 1; i <= m; i++) {
cin >> j >> k;
if (a[j] > a[k])
t[k] = 0;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long a[100005];
int t[100005];
int n, m;
int i, j, k, ans;
cin >> n >> m;
for (i = 1; i <= n; i++)
cin >> a[i];
for (i = 1; i <= n; i++)
t[i] = 1;
for (i = 1; i <= m; i++) {
cin >> j >> k;
if (a[j] > a[k])
t[k] = 0;
... | replace | 4 | 6 | 4 | 6 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<int> a(n), b(n);
for (int i = 0; i < m; i++) {
int ai, bi;
cin >> ai >> bi;
a[i] = ai - 1;
b[i] = bi - 1;
}
vec... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<int> a(m), b(m);
for (int i = 0; i < m; i++) {
int ai, bi;
cin >> ai >> bi;
a[i] = ai - 1;
b[i] = bi - 1;
}
vec... | replace | 9 | 10 | 9 | 10 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5, M = 1e5 * 2;
int n, m;
int hh[N];
int h[M], w[M], e[M], ne[M], idx;
bool st[N];
void add(int a, int b) { e[idx] = b, ne[idx] = h[a], h[a] = idx++; }
int main() {
cin >> n >> m;
memset(h, -1, sizeof h);
for (int i = 1; i <= n; i++)
cin >> hh[i];
... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7, M = 1e5 * 2 + 50;
int n, m;
int hh[N];
int h[M], w[M], e[M], ne[M], idx;
bool st[N];
void add(int a, int b) { e[idx] = b, ne[idx] = h[a], h[a] = idx++; }
int main() {
cin >> n >> m;
memset(h, -1, sizeof h);
for (int i = 1; i <= n; i++)
cin >... | replace | 2 | 3 | 2 | 3 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, h, a, b, ans = 0;
cin >> n >> m;
vector<int> height(n + 1);
for (int i = 1; i <= n; i++) {
cin >> h;
height.at(i) = h;
}
vector<int> top(n + 1);
for (int i = 0; i < m; i++) {
cin >> a >> b;
if (height[a] > height[b]) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, h, a, b, ans = 0;
cin >> n >> m;
vector<int> height(n + 1);
for (int i = 1; i <= n; i++) {
cin >> h;
height.at(i) = h;
}
vector<int> top(n + 1);
for (int i = 0; i < m; i++) {
cin >> a >> b;
if (height[a] > height[b]) {
... | replace | 29 | 30 | 29 | 30 | 2 | |
p02689 | C++ | Runtime Error | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace... | replace | 149 | 151 | 149 | 151 | 0 | |
p02689 | C++ | Runtime Error | // include
//------------------------------------------
#include <algorithm>
#include <bits/stdc++.h>
#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
//------------------------------------------
#include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list... | replace | 98 | 99 | 98 | 99 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
vector<bool> ans(N, true);
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
ans[min(H[a - 1] - 1, H[b - 1] - 1)] = false;
}
int cnt ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> H(N);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
vector<bool> ans(N, true);
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
if (H[a - 1] == H[b - 1]) {
ans[a - 1] = false;
... | replace | 14 | 15 | 14 | 24 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> arr(n);
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
vector<vector<int>> g(n);
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
x -= 1;
y -= 1;
g[x].push_back(y);
g[y].push... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> arr(n);
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
vector<vector<int>> g(n);
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
x -= 1;
y -= 1;
g[x].push_back(y);
g[y].push... | replace | 23 | 24 | 23 | 24 | -11 | |
p02689 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int N, M;
int H[10 ^ 5] = {0};
int NoGood[10 ^ 5] = {0};
cin >> N >> M;
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = 0; i < M; i++) {
int A, B;
cin >> A >> B;
if (H[A - 1] > H[B - 1]) {
NoGood[B - 1]++;
} else... | #include <iostream>
using namespace std;
int main() {
int N, M;
int H[100000] = {0};
int NoGood[100000] = {0};
cin >> N >> M;
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = 0; i < M; i++) {
int A, B;
cin >> A >> B;
if (H[A - 1] > H[B - 1]) {
NoGood[B - 1]++;
} else... | replace | 6 | 8 | 6 | 8 | 0 | |
p02689 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rep2(i, n) for (int i = 0; i <= n; i++)
#define repr(i, a, n) for (int i = a; i < n; i++)
#define... | #pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define rep2(i, n) for (int i = 0; i <= n; i++)
#define repr(i, a, n) for (int i = a; i < n; i++)
#define... | replace | 148 | 152 | 148 | 152 | -6 | /usr/include/c++/12/debug/vector:442:
In function:
std::debug::vector<_Tp, _Allocator>::reference std::debug::vector<_Tp,
_Allocator>::operator[](size_type) [with _Tp = long long int; _Allocator
= std::allocator<long long int>; reference = long long int&; size_type =
long unsigned int]
Error: attemp... |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep_bit(n) for (int bit = 0; bit < (1 << n); ++bit)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ld long double
#define CYES cout << "Yes" << endl
#define CNO cout << "No" << endl
#define SP << " " <<
#define CST(x) cou... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep_bit(n) for (int bit = 0; bit < (1 << n); ++bit)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ld long double
#define CYES cout << "Yes" << endl
#define CNO cout << "No" << endl
#define SP << " " <<
#define CST(x) cou... | replace | 52 | 54 | 52 | 53 | 0 | |
p02689 | C++ | Runtime Error | // ABC166 C
#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = s; i < (int)(n); i++)
const lint mod = 1000000007;
lint ans = 0;
lint n, m;
lint h[200001];
lint a[200001], b[200001];
lint score[21];
lint res = 0;... | // ABC166 C
#include <bits/stdc++.h>
using namespace std;
typedef long long lint;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, s, n) for (int i = s; i < (int)(n); i++)
const lint mod = 1000000007;
lint ans = 0;
lint n, m;
lint h[200001];
lint a[200001], b[200001];
lint score[200001];
lint res ... | replace | 13 | 14 | 13 | 14 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> high(N);
int ma[N];
for (int i = 1; i <= N; i++) {
cin >> high[i];
ma[i] = 0;
}
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
ma[a] = max(ma[a], high[b]);
ma[b] = max(ma[b], h... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int high[N];
int ma[N];
for (int i = 1; i <= N; i++) {
cin >> high[i];
ma[i] = 0;
}
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
ma[a] = max(ma[a], high[b]);
ma[b] = max(ma[b], high[a]);... | replace | 6 | 7 | 6 | 7 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
#define st first
#define nd second
using ll = long long;
using namespace std;
using pii = pair<int, int>;
const int N = 1e5;
std::vector<int> gr[N];
int h[N];
int main() {
int n, m;
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%d", &h[i]);
}
int x, y;
for (int ... | #include <bits/stdc++.h>
#define st first
#define nd second
using ll = long long;
using namespace std;
using pii = pair<int, int>;
const int N = 1e5 + 10;
std::vector<int> gr[N];
int h[N];
int main() {
int n, m;
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%d", &h[i]);
}
int x, y;
for ... | replace | 7 | 8 | 7 | 8 | 0 | |
p02689 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
// #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a), i##formax = (b); i < i##formax; i++)
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vect... | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
// #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a), i##formax = (b); i < i##formax; i++)
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vect... | replace | 18 | 19 | 18 | 19 | -11 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
vector<int> hei(n);
for (int i = 1; i <= n; i++)
cin >> hei[i];
vector<int> vec[200001];
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, m;
cin >> n >> m;
vector<int> hei(n + 1);
for (int i = 1; i <= n; i++)
cin >> hei[i];
vector<int> vec[200001];
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;... | replace | 10 | 11 | 10 | 11 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void) {
ll N, M;
cin >> N >> M;
vector<ll> h(N);
for (ll i = 0; i < N; i++) {
cin >> h.at(i);
}
ll a, b;
vector<ll> count(N, 0);
for (ll j = 0; j < M; j++) {
cin >> a >> b;
ll c = min(h.at(a - 1), h.at(b - 1));
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void) {
ll N, M;
cin >> N >> M;
vector<ll> h(N);
for (ll i = 0; i < N; i++) {
cin >> h.at(i);
}
ll a, b;
vector<ll> count(N, 0);
for (ll j = 0; j < M; j++) {
cin >> a >> b;
if (h.at(a - 1) < h.at(b - 1)) {
cou... | replace | 14 | 16 | 14 | 22 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, count = 0;
cin >> n >> m;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<vector<int>> G(n);
for (int i = 0; i < m; ++i) {
int a, b;
cin >> a >> b;
G[a].push_back(b);
}
for (int i = 0; i < n; i++) {... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, count = 0;
cin >> n >> m;
vector<int> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<vector<int>> G(n);
for (int i = 0; i < m; ++i) {
int a, b;
cin >> a >> b;
G[a - 1].push_back(b - 1);
G[b - 1].push_back(a - 1... | replace | 14 | 15 | 14 | 16 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// #pragma GCC optimize("Ofast")
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define REP(i, k, n) for (long long i = k; i < (long long)(n); i++)
#define all(a) a.begin(), a.end()
#define eb emplace_back
#define lb(v, k) (lower_bound(all(v), k) - v.begin... | #include <bits/stdc++.h>
using namespace std;
// #pragma GCC optimize("Ofast")
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define REP(i, k, n) for (long long i = k; i < (long long)(n); i++)
#define all(a) a.begin(), a.end()
#define eb emplace_back
#define lb(v, k) (lower_bound(all(v), k) - v.begin... | replace | 94 | 95 | 94 | 95 | 0 | |
p02689 | C++ | Runtime Error | #include <cmath>
#include <iostream>
#include <limits>
#include <set>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> h(n);
vector<bool> ok(n, true);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
... | #include <cmath>
#include <iostream>
#include <limits>
#include <set>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> h(n);
vector<bool> ok(n, true);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
... | replace | 16 | 17 | 16 | 17 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, N) for (ll(i) = 0; (i) < (N); (i)++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int mod = 1000000007;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> to(10010);
... | #include <bits/stdc++.h>
#define rep(i, N) for (ll(i) = 0; (i) < (N); (i)++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int mod = 1000000007;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> to(100100);
... | replace | 12 | 13 | 12 | 13 | 0 | |
p02689 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
#include <stdio.h>
#include <string.h>
#pragma warning(disable : 4996)
#define SIZE 100001
using namespace std;
int main() {
/* scanf("%lld", &N);
for (int i = 1; i <= N; i++) {
scanf("%lld", &A[i]);
if (A[i] <= 100) cnt[A[i]]++;
}
long ... | #include <cstdio>
#include <iostream>
#include <stdio.h>
#include <string.h>
#pragma warning(disable : 4996)
#define SIZE 100001
using namespace std;
int main() {
/* scanf("%lld", &N);
for (int i = 1; i <= N; i++) {
scanf("%lld", &A[i]);
if (A[i] <= 100) cnt[A[i]]++;
}
long ... | replace | 21 | 29 | 21 | 29 | 0 | |
p02689 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int h[10010], ma[10010] = {0};
for (int i = 0; i < n; i++) {
cin >> h[i];
ma[i] = 1;
}
for (int j = 0; j < m; j++) {
int a, b;
cin >> a >> b;
if (h[a - 1] < h[b - 1])
ma[a - 1] = 0;
else if (h[a... | #include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int h[100010], ma[100010] = {0};
for (int i = 0; i < n; i++) {
cin >> h[i];
ma[i] = 1;
}
for (int j = 0; j < m; j++) {
int a, b;
cin >> a >> b;
if (h[a - 1] < h[b - 1])
ma[a - 1] = 0;
else if (h... | replace | 7 | 8 | 7 | 8 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
#define ll long long
using namespace std;
const int N = 1e5 + 5;
vector<int> gr[N];
ll d[N], used[N];
int cnt = 0;
int dfs(int v) {
used[v] = 1;
int fl = 1;
for (auto e : gr[v]) {
if (d[v] <= d[e])
fl = 0;
}
if (fl)
cnt++;
for (auto e : gr[v]) {... | #include <bits/stdc++.h>
#define pb push_back
#define ll long long
using namespace std;
const int N = 1e5 + 5;
vector<int> gr[N];
ll d[N], used[N];
int cnt = 0;
void dfs(int v) {
used[v] = 1;
int fl = 1;
for (auto e : gr[v]) {
if (d[v] <= d[e])
fl = 0;
}
if (fl)
cnt++;
for (auto e : gr[v]) ... | replace | 11 | 12 | 11 | 12 | 0 | |
p02689 | C++ | Runtime Error | // created by pyoxiao on 2020/05/03
#include <bits/stdc++.h>
#define LL long long
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define CL(a, b) memset(a, b, sizeof(a))
using namespace std;
const int mod = 1e9 + 7;
LL fpow(LL a, LL b, LL p = mod) {
LL ans = 1;
a %= p;
while (b) {
... | // created by pyoxiao on 2020/05/03
#include <bits/stdc++.h>
#define LL long long
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define CL(a, b) memset(a, b, sizeof(a))
using namespace std;
const int mod = 1e9 + 7;
LL fpow(LL a, LL b, LL p = mod) {
LL ans = 1;
a %= p;
while (b) {
... | replace | 22 | 24 | 22 | 24 | 0 | |
p02689 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
long long int N, M;
cin >> N >> M;
long long int H[N];
for (int i = 0; i < N; i++)
cin >> H[i];
long long int A[M], B[M];
for (int i = 0; i < M; i++)
cin >> A[i] >> B[i];
bool flag[N];
for (int i = 0; i < N; i++)
flag[i] = true;
for ... | #include <iostream>
using namespace std;
int main() {
long long int N, M;
cin >> N >> M;
long long int H[N];
for (int i = 0; i < N; i++)
cin >> H[i];
long long int A[M], B[M];
for (int i = 0; i < M; i++)
cin >> A[i] >> B[i];
bool flag[N];
for (int i = 0; i < N; i++)
flag[i] = true;
for ... | replace | 17 | 38 | 17 | 22 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
#define REP3(i, x, n) for (int i = x; i > (n); i--)
#define zero_pad(num) setfill('0') << std::right << setw(num)
#define space_pad(num) setfill(' '... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
#define REP3(i, x, n) for (int i = x; i > (n); i--)
#define zero_pad(num) setfill('0') << std::right << setw(num)
#define space_pad(num) setfill(' '... | replace | 17 | 18 | 17 | 18 | -11 | |
p02689 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
// 展望台の高さ
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<int> ab(2 * m);
for (int i = 0; i < 2 * m; i++) {
cin >> ab[i];
}
// ok
// goodはよい展望台のこと
vector<int> good(n);
for (int i =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
// 展望台の高さ
vector<int> h(n);
for (int i = 0; i < n; i++) {
cin >> h[i];
}
vector<int> ab(2 * m);
for (int i = 0; i < 2 * m; i++) {
cin >> ab[i];
}
// ok
// goodはよい展望台のこと
vector<int> good(n);
for (int i =... | replace | 21 | 33 | 21 | 32 | TLE | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl "\n"
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> h(n);
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
vector<set<int>> adj(n);
for (int i = 0; i < m; ++i) {
int u, v;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl "\n"
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m;
cin >> n >> m;
vector<int> h(n);
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
vector<set<int>> adj(n);
for (int i = 0; i < m; ++i) {
int u, v;
... | insert | 27 | 27 | 27 | 31 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) loop(i, 0, n)
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define vi vector<int>
#define vl vector<ll>
#define pll pair<ll, ll>
#define vpll vector<pll>
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define loop(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) loop(i, 0, n)
#define all(c) c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define vi vector<int>
#define vl vector<ll>
#define pll pair<ll, ll>
#define vpll vector<pll>
... | replace | 26 | 27 | 26 | 27 | 0 | |
p02689 | C++ | Runtime Error | #include <cstdlib>
#include <cstring>
#include <iostream>
using namespace std;
const int N = 100010;
int h[N];
struct edge {
int v;
int next;
} e[N];
int p[N], eid;
void init() {
memset(p, -1, sizeof(p));
eid = 0;
}
void insert(int u, int v) {
e[eid].v = v;
e[eid].next = p[u];
p[u] = eid++;
}
int main() {... | #include <cstdlib>
#include <cstring>
#include <iostream>
using namespace std;
const int N = 100010;
int h[N];
struct edge {
int v;
int next;
} e[2 * N];
int p[N], eid;
void init() {
memset(p, -1, sizeof(p));
eid = 0;
}
void insert(int u, int v) {
e[eid].v = v;
e[eid].next = p[u];
p[u] = eid++;
}
int main... | replace | 9 | 10 | 9 | 10 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
// 短縮
#define rep(i, n) for (int i = 0; i < (n); ++i)
// sort()用
#define all(v) v.begin(), v.end()
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> H(N);
rep(i, N) cin >> H.at(i);
vector<int> A(M);
vector<int> B(M);
vector<int> NN(N);
vector<vector<int>>... | #include <bits/stdc++.h>
// 短縮
#define rep(i, n) for (int i = 0; i < (n); ++i)
// sort()用
#define all(v) v.begin(), v.end()
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> H(N);
rep(i, N) cin >> H.at(i);
vector<int> A(M);
vector<int> B(M);
vector<int> NN(N);
rep(i, M) { cin >>... | delete | 17 | 18 | 17 | 17 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define endl "\n"
typedef long long ll;
const double pi = 3.14159265358979323846;
int ctoi(const char c) {
if ('0' <= c && c <= '9')
return (c - '0');
return -1;
}
vector<int> input(int n) {
vector<int> vec(n);
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define endl "\n"
typedef long long ll;
const double pi = 3.14159265358979323846;
int ctoi(const char c) {
if ('0' <= c && c <= '9')
return (c - '0');
return -1;
}
vector<int> input(int n) {
vector<int> vec(n);
... | replace | 150 | 152 | 150 | 152 | 0 | |
p02689 | C++ | Runtime Error | #include <algorithm>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define PI 3.14159265358979323846264338327950L
ll res = 0;
int main() {
cin.tie(nullptr);
... | #include <algorithm>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define PI 3.14159265358979323846264338327950L
ll res = 0;
int main() {
cin.tie(nullptr);
... | replace | 23 | 25 | 23 | 25 | 0 | |
p02689 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n, m, h[100010];
int a[100010], b[100010];
cin >> n >> m;
rep(i, n) { cin >> h[... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
int n, m, h[100010];
int a[100010], b[100010];
cin >> n >> m;
rep(i, n) { cin >> h[... | replace | 23 | 36 | 23 | 29 | TLE | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
#define exrep(i, a, b) for (long long i = a; i <= b; i++)
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
ty... | #include <bits/stdc++.h>
#define exrep(i, a, b) for (long long i = a; i <= b; i++)
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
ty... | insert | 44 | 44 | 44 | 45 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<vector<int>> v(n + 1);
vector<int> f(n + 1);
vector<pair<long long, int>> arr;
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
f[i + 1] = x;
arr.emplace_back(x, i + 1);
}
sort(arr.rbegin(), arr.re... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<vector<int>> v(n + 1);
vector<int> f(n + 1);
vector<pair<long long, int>> arr;
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
f[i + 1] = x;
arr.emplace_back(x, i + 1);
}
sort(arr.rbegin(), arr.re... | replace | 19 | 22 | 19 | 22 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long int lld;
typedef unsigned long long int llu;
#define INF (lld)(9223372036854775807)
#define IINF (int)(2147483647)
using namespace std;
int main(void) {
lld n, m, a, b, s = 0;
cin >> n >> m;
vector<lld> h(n);
for (lld i = 0; i < n; i++) {
cin >> h[i];
}
vector... | #include <bits/stdc++.h>
typedef long long int lld;
typedef unsigned long long int llu;
#define INF (lld)(9223372036854775807)
#define IINF (int)(2147483647)
using namespace std;
int main(void) {
lld n, m, a, b, s = 0;
cin >> n >> m;
vector<lld> h(n);
for (lld i = 0; i < n; i++) {
cin >> h[i];
}
vector... | replace | 14 | 15 | 14 | 15 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll n, m;
cin >> n >> m;
vector<ll> h(n);
rep(i, n) { cin >> h[i]; }
vector<ll> a(n);
vector<ll> b(m);
vector<ll> judge(n);
rep(i, m) {
cin >> a[i] >> b[i];
if (h... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll n, m;
cin >> n >> m;
vector<ll> h(n);
rep(i, n) { cin >> h[i]; }
vector<ll> a(m);
vector<ll> b(m);
vector<ll> judge(n);
rep(i, m) {
cin >> a[i] >> b[i];
if (h... | replace | 10 | 11 | 10 | 11 | 0 | |
p02689 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define INF 10000... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define INF 10000... | replace | 42 | 44 | 42 | 48 | -11 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) \
; \
for (ll i = 1; i <= n; ++i)
using ll = long long;
using P = pair<int, int>;
int main() {
ll n, m;
cin >> ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) \
; \
for (ll i = 1; i <= n; ++i)
using ll = long long;
using P = pair<int, int>;
int main() {
ll n, m;
cin >> ... | replace | 16 | 17 | 16 | 17 | 0 | |
p02689 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define PI 3.14159265359
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0]))
int main() {
int N, M;
cin >> N >> M;
int H[M];
int ans[N];
rep(i, N)... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define PI 3.14159265359
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0]))
int main() {
int N, M;
cin >> N >> M;
int H[N];
int ans[N];
rep(i, N)... | replace | 12 | 13 | 12 | 13 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int ans, h[100000], n, m, x, y, l;
vector<int> ar[100000];
bool ok;
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int i = 0; i < m; i++) {
cin >> x >> y;
ar[x].push_back(y);
ar[y].push_back(x);
}
for (int i = 1; i <= ... | #include <bits/stdc++.h>
using namespace std;
int ans, h[100002], n, m, x, y, l;
vector<int> ar[100002];
bool ok;
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int i = 0; i < m; i++) {
cin >> x >> y;
ar[x].push_back(y);
ar[y].push_back(x);
}
for (int i = 1; i <= ... | replace | 3 | 5 | 3 | 5 | 0 | |
p02689 | C++ | Runtime Error | #include <iostream>
#include <string.h>
#include <vector>
using namespace std;
int main() {
long long int N, M;
long long int A, B;
long long int count = 0;
cin >> N >> M;
long long int tab[N + 5]; // obs
vector<long long int> cores[10005]; // linked roads
for (long long int i = 1; i <= N; ... | #include <iostream>
#include <string.h>
#include <vector>
using namespace std;
int main() {
long long int N, M;
long long int A, B;
long long int count = 0;
cin >> N >> M;
long long int tab[N + 5]; // obs
vector<long long int> cores[100005]; // linked roads
for (long long int i = 1; i <= N... | replace | 13 | 15 | 13 | 15 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> road(n, vector<int>(n, 0));
vector<int> h(n);
vector<bool> flag(n, true);
for (int i = 0; i < n; i++)
cin >> h[i];
int tmp_a, tmp_b;
for (int i = 0; i < m; i++) {
cin >> tmp_a >> tmp_b;
/*... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
// vector<vector<int>> road(n,vector<int>(n,0));
vector<int> h(n);
vector<bool> flag(n, true);
for (int i = 0; i < n; i++)
cin >> h[i];
int tmp_a, tmp_b;
for (int i = 0; i < m; i++) {
cin >> tmp_a >> tmp_b;
/... | replace | 5 | 6 | 5 | 6 | 0 | |
p02689 | C++ | Runtime Error | /*
Coded and Decoded by : Yash Kapoor
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define mp make_pair
#define pll pair<ll, ll>
#define vl vector<ll>
#define sl set<ll>
#define vll vector<pll>
#define ml map<ll, ll>
#define m... | /*
Coded and Decoded by : Yash Kapoor
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define mp make_pair
#define pll pair<ll, ll>
#define vl vector<ll>
#define sl set<ll>
#define vll vector<pll>
#define ml map<ll, ll>
#define m... | insert | 80 | 80 | 80 | 81 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n, m;
cin >> n >> m;
int cnt = n;
set<int> st;
vector<int> h;
rep(i, n) { cin >> h[i]; }
rep(i, m) {
int a, b;
cin >> a >> b;
int x, y;
x = h[a - 1];
y = h[b - 1];
int mn... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n, m;
cin >> n >> m;
int cnt = n;
set<int> st;
vector<int> h(n);
rep(i, n) { cin >> h[i]; }
rep(i, m) {
int a, b;
cin >> a >> b;
int x, y;
x = h[a - 1];
y = h[b - 1];
int... | replace | 9 | 10 | 9 | 10 | -11 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, r, a, b;
int c = 0;
cin >> n >> r;
vector<int> h(n);
vector<int> l(n);
for (int i = 0; i < n; i++) {
cin >> h.at(i);
l.at(i) = 1;
}
for (int i = 0; i < r; i++) {
cin >> a >> b;
if (h.at(a) < h.at(b)) {
l.at(b) *= 1, ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, r, a, b;
int c = 0;
cin >> n >> r;
vector<int> h(n);
vector<int> l(n);
for (int i = 0; i < n; i++) {
cin >> h.at(i);
l.at(i) = 1;
}
for (int i = 0; i < r; i++) {
cin >> a >> b;
a -= 1, b -= 1;
if (h.at(a) < h.at(b)) {
... | insert | 14 | 14 | 14 | 15 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 4) >= this->size() (which is 4)
|
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define fi first
#define sc second
#define rep(i, x) for (long long i = 0; i < x... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define fi first
#define sc second
#define rep(i, x) for (long long i = 0; i < x... | replace | 25 | 26 | 25 | 26 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
vector<int> adj[123456];
vector<int> hs;
bool is_good(int x) {
for (int node : adj[x]) {
if (hs[node] >= hs[x])
return false;
}
return true;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m, h;
cin >> n >> m >> h;
hs.resize(n + 1);
... | #include <bits/stdc++.h>
using namespace std;
vector<int> adj[123456];
vector<int> hs;
bool is_good(int x) {
for (int node : adj[x]) {
if (hs[node] >= hs[x])
return false;
}
return true;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n, m, h;
cin >> n >> m;
hs.resize(n + 1);
for ... | replace | 18 | 19 | 18 | 19 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int ans = 0;
int N, M;
cin >> N >> M;
vector<ll> H(N);
rep(i, N) { cin >> H[i]; }
vector<int> good(N, 1);
rep(i, M) {
int a, b;
cin ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int ans = 0;
int N, M;
cin >> N >> M;
vector<ll> H(N);
rep(i, N) { cin >> H[i]; }
vector<int> good(N, 1);
rep(i, M) {
int a, b;
cin ... | replace | 21 | 22 | 21 | 31 | 0 | |
p02689 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
bool r[100000];
int h[100000], a[100000], b[100000], n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> h[i];
r[i] = true;
}
for (int i = 0; i < m; i++) {
cin >> a[i] >> b[i];
}
for (int i = 0; i < n; i++) {
auto dif = h[a[i]... | #include <iostream>
using namespace std;
int main() {
bool r[100000];
int h[100000], a[100000], b[100000], n, m;
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> h[i];
r[i] = true;
}
for (int i = 0; i < m; i++) {
cin >> a[i] >> b[i];
}
for (int i = 0; i < m; i++) {
auto dif = h[a[i]... | replace | 15 | 16 | 15 | 16 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, m, ans;
int h[100010];
bool flag[100010];
vector<int> vec[100000];
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> h[i + 1];
}
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
vec[a].push_back(b);
vec[b].push_back(a)... | #include <bits/stdc++.h>
using namespace std;
int n, m, ans;
int h[100010];
bool flag[100010];
vector<int> vec[100010];
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> h[i + 1];
}
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
vec[a].push_back(b);
vec[b].push_back(a)... | replace | 5 | 6 | 5 | 6 | 0 | |
p02689 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vec... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vec... | replace | 52 | 53 | 52 | 53 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
#define INF 2e9
using namespace std;
int main() {
int N, M, A, B;
int buf[10001];
int check[10001];
cin >> N >> M;
int ans = N;
for (int i = 1; i <= N; i++) {
cin >> buf[i];
check[i] = 0;
}
for (int i = 0; i < M; i++) {
cin >> A >> B;
// cout << i << " ";
... | #include <bits/stdc++.h>
#define INF 2e9
using namespace std;
int main() {
int N, M, A, B;
int buf[100001];
int check[100001];
cin >> N >> M;
int ans = N;
for (int i = 1; i <= N; i++) {
cin >> buf[i];
check[i] = 0;
}
for (int i = 0; i < M; i++) {
cin >> A >> B;
// cout << i << " ";
... | replace | 6 | 8 | 6 | 8 | 0 | |
p02689 | C++ | Memory Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N;
cin >> M;
vector<long> height(N);
vector<bool> good(N, true);
vector<vector<bool>> adj(N, vector<bool>(N, false));
for (int i = 0; i < N; ++i) {
cin >> height[i];
}
for (int i = 0; i < M; ++i) {
int a,... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N;
cin >> M;
vector<long> height(N);
vector<bool> good(N, true);
for (int i = 0; i < N; ++i) {
cin >> height[i];
}
for (int i = 0; i < M; ++i) {
int a, b;
cin >> a;
cin >> b;
a--;
b--;
i... | delete | 10 | 11 | 10 | 10 | MLE | |
p02689 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define int long long
#define lowbit(x) ((x) & (-x))
#define hh putchar('\n')
#define kg putchar(' ')
using namespace std;
... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define int long long
#define lowbit(x) ((x) & (-x))
#define hh putchar('\n')
#define kg putchar(' ')
using namespace std;
... | replace | 16 | 17 | 16 | 17 | 0 | |
p02689 | C++ | Runtime Error | /************************************
/ AUTHOR : YATHARTH GOSWAMI /
/ ALIAS : hacker_yg /
/ INSTITUTE : IIT Kanpur /
************************************/
// TEMPLATE //
#include <bits/stdc++.h>
#define ll long long
#define MOD 1000000007
#define pb push_back... | /************************************
/ AUTHOR : YATHARTH GOSWAMI /
/ ALIAS : hacker_yg /
/ INSTITUTE : IIT Kanpur /
************************************/
// TEMPLATE //
#include <bits/stdc++.h>
#define ll long long
#define MOD 1000000007
#define pb push_back... | replace | 24 | 25 | 24 | 25 | 0 | |
p02689 | C++ | Runtime Error | /**
* author: Dooloper
* created: 03.05.2020 21:47:14
**/
#include <bits/stdc++.h>
using namespace std;
int cnt[105];
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n, m, ans = 0;
cin >> n >> m;
vector<long long> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i =... | /**
* author: Dooloper
* created: 03.05.2020 21:47:14
**/
#include <bits/stdc++.h>
using namespace std;
int cnt[101010];
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n, m, ans = 0;
cin >> n >> m;
vector<long long> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
for (int ... | replace | 9 | 10 | 9 | 10 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, m, d, sum, temp, c;
cin >> n >> m;
vector<long long int> a(n);
vector<vector<int>> p(n, vector<int>(n, 0));
for (int i = 0; i < n; i++)
cin >> a[i];
vector<int> b(n, 1);
while (m--) {
cin >> c >> d;
if (a[c - 1] <= a[d... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, m, d, sum, temp, c;
cin >> n >> m;
vector<long long int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
vector<int> b(n, 1);
while (m--) {
cin >> c >> d;
if (a[c - 1] <= a[d - 1])
b[c - 1] = 0;
if (a[d - 1] <= ... | delete | 6 | 7 | 6 | 6 | 0 | |
p02689 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long N, M, cnt = 0;
cin >> N >> M;
vector<long> H(N), A(M), B(M), check(N, 1);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = 0; i < M; i++) {
cin >> A[i] >> B[i];
}
for (int i = 0; i < N; i++... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long N, M, cnt = 0;
cin >> N >> M;
vector<long> H(N), A(M), B(M), check(N, 1);
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = 0; i < M; i++) {
cin >> A[i] >> B[i];
}
for (int i = 0; i < M; i++... | replace | 14 | 15 | 14 | 15 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <string>
#include <unordered_map>
#define ll long long
using namespace std;
const ll INF = 1LL << 60;
const int inf = 1 << 30;
const int N = 1e5 + 10;
inline void fastio() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
int h[10010];
int good[10010];
int main() {
int... | #include <bits/stdc++.h>
#include <string>
#include <unordered_map>
#define ll long long
using namespace std;
const ll INF = 1LL << 60;
const int inf = 1 << 30;
const int N = 1e5 + 10;
inline void fastio() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
int h[100010];
int good[100010];
int main() {
i... | replace | 14 | 16 | 14 | 16 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
signed main() {
int N, M;
cin >> N >> M;
vector<ll> H(N + 1);
rep(i, N) cin >> H[i + 1];
vector<vector<ll>> A(2, vector<ll>(M));
rep(i, M) cin >> A.at(0).at(i) >> A.at(1).at(i);
// ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
signed main() {
int N, M;
cin >> N >> M;
vector<ll> H(N + 1);
rep(i, N) cin >> H[i + 1];
vector<vector<ll>> A(2, vector<ll>(M));
rep(i, M) cin >> A.at(0).at(i) >> A.at(1).at(i);
// ... | replace | 16 | 17 | 16 | 17 | 0 | |
p02689 | C++ | Runtime Error | #include <cstdio>
const int MAXN = 105;
bool good[MAXN];
int H[MAXN];
int a, b, M, N;
int main() {
scanf(" %d%d", &N, &M);
for (int i = 1; i <= N; ++i) {
scanf("%d", &H[i]);
good[i] = true;
}
for (int i = 0; i < M; ++i) {
scanf(" %d%d", &a, &b);
good[a] &= (H[a] > H[b]);
good[b] &= (H[b] > ... | #include <cstdio>
const int MAXN = 1e5 + 5;
bool good[MAXN];
int H[MAXN];
int a, b, M, N;
int main() {
scanf(" %d%d", &N, &M);
for (int i = 1; i <= N; ++i) {
scanf("%d", &H[i]);
good[i] = true;
}
for (int i = 0; i < M; ++i) {
scanf(" %d%d", &a, &b);
good[a] &= (H[a] > H[b]);
good[b] &= (H[b... | replace | 1 | 2 | 1 | 2 | 0 | |
p02689 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
bool vis[100010];
int tot = 0;
int h[10010], a, b;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int j = 1; j <= m; j++) {
cin >> a >> b;
if (h[a] < h[b])
vis[a] = true;
else if (h[a] == h[b])
vis[a... | #include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
bool vis[100010];
int tot = 0;
int h[100010], a, b;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int j = 1; j <= m; j++) {
cin >> a >> b;
if (h[a] < h[b])
vis[a] = true;
else if (h[a] == h[b])
vis[... | replace | 7 | 8 | 7 | 8 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
using namespace std;
typedef long long ll;
int N, M, H[10010];
vector<int> G[10010];
int main() {
cin >> N >> M;
rep(i, N) cin >> H[i];
rep(i, M) {... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
using namespace std;
typedef long long ll;
int N, M, H[100010];
vector<int> G[100010];
int main() {
cin >> N >> M;
rep(i, N) cin >> H[i];
rep(i, M)... | replace | 7 | 9 | 7 | 9 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, m;
cin >> n >> m;
vector<ll> h;
vector<int> to[1000005];
for (int i = 0; i < n; i++) {
cin >> h.at(i);
}
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
to[a].push_back(b);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll n, m;
cin >> n >> m;
vector<ll> h(n);
vector<int> to[1000005];
for (int i = 0; i < n; i++) {
cin >> h.at(i);
}
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
to[a].push_back(b)... | replace | 8 | 9 | 8 | 9 | -11 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, M, A, B;
int ans = 0;
cin >> N >> M;
long long H[10010];
int Ten[10010] = {0};
rep(i, N) { cin >> H[i]; }
rep(i, M) {
cin >> A >> B;
if (H[A - 1] > H[B - 1]) {
Ten[B - 1] = ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, M, A, B;
int ans = 0;
cin >> N >> M;
long long H[100100];
int Ten[100100] = {0};
rep(i, N) { cin >> H[i]; }
rep(i, M) {
cin >> A >> B;
if (H[A - 1] > H[B - 1]) {
Ten[B - 1] ... | replace | 7 | 9 | 7 | 9 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define MAXN 100005
int hill[MAXN];
int fir[MAXN];
int n, m, ecnt, ans;
struct edge {
int v, nxt;
} eds[MAXN];
void adde(int a, int b) {
eds[++ecnt].v = b, eds[ecnt].nxt = fir[a], fir[a] = ecnt;
eds[++ecnt].v = a, eds[ecnt].nxt = fir[b], fir[b] = ecnt;
}
int main() {
... | #include <bits/stdc++.h>
using namespace std;
#define MAXN 100005
int hill[MAXN];
int fir[MAXN];
int n, m, ecnt, ans;
struct edge {
int v, nxt;
} eds[MAXN << 1];
void adde(int a, int b) {
eds[++ecnt].v = b, eds[ecnt].nxt = fir[a], fir[a] = ecnt;
eds[++ecnt].v = a, eds[ecnt].nxt = fir[b], fir[b] = ecnt;
}
int main... | replace | 8 | 9 | 8 | 9 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
static const int NMAX = 10010;
int main() {
int n, m;
int h[NMAX], ma[NMAX]; // ma[i]: 展望台 i から一本で行ける山の標高の最大値
cin >> n >> m;
REP(i, n)... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
static const int NMAX = 100100;
int main() {
int n, m;
int h[NMAX], ma[NMAX]; // ma[i]: 展望台 i から一本で行ける山の標高の最大値
cin >> n >> m;
REP(i, n... | replace | 7 | 8 | 7 | 8 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define CPP_CAT(x, y) CPP_CAT_I(x, y)
#define CPP_CAT_I(x, y) x##y
using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
using f32 = float;
using f64 = double;... | #include <bits/stdc++.h>
using namespace std;
#define CPP_CAT(x, y) CPP_CAT_I(x, y)
#define CPP_CAT_I(x, y) x##y
using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
using f32 = float;
using f64 = double;... | replace | 45 | 46 | 45 | 46 | 0 | |
p02689 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <sstream>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define INF LLONG_MAX
#define mod 1000000007
typedef long long ll;
int main(void) {
ll N, M;
cin >> N >> M;
vector<ll> H(N);
... | #include <algorithm>
#include <bits/stdc++.h>
#include <sstream>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repd(i, a, b) for (ll i = (a); i < (b); i++)
#define INF LLONG_MAX
#define mod 1000000007
typedef long long ll;
int main(void) {
ll N, M;
cin >> N >> M;
vector<ll> H(N);
... | replace | 16 | 17 | 16 | 17 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
typedef long long ll;
int h[10010];
int main() {
int n, m, a, b;
cin >> n >> m;
vector<vector<int>> G(n);
rep(i, n) cin >> h[i];
rep(i, m) {
cin >> a >> b;
a--;
b--;
G[a].push_back(b);
G[b].p... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using namespace std;
typedef long long ll;
int h[100010];
int main() {
int n, m, a, b;
cin >> n >> m;
vector<vector<int>> G(n);
rep(i, n) cin >> h[i];
rep(i, m) {
cin >> a >> b;
a--;
b--;
G[a].push_back(b);
G[b].... | replace | 4 | 5 | 4 | 5 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
long long int n, m;
cin >> n >> m;
long long int h[100001];
for (long long int i = 1; i <= n; i++) {
cin >> h[i];
}
long long int g[100001];
for (long long int i = 1; i <= n; i++) {
g[i] =... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
long long int n, m;
cin >> n >> m;
long long int h[100001];
for (long long int i = 1; i <= n; i++) {
cin >> h[i];
}
long long int g[100001];
for (long long int i = 1; i <= n; i++) {
g[i] =... | replace | 22 | 23 | 22 | 23 | 0 | |
p02689 | 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 n, m;
cin >> n >> m;
vector<int> h(n);
vector<bool> ok(n, true);
rep(i, n) cin >> h[i];
rep(i, n) {
int a, b;
cin >> a >> b;
a--, b--;... | #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 n, m;
cin >> n >> m;
vector<int> h(n);
vector<bool> ok(n, true);
rep(i, n) cin >> h[i];
rep(i, m) {
int a, b;
cin >> a >> b;
a--, b--;... | replace | 14 | 15 | 14 | 15 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> h(n), ma(n);
for (int i = 1; i < n + 1; i++) {
cin >> h[i];
ma[i] = 0;
}
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
ma[a] = max(h[b], ma[a]);
ma[b] = max(h[a], ma[b]);
}
i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> h(n + 1), ma(n + 1);
for (int i = 1; i < n + 1; i++) {
cin >> h[i];
ma[i] = 0;
}
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
ma[a] = max(h[b], ma[a]);
ma[b] = max(h[a], ma[b]);... | replace | 6 | 7 | 6 | 7 | 0 | |
p02689 | C++ | Runtime Error | // DushtuBunny
// Rahul Halder
// Indian Institute of Engineering Science & Technology,Shibpur
#include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); ... | // DushtuBunny
// Rahul Halder
// Indian Institute of Engineering Science & Technology,Shibpur
#include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); ... | replace | 45 | 46 | 45 | 46 | -11 | |
p02689 | C++ | Runtime Error | #pragma GCC optimize("Ofast", "-funroll-loops", "-fdelete-null-pointer-checks")
#pragma GCC target("ssse3", "sse3", "sse2", "sse", "avx2", "avx", "popcnt")
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ull unsigned long ... | #pragma GCC optimize("Ofast", "-funroll-loops", "-fdelete-null-pointer-checks")
#pragma GCC target("ssse3", "sse3", "sse2", "sse", "avx2", "avx", "popcnt")
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define ull unsigned long ... | replace | 26 | 28 | 26 | 28 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define ll long long
#define pb push_back
#define F first
#define S second
#define ld long double
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define vi vector<ll>
#define all(v) (v).begin(), (v).... | #include <bits/stdc++.h>
using namespace std;
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define ll long long
#define pb push_back
#define F first
#define S second
#define ld long double
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define vi vector<ll>
#define all(v) (v).begin(), (v).... | insert | 22 | 22 | 22 | 24 | 0 | |
p02689 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (ll i = a; i < ll(b); i++)
#define repr(i, a, b) for (ll i = a; i >= ll(b); i--)
#define endl "\n"
#define ALL(x) x.begin(), x.end()
#define ALLR(x) x.rbegin(... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (ll i = a; i < ll(b); i++)
#define repr(i, a, b) for (ll i = a; i >= ll(b); i--)
#define endl "\n"
#define ALL(x) x.begin(), x.end()
#define ALLR(x) x.rbegin(... | replace | 19 | 20 | 19 | 20 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n, m;
int count = 0;
cin >> n >> m;
vector<long long> h(n);
vector<int> a(m);
vector<int> b(m);
vector<int> ng(n);
rep(i, n) cin >> h.at(i);
rep(j, m) cin >> a.at(j) >> b.at(j);
rep(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n, m;
int count = 0;
cin >> n >> m;
vector<long long> h(n);
vector<int> a(m);
vector<int> b(m);
vector<int> ng(n);
rep(i, n) cin >> h.at(i);
rep(j, m) cin >> a.at(j) >> b.at(j);
rep(... | replace | 17 | 18 | 17 | 18 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, M;
cin >> N >> M;
vector<long long> H(N);
vector<long long> A(N);
vector<long long> B(N);
for (int i = 0; i < N; i++) {
cin >> H.at(i);
}
vector<long long> cnt_i(N, 0);
for (int i = 0; i < M; i++) {
cin >> A.at(i) >> B... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long N, M;
cin >> N >> M;
vector<long long> H(N);
vector<long long> A(M);
vector<long long> B(M);
for (int i = 0; i < N; i++) {
cin >> H.at(i);
}
vector<long long> cnt_i(N, 0);
for (int i = 0; i < M; i++) {
cin >> A.at(i) >> B... | replace | 8 | 10 | 8 | 10 | 0 | |
p02689 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, M, H[10010], MAX[10010];
cin >> N >> M;
for (int i = 1; i <= N; i++) {
cin >> H[i];
MAX[i] = 0;
}
for (int i = 1; i <= M; i++) {
int A, B;
cin >> A >> B;
MAX[A] = max(MAX[A], H[B]);
MAX[B] = max(MAX[B], ... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, M, H[100010], MAX[100010];
cin >> N >> M;
for (int i = 1; i <= N; i++) {
cin >> H[i];
MAX[i] = 0;
}
for (int i = 1; i <= M; i++) {
int A, B;
cin >> A >> B;
MAX[A] = max(MAX[A], H[B]);
MAX[B] = max(MAX[B]... | replace | 5 | 6 | 5 | 6 | 0 | |
p02689 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
vector<int> high(n);
vector<vector<bool>> bridge(n, vector<bool>(n, false));
for (int i = 0; i < n; i++) {
cin >> high[i];
}
int a, b;
vector<bool> flags(n, true);
for (int i = 0; i < m; i++) {
cin >... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, m;
cin >> n >> m;
vector<int> high(n);
for (int i = 0; i < n; i++) {
cin >> high[i];
}
int a, b;
vector<bool> flags(n, true);
for (int i = 0; i < m; i++) {
cin >> a >> b;
a--;
b--;
if (high[a] > high[b])
... | delete | 10 | 12 | 10 | 10 | MLE | |
p02689 | C++ | Time Limit Exceeded | #define MAX 100000
#include <iostream>
#include <vector>
using namespace std;
int N, M;
int h[MAX];
int main() {
cin >> N >> M;
vector<int> ini(N + 1, 1);
for (int i = 1; i <= N; i++) {
cin >> h[i];
}
// cout << ini.size();
int a, b;
for (int j = 1; j <= M; j++) {
cin >> a >> b;
if (h[a] > h... | #define MAX 200000
#include <iostream>
#include <vector>
using namespace std;
int N, M;
int h[MAX];
int main() {
cin >> N >> M;
vector<int> ini(N + 1, 1);
for (int i = 1; i <= N; i++) {
cin >> h[i];
}
// cout << ini.size();
int a, b;
for (int j = 1; j <= M; j++) {
cin >> a >> b;
if (h[a] > h... | replace | 0 | 1 | 0 | 1 | TLE | |
p02689 | C++ | Runtime Error | // 参考：http://ehafib.hatenablog.com/entry/2015/12/23/164517
// インクルード(アルファベット順,bits/stdc++.hは使わない派閥)
#include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreate... | // 参考：http://ehafib.hatenablog.com/entry/2015/12/23/164517
// インクルード(アルファベット順,bits/stdc++.hは使わない派閥)
#include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreate... | replace | 54 | 55 | 54 | 55 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<uint64_t> h(n);
for (auto &it : h) {
cin >> it;
}
set<int> good;
for (int i = 0; i < n; i++) {
good.insert(i);
}
for (int i = 0; i < m; i++) {
int a, b;
a--;
b--;
if (h.at(a) == h.at(b... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<uint64_t> h(n);
for (auto &it : h) {
cin >> it;
}
set<int> good;
for (int i = 0; i < n; i++) {
good.insert(i);
}
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
if... | insert | 18 | 18 | 18 | 19 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 18446744072027799679) >= this->size() (which is 4)
|
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m, x;
x = 0;
cin >> n >> m;
vector<long long> h(n);
vector<long long> a(m);
vector<long long> b(m);
vector<long long> sum(n);
for (int i = 0; i < n; i++) {
cin >> h.at(i);
}
for (long long i = 0; i < m; i++) {
cin >> a.... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m, x;
x = 0;
cin >> n >> m;
vector<long long> h(n);
vector<long long> a(m);
vector<long long> b(m);
vector<long long> sum(n);
for (int i = 0; i < n; i++) {
cin >> h.at(i);
}
for (long long i = 0; i < m; i++) {
cin >> a.... | replace | 18 | 22 | 18 | 23 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 4) >= this->size() (which is 4)
|
p02689 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#define int long long
#define rr register
#define MAXN 100010
#define inf 1e18
using namespace std;
inline int read() {
int s = 0, f = 0;
char ch = getchar();
while (!isdigit(ch)) {
f |= ch == ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#define int long long
#define rr register
#define MAXN 1000010
#define inf 1e18
using namespace std;
inline int read() {
int s = 0, f = 0;
char ch = getchar();
while (!isdigit(ch)) {
f |= ch ==... | replace | 10 | 11 | 10 | 11 | 0 | |
p02689 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 1005;
int best[N], h[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
best[x] = max(best[x], h[y... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int best[N], h[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
best[x] = max(best[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.