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);
ch = getchar();
}
return x * f;
}
struct edge {
int v, nxt;
} e[200010];
int head[200010], cnt, n, m, w[100010], x, y, ans;
inline void add(int u, int v) {
e[++cnt].v = v;
e[cnt].nxt = head[u];
head[u] = cnt;
}
int main() {
n = read();
m = read();
for (int i = 1; i <= n; ++i)
w[i] = read();
for (int i = 1; i <= m; ++i)
x = read(), y = read(), add(x, y), add(y, x);
for (int u = 1; u <= n; ++u) {
bool flag = 1;
for (int i = head[u]; i; i = e[i].nxt) {
int v = e[i].v;
flag &= w[u] > w[v];
}
if (flag)
ans++;
}
return printf("%d\n", ans);
} | #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);
ch = getchar();
}
return x * f;
}
struct edge {
int v, nxt;
} e[200010];
int head[200010], cnt, n, m, w[100010], x, y, ans;
inline void add(int u, int v) {
e[++cnt].v = v;
e[cnt].nxt = head[u];
head[u] = cnt;
}
int main() {
n = read();
m = read();
for (int i = 1; i <= n; ++i)
w[i] = read();
for (int i = 1; i <= m; ++i)
x = read(), y = read(), add(x, y), add(y, x);
for (int u = 1; u <= n; ++u) {
bool flag = 1;
for (int i = head[u]; i; i = e[i].nxt) {
int v = e[i].v;
flag &= w[u] > w[v];
}
if (flag)
ans++;
}
return printf("%d\n", ans) & 0;
} | 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 &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
#define all(x) x.begin(), x.end()
bool compare(pair<int, int> a, pair<int, int> b) {
if (a.first != b.first) {
return a.first < b.first;
} else {
return a.second < b.second;
}
}
// 入力
vector<vector<ll>> G;
vector<bool> seen;
vector<ll> h;
ll cnt = 1;
ll mx;
ll flag;
// ll fcnt=1;
void dfs(ll v) {
seen[v] = 1;
if (h[v] == mx) {
flag = 1;
}
if (h[v] > mx) {
mx = h[v];
flag = 0;
}
rep(i, G[v].size()) {
if (seen[G[v][i]] == 0) {
dfs(G[v][i]);
}
}
}
int main() {
ll n, m;
cin >> n >> m;
G.resize(n);
seen.resize(n);
h.resize(n);
rep(i, n) { cin >> h[i]; }
rep(i, m) {
ll a, b;
cin >> a >> b;
a--;
b--;
G[a].pb(b);
G[b].pb(a);
}
ll ans = 0;
vector<ll> an(n);
rep(k, n) {
if (an[k] == 0) {
vector<ll> dist(n, -1);
queue<ll> que;
dist[k] = 0;
que.push(k);
while (!que.empty()) {
ll v = que.front();
que.pop();
flag = 0;
for (ll i : G[v]) {
if (h[v] == h[i]) {
an[v] = 1;
an[i] = 1;
break;
} else if (h[v] < h[i]) {
an[v] = 1;
break;
} else {
an[i] = 1;
}
}
}
}
}
rep(i, n) {
if (an[i] == 0) {
ans++;
}
}
cout << ans << endl;
return 0;
} | #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 &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
#define all(x) x.begin(), x.end()
bool compare(pair<int, int> a, pair<int, int> b) {
if (a.first != b.first) {
return a.first < b.first;
} else {
return a.second < b.second;
}
}
// 入力
vector<vector<ll>> G;
vector<bool> seen;
vector<ll> h;
ll cnt = 1;
ll mx;
ll flag;
// ll fcnt=1;
void dfs(ll v) {
seen[v] = 1;
if (h[v] == mx) {
flag = 1;
}
if (h[v] > mx) {
mx = h[v];
flag = 0;
}
rep(i, G[v].size()) {
if (seen[G[v][i]] == 0) {
dfs(G[v][i]);
}
}
}
int main() {
ll n, m;
cin >> n >> m;
G.resize(n);
seen.resize(n);
h.resize(n);
rep(i, n) { cin >> h[i]; }
rep(i, m) {
ll a, b;
cin >> a >> b;
a--;
b--;
G[a].pb(b);
G[b].pb(a);
}
ll ans = 0;
vector<ll> an(n);
rep(k, n) {
if (an[k] == 0) {
for (ll i : G[k]) {
if (h[k] == h[i]) {
an[k] = 1;
an[i] = 1;
break;
} else if (h[k] < h[i]) {
an[k] = 1;
break;
} else {
an[i] = 1;
}
}
}
}
rep(i, n) {
if (an[i] == 0) {
ans++;
}
}
cout << ans << endl;
return 0;
} | 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;
} else if (H[A] < H[B]) {
check[A] = false;
} else {
check[A] = false;
check[B] = false;
}
}
int cnt = 0;
for (int i = 1; i <= n; i++) {
if (check[i]) {
cnt++;
}
}
cout << cnt << endl;
return 0;
} | #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;
} else if (H[A] < H[B]) {
check[A] = false;
} else {
check[A] = false;
check[B] = false;
}
}
int cnt = 0;
for (int i = 1; i <= n; i++) {
if (check[i]) {
cnt++;
}
}
cout << cnt << endl;
return 0;
} | 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]);
ma[b] = max(ma[b], h[a]);
}
int c = 0;
for (int i = 1; i <= N; i++) {
if (ma[i] < h[i])
c += 1;
}
cout << c << endl;
return 0;
} | #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], h[b]);
ma[b] = max(ma[b], h[a]);
}
int c = 0;
for (int i = 1; i <= N; i++) {
if (ma[i] < h[i])
c += 1;
}
cout << c << endl;
return 0;
} | 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 10005
int h[MAX_N];
vector<int> edge[MAX_N];
int main() {
int n, m;
cin >> n >> m;
rep(i, n) cin >> h[i];
rep(i, m) {
int a, b;
cin >> a >> b;
a--;
b--;
edge[a].push_back(b);
edge[b].push_back(a);
}
int ans = 0;
rep(i, n) {
bool good = true;
rep(j, edge[i].size()) {
if (h[i] <= h[edge[i][j]]) {
good = false;
break;
}
}
ans += good;
}
outl(ans);
return 0;
}
| //
//
#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 100005
int h[MAX_N];
vector<int> edge[MAX_N];
int main() {
int n, m;
cin >> n >> m;
rep(i, n) cin >> h[i];
rep(i, m) {
int a, b;
cin >> a >> b;
a--;
b--;
edge[a].push_back(b);
edge[b].push_back(a);
}
int ans = 0;
rep(i, n) {
bool good = true;
rep(j, edge[i].size()) {
if (h[i] <= h[edge[i][j]]) {
good = false;
break;
}
}
ans += good;
}
outl(ans);
return 0;
}
| 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
#define FIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define Node struct node
#define spc " "
#define E 2.71828182845904523536
#define pb push_back
#define pp pop_back
#define valid(nx, ny) nx >= 0 && nx < n &&ny >= 0 && ny < m
#define ee endl
#define pii pair<int, int>
#define infinity 10000000000000000
#define mod 1000000007
int fx[] = {0, 0, +1, -1};
int fy[] = {+1, -1, 0, 0};
using namespace std;
/// check n=1;
/// check corner case;
const int maX = 1e3 + 1;
vector<ll> Graph[maX], cost[maX];
ll visit[maX];
int main() {
ll n, k, i, j, cc = 0;
cin >> n >> k;
ll ara[n + 1];
for (i = 1; i <= n; i++)
cin >> ara[i];
for (i = 1; i <= k; i++) {
ll x, y;
cin >> x >> y;
Graph[x].pb(y);
Graph[y].pb(x);
}
for (i = 1; i <= n; i++) {
ll l = 0;
for (j = 0; j < Graph[i].size(); j++) {
ll u = Graph[i][j];
if (ara[i] <= ara[u]) {
l = 1;
break;
}
}
if (l == 0)
cc++;
}
cout << cc << endl;
return 0;
}
| /* ______
_______ /\ |``\ | | /
| / \ |__/ |____ |/
| / _ _\ | \ | |\
| / \ | \ |______ | \
Dept. of CSE
Comilla University
*/
#include <bits/stdc++.h>
#define pi 2 * acos(0.0)
#define ll long long
#define FIO \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define Node struct node
#define spc " "
#define E 2.71828182845904523536
#define pb push_back
#define pp pop_back
#define valid(nx, ny) nx >= 0 && nx < n &&ny >= 0 && ny < m
#define ee endl
#define pii pair<int, int>
#define infinity 10000000000000000
#define mod 1000000007
int fx[] = {0, 0, +1, -1};
int fy[] = {+1, -1, 0, 0};
using namespace std;
/// check n=1;
/// check corner case;
const int maX = 1e5 + 1;
vector<ll> Graph[maX], cost[maX];
ll visit[maX];
int main() {
ll n, k, i, j, cc = 0;
cin >> n >> k;
ll ara[n + 1];
for (i = 1; i <= n; i++)
cin >> ara[i];
for (i = 1; i <= k; i++) {
ll x, y;
cin >> x >> y;
Graph[x].pb(y);
Graph[y].pb(x);
}
for (i = 1; i <= n; i++) {
ll l = 0;
for (j = 0; j < Graph[i].size(); j++) {
ll u = Graph[i][j];
if (ara[i] <= ara[u]) {
l = 1;
break;
}
}
if (l == 0)
cc++;
}
cout << cc << endl;
return 0;
}
| 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> ans(n + 1, 1);
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
ans[x] = ans[x] && (a[x] > a[y]);
ans[y] = ans[y] && (a[y] > a[x]);
}
int count = 0;
for (int i = 1; i <= n; i++) {
if (ans[i]) {
count++;
}
}
cout << count;
return 0;
}
| #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> ans(n + 1, 1);
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
ans[x] = ans[x] && (a[x] > a[y]);
ans[y] = ans[y] && (a[y] > a[x]);
}
int count = 0;
for (int i = 1; i <= n; i++) {
if (ans[i]) {
count++;
}
}
cout << count;
return 0;
}
| 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])
Bad[v] = true;
}
int ans = 0;
for (int i = 1; i <= N; ++i)
if (!Bad[i])
ans++;
cout << ans << endl;
return 0;
}
| #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[u])
Bad[v] = true;
}
int ans = 0;
for (int i = 1; i <= N; ++i)
if (!Bad[i])
ans++;
cout << ans << endl;
return 0;
}
| 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, x, y;
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> h[i];
while (m--) {
cin >> x >> y;
if (h[x] <= h[y])
a[x] = 1;
if (h[y] <= h[x])
a[y] = 1;
}
int r = 0;
for (int i = 1; i <= n; i++)
r += (a[i] == 0);
cout << r;
return 0;
} | #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, m, x, y;
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> h[i];
while (m--) {
cin >> x >> y;
if (h[x] <= h[y])
a[x] = 1;
if (h[y] <= h[x])
a[y] = 1;
}
int r = 0;
for (int i = 1; i <= n; i++)
r += (a[i] == 0);
cout << r;
return 0;
} | 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;
}
for (int i = 1; i <= m; i++) {
int a, b;
cin >> a >> b;
ma[a] = max(ma[a], h[b]);
ma[b] = max(ma[b], h[a]);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
if (ma[i] < h[i])
ans++;
}
cout << ans << endl;
return 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] = 0;
}
for (int i = 1; i <= m; i++) {
int a, b;
cin >> a >> b;
ma[a] = max(ma[a], h[b]);
ma[b] = max(ma[b], h[a]);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
if (ma[i] < h[i])
ans++;
}
cout << ans << endl;
return 0;
} | 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;
else
t[j] = 0;
if (a[k] == a[j]) {
t[j] = 0;
t[k] = 0;
}
}
ans = 0;
for (i = 1; i <= n; i++) {
if (t[i])
ans++;
}
cout << ans << endl;
return 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;
else
t[j] = 0;
if (a[k] == a[j]) {
t[j] = 0;
t[k] = 0;
}
}
ans = 0;
for (i = 1; i <= n; i++) {
if (t[i])
ans++;
}
cout << ans << endl;
return 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;
}
vector<bool> g(n, true);
for (int i = 0; i < m; i++) {
if (h[a[i]] <= h[b[i]])
g[a[i]] = false;
if (h[a[i]] >= h[b[i]])
g[b[i]] = false;
}
int ans = 0;
for (int i = 0; i < n; i++)
if (g[i])
ans++;
cout << ans << endl;
return 0;
}
| #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;
}
vector<bool> g(n, true);
for (int i = 0; i < m; i++) {
if (h[a[i]] <= h[b[i]])
g[a[i]] = false;
if (h[a[i]] >= h[b[i]])
g[b[i]] = false;
}
int ans = 0;
for (int i = 0; i < n; i++)
if (g[i])
ans++;
cout << ans << endl;
return 0;
}
| 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];
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
add(a, b);
add(b, a);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
int flag = 1;
for (int j = h[i]; j != -1; j = ne[j]) {
int k = e[j];
if (hh[i] <= hh[k]) {
flag = 0;
break;
}
}
if (flag)
ans++;
}
cout << ans << endl;
} | #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 >> hh[i];
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
add(a, b);
add(b, a);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
int flag = 1;
for (int j = h[i]; j != -1; j = ne[j]) {
int k = e[j];
if (hh[i] <= hh[k]) {
flag = 0;
break;
}
}
if (flag)
ans++;
}
cout << ans << endl;
} | 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]) {
top[b]--;
} else if (height[a] < height[b]) {
top[a]--;
} else {
top[a]--;
top[b]--;
}
}
for (int i = 1; i <= n; i++) {
if (top[i] == 0) {
ans++;
}
}
cout << ans << endl;
return ans;
} | #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]) {
top[b]--;
} else if (height[a] < height[b]) {
top[a]--;
} else {
top[a]--;
top[b]--;
}
}
for (int i = 1; i <= n; i++) {
if (top[i] == 0) {
ans++;
}
}
cout << ans << endl;
return 0;
} | 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 std;
// 素因数分解
vector<pair<long long, long long>> prime_factorize(long long n) {
vector<pair<long long, long long>> res;
for (long long p = 2; p * p <= n; ++p) {
if (n % p != 0)
continue;
int num = 0;
while (n % p == 0) {
++num;
n /= p;
}
res.push_back(make_pair(p, num));
}
if (n != 1)
res.push_back(make_pair(n, 1));
return res;
}
// modint
template <int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
if (val < 0)
val += MOD;
}
constexpr int getmod() { return MOD; }
constexpr Fp operator-() const noexcept { return val ? MOD - val : 0; }
constexpr Fp operator+(const Fp &r) const noexcept { return Fp(*this) += r; }
constexpr Fp operator-(const Fp &r) const noexcept { return Fp(*this) -= r; }
constexpr Fp operator*(const Fp &r) const noexcept { return Fp(*this) *= r; }
constexpr Fp operator/(const Fp &r) const noexcept { return Fp(*this) /= r; }
constexpr Fp &operator+=(const Fp &r) noexcept {
val += r.val;
if (val >= MOD)
val -= MOD;
return *this;
}
constexpr Fp &operator-=(const Fp &r) noexcept {
val -= r.val;
if (val < 0)
val += MOD;
return *this;
}
constexpr Fp &operator/=(const Fp &r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % MOD;
if (val < 0)
val += MOD;
return *this;
}
constexpr bool operator==(const Fp &r) const noexcept {
return this->val == r.val;
}
constexpr bool operator!=(const Fp &r) const noexcept {
return this->val != r.val;
}
friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept {
return os << x.val;
}
friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
// 二項係数ライブラリ
template <class T> struct BiCoef {
vector<T> fact_, inv_, finv_;
constexpr BiCoef() {}
constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
init(n);
}
constexpr void init(int n) noexcept {
fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
int MOD = fact_[0].getmod();
for (int i = 2; i < n; i++) {
fact_[i] = fact_[i - 1] * i;
inv_[i] = -inv_[MOD % i] * (MOD / i);
finv_[i] = finv_[i - 1] * inv_[i];
}
}
constexpr T com(int n, int k) const noexcept {
if (n < k || n < 0 || k < 0)
return 0;
return fact_[n] * finv_[k] * finv_[n - k];
}
constexpr T fact(int n) const noexcept {
if (n < 0)
return 0;
return fact_[n];
}
constexpr T inv(int n) const noexcept {
if (n < 0)
return 0;
return inv_[n];
}
constexpr T finv(int n) const noexcept {
if (n < 0)
return 0;
return finv_[n];
}
};
// 因数分解
long long gcd(long long x, long long y) {
if (y == 0) {
return x;
} else {
return gcd(y, x % y);
}
}
const int MOD = 1000000007;
using mint = Fp<MOD>;
typedef long long unsigned int ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n, m;
cin >> n >> m;
vector<int> h(n);
vector<int> ma(n, 0);
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
rep(i, m) {
int a, b;
cin >> a >> b;
ma[a] = max(ma[a], h[b]);
ma[b] = max(ma[b], h[a]);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
ans += h[i] > ma[i];
}
cout << ans << endl;
return 0;
} | #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 std;
// 素因数分解
vector<pair<long long, long long>> prime_factorize(long long n) {
vector<pair<long long, long long>> res;
for (long long p = 2; p * p <= n; ++p) {
if (n % p != 0)
continue;
int num = 0;
while (n % p == 0) {
++num;
n /= p;
}
res.push_back(make_pair(p, num));
}
if (n != 1)
res.push_back(make_pair(n, 1));
return res;
}
// modint
template <int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
if (val < 0)
val += MOD;
}
constexpr int getmod() { return MOD; }
constexpr Fp operator-() const noexcept { return val ? MOD - val : 0; }
constexpr Fp operator+(const Fp &r) const noexcept { return Fp(*this) += r; }
constexpr Fp operator-(const Fp &r) const noexcept { return Fp(*this) -= r; }
constexpr Fp operator*(const Fp &r) const noexcept { return Fp(*this) *= r; }
constexpr Fp operator/(const Fp &r) const noexcept { return Fp(*this) /= r; }
constexpr Fp &operator+=(const Fp &r) noexcept {
val += r.val;
if (val >= MOD)
val -= MOD;
return *this;
}
constexpr Fp &operator-=(const Fp &r) noexcept {
val -= r.val;
if (val < 0)
val += MOD;
return *this;
}
constexpr Fp &operator/=(const Fp &r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % MOD;
if (val < 0)
val += MOD;
return *this;
}
constexpr bool operator==(const Fp &r) const noexcept {
return this->val == r.val;
}
constexpr bool operator!=(const Fp &r) const noexcept {
return this->val != r.val;
}
friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept {
return os << x.val;
}
friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
// 二項係数ライブラリ
template <class T> struct BiCoef {
vector<T> fact_, inv_, finv_;
constexpr BiCoef() {}
constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
init(n);
}
constexpr void init(int n) noexcept {
fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
int MOD = fact_[0].getmod();
for (int i = 2; i < n; i++) {
fact_[i] = fact_[i - 1] * i;
inv_[i] = -inv_[MOD % i] * (MOD / i);
finv_[i] = finv_[i - 1] * inv_[i];
}
}
constexpr T com(int n, int k) const noexcept {
if (n < k || n < 0 || k < 0)
return 0;
return fact_[n] * finv_[k] * finv_[n - k];
}
constexpr T fact(int n) const noexcept {
if (n < 0)
return 0;
return fact_[n];
}
constexpr T inv(int n) const noexcept {
if (n < 0)
return 0;
return inv_[n];
}
constexpr T finv(int n) const noexcept {
if (n < 0)
return 0;
return finv_[n];
}
};
// 因数分解
long long gcd(long long x, long long y) {
if (y == 0) {
return x;
} else {
return gcd(y, x % y);
}
}
const int MOD = 1000000007;
using mint = Fp<MOD>;
typedef long long unsigned int ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n, m;
cin >> n >> m;
vector<int> h(n + 1);
vector<int> ma(n + 1, 0);
for (int i = 1; i <= n; i++) {
cin >> h[i];
}
rep(i, m) {
int a, b;
cin >> a >> b;
ma[a] = max(ma[a], h[b]);
ma[b] = max(ma[b], h[a]);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
ans += h[i] > ma[i];
}
cout << ans << endl;
return 0;
} | 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 <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define fore(i, a) for (auto &i : a)
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
// clear memory
#define CLR(a) memset((a), 0, sizeof(a))
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
int main() {
int N, M;
cin >> N >> M;
long long H[N], A[M], B[M];
for (int i = 0; i < N; ++i) {
cin >> H[i];
}
vector<vector<long long>> v(M + 1);
for (int i = 0; i < M; ++i) {
cin >> A[i] >> B[i];
A[i] -= 1, B[i] -= 1;
v[A[i]].push_back(B[i]);
v[B[i]].push_back(A[i]);
}
long long good_count = 0;
for (long long i = 0; i < N; ++i) {
bool no_exist = true;
bool all_exist = true;
if (v[i].size() >= 1)
no_exist = false;
for (long long j = 0; j < v[i].size(); ++j) {
if (H[i] <= H[v[i][j]]) {
all_exist = false;
}
}
if (no_exist)
good_count++;
else if (all_exist)
good_count++;
}
cout << good_count;
} | // 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 <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define fore(i, a) for (auto &i : a)
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
// clear memory
#define CLR(a) memset((a), 0, sizeof(a))
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
int main() {
int N, M;
cin >> N >> M;
long long H[N], A[M], B[M];
for (int i = 0; i < N; ++i) {
cin >> H[i];
}
vector<vector<long long>> v(M + 1000);
for (int i = 0; i < M; ++i) {
cin >> A[i] >> B[i];
A[i] -= 1, B[i] -= 1;
v[A[i]].push_back(B[i]);
v[B[i]].push_back(A[i]);
}
long long good_count = 0;
for (long long i = 0; i < N; ++i) {
bool no_exist = true;
bool all_exist = true;
if (v[i].size() >= 1)
no_exist = false;
for (long long j = 0; j < v[i].size(); ++j) {
if (H[i] <= H[v[i][j]]) {
all_exist = false;
}
}
if (no_exist)
good_count++;
else if (all_exist)
good_count++;
}
cout << good_count;
} | 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 = 0;
for (int i = 0; i < N; i++) {
if (ans[i]) {
cnt++;
}
}
cout << cnt << endl;
} | #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;
ans[b - 1] = false;
continue;
}
int X = a - 1;
if (H[a - 1] > H[b - 1]) {
X = b - 1;
}
ans[X] = false;
}
int cnt = 0;
for (int i = 0; i < N; i++) {
if (ans[i]) {
cnt++;
}
}
cout << cnt << endl;
} | 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_back(x);
}
int ans = 0;
for (int i = 0; i < n; i++) {
int maxa = -1;
for (int j = 0; j < g[i].size(); i++) {
maxa = max(maxa, arr[g[i][j]]);
}
if (maxa < arr[i])
ans += 1;
}
cout << ans << endl;
return 0;
} | #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_back(x);
}
int ans = 0;
for (int i = 0; i < n; i++) {
int maxa = -1;
for (int j = 0; j < g[i].size(); j++) {
maxa = max(maxa, arr[g[i][j]]);
}
if (maxa < arr[i])
ans += 1;
}
cout << ans << endl;
return 0;
}
| 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 if (H[A - 1] < H[B - 1]) {
NoGood[A - 1]++;
} else {
NoGood[A - 1]++;
NoGood[B - 1]++;
}
}
int GoodCounter = 0;
for (int i = 0; i < N; i++) {
if (NoGood[i] == 0) {
GoodCounter++;
}
}
cout << GoodCounter << endl;
return 0;
} | #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 if (H[A - 1] < H[B - 1]) {
NoGood[A - 1]++;
} else {
NoGood[A - 1]++;
NoGood[B - 1]++;
}
}
int GoodCounter = 0;
for (int i = 0; i < N; i++) {
if (NoGood[i] == 0) {
GoodCounter++;
}
}
cout << GoodCounter << endl;
return 0;
} | 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 all(a) a.begin(), a.end()
#define P pair<long long, long long>
#define uni(e) e.erase(unique(e.begin(), e.end()), e.end())
#define double long double
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int INF = 1e10;
int MOD = 1e9 + 7;
template <class T> void out(T a) { cout << a << '\n'; }
template <class T> void yesno(T b) {
if (b)
out("yes");
else
out("no");
}
template <class T> void YesNo(T b) {
if (b)
out("Yes");
else
out("No");
}
template <class T> void YESNO(T b) {
if (b)
out("YES");
else
out("NO");
}
template <class T> void noyes(T b) {
if (b)
out("no");
else
out("yes");
}
template <class T> void NoYes(T b) {
if (b)
out("No");
else
out("Yes");
}
template <class T> void NOYES(T b) {
if (b)
out("NO");
else
out("YES");
}
int keta(int a) {
double b = a;
b = log10(b);
int c = b;
return c + 1;
}
int kurai(int a, int b) {
int m = pow(10, b), n = pow(10, b - 1);
return (a % m) / n;
}
int ketawa(int a) {
int k = 0;
rep(i, keta(a)) { k += kurai(a, i + 1); }
return k;
}
int gcd(int a, int b) {
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int mid(int a, int b, int c) {
vector<int> k(3);
k[0] = a;
k[1] = b;
k[2] = c;
sort(all(k));
return k[1];
}
bool sosuu(int a) {
bool b = 1;
if (a <= 1)
return 0;
else {
rep1(i, sqrt(a) - 1) {
if (a % (i + 1) == 0)
b = 0;
}
return b;
}
}
int modpow(int a, int b, int m = MOD) {
if (!b)
return 1;
if (b & 1)
return modpow(a, b - 1, m) * a % m;
int memo = modpow(a, b >> 1, m);
return memo * memo % m;
}
int fact_mod(int n) {
int f = 1;
for (int i = 2; i < n + 1; i++)
f = f * (i % MOD) % MOD;
return f;
}
int mod_pow(int x, int n) {
int res = 1;
while (n > 0) {
if (n & 1)
res = (res * x) % MOD;
x = (x * x) % MOD;
n >>= 1;
}
return res;
}
int c_mod(int n, int r) {
if (r > n - r)
r = n - r;
if (r == 0)
return 1;
int a = 1;
rep(i, r) a = a * ((n - i) % MOD) % MOD;
int b = mod_pow(fact_mod(r), MOD - 2);
return (a % MOD) * (b % MOD) % MOD;
}
signed main() {
int a, b;
cin >> a >> b;
vector<int> c(a), d(b), e(b), f(a, 1);
rep(i, a) cin >> c[i];
rep(i, b) cin >> d[i] >> e[i];
rep(i, b) {
if (c[d[i - 1]] <= c[e[i - 1]])
f[d[i - 1]] = 0;
if (c[e[i - 1]] <= c[d[i - 1]])
f[e[i - 1]] = 0;
}
int h = 0;
rep(i, a) {
if (f[i])
h++;
}
out(h);
}
| #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 all(a) a.begin(), a.end()
#define P pair<long long, long long>
#define uni(e) e.erase(unique(e.begin(), e.end()), e.end())
#define double long double
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int INF = 1e10;
int MOD = 1e9 + 7;
template <class T> void out(T a) { cout << a << '\n'; }
template <class T> void yesno(T b) {
if (b)
out("yes");
else
out("no");
}
template <class T> void YesNo(T b) {
if (b)
out("Yes");
else
out("No");
}
template <class T> void YESNO(T b) {
if (b)
out("YES");
else
out("NO");
}
template <class T> void noyes(T b) {
if (b)
out("no");
else
out("yes");
}
template <class T> void NoYes(T b) {
if (b)
out("No");
else
out("Yes");
}
template <class T> void NOYES(T b) {
if (b)
out("NO");
else
out("YES");
}
int keta(int a) {
double b = a;
b = log10(b);
int c = b;
return c + 1;
}
int kurai(int a, int b) {
int m = pow(10, b), n = pow(10, b - 1);
return (a % m) / n;
}
int ketawa(int a) {
int k = 0;
rep(i, keta(a)) { k += kurai(a, i + 1); }
return k;
}
int gcd(int a, int b) {
if (a % b == 0)
return b;
return gcd(b, a % b);
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int mid(int a, int b, int c) {
vector<int> k(3);
k[0] = a;
k[1] = b;
k[2] = c;
sort(all(k));
return k[1];
}
bool sosuu(int a) {
bool b = 1;
if (a <= 1)
return 0;
else {
rep1(i, sqrt(a) - 1) {
if (a % (i + 1) == 0)
b = 0;
}
return b;
}
}
int modpow(int a, int b, int m = MOD) {
if (!b)
return 1;
if (b & 1)
return modpow(a, b - 1, m) * a % m;
int memo = modpow(a, b >> 1, m);
return memo * memo % m;
}
int fact_mod(int n) {
int f = 1;
for (int i = 2; i < n + 1; i++)
f = f * (i % MOD) % MOD;
return f;
}
int mod_pow(int x, int n) {
int res = 1;
while (n > 0) {
if (n & 1)
res = (res * x) % MOD;
x = (x * x) % MOD;
n >>= 1;
}
return res;
}
int c_mod(int n, int r) {
if (r > n - r)
r = n - r;
if (r == 0)
return 1;
int a = 1;
rep(i, r) a = a * ((n - i) % MOD) % MOD;
int b = mod_pow(fact_mod(r), MOD - 2);
return (a % MOD) * (b % MOD) % MOD;
}
signed main() {
int a, b;
cin >> a >> b;
vector<int> c(a), d(b), e(b), f(a, 1);
rep(i, a) cin >> c[i];
rep(i, b) cin >> d[i] >> e[i];
rep(i, b) {
if (c[d[i] - 1] <= c[e[i] - 1])
f[d[i] - 1] = 0;
if (c[e[i] - 1] <= c[d[i] - 1])
f[e[i] - 1] = 0;
}
int h = 0;
rep(i, a) {
if (f[i])
h++;
}
out(h);
}
| 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: attempt to subscript container with out-of-bounds index -1, but
container only holds 3 elements.
Objects involved in the operation:
sequence "this" @ 0x7ffcba14b330 {
type = std::debug::vector<long long, std::allocator<long long> >;
}
|
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) cout << fixed << setprecision(x)
using namespace std;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<vi> Graph;
// 条件式 ? 真の場合の文 : 偽の場合の文
// abs(x) = (x の絶対値)
// string S S,at(i),S += T,S += c,S.size(),S.substr(l)l文字目から最後まで,
/// S.substr(l, r)l文字目からl+r-1文字目 n文字目から0個で空列を返せる
//*min_element(all(x)) *max_element(all(x))
// vi x; x.back(),x.front(),x.push_back(),x.pop_back()
// swap(a, b)
// gcd(a, b)最大公約数
// sort(all(x)),reverse(all(x)),sort(x.begin()+l,a.begin()+r)lからrまで
// stack<int> a; a.push(x),a.pop(),a.top(),a.empty()bool
// queue<int> b; b.push(x),b.pop(),b.front(),b.empty()bool,b.size()
// 要素が小さい順 priority_queue<int, vector<int>, greater<int>> c,c.top()
// map<int, int> M1; 変数[key] = value; 変数.erase(key); 変数.at(key);
// 変数.count(key)所属判定 変数.size() find(all(x),
// key)boolソート済みのベクトル
//*lower_bound(all(x),k)以上の最小の要素,*uppper_bound(all(x),k)より大きい最小の要素
// char('0'+cnt) 数字cntからcharへの変換
// int(char-'0') charからintへの変換
int main() {
int n, m;
cin >> n >> m;
vi h(n);
rep(i, n) { cin >> h.at(i); }
vb ok(n, true);
rep(i, m) {
int a, b;
cin >> a >> b;
a--;
b--;
if (!ok.at(i))
continue;
if (h.at(a) <= h.at(b))
ok.at(a) = false;
if (h.at(a) >= h.at(b))
ok.at(b) = false;
}
cout << count(all(ok), true) << endl;
}
| #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) cout << fixed << setprecision(x)
using namespace std;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<vi> Graph;
// 条件式 ? 真の場合の文 : 偽の場合の文
// abs(x) = (x の絶対値)
// string S S,at(i),S += T,S += c,S.size(),S.substr(l)l文字目から最後まで,
/// S.substr(l, r)l文字目からl+r-1文字目 n文字目から0個で空列を返せる
//*min_element(all(x)) *max_element(all(x))
// vi x; x.back(),x.front(),x.push_back(),x.pop_back()
// swap(a, b)
// gcd(a, b)最大公約数
// sort(all(x)),reverse(all(x)),sort(x.begin()+l,a.begin()+r)lからrまで
// stack<int> a; a.push(x),a.pop(),a.top(),a.empty()bool
// queue<int> b; b.push(x),b.pop(),b.front(),b.empty()bool,b.size()
// 要素が小さい順 priority_queue<int, vector<int>, greater<int>> c,c.top()
// map<int, int> M1; 変数[key] = value; 変数.erase(key); 変数.at(key);
// 変数.count(key)所属判定 変数.size() find(all(x),
// key)boolソート済みのベクトル
//*lower_bound(all(x),k)以上の最小の要素,*uppper_bound(all(x),k)より大きい最小の要素
// char('0'+cnt) 数字cntからcharへの変換
// int(char-'0') charからintへの変換
int main() {
int n, m;
cin >> n >> m;
vi h(n);
rep(i, n) { cin >> h.at(i); }
vb ok(n, true);
rep(i, m) {
int a, b;
cin >> a >> b;
a--;
b--;
if (h.at(a) <= h.at(b))
ok.at(a) = false;
if (h.at(a) >= h.at(b))
ok.at(b) = false;
}
cout << count(all(ok), true) << endl;
}
| 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;
int main() {
cin >> n >> m;
rep(i, n) { scanf("%lld", &h[i + 1]); }
rep(i, m) { scanf("%lld %lld", &a[i], &b[i]); }
rep(i, m) {
score[a[i]] = max(score[a[i]], h[b[i]]);
score[b[i]] = max(score[b[i]], h[a[i]]);
}
reps(i, 1, n + 1) {
if (score[i] < h[i])
ans++;
}
printf("%lld\n", ans);
}
| // 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 = 0;
int main() {
cin >> n >> m;
rep(i, n) { scanf("%lld", &h[i + 1]); }
rep(i, m) { scanf("%lld %lld", &a[i], &b[i]); }
rep(i, m) {
score[a[i]] = max(score[a[i]], h[b[i]]);
score[b[i]] = max(score[b[i]], h[a[i]]);
}
reps(i, 1, n + 1) {
if (score[i] < h[i])
ans++;
}
printf("%lld\n", ans);
}
| 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], high[a]);
}
int res = 0;
for (int i = 1; i <= N; i++) {
if (high[i] > ma[i])
res++;
}
cout << res << endl;
return 0;
} | #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]);
}
int res = 0;
for (int i = 1; i <= N; i++) {
if (high[i] > ma[i])
res++;
}
cout << res << endl;
return 0;
} | 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 i = 1; i <= m; i++) {
scanf("%d %d", &x, &y);
gr[x].push_back(y);
gr[y].push_back(x);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
bool io = true;
for (auto it : gr[i]) {
if (h[i] <= h[it]) {
io = false;
break;
}
}
if (io)
ans++;
}
printf("%d", ans);
} | #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 (int i = 1; i <= m; i++) {
scanf("%d %d", &x, &y);
gr[x].push_back(y);
gr[y].push_back(x);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
bool io = true;
for (auto it : gr[i]) {
if (h[i] <= h[it]) {
io = false;
break;
}
}
if (io)
ans++;
}
printf("%d", ans);
} | 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;
vector<int> h(n);
vector<vector<pair<int, int>>> road(m);
FOR(i, 0, n) { cin >> h[i]; }
FOR(i, 0, m) {
int a, b;
cin >> a >> b;
road[a - 1].push_back(make_pair(a - 1, b - 1));
road[b - 1].push_back(make_pair(b - 1, a - 1));
}
int ans = 0;
FOR(i, 0, n) {
bool flag = true;
FOR(j, 0, road[i].size()) {
if (h[i] <= h[road[i][j].second]) {
flag = false;
break;
}
}
if (flag) {
ans++;
}
}
cout << ans << endl;
return 0;
} | #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;
vector<int> h(n);
vector<vector<pair<int, int>>> road(n);
FOR(i, 0, n) { cin >> h[i]; }
FOR(i, 0, m) {
int a, b;
cin >> a >> b;
road[a - 1].push_back(make_pair(a - 1, b - 1));
road[b - 1].push_back(make_pair(b - 1, a - 1));
}
int ans = 0;
FOR(i, 0, n) {
bool flag = true;
FOR(j, 0, road[i].size()) {
if (h[i] <= h[road[i][j].second]) {
flag = false;
break;
}
}
if (flag) {
ans++;
}
}
cout << ans << endl;
return 0;
} | 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;
vec[x].push_back(y);
vec[y].push_back(x);
}
int cnt = 0;
for (int i = 1; i <= n; i++) {
int flag = 0;
for (auto x : vec[i]) {
if (hei[i] <= hei[x]) {
flag = 1;
break;
}
}
if (flag == 0)
cnt++;
}
cout << cnt << endl;
return 0;
}
| #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;
vec[x].push_back(y);
vec[y].push_back(x);
}
int cnt = 0;
for (int i = 1; i <= n; i++) {
int flag = 0;
for (auto x : vec[i]) {
if (hei[i] <= hei[x]) {
flag = 1;
break;
}
}
if (flag == 0)
cnt++;
}
cout << cnt << endl;
return 0;
}
| 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));
count.at(c)++;
}
ll ans = 0;
for (ll i = 0; i < N; i++) {
if (count.at(i) == 0) {
ans++;
}
}
cout << ans << endl;
} | #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)) {
count.at(a - 1)++;
} else if (h.at(a - 1) == h.at(b - 1)) {
count.at(a - 1)++;
count.at(b - 1)++;
} else {
count.at(b - 1)++;
}
}
ll ans = 0;
for (ll i = 0; i < N; i++) {
if (count.at(i) == 0) {
ans++;
}
}
cout << ans << endl;
} | 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++) {
int r = 0;
for (int x : G[i]) {
if (h[i] <= h[x])
r++;
}
if (r == 0)
count++;
}
cout << count << endl;
} | #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);
}
for (int i = 0; i < n; i++) {
int r = 0;
for (int x : G[i]) {
if (h[i] <= h[x])
r++;
}
if (r == 0)
count++;
}
cout << count << endl;
} | 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())
#define ub(v, k) (upper_bound(all(v), k) - v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T, vector<T>, greater<T>>
using ll = long long;
using P = pair<ll, ll>;
using PP = tuple<ll, ll, ll>;
using S = multiset<ll>;
using vi = vector<ll>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
const ll inf = 1001001001001001;
const int INF = 1001001001;
const int mod = 1000000007;
const double eps = 1e-10;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> void out(T a) { cout << a << '\n'; }
template <class T> void outp(T a) {
cout << '(' << a.fi << ',' << a.se << ')' << '\n';
}
template <class T> void outvp(T v) {
rep(i, v.size()) cout << '(' << v[i].fi << ',' << v[i].se << ')';
cout << '\n';
}
template <class T> void outv(T v) {
rep(i, v.size()) {
if (i)
cout << ' ';
cout << v[i];
}
cout << '\n';
}
template <class T> void outvv(T v) { rep(i, v.size()) outv(v[i]); }
template <class T> bool isin(T x, T l, T r) { return (l) <= (x) && (x) <= (r); }
template <class T> void YesNo(T b) {
if (b)
out("Yes");
else
out("No");
}
void decimal(int x) { cout << fixed << setprecision(x); }
// ll GCD(ll a,ll b){if(b==0) return a; return GCD(b,a%b);}
// ll LCM(ll a,ll b){return(a/GCD(a,b))*(b/GCD(a,b))*GCD(a,b);}
ll POW(ll a, ll b) {
a %= mod;
if (b == 0)
return 1;
if (b & 1)
return a * POW(a, b - 1) % mod;
ll k = POW(a, b / 2);
return k * k % mod;
}
vi calc(ll x) {
vi res;
while (x > 0) {
res.eb(x % 10);
x /= 10;
}
reverse(all(res));
return res;
}
void solve() {
ll n, m;
cin >> n >> m;
vi h(n);
rep(i, n) cin >> h[i];
vi a(m), b(m);
rep(i, m) cin >> a[i] >> b[i];
vi p(n, 0);
vector<bool> q(n, true);
rep(i, n) {
q[a[i] - 1] = false;
q[b[i] - 1] = false;
chmax(p[a[i] - 1], h[b[i] - 1]);
chmax(p[b[i] - 1], h[a[i] - 1]);
}
ll ans = 0;
rep(i, n) {
if (h[i] > p[i])
ans++;
else if (q[i])
ans++;
}
out(ans);
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
}
| #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())
#define ub(v, k) (upper_bound(all(v), k) - v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T, vector<T>, greater<T>>
using ll = long long;
using P = pair<ll, ll>;
using PP = tuple<ll, ll, ll>;
using S = multiset<ll>;
using vi = vector<ll>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
const ll inf = 1001001001001001;
const int INF = 1001001001;
const int mod = 1000000007;
const double eps = 1e-10;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> void out(T a) { cout << a << '\n'; }
template <class T> void outp(T a) {
cout << '(' << a.fi << ',' << a.se << ')' << '\n';
}
template <class T> void outvp(T v) {
rep(i, v.size()) cout << '(' << v[i].fi << ',' << v[i].se << ')';
cout << '\n';
}
template <class T> void outv(T v) {
rep(i, v.size()) {
if (i)
cout << ' ';
cout << v[i];
}
cout << '\n';
}
template <class T> void outvv(T v) { rep(i, v.size()) outv(v[i]); }
template <class T> bool isin(T x, T l, T r) { return (l) <= (x) && (x) <= (r); }
template <class T> void YesNo(T b) {
if (b)
out("Yes");
else
out("No");
}
void decimal(int x) { cout << fixed << setprecision(x); }
// ll GCD(ll a,ll b){if(b==0) return a; return GCD(b,a%b);}
// ll LCM(ll a,ll b){return(a/GCD(a,b))*(b/GCD(a,b))*GCD(a,b);}
ll POW(ll a, ll b) {
a %= mod;
if (b == 0)
return 1;
if (b & 1)
return a * POW(a, b - 1) % mod;
ll k = POW(a, b / 2);
return k * k % mod;
}
vi calc(ll x) {
vi res;
while (x > 0) {
res.eb(x % 10);
x /= 10;
}
reverse(all(res));
return res;
}
void solve() {
ll n, m;
cin >> n >> m;
vi h(n);
rep(i, n) cin >> h[i];
vi a(m), b(m);
rep(i, m) cin >> a[i] >> b[i];
vi p(n, 0);
vector<bool> q(n, true);
rep(i, m) {
q[a[i] - 1] = false;
q[b[i] - 1] = false;
chmax(p[a[i] - 1], h[b[i] - 1]);
chmax(p[b[i] - 1], h[a[i] - 1]);
}
ll ans = 0;
rep(i, n) {
if (h[i] > p[i])
ans++;
else if (q[i])
ans++;
}
out(ans);
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
}
| 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;
--a;
--b;
if (h[a] <= h[b])
ok[a] = false;
if (h[b] <= h[a])
ok[b] = false;
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (ok[i])
ans++;
}
cout << ans << endl;
return 0;
} | #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;
--a;
--b;
if (h[a] <= h[b])
ok[a] = false;
if (h[b] <= h[a])
ok[b] = false;
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (ok[i])
ans++;
}
cout << ans << endl;
return 0;
} | 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);
vector<int> h(n);
rep(i, n) cin >> h[i];
rep(i, m) {
int a, b;
cin >> a >> b;
--a;
--b;
to[a].push_back(b);
to[b].push_back(a);
}
int ans = 0;
rep(i, n) {
bool ok = true;
for (int v : to[i]) {
if (h[i] <= h[v]) {
ok = false;
}
}
if (ok)
ans++;
}
cout << ans << endl;
} | #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);
vector<int> h(n);
rep(i, n) cin >> h[i];
rep(i, m) {
int a, b;
cin >> a >> b;
--a;
--b;
to[a].push_back(b);
to[b].push_back(a);
}
int ans = 0;
rep(i, n) {
bool ok = true;
for (int v : to[i]) {
if (h[i] <= h[v]) {
ok = false;
}
}
if (ok)
ans++;
}
cout << ans << endl;
} | 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 long Answer = 0;
for (int i = 1; i <= 50; i++) Answer += cnt[i] * cnt[101 - i];
cout << Answer << endl;
*/
int N, M;
scanf("%d %d", &N, &M);
int *H;
int *flag;
int *A;
int *B;
H = (int *)malloc(sizeof(int));
flag = (int *)malloc(sizeof(int));
A = (int *)malloc(sizeof(int));
B = (int *)malloc(sizeof(int));
int count = 0;
for (int i = 1; i <= N; i++) {
scanf("%d", &H[i]);
flag[i] = 0;
}
for (int i = 1; i <= M; i++) {
scanf("%d %d", &A[i], &B[i]);
}
for (int i = 1; i <= M; i++) {
if (H[A[i]] < H[B[i]]) {
flag[A[i]] = 1;
} else if (H[A[i]] == H[B[i]]) {
flag[A[i]] = 1;
flag[B[i]] = 1;
} else
flag[B[i]] = 1;
}
for (int i = 1; i <= N; i++) {
if (flag[i] == 0)
count++;
}
printf("%d\n", count);
return 0;
} | #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 long Answer = 0;
for (int i = 1; i <= 50; i++) Answer += cnt[i] * cnt[101 - i];
cout << Answer << endl;
*/
int N, M;
scanf("%d %d", &N, &M);
int H[SIZE];
int flag[SIZE];
int A[SIZE];
int B[SIZE];
// H = (int*)malloc(sizeof(int));
// flag = (int*)malloc(sizeof(int));
// A = (int*)malloc(sizeof(int));
// B = (int*)malloc(sizeof(int));
int count = 0;
for (int i = 1; i <= N; i++) {
scanf("%d", &H[i]);
flag[i] = 0;
}
for (int i = 1; i <= M; i++) {
scanf("%d %d", &A[i], &B[i]);
}
for (int i = 1; i <= M; i++) {
if (H[A[i]] < H[B[i]]) {
flag[A[i]] = 1;
} else if (H[A[i]] == H[B[i]]) {
flag[A[i]] = 1;
flag[B[i]] = 1;
} else
flag[B[i]] = 1;
}
for (int i = 1; i <= N; i++) {
if (flag[i] == 0)
count++;
}
printf("%d\n", count);
return 0;
} | 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 - 1] > h[b - 1])
ma[b - 1] = 0;
else {
ma[a - 1] = 0;
ma[b - 1] = 0;
}
}
int ans = 0;
for (int k = 0; k < n; k++) {
if (ma[k] == 1)
ans++;
}
cout << ans << endl;
} | #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[a - 1] > h[b - 1])
ma[b - 1] = 0;
else {
ma[a - 1] = 0;
ma[b - 1] = 0;
}
}
int ans = 0;
for (int k = 0; k < n; k++) {
if (ma[k] == 1)
ans++;
}
cout << ans << endl;
} | 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]) {
if (!used[e])
dfs(e);
}
}
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++)
cin >> d[i + 1];
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
gr[u].pb(v);
gr[v].pb(u);
}
for (int i = 1; i <= n; i++) {
if (!used[i])
dfs(i);
}
cout << cnt;
return 0;
}
| #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]) {
if (!used[e])
dfs(e);
}
}
int main() {
int n, m;
cin >> n >> m;
for (int i = 0; i < n; i++)
cin >> d[i + 1];
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
gr[u].pb(v);
gr[v].pb(u);
}
for (int i = 1; i <= n; i++) {
if (!used[i])
dfs(i);
}
cout << cnt;
return 0;
}
| 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) {
if (b & 1)
ans = ans * a % p;
b >>= 1;
a = a * a % p;
}
return ans;
}
LL gcd(LL a, LL b) { return b == 0 ? a : gcd(b, a % b); }
int n, m, h[10010];
vector<int> ver[10010];
void solve() {
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%d", h + i);
}
for (int i = 1; i <= m; i++) {
int a, b;
scanf("%d %d", &a, &b);
ver[a].pb(b);
ver[b].pb(a);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
bool ok = 1;
for (auto to : ver[i]) {
if (h[to] >= h[i]) {
ok = 0;
break;
}
}
if (ok)
ans++;
}
printf("%d\n", ans);
}
int main() {
int T = 1;
// scanf("%d", &T);
while (T--)
solve();
return 0;
} | // 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) {
if (b & 1)
ans = ans * a % p;
b >>= 1;
a = a * a % p;
}
return ans;
}
LL gcd(LL a, LL b) { return b == 0 ? a : gcd(b, a % b); }
int n, m, h[100010];
vector<int> ver[100010];
void solve() {
scanf("%d %d", &n, &m);
for (int i = 1; i <= n; i++) {
scanf("%d", h + i);
}
for (int i = 1; i <= m; i++) {
int a, b;
scanf("%d %d", &a, &b);
ver[a].pb(b);
ver[b].pb(a);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
bool ok = 1;
for (auto to : ver[i]) {
if (h[to] >= h[i]) {
ok = 0;
break;
}
}
if (ok)
ans++;
}
printf("%d\n", ans);
}
int main() {
int T = 1;
// scanf("%d", &T);
while (T--)
solve();
return 0;
} | 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 (int i = 0; i < 1000; i++) {
for (int j = 0; j < M; j++) {
if (H[A[j]] > H[B[j]]) {
H[B[j]] = H[A[j]];
flag[B[j]] = false;
}
if (H[B[j]] > H[A[j]]) {
H[A[j]] = H[B[j]];
flag[A[j]] = false;
}
}
for (int j = M - 1; j >= 0; j--) {
if (H[A[j]] > H[B[j]]) {
H[B[j]] = H[A[j]];
flag[B[j]] = false;
}
if (H[B[j]] > H[A[j]]) {
H[A[j]] = H[B[j]];
flag[A[j]] = false;
}
}
}
int res = 0;
for (int i = 0; i < N; i++) {
if (flag[i] == true)
res++;
}
cout << res << endl;
} | #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 (int i = 0; i < M; i++) {
if (H[A[i] - 1] >= H[B[i] - 1])
flag[B[i] - 1] = false;
if (H[B[i] - 1] >= H[A[i] - 1])
flag[A[i] - 1] = false;
}
int res = 0;
for (int i = 0; i < N; i++) {
if (flag[i] == true)
res++;
}
cout << res << endl;
}
| 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(' ') << std::right << setw(num)
#define ALL(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
int main() {
int n, m, h[114514810], ma[114514810];
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> h[i];
ma[i] = 0;
}
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
ma[a] = max(ma[a], h[b]);
ma[b] = max(ma[b], h[a]);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
ans += h[i] > ma[i];
}
cout << ans << endl;
} | #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(' ') << std::right << setw(num)
#define ALL(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
int main() {
int n, m, h[114514], ma[114514];
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> h[i];
ma[i] = 0;
}
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
ma[a] = max(ma[a], h[b]);
ma[b] = max(ma[b], h[a]);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
ans += h[i] > ma[i];
}
cout << ans << endl;
} | 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 = 0; i < n; i++) {
good[i] = 1;
}
// iはi番目の展望台の探索
for (int i = 0; i < n; i++) {
for (int j = 0; j < 2 * m; j += 2) {
if (i == ab[j] - 1) {
if (h[ab[j] - 1] < h[ab[j + 1] - 1] ||
h[ab[j] - 1] == h[ab[j + 1] - 1]) {
good[i] = 0;
}
if (h[ab[j] - 1] > h[ab[j + 1] - 1] ||
h[ab[j] - 1] == h[ab[j + 1] - 1]) {
good[ab[j + 1] - 1] = 0;
}
}
}
}
int ans = 0;
for (int i = 0; i < n; i++) {
ans += good[i];
}
cout << ans << endl;
} | #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 = 0; i < n; i++) {
good[i] = 1;
}
// iはi番目の展望台の探索
for (int i = 0; i < 2 * m; i += 2) {
if (good[ab[i] - 1] == 0 && good[ab[i + 1] - 1] == 0) {
continue;
}
if (h[ab[i] - 1] > h[ab[i + 1] - 1]) {
good[ab[i + 1] - 1] = 0;
} else if (h[ab[i] - 1] < h[ab[i + 1] - 1]) {
good[ab[i] - 1] = 0;
} else {
good[ab[i] - 1] = 0;
good[ab[i + 1] - 1] = 0;
}
}
int ans = 0;
for (int i = 0; i < n; i++) {
ans += good[i];
}
cout << ans << endl;
} | 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;
cin >> u >> v;
u--;
v--;
adj[u].insert(h[v]);
adj[v].insert(h[u]);
}
int ans = 0;
for (int i = 0; i < n; ++i) {
auto it = adj[i].end();
it--; // largest element
ans += (h[i] > *it);
}
cout << ans;
return 0;
} | #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;
cin >> u >> v;
u--;
v--;
adj[u].insert(h[v]);
adj[v].insert(h[u]);
}
int ans = 0;
for (int i = 0; i < n; ++i) {
if (adj[i].empty()) {
ans++;
continue;
}
auto it = adj[i].end();
it--; // largest element
ans += (h[i] > *it);
}
cout << ans;
return 0;
} | 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>
int main() {
ll int n, m;
cin >> n >> m;
vl h(n);
rep(i, n) cin >> h[i];
vl a(m), b(m);
rep(i, m) cin >> a[i] >> b[i];
vector<vector<int>> net(n);
rep(i, m) {
net[a[i] - 1].push_back(b[i] - 1);
net[b[i] - 1].push_back(a[i] - 1);
}
rep(i, m) { sort(all(net[i])); }
int ans = 0;
rep(i, n) {
ll int hi = h[i];
int flag = 0;
int ini;
if (net[i].size() > 0) {
ini = net[i][0];
for (long unsigned int j = 0; j < net[i].size(); j++) {
if (j != 0 && ini == net[i][j])
continue;
if (hi <= h[net[i][j]]) {
ini = net[i][j];
flag = 1;
}
}
}
if (flag == 0)
ans++;
}
cout << ans << endl;
}
| #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>
int main() {
ll int n, m;
cin >> n >> m;
vl h(n);
rep(i, n) cin >> h[i];
vl a(m), b(m);
rep(i, m) cin >> a[i] >> b[i];
vector<vector<int>> net(n);
rep(i, m) {
net[a[i] - 1].push_back(b[i] - 1);
net[b[i] - 1].push_back(a[i] - 1);
}
rep(i, n) { sort(all(net[i])); }
int ans = 0;
rep(i, n) {
ll int hi = h[i];
int flag = 0;
int ini;
if (net[i].size() > 0) {
ini = net[i][0];
for (long unsigned int j = 0; j < net[i].size(); j++) {
if (j != 0 && ini == net[i][j])
continue;
if (hi <= h[net[i][j]]) {
ini = net[i][j];
flag = 1;
}
}
}
if (flag == 0)
ans++;
}
cout << ans << endl;
}
| 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() {
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
ios::sync_with_stdio(false);
init();
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;
insert(u, v);
insert(v, u);
}
int cnt = 0;
for (int i = 1; i <= n; i++) {
int maxn = -1;
for (int j = p[i]; j != -1; j = e[j].next) {
int v = e[j].v;
maxn = max(maxn, h[v]);
}
if (h[i] > maxn) {
cnt++;
}
}
cout << cnt << endl;
return 0;
} | #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() {
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
ios::sync_with_stdio(false);
init();
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;
insert(u, v);
insert(v, u);
}
int cnt = 0;
for (int i = 1; i <= n; i++) {
int maxn = -1;
for (int j = p[i]; j != -1; j = e[j].next) {
int v = e[j].v;
maxn = max(maxn, h[v]);
}
if (h[i] > maxn) {
cnt++;
}
}
cout << cnt << endl;
return 0;
} | 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>> path(N, vector<int>(M));
rep(i, M) { cin >> A.at(i) >> B.at(i); }
rep(i, N) { NN.at(i) = 1; }
rep(i, M) {
if (H.at(A.at(i) - 1) > H.at(B.at(i) - 1)) {
NN.at(B.at(i) - 1) = 0;
} else if (H.at(A.at(i) - 1) == H.at(B.at(i) - 1)) {
NN.at(B.at(i) - 1) = 0;
NN.at(A.at(i) - 1) = 0;
} else {
NN.at(A.at(i) - 1) = 0;
}
}
int sum = 0;
rep(i, N) {
if (NN.at(i) == 1) {
sum++;
}
}
cout << sum;
return 0;
}
| #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 >> A.at(i) >> B.at(i); }
rep(i, N) { NN.at(i) = 1; }
rep(i, M) {
if (H.at(A.at(i) - 1) > H.at(B.at(i) - 1)) {
NN.at(B.at(i) - 1) = 0;
} else if (H.at(A.at(i) - 1) == H.at(B.at(i) - 1)) {
NN.at(B.at(i) - 1) = 0;
NN.at(A.at(i) - 1) = 0;
} else {
NN.at(A.at(i) - 1) = 0;
}
}
int sum = 0;
rep(i, N) {
if (NN.at(i) == 1) {
sum++;
}
}
cout << sum;
return 0;
}
| 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);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
return vec;
}
void output(vector<int> vec) {
for (int i = 0; i < vec.size(); i++) {
cout << vec[i] << " ";
}
return;
}
vector<vector<int>> input(int n, int m) {
vector<vector<int>> table(n, vector<int>(m));
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> table.at(i).at(j);
}
}
return table;
}
void output(vector<vector<int>> table) {
for (int i = 0; i < table.size(); i++) {
for (int j = 0; j < table.at(0).size(); j++) {
cout << table.at(i).at(j) << " ";
}
cout << endl;
}
}
long long perm(int n, int r) {
if (n < r) {
cout << "error" << endl;
return 0;
}
long long perm = 1;
for (int i = n; i > n - r; i--) {
perm *= i;
}
return perm;
}
long long comb(int n, int r) {
if (n < r) {
cout << "error" << endl;
return 0;
}
long long comb = perm(n, r);
for (int i = r; i > 0; i--) {
comb /= i;
}
return comb;
}
long long homo(int n, int r) { return comb(n + r - 1, n - 1); }
long long fact(int n) {
long long fact = 1;
for (int i = n; i > 0; i--) {
fact *= i;
}
return fact;
}
int gcd(int a, int b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
int lcm(int a, int b) { return a * b / gcd(a, b); }
bool isprime(int n) {
if (n < 2)
return false;
else if (n == 2)
return true;
else if (n % 2 == 0)
return false;
for (int i = 3; i <= sqrt(n); i += 2) {
if (n % i == 0) {
return false;
}
}
return true;
}
vector<long long> divisors(long long N) {
vector<long long> res;
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
res.push_back(i);
// 重複しないならば i の相方である N/i も push
if (N / i != i)
res.push_back(N / i);
}
}
// 小さい順に並び替える
sort(res.begin(), res.end());
return res;
/*long long N;
cin >> N;
vector<long long> res = divisors(N);
for (int i = 0; i < res.size(); ++i) {
cout << res[i] << " ";
}
cout << endl;*/
}
vector<pair<long long, long long>> prime_factorize(long long N) {
vector<pair<long long, long long>> res;
for (long long a = 2; a * a <= N; ++a) {
if (N % a != 0)
continue;
long long ex = 0;
while (N % a == 0) {
++ex;
N /= a;
}
res.push_back({a, ex});
}
if (N != 1)
res.push_back({N, 1});
return res;
}
void sayYes(bool f) {
if (f) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
void sayYES(bool f) {
if (f) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
int main() {
int n, m;
cin >> n >> m;
vector<int> h(n);
vector<int> ma(n);
for (int i = 1; i <= n; i++) {
cin >> h[i];
ma[i] = 0;
}
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
ma[a] = max(ma[a], h[b]);
ma[b] = max(ma[b], h[a]);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
if (h[i] > ma[i]) {
ans++;
}
}
cout << ans << endl;
} | #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);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
return vec;
}
void output(vector<int> vec) {
for (int i = 0; i < vec.size(); i++) {
cout << vec[i] << " ";
}
return;
}
vector<vector<int>> input(int n, int m) {
vector<vector<int>> table(n, vector<int>(m));
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
cin >> table.at(i).at(j);
}
}
return table;
}
void output(vector<vector<int>> table) {
for (int i = 0; i < table.size(); i++) {
for (int j = 0; j < table.at(0).size(); j++) {
cout << table.at(i).at(j) << " ";
}
cout << endl;
}
}
long long perm(int n, int r) {
if (n < r) {
cout << "error" << endl;
return 0;
}
long long perm = 1;
for (int i = n; i > n - r; i--) {
perm *= i;
}
return perm;
}
long long comb(int n, int r) {
if (n < r) {
cout << "error" << endl;
return 0;
}
long long comb = perm(n, r);
for (int i = r; i > 0; i--) {
comb /= i;
}
return comb;
}
long long homo(int n, int r) { return comb(n + r - 1, n - 1); }
long long fact(int n) {
long long fact = 1;
for (int i = n; i > 0; i--) {
fact *= i;
}
return fact;
}
int gcd(int a, int b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
int lcm(int a, int b) { return a * b / gcd(a, b); }
bool isprime(int n) {
if (n < 2)
return false;
else if (n == 2)
return true;
else if (n % 2 == 0)
return false;
for (int i = 3; i <= sqrt(n); i += 2) {
if (n % i == 0) {
return false;
}
}
return true;
}
vector<long long> divisors(long long N) {
vector<long long> res;
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
res.push_back(i);
// 重複しないならば i の相方である N/i も push
if (N / i != i)
res.push_back(N / i);
}
}
// 小さい順に並び替える
sort(res.begin(), res.end());
return res;
/*long long N;
cin >> N;
vector<long long> res = divisors(N);
for (int i = 0; i < res.size(); ++i) {
cout << res[i] << " ";
}
cout << endl;*/
}
vector<pair<long long, long long>> prime_factorize(long long N) {
vector<pair<long long, long long>> res;
for (long long a = 2; a * a <= N; ++a) {
if (N % a != 0)
continue;
long long ex = 0;
while (N % a == 0) {
++ex;
N /= a;
}
res.push_back({a, ex});
}
if (N != 1)
res.push_back({N, 1});
return res;
}
void sayYes(bool f) {
if (f) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
void sayYES(bool f) {
if (f) {
cout << "YES" << endl;
} else {
cout << "NO" << endl;
}
}
int main() {
int n, m;
cin >> n >> m;
vector<int> h(100010);
vector<int> ma(100010);
for (int i = 1; i <= n; i++) {
cin >> h[i];
ma[i] = 0;
}
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
ma[a] = max(ma[a], h[b]);
ma[b] = max(ma[b], h[a]);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
if (h[i] > ma[i]) {
ans++;
}
}
cout << ans << endl;
}
| 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);
ios::sync_with_stdio(false);
ll N, M;
cin >> N >> M;
vector<ll> H(N);
vector<ll> ma(N);
for (int i = 1; i <= N; i++) {
cin >> H[i];
ma[i] = 0;
}
for (int i = 0; i < M; i++) {
ll a, b;
cin >> a >> b;
ma[a] = max(ma[a], H[b]);
ma[b] = max(ma[b], H[a]);
}
ll ans = 0;
for (int i = 1; i <= N; i++) {
ans += H[i] > ma[i];
}
cout << ans << endl;
return 0;
} | #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);
ios::sync_with_stdio(false);
ll N, M;
cin >> N >> M;
vector<ll> H(N + 50);
vector<ll> ma(N + 50);
for (int i = 1; i <= N; i++) {
cin >> H[i];
ma[i] = 0;
}
for (int i = 0; i < M; i++) {
ll a, b;
cin >> a >> b;
ma[a] = max(ma[a], H[b]);
ma[b] = max(ma[b], H[a]);
}
ll ans = 0;
for (int i = 1; i <= N; i++) {
ans += H[i] > ma[i];
}
cout << ans << endl;
return 0;
} | 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[i]; }
rep(i, m) { cin >> a[i] >> b[i]; }
bool ans[100010];
rep(i, n) { ans[i] = true; }
rep(j, n) {
rep(i, m) {
if (a[i] == j + 1 && h[a[i] - 1] <= h[b[i] - 1]) {
ans[j] = false;
break;
}
if (b[i] == j + 1 && h[a[i] - 1] >= h[b[i] - 1]) {
ans[j] = false;
break;
}
}
}
int cnt = 0;
rep(i, n) {
if (ans[i] == true)
cnt++;
}
cout << cnt << endl;
return 0;
} | #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[i]; }
rep(i, m) { cin >> a[i] >> b[i]; }
bool ans[100010];
rep(i, n) { ans[i] = true; }
rep(i, m) {
int atai = h[a[i] - 1] - h[b[i] - 1];
if (atai <= 0)
ans[a[i] - 1] = false;
if (atai >= 0)
ans[b[i] - 1] = false;
}
int cnt = 0;
rep(i, n) {
if (ans[i] == true)
cnt++;
}
cout << cnt << endl;
return 0;
} | 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;
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<P> vp;
typedef vector<vector<ll>> vvl;
typedef vector<vector<P>> vvp;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
const int MAX = 510000;
const double pi = acos(-1);
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, m;
cin >> n >> m;
vector<ll> h(n);
vector<bool> ok(n, true);
rep(i, m) {
ll a, b;
cin >> a >> b;
a--;
b--;
if (h[a] <= h[b])
ok[a] = false;
if (h[b] <= h[a])
ok[b] = false;
}
ll cnt = 0;
rep(i, n) {
if (ok[i])
cnt++;
}
cout << cnt << endl;
return 0;
}
| #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;
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<string> vs;
typedef vector<P> vp;
typedef vector<vector<ll>> vvl;
typedef vector<vector<P>> vvp;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
const int MAX = 510000;
const double pi = acos(-1);
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, m;
cin >> n >> m;
vector<ll> h(n);
rep(i, n) cin >> h[i];
vector<bool> ok(n, true);
rep(i, m) {
ll a, b;
cin >> a >> b;
a--;
b--;
if (h[a] <= h[b])
ok[a] = false;
if (h[b] <= h[a])
ok[b] = false;
}
ll cnt = 0;
rep(i, n) {
if (ok[i])
cnt++;
}
cout << cnt << endl;
return 0;
}
| 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.rend());
for (; k--;) {
int c, d;
cin >> n >> d;
v[n].push_back(d);
v[d].push_back(n);
}
vector<bool> vis(n + 1, 0);
int cnt = 0;
for (auto i : arr) {
if (!vis[i.second]) {
bool flg = 1;
// cout<<i.second<<" ";
vis[i.second] = 1;
for (int j : v[i.second]) {
if (i.first <= f[j]) {
flg = 0;
break;
}
vis[j] = 1;
// cout<<j<<" ";
}
// cout<<"\n";
cnt += flg;
}
}
cout << cnt << "\n";
return 0;
} | #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.rend());
for (; k--;) {
int c, d;
cin >> c >> d;
v[c].push_back(d);
v[d].push_back(c);
}
vector<bool> vis(n + 1, 0);
int cnt = 0;
for (auto i : arr) {
if (!vis[i.second]) {
bool flg = 1;
// cout<<i.second<<" ";
vis[i.second] = 1;
for (int j : v[i.second]) {
if (i.first <= f[j]) {
flg = 0;
break;
}
vis[j] = 1;
// cout<<j<<" ";
}
// cout<<"\n";
cnt += flg;
}
}
cout << cnt << "\n";
return 0;
} | 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<vector<int>> p(10000);
for (lld i = 0; i < m; i++) {
cin >> a >> b;
p[a - 1].push_back(b - 1);
p[b - 1].push_back(a - 1);
}
for (lld i = 0; i < n; i++) {
for (auto &t : p[i]) {
if (h[t] >= h[i]) {
goto no;
}
}
s++;
no:;
}
cout << s << "\n";
} | #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<vector<int>> p(n);
for (lld i = 0; i < m; i++) {
cin >> a >> b;
p[a - 1].push_back(b - 1);
p[b - 1].push_back(a - 1);
}
for (lld i = 0; i < n; i++) {
for (auto &t : p[i]) {
if (h[t] >= h[i]) {
goto no;
}
}
s++;
no:;
}
cout << s << "\n";
} | 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[a[i] - 1] < h[b[i] - 1]) {
judge[a[i] - 1] = 1;
} else if (h[a[i] - 1] > h[b[i] - 1]) {
judge[b[i] - 1] = 1;
} else {
judge[a[i] - 1] = 1;
judge[b[i] - 1] = 1;
}
}
ll ans = 0;
rep(i, n) {
if (judge[i] == 0) {
ans++;
}
}
cout << ans << endl;
} | #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[a[i] - 1] < h[b[i] - 1]) {
judge[a[i] - 1] = 1;
} else if (h[a[i] - 1] > h[b[i] - 1]) {
judge[b[i] - 1] = 1;
} else {
judge[a[i] - 1] = 1;
judge[b[i] - 1] = 1;
}
}
ll ans = 0;
rep(i, n) {
if (judge[i] == 0) {
ans++;
}
}
cout << ans << endl;
} | 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 100000000000
#define MOD 100000007 // 10^9+7
using namespace std;
using ll = long long;
using P = pair<int, int>;
char s[50][50];
int h, w;
int main() {
int n, m;
cin >> n >> m;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<vector<int>> arr(n);
int a, b;
rep(i, m) {
cin >> a >> b;
a--;
b--;
arr[a].push_back(b);
arr[b].push_back(a);
}
int ans = 0;
for (int i = 0; i < n; i++) {
int flag = 1;
for (int j = 0; j < sizeof(arr[i]); j++) {
if (h[i] < h[arr[i][j]]) {
flag = 0;
}
}
if (flag)
ans++;
}
cout << ans << endl;
return 0;
}
| #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 100000000000
#define MOD 100000007 // 10^9+7
using namespace std;
using ll = long long;
using P = pair<int, int>;
char s[50][50];
int h, w;
int main() {
int n, m;
cin >> n >> m;
vector<int> h(n);
rep(i, n) cin >> h[i];
vector<vector<int>> arr(n);
int a, b;
rep(i, m) {
cin >> a >> b;
a--;
b--;
arr[a].push_back(b);
arr[b].push_back(a);
}
int ans = 0;
for (int i = 0; i < n; i++) {
int flag = 1;
if (arr[i].size() == 0) {
ans++;
continue;
}
for (int j = 0; j < arr[i].size(); j++) {
if (h[i] <= h[arr[i][j]]) {
flag = 0;
}
}
if (flag)
ans++;
}
cout << ans << endl;
return 0;
}
| 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 >> n >> m;
vector<ll> h(n + 10);
rep(i, n) cin >> h[i];
vector<ll> a(m + 10);
vector<ll> b(m + 10);
rep(i, m) cin >> a[i] >> b[i];
vector<ll> ans(n);
rep(i, n) ans[i] = 0;
rep(i, m) {
if (h[a[i]] >= h[b[i]])
++ans[b[i]];
if (h[a[i]] <= h[b[i]])
++ans[a[i]];
}
ll count = 0;
rep(i, n) {
if (ans[i] == 0)
++count;
}
cout << count << endl;
return 0;
}
| #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 >> n >> m;
vector<ll> h(n + 10);
rep(i, n) cin >> h[i];
vector<ll> a(m + 10);
vector<ll> b(m + 10);
rep(i, m) cin >> a[i] >> b[i];
vector<ll> ans(n + 10);
rep(i, n) ans[i] = 0;
rep(i, m) {
if (h[a[i]] >= h[b[i]])
++ans[b[i]];
if (h[a[i]] <= h[b[i]])
++ans[a[i]];
}
ll count = 0;
rep(i, n) {
if (ans[i] == 0)
++count;
}
cout << count << endl;
return 0;
}
| 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) {
cin >> H[i];
ans[i] = 1;
}
rep(i, M) {
int A, B;
cin >> A >> B;
if (H[A - 1] < H[B - 1]) {
ans[A - 1] = 0;
} else if (H[A - 1] > H[B - 1]) {
ans[B - 1] = 0;
}
else {
ans[A - 1] = 0;
ans[B - 1] = 0;
}
}
int sum_ = 0;
rep(i, N) { sum_ += ans[i]; }
cout << sum_ << endl;
return 0;
}
| #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) {
cin >> H[i];
ans[i] = 1;
}
rep(i, M) {
int A, B;
cin >> A >> B;
if (H[A - 1] < H[B - 1]) {
ans[A - 1] = 0;
} else if (H[A - 1] > H[B - 1]) {
ans[B - 1] = 0;
}
else {
ans[A - 1] = 0;
ans[B - 1] = 0;
}
}
int sum_ = 0;
rep(i, N) { sum_ += ans[i]; }
cout << sum_ << endl;
return 0;
}
| 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 <= n; i++) {
l = ar[i].size();
ok = true;
for (int j = 0; j < l; j++) {
if (h[i] <= h[ar[i][j]])
ok = false;
// cout<<i<<" "<<h[i]<<" "<<h[ar[i][j]]<<"\n";
}
if (ok == true)
ans++;
// cout<<h[i]<<" "<<h[ar[i][j]]<<"\n";
}
cout << ans << "\n";
} | #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 <= n; i++) {
l = ar[i].size();
ok = true;
for (int j = 0; j < l; j++) {
if (h[i] <= h[ar[i][j]])
ok = false;
// cout<<i<<" "<<h[i]<<" "<<h[ar[i][j]]<<"\n";
}
if (ok == true)
ans++;
// cout<<h[i]<<" "<<h[ar[i][j]]<<"\n";
}
cout << ans << "\n";
} | 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; i++) {
cin >> tab[i];
}
for (long long int i = 0; i < M; i++) {
cin >> A >> B; // road A linked to B
cores[A].push_back(B);
cores[B].push_back(A);
}
for (long long int i = 1; i <= N; ++i) {
bool good = true;
for (long long int it : cores[i]) {
if (tab[it] >= tab[i]) {
good = false;
break;
}
}
if (good) {
count++;
}
}
cout << count;
return 0;
} | #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; i++) {
cin >> tab[i];
}
for (long long int i = 0; i < M; i++) {
cin >> A >> B; // road A linked to B
cores[A].push_back(B);
cores[B].push_back(A);
}
for (long long int i = 1; i <= N; ++i) {
bool good = true;
for (long long int it : cores[i]) {
if (tab[it] >= tab[i]) {
good = false;
break;
}
}
if (good) {
count++;
}
}
cout << count;
return 0;
} | 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;
/*
road[tmp_a-1][tmp_b-1]=1;
road[tmp_b-1][tmp_a-1]=1;
*/
if (h[tmp_a - 1] > h[tmp_b - 1])
flag[tmp_b - 1] = false;
if (h[tmp_a - 1] < h[tmp_b - 1])
flag[tmp_a - 1] = false;
if (h[tmp_a - 1] == h[tmp_b - 1]) {
flag[tmp_b - 1] = false;
flag[tmp_a - 1] = false;
}
}
int ans = 0;
// bool flag=true;
for (int i = 0; i < n; i++) {
if (flag[i]) {
ans++;
}
}
cout << ans << endl;
} | #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;
/*
road[tmp_a-1][tmp_b-1]=1;
road[tmp_b-1][tmp_a-1]=1;
*/
if (h[tmp_a - 1] > h[tmp_b - 1])
flag[tmp_b - 1] = false;
if (h[tmp_a - 1] < h[tmp_b - 1])
flag[tmp_a - 1] = false;
if (h[tmp_a - 1] == h[tmp_b - 1]) {
flag[tmp_b - 1] = false;
flag[tmp_a - 1] = false;
}
}
int ans = 0;
// bool flag=true;
for (int i = 0; i < n; i++) {
if (flag[i]) {
ans++;
}
}
cout << ans << endl;
} | 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 mll map<pll, ll>
#define all(a) a.begin(), a.end()
#define x first
#define y second
#define sz(x) (ll) x.size()
#define dl '\n'
#define why (ll)1000000007
// #define why (ll)998244353
#define lp(i, a, b) for (ll i = a; i < b; ++i)
#define lpr(i, a, b) for (ll i = a; i >= b; i--)
#define lpd(i, x) for (auto i : x)
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
ll inf = 1e18;
ld pi = 3.141592653589;
ll mod = why;
ll fast_power(ll base, ll power, ll mod) {
ll result = 1;
while (power) {
if (power % 2)
result = (result * base) % mod;
base = (base * base) % mod;
power /= 2;
}
return result;
}
ll inverse(ll base, ll mod) { return fast_power(base, mod - 2, mod); }
ll solve() {
ll n, m;
cin >> n >> m;
vl h(n);
lp(i, 0, n) cin >> h[i];
ll ans = 0;
map<ll, vl> ma;
lp(i, 0, m) {
ll x, y;
cin >> x >> y;
ma[x].pb(y);
ma[y].pb(x);
}
lpd(x, ma) {
if (x.y.size() == 0)
ans++;
bool f = 0;
// cout<<x.F<<" ";
lpd(j, x.y) {
// cout<<j<<" ";
if (h[j - 1] >= h[x.x - 1]) {
f = 1;
break;
}
}
if (!f) {
ans++;
}
}
lp(i, 1, n + 1) if (ma[i].size() == 0) ans++;
cout << ans;
}
int main() {
ios ll t = 1;
// cin>>t;
while (t--) {
solve();
}
} | /*
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 mll map<pll, ll>
#define all(a) a.begin(), a.end()
#define x first
#define y second
#define sz(x) (ll) x.size()
#define dl '\n'
#define why (ll)1000000007
// #define why (ll)998244353
#define lp(i, a, b) for (ll i = a; i < b; ++i)
#define lpr(i, a, b) for (ll i = a; i >= b; i--)
#define lpd(i, x) for (auto i : x)
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
ll inf = 1e18;
ld pi = 3.141592653589;
ll mod = why;
ll fast_power(ll base, ll power, ll mod) {
ll result = 1;
while (power) {
if (power % 2)
result = (result * base) % mod;
base = (base * base) % mod;
power /= 2;
}
return result;
}
ll inverse(ll base, ll mod) { return fast_power(base, mod - 2, mod); }
ll solve() {
ll n, m;
cin >> n >> m;
vl h(n);
lp(i, 0, n) cin >> h[i];
ll ans = 0;
map<ll, vl> ma;
lp(i, 0, m) {
ll x, y;
cin >> x >> y;
ma[x].pb(y);
ma[y].pb(x);
}
lpd(x, ma) {
if (x.y.size() == 0)
ans++;
bool f = 0;
// cout<<x.F<<" ";
lpd(j, x.y) {
// cout<<j<<" ";
if (h[j - 1] >= h[x.x - 1]) {
f = 1;
break;
}
}
if (!f) {
ans++;
}
}
lp(i, 1, n + 1) if (ma[i].size() == 0) ans++;
cout << ans;
return 0;
}
int main() {
ios ll t = 1;
// cin>>t;
while (t--) {
solve();
}
} | 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 = min(x, y);
if (x == y) {
st.insert(a);
st.insert(b);
} else if (mn == x) {
st.insert(a);
} else if (mn == y) {
st.insert(b);
}
}
cnt -= st.size();
cout << cnt << endl;
} | #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 mn = min(x, y);
if (x == y) {
st.insert(a);
st.insert(b);
} else if (mn == x) {
st.insert(a);
} else if (mn == y) {
st.insert(b);
}
}
cnt -= st.size();
cout << cnt << endl;
} | 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, l.at(a) *= 0;
} else if (h.at(a) > h.at(b)) {
l.at(a) *= 1, l.at(b) = 0;
} else {
l.at(a) *= 0, l.at(b) *= 0;
}
}
for (int i = 0; i < n; i++) {
if (l.at(i) == 1) {
c++;
}
}
cout << c << endl;
}
| #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)) {
l.at(b) *= 1, l.at(a) *= 0;
} else if (h.at(a) > h.at(b)) {
l.at(a) *= 1, l.at(b) = 0;
} else {
l.at(a) *= 0, l.at(b) *= 0;
}
}
for (int i = 0; i < n; i++) {
if (l.at(i) == 1) {
c++;
}
}
cout << c << endl;
}
| 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; i++)
#define repn(i, x) for (long long i = 1; i <= x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define ERASE(x) x.erase(unique(x.begin(), x.end()), x.end())
#define POSL(x, v) (lower_bound(x.begin(), x.end(), v) - x.begin())
#define POSU(x, v) (upper_bound(x.begin(), x.end(), v) - x.begin())
vector<pair<string, P>> vec;
// vector<vector<int>> data(3, vector<int>(4));
void solve(long long N, long long M, std::vector<long long> H,
std::vector<long long> A, std::vector<long long> B) {
vector<bool> b(N, true);
rep(i, N) {
if (H[A[i]] <= H[B[i]])
b[A[i]] = false;
if (H[B[i]] <= H[A[i]])
b[B[i]] = false;
}
ll res = 0;
rep(i, N) {
if (b[i])
res++;
}
cout << res << endl;
}
int main() {
long long N;
scanf("%lld", &N);
long long M;
scanf("%lld", &M);
std::vector<long long> H(N);
for (int i = 0; i < N; i++) {
scanf("%lld", &H[i]);
}
std::vector<long long> A(M);
std::vector<long long> B(M);
for (int i = 0; i < M; i++) {
scanf("%lld", &A[i]);
scanf("%lld", &B[i]);
A[i]--;
B[i]--;
}
solve(N, M, std::move(H), std::move(A), std::move(B));
return 0;
}
| #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; i++)
#define repn(i, x) for (long long i = 1; i <= x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define ERASE(x) x.erase(unique(x.begin(), x.end()), x.end())
#define POSL(x, v) (lower_bound(x.begin(), x.end(), v) - x.begin())
#define POSU(x, v) (upper_bound(x.begin(), x.end(), v) - x.begin())
vector<pair<string, P>> vec;
// vector<vector<int>> data(3, vector<int>(4));
void solve(long long N, long long M, std::vector<long long> H,
std::vector<long long> A, std::vector<long long> B) {
vector<bool> b(N, true);
rep(i, M) {
if (H[A[i]] <= H[B[i]])
b[A[i]] = false;
if (H[B[i]] <= H[A[i]])
b[B[i]] = false;
}
ll res = 0;
rep(i, N) {
if (b[i])
res++;
}
cout << res << endl;
}
int main() {
long long N;
scanf("%lld", &N);
long long M;
scanf("%lld", &M);
std::vector<long long> H(N);
for (int i = 0; i < N; i++) {
scanf("%lld", &H[i]);
}
std::vector<long long> A(M);
std::vector<long long> B(M);
for (int i = 0; i < M; i++) {
scanf("%lld", &A[i]);
scanf("%lld", &B[i]);
A[i]--;
B[i]--;
}
solve(N, M, std::move(H), std::move(A), std::move(B));
return 0;
}
| 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);
for (int i = 1; i <= n; ++i)
cin >> hs[i];
for (int i = 0, x, y; i < m; ++i) {
cin >> x >> y;
adj[x].push_back(y);
adj[y].push_back(x);
}
int cnt = 0;
for (int i = 1; i <= n; ++i) {
cnt += is_good(i);
}
cout << cnt << endl;
return 0;
} | #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 (int i = 1; i <= n; ++i)
cin >> hs[i];
for (int i = 0, x, y; i < m; ++i) {
cin >> x >> y;
adj[x].push_back(y);
adj[y].push_back(x);
}
int cnt = 0;
for (int i = 1; i <= n; ++i) {
cnt += is_good(i);
}
cout << cnt << endl;
return 0;
} | 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 >> a >> b;
good[min(H[a], H[b])] = 0;
}
rep(i, N) { ans += good[i]; }
cout << ans << endl;
return 0;
} | #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 >> a >> b;
a--;
b--;
if (H[a] > H[b]) {
good[b] = 0;
} else if (H[a] < H[b]) {
good[a] = 0;
} else {
good[a] = 0;
good[b] = 0;
}
}
rep(i, N) { ans += good[i]; }
cout << ans << endl;
return 0;
} | 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] - 1] - h[b[i] - 1];
if (dif > 0) {
r[b[i] - 1] = false;
} else if (dif < 0) {
r[a[i] - 1] = false;
} else {
r[a[i] - 1] = false;
r[b[i] - 1] = false;
}
}
int cnt = 0;
for (int i = 0; i < n; i++) {
if (r[i]) {
cnt++;
}
}
cout << cnt << endl;
} | #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] - 1] - h[b[i] - 1];
if (dif > 0) {
r[b[i] - 1] = false;
} else if (dif < 0) {
r[a[i] - 1] = false;
} else {
r[a[i] - 1] = false;
r[b[i] - 1] = false;
}
}
int cnt = 0;
for (int i = 0; i < n; i++) {
if (r[i]) {
cnt++;
}
}
cout << cnt << endl;
} | 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);
}
for (int i = 1; i <= n; i++) {
if (flag[i])
continue;
for (int j = 0; j < vec[i].size(); j++) {
if (h[i] > h[vec[i][j]]) {
flag[vec[i][j]] = true;
} else {
flag[i] = true;
break;
}
}
}
for (int i = 1; i <= n; i++) {
if (!flag[i])
ans++;
}
cout << ans << endl;
} | #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);
}
for (int i = 1; i <= n; i++) {
if (flag[i])
continue;
for (int j = 0; j < vec[i].size(); j++) {
if (h[i] > h[vec[i][j]]) {
flag[vec[i][j]] = true;
} else {
flag[i] = true;
break;
}
}
}
for (int i = 1; i <= n; i++) {
if (!flag[i])
ans++;
}
cout << ans << endl;
} | 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 <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define FORR(i, a, b) for (int i = a; i >= b; --i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<double> VD;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef vector<VD> VVD;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
using Graph = vector<vector<int>>;
using edge = struct {
int to;
ll cost;
};
template <class t, class u> void chmax(t &a, u b) {
if (a < b)
a = b;
}
template <class t, class u> void chmin(t &a, u b) {
if (b < a)
a = b;
}
typedef priority_queue<ll> PQ_HIGH;
typedef priority_queue<ll, VL, greater<ll>> PQ_LOW; // 昇順
int main() {
int N, M;
cin >> N >> M;
VL H(N, 0);
VI a(N, 0), b(N, 0);
REP(i, N) { cin >> H[i]; }
REP(i, M) {
cin >> a[i] >> b[i];
a[i]--, b[i]--;
}
VI ans(N, 0);
for (int i = 0; i < M; i++) {
if (H[a[i]] >= H[b[i]]) {
ans[b[i]] = 1;
}
if (H[a[i]] <= H[b[i]]) {
ans[a[i]] = 1;
}
}
int count = 0;
REP(i, N) {
if (ans[i] == 0) {
count++;
}
}
cout << count << endl;
}
| #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 <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define FORR(i, a, b) for (int i = a; i >= b; --i)
#define ALL(c) (c).begin(), (c).end()
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<double> VD;
typedef vector<VI> VVI;
typedef vector<VL> VVL;
typedef vector<VD> VVD;
typedef pair<int, int> P;
typedef pair<ll, ll> PL;
using Graph = vector<vector<int>>;
using edge = struct {
int to;
ll cost;
};
template <class t, class u> void chmax(t &a, u b) {
if (a < b)
a = b;
}
template <class t, class u> void chmin(t &a, u b) {
if (b < a)
a = b;
}
typedef priority_queue<ll> PQ_HIGH;
typedef priority_queue<ll, VL, greater<ll>> PQ_LOW; // 昇順
int main() {
int N, M;
cin >> N >> M;
VL H(N, 0);
VI a(M, 0), b(M, 0);
REP(i, N) { cin >> H[i]; }
REP(i, M) {
cin >> a[i] >> b[i];
a[i]--, b[i]--;
}
VI ans(N, 0);
for (int i = 0; i < M; i++) {
if (H[a[i]] >= H[b[i]]) {
ans[b[i]] = 1;
}
if (H[a[i]] <= H[b[i]]) {
ans[a[i]] = 1;
}
}
int count = 0;
REP(i, N) {
if (ans[i] == 0) {
count++;
}
}
cout << count << endl;
}
| 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 << " ";
if (buf[A] < buf[B]) {
// cout << "a" << endl;
if (check[A] == 0) {
ans--;
check[A] = 1;
}
} else if (buf[A] == buf[B]) {
// cout << "b" << endl;
if (check[A] == 0) {
ans--;
check[A] = 1;
}
if (check[B] == 0) {
ans--;
check[B] = 1;
}
} else if (buf[A] > buf[B]) {
// cout << "c" << endl;
if (check[B] == 0) {
ans--;
check[B] = 1;
}
}
}
cout << ans << endl;
return 0;
} | #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 << " ";
if (buf[A] < buf[B]) {
// cout << "a" << endl;
if (check[A] == 0) {
ans--;
check[A] = 1;
}
} else if (buf[A] == buf[B]) {
// cout << "b" << endl;
if (check[A] == 0) {
ans--;
check[A] = 1;
}
if (check[B] == 0) {
ans--;
check[B] = 1;
}
} else if (buf[A] > buf[B]) {
// cout << "c" << endl;
if (check[B] == 0) {
ans--;
check[B] = 1;
}
}
}
cout << ans << endl;
return 0;
} | 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, b;
cin >> a;
cin >> b;
a--;
b--;
if (height[a] < height[b]) {
good[a] = false;
} else if (height[b] < height[a]) {
good[b] = false;
} else if (height[a] == height[b]) {
good[a] = false;
good[b] = false;
}
}
int ngood = 0;
for (int i = 0; i < N; ++i) {
if (good[i])
ngood++;
}
cout << ngood << endl;
return 0;
} | #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--;
if (height[a] < height[b]) {
good[a] = false;
} else if (height[b] < height[a]) {
good[b] = false;
} else if (height[a] == height[b]) {
good[a] = false;
good[b] = false;
}
}
int ngood = 0;
for (int i = 0; i < N; ++i) {
if (good[i])
ngood++;
}
cout << ngood << endl;
return 0;
} | 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;
const int maxn = 10005, mod = 20101009;
int n, m, cnt, head[maxn], h[maxn], ans;
struct edge {
int to, next;
} e[maxn << 1];
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 << 1) + (x << 3) + (ch ^ 48);
ch = getchar();
}
return x * f;
}
inline void write(int a) {
if (a < 0) {
putchar('-');
putchar('1');
} else {
if (a >= 10)
write(a / 10);
putchar(a % 10 + '0');
}
}
void add(int from, int to) {
e[++cnt] = (edge){to, head[from]};
head[from] = cnt;
}
signed main() {
n = read(), m = read();
for (int i = 1; i <= n; ++i)
h[i] = read();
for (int i = 1; i <= m; ++i) {
int u = read(), v = read();
add(u, v), add(v, u);
}
for (int i = 1; i <= n; ++i) {
int flag = 0;
for (int j = head[i]; j; j = e[j].next)
if (h[e[j].to] >= h[i]) {
flag = 1;
break;
}
if (!flag)
++ans;
}
write(ans);
return 0;
}
| #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;
const int maxn = 100005, mod = 20101009;
int n, m, cnt, head[maxn], h[maxn], ans;
struct edge {
int to, next;
} e[maxn << 1];
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 << 1) + (x << 3) + (ch ^ 48);
ch = getchar();
}
return x * f;
}
inline void write(int a) {
if (a < 0) {
putchar('-');
putchar('1');
} else {
if (a >= 10)
write(a / 10);
putchar(a % 10 + '0');
}
}
void add(int from, int to) {
e[++cnt] = (edge){to, head[from]};
head[from] = cnt;
}
signed main() {
n = read(), m = read();
for (int i = 1; i <= n; ++i)
h[i] = read();
for (int i = 1; i <= m; ++i) {
int u = read(), v = read();
add(u, v), add(v, u);
}
for (int i = 1; i <= n; ++i) {
int flag = 0;
for (int j = head[i]; j; j = e[j].next)
if (h[e[j].to] >= h[i]) {
flag = 1;
break;
}
if (!flag)
++ans;
}
write(ans);
return 0;
}
| 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
#define mp make_pair
#define F first
#define S second
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<ll> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<pair<int, int>> v(n);
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
v[i] = mp(a, b);
}
vector<bool> ans(n, true);
for (int i = 0; i < m; i++) {
if (h[v[i].F - 1] > h[v[i].S - 1]) {
ans[v[i].S - 1] = false;
} else if (h[v[i].F - 1] < h[v[i].S - 1]) {
ans[v[i].F - 1] = false;
} else {
ans[v[i].F - 1] = false;
ans[v[i].S - 1] = false;
}
}
int count = 0;
for (int i = 0; i < n; i++) {
if (ans[i] == true)
count++;
}
cout << count << endl;
return 0;
}
| /************************************
/ 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
#define mp make_pair
#define F first
#define S second
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<ll> h(n);
for (int i = 0; i < n; i++)
cin >> h[i];
vector<pair<int, int>> v(m);
for (int i = 0; i < m; i++) {
int a, b;
cin >> a >> b;
v[i] = mp(a, b);
}
vector<bool> ans(n, true);
for (int i = 0; i < m; i++) {
if (h[v[i].F - 1] > h[v[i].S - 1]) {
ans[v[i].S - 1] = false;
} else if (h[v[i].F - 1] < h[v[i].S - 1]) {
ans[v[i].F - 1] = false;
} else {
ans[v[i].F - 1] = false;
ans[v[i].S - 1] = false;
}
}
int count = 0;
for (int i = 0; i < n; i++) {
if (ans[i] == true)
count++;
}
cout << count << endl;
return 0;
}
| 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 = 0; i < n; i++)
cnt[i] = 1;
int a, b;
for (int i = 0; i < m; i++) {
cin >> a >> b;
a--;
b--;
if (h[a] >= h[b] && cnt[b] != 0) {
cnt[b] = 0;
}
if (h[a] <= h[b] && cnt[a] != 0) {
cnt[a] = 0;
}
}
for (int i = 0; i < n; i++) {
if (cnt[i] == 1)
ans++;
}
cout << ans << endl;
return 0;
} | /**
* 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 i = 0; i < n; i++)
cnt[i] = 1;
int a, b;
for (int i = 0; i < m; i++) {
cin >> a >> b;
a--;
b--;
if (h[a] >= h[b] && cnt[b] != 0) {
cnt[b] = 0;
}
if (h[a] <= h[b] && cnt[a] != 0) {
cnt[a] = 0;
}
}
for (int i = 0; i < n; i++) {
if (cnt[i] == 1)
ans++;
}
cout << ans << endl;
return 0;
} | 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 - 1])
b[c - 1] = 0;
if (a[d - 1] <= a[c - 1])
b[d - 1] = 0;
}
sum = 0;
for (int i = 0; i < n; i++) {
if (b[i]) {
// cout<<i+1<<endl;
sum++;
}
}
cout << sum << endl;
} | #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] <= a[c - 1])
b[d - 1] = 0;
}
sum = 0;
for (int i = 0; i < n; i++) {
if (b[i]) {
// cout<<i+1<<endl;
sum++;
}
}
cout << sum << endl;
} | 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++) {
if (H[A[i] - 1] > H[B[i] - 1]) {
check[B[i] - 1] = 0;
} else if (H[A[i] - 1] < H[B[i] - 1]) {
check[A[i] - 1] = 0;
} else {
check[A[i] - 1] = 0;
check[B[i] - 1] = 0;
}
}
for (int i = 0; i < N; i++) {
if (check[i] == 1) {
cnt++;
}
}
cout << cnt;
} | #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++) {
if (H[A[i] - 1] > H[B[i] - 1]) {
check[B[i] - 1] = 0;
} else if (H[A[i] - 1] < H[B[i] - 1]) {
check[A[i] - 1] = 0;
} else {
check[A[i] - 1] = 0;
check[B[i] - 1] = 0;
}
}
for (int i = 0; i < N; i++) {
if (check[i] == 1) {
cnt++;
}
}
cout << cnt;
} | 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 n, m, a, b, ans = 0;
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int i = 1; i <= m; i++) {
cin >> a >> b;
if (h[a] > h[b])
good[b] = 1;
else if (h[a] == h[b])
good[a] = good[b] = 1;
else
good[a] = 1;
}
for (int i = 1; i <= n; i++)
ans += (good[i] == 1) ? 0 : 1;
cout << ans;
return 0;
}
| #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() {
int n, m, a, b, ans = 0;
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> h[i];
for (int i = 1; i <= m; i++) {
cin >> a >> b;
if (h[a] > h[b])
good[b] = 1;
else if (h[a] == h[b])
good[a] = good[b] = 1;
else
good[a] = 1;
}
for (int i = 1; i <= n; i++)
ans += (good[i] == 1) ? 0 : 1;
cout << ans;
return 0;
}
| 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);
// cout << "aaa" << endl;
vector<ll> R(N);
rep(i, M) {
int f = A.at(0).at(i);
int s = A.at(1).at(i);
// cout << H[f] << "vs" << H[s] << endl;
if (H[f] > H[s]) {
R[s] = -1;
} else if (H[f] < H[s]) {
R[f] = -1;
} else {
R[f] = -1;
R[s] = -1;
}
}
// cout << "bbb" << endl;
int ans = 0;
rep(i, N) {
// cout << "R[" << i+1 << "]=" << R[i+1] << endl;
if (R[i + 1] != -1)
ans++;
}
cout << ans << endl;
} | #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);
// cout << "aaa" << endl;
vector<ll> R(N + 1);
rep(i, M) {
int f = A.at(0).at(i);
int s = A.at(1).at(i);
// cout << H[f] << "vs" << H[s] << endl;
if (H[f] > H[s]) {
R[s] = -1;
} else if (H[f] < H[s]) {
R[f] = -1;
} else {
R[f] = -1;
R[s] = -1;
}
}
// cout << "bbb" << endl;
int ans = 0;
rep(i, N) {
// cout << "R[" << i+1 << "]=" << R[i+1] << endl;
if (R[i + 1] != -1)
ans++;
}
cout << ans << endl;
} | 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] > H[a]);
}
int ret = 0;
for (int i = 1; i <= N; ++i) {
if (good[i])
++ret;
}
printf("%d\n", ret);
return 0;
} | #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] > H[a]);
}
int ret = 0;
for (int i = 1; i <= N; ++i) {
if (good[i])
++ret;
}
printf("%d\n", ret);
return 0;
} | 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] = vis[b] = true;
else
vis[b] = true;
}
for (int i = 1; i <= n; i++) {
if (vis[i] == false) {
tot++;
}
}
cout << tot;
return 0;
} | #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[a] = vis[b] = true;
else
vis[b] = true;
}
for (int i = 1; i <= n; i++) {
if (vis[i] == false) {
tot++;
}
}
cout << tot;
return 0;
} | 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) {
int a, b;
cin >> a >> b;
// aとbは0インデックスに揃える
a--;
b--;
G[a].push_back(b);
// 無向グラフなのでbにもaを追加する
G[b].push_back(a);
}
int ans = 0;
rep(i, N) {
bool check = true;
for (auto g : G[i]) {
if (H[i] <= H[g])
check = false;
}
if (check)
ans++;
}
cout << ans << endl;
}
| #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) {
int a, b;
cin >> a >> b;
// aとbは0インデックスに揃える
a--;
b--;
G[a].push_back(b);
// 無向グラフなのでbにもaを追加する
G[b].push_back(a);
}
int ans = 0;
rep(i, N) {
bool check = true;
for (auto g : G[i]) {
if (H[i] <= H[g])
check = false;
}
if (check)
ans++;
}
cout << ans << endl;
}
| 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);
to[b].push_back(a);
}
bool goo;
int cnt = 0;
for (int i = 0; i < n; i++) {
goo = true;
int hig = h.at(i);
for (auto x : to[i]) {
if (hig <= h.at(x)) {
goo = false;
}
}
if (goo)
cnt++;
}
cout << cnt << endl;
return 0;
}
| #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);
to[b].push_back(a);
}
bool goo;
int cnt = 0;
for (int i = 0; i < n; i++) {
goo = true;
int hig = h.at(i);
for (auto x : to[i]) {
if (hig <= h.at(x)) {
goo = false;
}
}
if (goo)
cnt++;
}
cout << cnt << endl;
return 0;
}
| 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] = 1;
} else if (H[A - 1] < H[B - 1]) {
Ten[A - 1] = 1;
} else {
Ten[A - 1] = 1;
Ten[B - 1] = 1;
}
}
rep(i, N) {
if (Ten[i] == 0)
ans++;
}
cout << ans << endl;
return 0;
} | #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] = 1;
} else if (H[A - 1] < H[B - 1]) {
Ten[A - 1] = 1;
} else {
Ten[A - 1] = 1;
Ten[B - 1] = 1;
}
}
rep(i, N) {
if (Ten[i] == 0)
ans++;
}
cout << ans << endl;
return 0;
} | 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() {
int a, b;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
scanf("%d", &hill[i]);
for (int i = 1; i <= m; i++) {
scanf("%d%d", &a, &b);
adde(a, b);
}
for (int i = 1; i <= n; i++) {
bool flg = 0;
for (int j = fir[i]; j; j = eds[j].nxt) {
int v = eds[j].v;
if (hill[v] >= hill[i])
flg = 1;
}
if (flg == 0)
ans++;
}
printf("%d\n", ans);
return 0;
} | #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() {
int a, b;
scanf("%d%d", &n, &m);
for (int i = 1; i <= n; i++)
scanf("%d", &hill[i]);
for (int i = 1; i <= m; i++) {
scanf("%d%d", &a, &b);
adde(a, b);
}
for (int i = 1; i <= n; i++) {
bool flg = 0;
for (int j = fir[i]; j; j = eds[j].nxt) {
int v = eds[j].v;
if (hill[v] >= hill[i])
flg = 1;
}
if (flg == 0)
ans++;
}
printf("%d\n", ans);
return 0;
} | 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) cin >> h[i];
REP(i, n) ma[i] = 0; // 初期化
REP(i, m) {
int a, b;
cin >> a >> b;
--a;
--b;
ma[a] = max(ma[a], h[b]);
ma[b] = max(ma[b], h[a]);
}
int cnt = 0;
REP(i, n) {
if (h[i] > ma[i])
++cnt;
}
cout << cnt << endl;
return 0;
} | #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) cin >> h[i];
REP(i, n) ma[i] = 0; // 初期化
REP(i, m) {
int a, b;
cin >> a >> b;
--a;
--b;
ma[a] = max(ma[a], h[b]);
ma[b] = max(ma[b], h[a]);
}
int cnt = 0;
REP(i, n) {
if (h[i] > ma[i])
++cnt;
}
cout << cnt << endl;
return 0;
} | 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;
using ll = long long;
constexpr i64 INF = 1010000000000000017LL;
constexpr i64 MOD = 1000000007LL;
constexpr f64 EPS = 1e-12;
constexpr f64 PI = 3.14159265358979323846;
#define FOR(i, start, end) \
for (i64 i = (start), CPP_CAT(i, xxxx_end) = (end); \
i < CPP_CAT(i, xxxx_end); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(f, c, ...) \
(([&](decltype((c)) cccc) { \
return (f)(std::begin(cccc), std::end(cccc), ##__VA_ARGS__); \
})(c))
struct ProconInit {
static constexpr int IOS_PREC = 15;
static constexpr bool AUTOFLUSH = false;
ProconInit() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(IOS_PREC);
if (AUTOFLUSH)
cout << unitbuf;
}
} PROCON_INIT;
void solve() {
ll n, m;
cin >> n >> m;
vector<ll> h(n);
FOR(i, 0, n) cin >> h[i];
vector<ll> a(n), b(n);
FOR(i, 0, m) {
cin >> a[i] >> b[i];
--a[i];
--b[i];
}
vector<int> res(n, 1);
FOR(i, 0, m) {
if (h[a[i]] > h[b[i]])
res[b[i]] = 0;
if (h[a[i]] < h[b[i]])
res[a[i]] = 0;
if (h[a[i]] == h[b[i]]) {
res[a[i]] = 0;
res[b[i]] = 0;
}
}
cout << accumulate(res.begin(), res.end(), 0);
}
signed main() {
solve();
return 0;
} | #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;
using ll = long long;
constexpr i64 INF = 1010000000000000017LL;
constexpr i64 MOD = 1000000007LL;
constexpr f64 EPS = 1e-12;
constexpr f64 PI = 3.14159265358979323846;
#define FOR(i, start, end) \
for (i64 i = (start), CPP_CAT(i, xxxx_end) = (end); \
i < CPP_CAT(i, xxxx_end); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(f, c, ...) \
(([&](decltype((c)) cccc) { \
return (f)(std::begin(cccc), std::end(cccc), ##__VA_ARGS__); \
})(c))
struct ProconInit {
static constexpr int IOS_PREC = 15;
static constexpr bool AUTOFLUSH = false;
ProconInit() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(IOS_PREC);
if (AUTOFLUSH)
cout << unitbuf;
}
} PROCON_INIT;
void solve() {
ll n, m;
cin >> n >> m;
vector<ll> h(n);
FOR(i, 0, n) cin >> h[i];
vector<ll> a(m), b(m);
FOR(i, 0, m) {
cin >> a[i] >> b[i];
--a[i];
--b[i];
}
vector<int> res(n, 1);
FOR(i, 0, m) {
if (h[a[i]] > h[b[i]])
res[b[i]] = 0;
if (h[a[i]] < h[b[i]])
res[a[i]] = 0;
if (h[a[i]] == h[b[i]]) {
res[a[i]] = 0;
res[b[i]] = 0;
}
}
cout << accumulate(res.begin(), res.end(), 0);
}
signed main() {
solve();
return 0;
} | 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);
rep(i, N) cin >> H.at(i);
vector<ll> J(N);
rep(i, M) J.at(i) = 0;
ll A, B;
ll count = 0;
rep(i, M) {
cin >> A >> B;
A--;
B--;
if (H.at(A) > H.at(B))
J.at(B)++;
else if (H.at(A) < H.at(B))
J.at(A)++;
else {
J.at(A)++;
J.at(B)++;
}
}
rep(i, N) if (J.at(i) == 0) count++;
cout << count << endl;
return 0;
}
| #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);
rep(i, N) cin >> H.at(i);
vector<ll> J(N);
rep(i, N) J.at(i) = 0;
ll A, B;
ll count = 0;
rep(i, M) {
cin >> A >> B;
A--;
B--;
if (H.at(A) > H.at(B))
J.at(B)++;
else if (H.at(A) < H.at(B))
J.at(A)++;
else {
J.at(A)++;
J.at(B)++;
}
}
rep(i, N) if (J.at(i) == 0) count++;
cout << count << endl;
return 0;
}
| 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].push_back(a);
}
int cnt = 0;
rep(i, n) {
rep(j, G[i].size()) {
if (h[i] <= h[G[i][j]]) {
cnt++;
break;
}
}
}
cout << n - cnt;
} | #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].push_back(a);
}
int cnt = 0;
rep(i, n) {
rep(j, G[i].size()) {
if (h[i] <= h[G[i][j]]) {
cnt++;
break;
}
}
}
cout << n - cnt;
}
| 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] = 1;
}
long long int c[100001];
for (long long int i = 1; i <= n; i++) {
c[i] = 1;
}
long long int a[100001], b[100001];
for (long long int j = 1; j <= n; j++) {
cin >> a[j] >> b[j];
if (h[a[j]] > h[b[j]]) {
g[a[j]] = 1;
} else {
c[a[j]] = 0;
}
if (h[a[j]] < h[b[j]]) {
g[b[j]] = 1;
} else {
c[b[j]] = 0;
}
}
int l = 0;
for (long long int i = 1; i <= n; i++) {
if (c[i] && g[i]) {
l++;
}
}
cout << l;
} | #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] = 1;
}
long long int c[100001];
for (long long int i = 1; i <= n; i++) {
c[i] = 1;
}
long long int a[100001], b[100001];
for (long long int j = 1; j <= m; j++) {
cin >> a[j] >> b[j];
if (h[a[j]] > h[b[j]]) {
g[a[j]] = 1;
} else {
c[a[j]] = 0;
}
if (h[a[j]] < h[b[j]]) {
g[b[j]] = 1;
} else {
c[b[j]] = 0;
}
}
int l = 0;
for (long long int i = 1; i <= n; i++) {
if (c[i] && g[i]) {
l++;
}
}
cout << l;
} | 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--;
if (h[a] <= h[b])
ok[a] = false;
if (h[b] <= h[a])
ok[b] = false;
}
int ans = 0;
rep(i, n) {
if (ok[i])
ans++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<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--;
if (h[a] <= h[b])
ok[a] = false;
if (h[b] <= h[a])
ok[b] = false;
}
int ans = 0;
rep(i, n) {
if (ok[i])
ans++;
}
cout << ans << endl;
return 0;
} | 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]);
}
int ans = 0;
for (int i = 1; i < n + 1; i++) {
if (h[i] > ma[i])
ans++;
}
cout << ans << endl;
return 0;
} | #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]);
}
int ans = 0;
for (int i = 1; i < n + 1; i++) {
if (h[i] > ma[i])
ans++;
}
cout << ans << endl;
return 0;
} | 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); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define f first
#define se second
#define LB lower_bound
#define UB upper_bound
#define pb push_back
#define mp make_pair
#define vll vector<ll>
#define vi vector<int>
#define vc vector<char>
#define vpll vector<pair<ll, ll>>
const unsigned int MOD = 1000000007;
using namespace std;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
IOS;
int T;
// cin>>T;
T = 1;
while (T--) {
ll n, m;
cin >> n >> m;
ll h[n + 1];
for (ll i = 1; i <= n; i++)
cin >> h[i];
vector<vector<ll>> v(m + 2);
// cout<<m;
for (ll i = 0; i < m; i++) {
ll x, y;
cin >> x >> y;
v[x].pb(y);
v[y].pb(x);
}
ll ans = 0;
for (ll i = 1; i <= n; i++) {
if (v[i].size() == 0) {
ans++;
continue;
}
ll flag = 1;
for (ll j = 0; j < v[i].size(); j++) {
if (h[i] <= h[v[i][j]]) {
flag = 0;
break;
}
}
if (flag)
ans++;
}
cout << ans;
}
return 0;
} | // DushtuBunny
// Rahul Halder
// Indian Institute of Engineering Science & Technology,Shibpur
#include <bits/stdc++.h>
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll long long
#define f first
#define se second
#define LB lower_bound
#define UB upper_bound
#define pb push_back
#define mp make_pair
#define vll vector<ll>
#define vi vector<int>
#define vc vector<char>
#define vpll vector<pair<ll, ll>>
const unsigned int MOD = 1000000007;
using namespace std;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
IOS;
int T;
// cin>>T;
T = 1;
while (T--) {
ll n, m;
cin >> n >> m;
ll h[n + 1];
for (ll i = 1; i <= n; i++)
cin >> h[i];
vector<vector<ll>> v(n + 1);
// cout<<m;
for (ll i = 0; i < m; i++) {
ll x, y;
cin >> x >> y;
v[x].pb(y);
v[y].pb(x);
}
ll ans = 0;
for (ll i = 1; i <= n; i++) {
if (v[i].size() == 0) {
ans++;
continue;
}
ll flag = 1;
for (ll j = 0; j < v[i].size(); j++) {
if (h[i] <= h[v[i][j]]) {
flag = 0;
break;
}
}
if (flag)
ans++;
}
cout << ans;
}
return 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 long
#define ff first
#define ss second
#define endl '\n'
const ll MOD = 1e9 + 7;
void solve() {
int n, m;
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 x, y;
cin >> x >> y;
g[--x].push_back(--y);
g[--y].push_back(--x);
}
int ans = 0;
for (int i = 0; i < n; i++) {
bool ok = 1;
for (int j : g[i]) {
if (h[i] <= h[j]) {
ok = 0;
break;
}
}
ans += ok;
}
cout << ans << endl;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
ll t = 1;
for (ll tt = 1; tt <= t; tt++) {
// cout << "case #" << tt << ":\n";
solve();
}
return 0;
}
| #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 long
#define ff first
#define ss second
#define endl '\n'
const ll MOD = 1e9 + 7;
void solve() {
int n, m;
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 x, y;
cin >> x >> y;
g[x - 1].push_back(y - 1);
g[y - 1].push_back(x - 1);
}
int ans = 0;
for (int i = 0; i < n; i++) {
bool ok = 1;
for (int j : g[i]) {
if (h[i] <= h[j]) {
ok = 0;
break;
}
}
ans += ok;
}
cout << ans << endl;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
ll t = 1;
for (ll tt = 1; tt <= t; tt++) {
// cout << "case #" << tt << ":\n";
solve();
}
return 0;
}
| 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).end()
const int inf = 1e9 + 10;
void solve() {
ll n, m;
cin >> n >> m;
vi a(n, 0), h(n, 0);
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 0; i < m; i++) {
ll x, y;
cin >> x >> y;
a[x] = max(a[x], h[y]);
a[y] = max(a[y], h[x]);
}
ll ans = 0;
for (int i = 0; i < n; i++)
ans += h[i] > a[i];
cout << ans;
}
int main() {
FASTIO;
cout << fixed << setprecision(25);
int t = 1;
// cin >> t;
while (t--) {
solve();
}
return 0;
} | #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).end()
const int inf = 1e9 + 10;
void solve() {
ll n, m;
cin >> n >> m;
vi a(n, 0), h(n, 0);
for (int i = 0; i < n; i++)
cin >> h[i];
for (int i = 0; i < m; i++) {
ll x, y;
cin >> x >> y;
x--;
y--;
a[x] = max(a[x], h[y]);
a[y] = max(a[y], h[x]);
}
ll ans = 0;
for (int i = 0; i < n; i++)
ans += h[i] > a[i];
cout << ans;
}
int main() {
FASTIO;
cout << fixed << setprecision(25);
int t = 1;
// cin >> t;
while (t--) {
solve();
}
return 0;
} | 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(), x.rend()
#define INF 1e9
#define DEBUG(x) cout << "debug: " << x << endl
int n, m;
vector<int> graph[100010];
int main() {
cin >> n >> m;
vector<int> h(m);
rep(i, 0, n) cin >> h[i];
rep(i, 0, m) {
int a, b;
cin >> a >> b;
a--;
b--;
graph[a].push_back(b);
graph[b].push_back(a);
}
int ans = 0;
rep(i, 0, n) {
int nh = h[i];
int maxh = 0;
for (auto x : graph[i]) {
maxh = max(maxh, h[x]);
}
if (nh > maxh)
ans++;
}
cout << ans << endl;
return 0;
}
| #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(), x.rend()
#define INF 1e9
#define DEBUG(x) cout << "debug: " << x << endl
int n, m;
vector<int> graph[100010];
int main() {
cin >> n >> m;
vector<int> h(n);
rep(i, 0, n) cin >> h[i];
rep(i, 0, m) {
int a, b;
cin >> a >> b;
a--;
b--;
graph[a].push_back(b);
graph[b].push_back(a);
}
int ans = 0;
rep(i, 0, n) {
int nh = h[i];
int maxh = 0;
for (auto x : graph[i]) {
maxh = max(maxh, h[x]);
}
if (nh > maxh)
ans++;
}
cout << ans << endl;
return 0;
}
| 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(j, m) {
if (h.at(a.at(j) - 1) > h.at(b.at(j) - 1)) {
ng.at(b.at(j)) = 1;
} else if (h.at(a.at(j) - 1) < h.at(b.at(j) - 1)) {
ng.at(a.at(j) - 1) = 1;
} else {
ng.at(a.at(j) - 1) = 1;
ng.at(b.at(j) - 1) = 1;
}
}
rep(i, n) {
if (ng.at(i) == 0) {
count++;
}
}
cout << count << endl;
}
| #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(j, m) {
if (h.at(a.at(j) - 1) > h.at(b.at(j) - 1)) {
ng.at(b.at(j) - 1) = 1;
} else if (h.at(a.at(j) - 1) < h.at(b.at(j) - 1)) {
ng.at(a.at(j) - 1) = 1;
} else {
ng.at(a.at(j) - 1) = 1;
ng.at(b.at(j) - 1) = 1;
}
}
rep(i, n) {
if (ng.at(i) == 0) {
count++;
}
}
cout << count << endl;
}
| 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.at(i);
if (H.at(A.at(i) - 1) < H.at(B.at(i) - 1)) {
cnt_i.at(A.at(i) - 1)++;
} else if (H.at(A.at(i) - 1) > H.at(B.at(i) - 1)) {
cnt_i.at(B.at(i) - 1)++;
} else {
cnt_i.at(A.at(i) - 1)++;
cnt_i.at(B.at(i) - 1)++;
}
}
long long cnt_ans = 0;
for (int i = 0; i < N; i++) {
if (cnt_i.at(i) == 0) {
cnt_ans++;
}
}
cout << cnt_ans << "\n";
} | #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.at(i);
if (H.at(A.at(i) - 1) < H.at(B.at(i) - 1)) {
cnt_i.at(A.at(i) - 1)++;
} else if (H.at(A.at(i) - 1) > H.at(B.at(i) - 1)) {
cnt_i.at(B.at(i) - 1)++;
} else {
cnt_i.at(A.at(i) - 1)++;
cnt_i.at(B.at(i) - 1)++;
}
}
long long cnt_ans = 0;
for (int i = 0; i < N; i++) {
if (cnt_i.at(i) == 0) {
cnt_ans++;
}
}
cout << cnt_ans << "\n";
} | 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], H[A]);
}
int ans = 0;
for (int i = 1; i <= N; i++) {
ans += H[i] > MAX[i];
}
cout << ans << endl;
return 0;
} | #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], H[A]);
}
int ans = 0;
for (int i = 1; i <= N; i++) {
ans += H[i] > MAX[i];
}
cout << ans << endl;
return 0;
} | 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 >> a >> b;
a--;
b--;
if (high[a] > high[b])
flags[b] = false;
else if (high[a] < high[b])
flags[a] = false;
else {
flags[a] = false;
flags[b] = false;
}
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (flags[i])
ans++;
}
cout << ans << endl;
return 0;
}
| #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])
flags[b] = false;
else if (high[a] < high[b])
flags[a] = false;
else {
flags[a] = false;
flags[b] = false;
}
}
int ans = 0;
for (int i = 0; i < n; i++) {
if (flags[i])
ans++;
}
cout << ans << endl;
return 0;
}
| 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[b]) {
ini[b] = 0;
} else if (h[a] < h[b]) {
ini[a] = 0;
} else {
ini[a] = 0;
ini[b] = 0;
}
}
int sum = 0;
for (int j = 1; j <= N; j++) {
sum += ini[j];
}
cout << sum << endl;
return 0;
} | #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[b]) {
ini[b] = 0;
} else if (h[a] < h[b]) {
ini[a] = 0;
} else {
ini[a] = 0;
ini[b] = 0;
}
}
int sum = 0;
for (int j = 1; j <= N; j++) {
sum += ini[j];
}
cout << sum << endl;
return 0;
} | 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のgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> //入出力
#include <iterator> //集合演算(積集合,和集合,差集合など)
#include <map> //map(辞書)
#include <numeric> //iota(整数列の生成),gcdとlcm(c++17)
#include <queue> //キュー
#include <set> //集合
#include <stack> //スタック
#include <string> //文字列
#include <unordered_map> //イテレータあるけど順序保持しないmap
#include <unordered_set> //イテレータあるけど順序保持しないset
#include <utility> //pair
#include <vector> //可変長配列
using namespace std;
typedef long long ll;
// マクロ
// forループ関係
// 引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
// Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
// xにはvectorなどのコンテナ
#define ALL(x) (x).begin(), (x).end() // sortなどの引数を省略したい
#define SIZE(x) ((ll)(x).size()) // sizeをsize_tからllに直しておく
#define MAX(x) *max_element(ALL(x)) // 最大値を求める
#define MIN(x) *min_element(ALL(x)) // 最小値を求める
// 定数
#define INF 1000000000000 // 10^12:極めて大きい値,∞
#define MOD 1000000007 // 10^9+7:合同式の法
#define MAXR 100000 // 10^5:配列の最大のrange(素数列挙などで使用)
// 略記
#define PB push_back // vectorヘの挿入
#define MP make_pair // pairのコンストラクタ
#define F first // pairの一つ目の要素
#define S second // pairの二つ目の要素
int main() {
int N, M;
cin >> N >> M;
vector<ll> H(N);
FOR(i, 0, N) { cin >> H[i]; }
vector<int> A(N), B(N);
FOR(i, 0, M) { cin >> A[i] >> B[i]; }
vector<bool> state(N, true);
FOR(i, 0, M) {
if (H[A[i] - 1] > H[B[i] - 1])
state[B[i] - 1] = false;
else if (H[A[i] - 1] < H[B[i] - 1])
state[A[i] - 1] = false;
else
state[A[i] - 1] = state[B[i] - 1] = false;
}
auto num = count(state.begin(), state.end(), true);
cout << num << endl;
}
| // 参考：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のgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> //入出力
#include <iterator> //集合演算(積集合,和集合,差集合など)
#include <map> //map(辞書)
#include <numeric> //iota(整数列の生成),gcdとlcm(c++17)
#include <queue> //キュー
#include <set> //集合
#include <stack> //スタック
#include <string> //文字列
#include <unordered_map> //イテレータあるけど順序保持しないmap
#include <unordered_set> //イテレータあるけど順序保持しないset
#include <utility> //pair
#include <vector> //可変長配列
using namespace std;
typedef long long ll;
// マクロ
// forループ関係
// 引数は、(ループ内変数,動く範囲)か(ループ内変数,始めの数,終わりの数)、のどちらか
// Dがついてないものはループ変数は1ずつインクリメントされ、Dがついてるものはループ変数は1ずつデクリメントされる
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (ll)(b); i--)
// xにはvectorなどのコンテナ
#define ALL(x) (x).begin(), (x).end() // sortなどの引数を省略したい
#define SIZE(x) ((ll)(x).size()) // sizeをsize_tからllに直しておく
#define MAX(x) *max_element(ALL(x)) // 最大値を求める
#define MIN(x) *min_element(ALL(x)) // 最小値を求める
// 定数
#define INF 1000000000000 // 10^12:極めて大きい値,∞
#define MOD 1000000007 // 10^9+7:合同式の法
#define MAXR 100000 // 10^5:配列の最大のrange(素数列挙などで使用)
// 略記
#define PB push_back // vectorヘの挿入
#define MP make_pair // pairのコンストラクタ
#define F first // pairの一つ目の要素
#define S second // pairの二つ目の要素
int main() {
int N, M;
cin >> N >> M;
vector<ll> H(N);
FOR(i, 0, N) { cin >> H[i]; }
vector<int> A(M), B(M);
FOR(i, 0, M) { cin >> A[i] >> B[i]; }
vector<bool> state(N, true);
FOR(i, 0, M) {
if (H[A[i] - 1] > H[B[i] - 1])
state[B[i] - 1] = false;
else if (H[A[i] - 1] < H[B[i] - 1])
state[A[i] - 1] = false;
else
state[A[i] - 1] = state[B[i] - 1] = false;
}
auto num = count(state.begin(), state.end(), true);
cout << num << endl;
}
| 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)) {
good.erase(a);
good.erase(b);
}
if (h.at(a) < h.at(b))
good.erase(a);
if (h.at(b) < h.at(a))
good.erase(b);
}
cout << good.size() << endl;
}
| #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 (h.at(a) == h.at(b)) {
good.erase(a);
good.erase(b);
}
if (h.at(a) < h.at(b))
good.erase(a);
if (h.at(b) < h.at(a))
good.erase(b);
}
cout << good.size() << endl;
}
| 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.at(i) >> b.at(i);
}
for (long long i = 0; i < m; i++) {
if (h.at(a.at(i)) < h.at(b.at(i))) {
sum.at(a.at(i)) = 1;
} else if (h.at(a.at(i)) > h.at(b.at(i))) {
sum.at(b.at(i)) = 1;
}
}
for (long long i = 0; i < n; i++) {
if (sum.at(i) == 0) {
x++;
}
}
cout << x << endl;
}
| #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.at(i) >> b.at(i);
}
for (long long i = 0; i < m; i++) {
if (h.at(a.at(i) - 1) <= h.at(b.at(i) - 1)) {
sum.at(a.at(i) - 1) = 1;
}
if (h.at(a.at(i) - 1) >= h.at(b.at(i) - 1)) {
sum.at(b.at(i) - 1) = 1;
}
}
for (long long i = 0; i < n; i++) {
if (sum.at(i) == 0) {
x++;
}
}
cout << x << endl;
}
| 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 == '-';
ch = getchar();
}
while (isdigit(ch)) {
s = s * 10 + (ch ^ 48);
ch = getchar();
}
return f ? -s : s;
}
struct Edge {
int nxt;
int to;
} e[MAXN];
int n, m, ans, tot;
int a[MAXN], head[MAXN];
inline void add(int from, int to) {
e[++tot].to = to;
e[tot].nxt = head[from];
head[from] = tot;
}
void dfs(int x) {
for (rr int i = head[x]; i; i = e[i].nxt) {
int to = e[i].to;
if (a[x] <= a[to])
return;
}
ans++;
}
signed main() {
n = read();
m = read();
for (rr int i = 1; i <= n; i++)
a[i] = read();
for (rr int i = 1; i <= m; i++) {
int x = read(), y = read();
add(x, y);
add(y, x);
}
for (rr int i = 1; i <= n; i++)
dfs(i);
cout << ans << "\n";
} | #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 == '-';
ch = getchar();
}
while (isdigit(ch)) {
s = s * 10 + (ch ^ 48);
ch = getchar();
}
return f ? -s : s;
}
struct Edge {
int nxt;
int to;
} e[MAXN];
int n, m, ans, tot;
int a[MAXN], head[MAXN];
inline void add(int from, int to) {
e[++tot].to = to;
e[tot].nxt = head[from];
head[from] = tot;
}
void dfs(int x) {
for (rr int i = head[x]; i; i = e[i].nxt) {
int to = e[i].to;
if (a[x] <= a[to])
return;
}
ans++;
}
signed main() {
n = read();
m = read();
for (rr int i = 1; i <= n; i++)
a[i] = read();
for (rr int i = 1; i <= m; i++) {
int x = read(), y = read();
add(x, y);
add(y, x);
}
for (rr int i = 1; i <= n; i++)
dfs(i);
cout << ans << "\n";
} | 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]);
best[y] = max(best[y], h[x]);
}
int ans = 0;
for (int i = 1; i <= n; i++)
if (h[i] > best[i])
ans++;
cout << ans << endl;
}
| #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], h[y]);
best[y] = max(best[y], h[x]);
}
int ans = 0;
for (int i = 1; i <= n; i++)
if (h[i] > best[i])
ans++;
cout << ans << endl;
}
| 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.