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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02791 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int n, count = 0;
int min;
int p[200010];
cin >> n;
for (int i = 0; i < n; i++) {
scanf("%d", &p[i]);
}
min = p[0];
for (int i = 0; i < n; i++) {
int flag = 1;
if (min > p[i]) {
min = p[i];
}
for (int j = 0; j <= i; j++) {
if (p[i] > p[j] || min < p[i]) {
flag = 0;
break;
}
}
if (flag) {
count++;
}
}
cout << count << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, count = 0;
int min;
int p[200010];
cin >> n;
for (int i = 0; i < n; i++) {
scanf("%d", &p[i]);
}
min = p[0];
for (int i = 0; i < n; i++) {
int flag = 1;
if (min > p[i]) {
min = p[i];
}
if (min < p[i]) {
flag = 0;
}
if (flag) {
count++;
}
}
cout << count << endl;
return 0;
} | replace | 18 | 23 | 18 | 20 | TLE | |
p02791 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int P[100010];
int main() {
int N, i, cnt = 0, min;
cin >> N;
for (i = 1; i <= N; i++) {
cin >> P[i];
if (min > P[i]) {
cnt++;
// } else {
min = P[i];
}
// cout << i << " " << min << " " << cnt << endl;
}
cout << cnt << endl;
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int P[330010];
int main() {
int N, i, cnt = 0, min;
cin >> N;
for (i = 1; i <= N; i++) {
cin >> P[i];
if (min > P[i]) {
cnt++;
// } else {
min = P[i];
}
// cout << i << " " << min << " " << cnt << endl;
}
cout << cnt << endl;
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02791 | C++ | Time Limit Exceeded | // 152
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int ans = 0;
for (int i = 0; i < n; i++) {
bool flg = true;
for (int j = 0; j < i; j++) {
if (p[i] <= p[j]) {
;
} else {
flg = false;
break;
}
}
if (flg == true) {
ans = ans + 1;
}
}
cout << ans << endl;
return 0;
} | // 152
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p[i];
}
int ans = 1;
int data = p[0];
for (int i = 1; i < n; i++) {
if (data > p[i]) {
data = p[i];
ans = ans + 1;
}
}
cout << ans << endl;
return 0;
} | replace | 13 | 25 | 13 | 18 | TLE | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define srep(i, n, m) for (int i = n; i < m; i++)
#define elif else if
#define INF 1000000007
using namespace std;
int n, k, s, aa[110000], cnt = 0, cnta = INF;
signed main() {
cin >> n;
rep(i, n) {
cin >> aa[i];
if (cnta > aa[i]) {
cnta = aa[i];
cnt++;
}
}
cout << cnt;
} | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define srep(i, n, m) for (int i = n; i < m; i++)
#define elif else if
#define INF 1000000007
using namespace std;
int n, k, s, aa[220000], cnt = 0, cnta = INF;
signed main() {
cin >> n;
rep(i, n) {
cin >> aa[i];
if (cnta > aa[i]) {
cnta = aa[i];
cnt++;
}
}
cout << cnt;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02791 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> lists(n);
for (int i = 0; i < n; i++) {
cin >> lists.at(i);
}
int ans = n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < i; j++) {
if (lists.at(i) >= lists.at(j)) {
ans -= 1;
break;
}
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> lists(n);
for (int i = 0; i < n; i++) {
cin >> lists.at(i);
}
int ans = 1;
int std = lists.at(0);
for (int i = 1; i < n; i++) {
if (lists.at(i) < std) {
ans += 1;
std = lists.at(i);
}
}
cout << ans << endl;
return 0;
} | replace | 13 | 20 | 13 | 20 | TLE | |
p02791 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, p[100000], mini[100000], ans = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &p[i]);
}
mini[0] = p[0];
for (int i = 1; i < n; i++) {
mini[i] = min(mini[i - 1], p[i]);
}
for (int i = 0; i < n; i++) {
if (mini[i] == p[i]) {
ans++;
}
}
printf("%d\n", ans);
} | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n, p[200000], mini[200000], ans = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &p[i]);
}
mini[0] = p[0];
for (int i = 1; i < n; i++) {
mini[i] = min(mini[i - 1], p[i]);
}
for (int i = 0; i < n; i++) {
if (mini[i] == p[i]) {
ans++;
}
}
printf("%d\n", ans);
} | replace | 10 | 11 | 10 | 11 | 0 | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int a[N];
int main() {
int n, x, ans = 1, ma;
cin >> n;
for (int i = 0; i < n; i++)
scanf("%d", a + i);
ma = a[0];
for (int i = 1; i < n; i++) {
ma = min(ma, a[i]);
if (a[i] <= ma)
ans++;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int a[N];
int main() {
int n, x, ans = 1, ma;
cin >> n;
for (int i = 0; i < n; i++)
scanf("%d", a + i);
ma = a[0];
for (int i = 1; i < n; i++) {
ma = min(ma, a[i]);
if (a[i] <= ma)
ans++;
}
cout << ans << endl;
return 0;
}
| replace | 2 | 3 | 2 | 3 | 0 | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, c) for (int i = 0; i < (int)c; ++i)
using llint = long long int;
using namespace std;
int main() {
int N;
int P[100005];
cin >> N;
rep(i, N) cin >> P[i];
int count = 0;
int m = P[0];
rep(i, N) {
if (m >= P[i])
count++;
m = min(m, P[i]);
}
cout << count << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, c) for (int i = 0; i < (int)c; ++i)
using llint = long long int;
using namespace std;
int main() {
int N;
int P[200005];
cin >> N;
rep(i, N) cin >> P[i];
int count = 0;
int m = P[0];
rep(i, N) {
if (m >= P[i])
count++;
m = min(m, P[i]);
}
cout << count << endl;
return 0;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02791 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> P(N);
for (int i = 0; i < N; ++i) {
cin >> P.at(N);
}
int ans = 0;
int currentMin = 1e9;
for (int i = 0; i < N; ++i) {
currentMin = min(currentMin, P.at(i));
if (currentMin == P.at(i)) {
ans++;
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> P(N);
for (int i = 0; i < N; ++i) {
cin >> P.at(i);
}
int ans = 0;
int currentMin = 1e9;
for (int i = 0; i < N; ++i) {
currentMin = min(currentMin, P.at(i));
if (currentMin == P.at(i)) {
ans++;
}
}
cout << ans << endl;
return 0;
} | replace | 14 | 15 | 14 | 15 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 5) >= this->size() (which is 5)
|
p02791 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int p[n];
for (int i = 0; i < n; i++)
cin >> p[i];
int count = 0;
for (int i = 0; i < n; i++)
for (int j = 0; j <= i; j++) {
if (p[i] > p[j])
break;
if (j == i)
count++;
}
cout << count;
}
| #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int p[n];
for (int i = 0; i < n; i++)
cin >> p[i];
int count = 1;
int min = p[0];
for (int i = 1; i < n; i++)
if (p[i] < min) {
min = p[i];
count++;
}
cout << count;
}
| replace | 12 | 19 | 12 | 18 | TLE | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int N;
int P[120000];
int i;
int ans = 0;
int min = 0;
cin >> N;
for (i = 0; i < N; i++)
cin >> P[i];
min = P[0];
for (i = 0; i < N; i++) {
if (P[i] <= min) {
min = P[i];
ans++;
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <math.h>
using namespace std;
int main() {
int N;
int P[240000];
int i;
int ans = 0;
int min = 0;
cin >> N;
for (i = 0; i < N; i++)
cin >> P[i];
min = P[0];
for (i = 0; i < N; i++) {
if (P[i] <= min) {
min = P[i];
ans++;
}
}
cout << ans << endl;
return 0;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02791 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
int N;
cin >> N;
vector<int> p(N);
int i;
for (i = 0; i < N; i++)
cin >> p.at(i);
if (N == 1) {
cout << 1 << endl;
return 0;
}
int ans = 1;
for (i = 1; i < N; i++) {
int tmp = p.at(i);
sort(p.begin(), p.begin() + i + 1);
if (p.at(0) == tmp)
ans++;
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
int N;
cin >> N;
vector<int> p(N);
int i;
for (i = 0; i < N; i++)
cin >> p.at(i);
if (N == 1) {
cout << 1 << endl;
return 0;
}
int ans = 1;
for (i = 1; i < N; i++) {
int tmp = p.at(i);
p.at(0) = min(p.at(0), p.at(i));
if (p.at(0) == tmp)
ans++;
}
cout << ans << endl;
return 0;
}
| replace | 55 | 56 | 55 | 56 | TLE | |
p02791 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
int cnt = 0;
rep(i, n) {
int min = *min_element(p.begin(), p.begin() + i);
if (min >= p[i])
cnt++;
}
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;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
int cnt = 1;
int mini = p[0];
for (int i = 1; i < n; i++) {
mini = min(mini, p[i - 1]);
if (mini >= p[i])
cnt++;
}
cout << cnt << endl;
} | replace | 8 | 12 | 8 | 13 | TLE | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, res, mn;
int a[100001];
cin >> n;
res = 0;
mn = INT_MAX;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (mn >= a[i]) {
mn = a[i];
res++;
}
}
cout << res << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, res, mn;
int a[200001];
cin >> n;
res = 0;
mn = INT_MAX;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (mn >= a[i]) {
mn = a[i];
res++;
}
}
cout << res << endl;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, total = 0, minv = 1e5 + 5;
int a[100005];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
if (a[i] <= minv) {
minv = a[i];
total++;
}
}
cout << total << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n, total = 0, minv = 2138475648;
int a[200005];
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
if (a[i] <= minv) {
minv = a[i];
total++;
}
}
cout << total << endl;
return 0;
} | replace | 3 | 5 | 3 | 5 | 0 | |
p02791 | C++ | Runtime Error | #include <iostream>
using namespace std;
int n, p[20010], count, miiin;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p[i];
}
miiin = p[0];
for (int i = 0; i < n; i++) {
if (p[i] == 1) {
count += 1;
cout << count << endl;
return 0;
}
if (p[i] <= miiin) {
count += 1;
miiin = p[i];
}
}
} | #include <iostream>
using namespace std;
int n, p[200100], count, miiin;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> p[i];
}
miiin = p[0];
for (int i = 0; i < n; i++) {
if (p[i] == 1) {
count += 1;
cout << count << endl;
return 0;
}
if (p[i] <= miiin) {
count += 1;
miiin = p[i];
}
}
} | replace | 2 | 3 | 2 | 3 | 0 | |
p02791 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int P[N];
for (int i = 0; i < N; i++)
cin >> P[i];
int ans = 1;
for (int i = 1; i < N; i++) {
bool flag = true;
for (int j = i - 1; j >= 0; j--) {
if (P[j] < P[i]) {
flag = false;
break;
}
}
if (flag)
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int P[N];
for (int i = 0; i < N; i++)
cin >> P[i];
int M[N], m = INT_MAX;
for (int i = 0; i < N; i++) {
m = min(P[i], m);
M[i] = m;
}
int ans = 0;
for (int i = 0; i < N; i++) {
if (M[i] == P[i]) // P[i]が最小 → P[i] = M[i]
ans++;
}
cout << ans << endl;
} | replace | 10 | 20 | 10 | 19 | TLE | |
p02791 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define mem(i, a) memset(i, a, sizeof(i))
#define PI acos(-1.0)
#define DMAX 100000 + 5
#define MOD 20190823
#define eps 1e-8
#define mp make_pair
#define INF 1000000000 + 9
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
inline void read(int &f) {
f = 0;
ll x = 1;
char ch = getchar();
while (ch < 48 || ch > 57) {
if (ch == '-') {
x = -1;
}
ch = getchar();
}
while (ch <= 57 && ch >= 48) {
f = f * 10 + ch - '0';
ch = getchar();
}
f *= x;
}
int n;
int tr[DMAX];
int a[DMAX];
int ans = 1;
int minn = INF;
int lowbit(int p) { return p & (-p); }
void add(int pos, int val) {
for (; pos <= n; pos += lowbit(pos)) {
tr[pos] += val;
}
}
int query(int pos) {
int add = 0;
for (; pos; pos -= lowbit(pos)) {
add += tr[pos];
}
return add;
}
int main() {
read(n);
for (int i = 1; i <= n; i++) {
read(a[i]);
}
minn = a[1];
for (int i = 2; i <= n; i++) {
if (a[i] < minn) {
ans++;
minn = a[i];
}
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define mem(i, a) memset(i, a, sizeof(i))
#define PI acos(-1.0)
#define DMAX 200000 + 5
#define MOD 20190823
#define eps 1e-8
#define mp make_pair
#define INF 1000000000 + 9
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
inline void read(int &f) {
f = 0;
ll x = 1;
char ch = getchar();
while (ch < 48 || ch > 57) {
if (ch == '-') {
x = -1;
}
ch = getchar();
}
while (ch <= 57 && ch >= 48) {
f = f * 10 + ch - '0';
ch = getchar();
}
f *= x;
}
int n;
int tr[DMAX];
int a[DMAX];
int ans = 1;
int minn = INF;
int lowbit(int p) { return p & (-p); }
void add(int pos, int val) {
for (; pos <= n; pos += lowbit(pos)) {
tr[pos] += val;
}
}
int query(int pos) {
int add = 0;
for (; pos; pos -= lowbit(pos)) {
add += tr[pos];
}
return add;
}
int main() {
read(n);
for (int i = 1; i <= n; i++) {
read(a[i]);
}
minn = a[1];
for (int i = 2; i <= n; i++) {
if (a[i] < minn) {
ans++;
minn = a[i];
}
}
cout << ans << endl;
return 0;
} | replace | 12 | 13 | 12 | 13 | 0 | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n;
scanf("%d", &n);
int p[100000];
rep(i, n) scanf("%d", &p[i]);
int mn = n + 1;
int ans = 0;
rep(i, n) {
if (p[i] <= mn)
ans++;
mn = min(mn, p[i]);
}
printf("%d\n", ans);
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n;
scanf("%d", &n);
int p[200000];
rep(i, n) scanf("%d", &p[i]);
int mn = n + 1;
int ans = 0;
rep(i, n) {
if (p[i] <= mn)
ans++;
mn = min(mn, p[i]);
}
printf("%d\n", ans);
return 0;
}
| replace | 9 | 10 | 9 | 10 | 0 | |
p02791 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main(void) {
int N;
cin >> N;
int P[N];
for (int i = 0; i < N; i++)
cin >> P[i];
int j, k, count = 1;
for (j = 1; j < N; j++) {
for (k = j - 1; k > -1; k--) {
if (P[j] > P[k])
break;
if (k == 0)
count++;
}
}
cout << count << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
int N;
cin >> N;
int P[N];
for (int i = 0; i < N; i++)
cin >> P[i];
int j, min = 10000000, count = 0;
for (j = 0; j < N; j++) {
if (P[j] < min)
min = P[j];
if (min == P[j])
count++;
}
cout << count << endl;
return 0;
}
| replace | 10 | 18 | 10 | 16 | TLE | |
p02791 | C++ | Runtime Error | /* -*- coding: utf-8 -*-
*
* c.cc: C - Low Elements
*/
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
/* constant */
const int MAX_N = 100000;
/* typedef */
template <typename T, const int MAX_N> struct BIT {
int n;
T bits[MAX_N + 1];
BIT() {}
void init(int _n) {
n = _n;
// memset(bits, 0, sizeof(bits));
}
T sum(int x) {
T s = 0;
while (x > 0) {
s += bits[x];
x -= (x & -x);
}
return s;
}
void add(int x, T v) {
while (x <= n) {
bits[x] += v;
x += (x & -x);
}
}
};
/* global variables */
BIT<int, MAX_N> bit;
/* subroutines */
/* main */
int main() {
int n;
scanf("%d", &n);
bit.init(n);
int cnt = 0;
for (int i = 0; i < n; i++) {
int pi;
scanf("%d", &pi);
int s = bit.sum(pi);
if (s == 0)
cnt++;
// printf("%d: %d\n", pi, s);
bit.add(pi, 1);
}
printf("%d\n", cnt);
return 0;
}
| /* -*- coding: utf-8 -*-
*
* c.cc: C - Low Elements
*/
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
/* constant */
const int MAX_N = 200000;
/* typedef */
template <typename T, const int MAX_N> struct BIT {
int n;
T bits[MAX_N + 1];
BIT() {}
void init(int _n) {
n = _n;
// memset(bits, 0, sizeof(bits));
}
T sum(int x) {
T s = 0;
while (x > 0) {
s += bits[x];
x -= (x & -x);
}
return s;
}
void add(int x, T v) {
while (x <= n) {
bits[x] += v;
x += (x & -x);
}
}
};
/* global variables */
BIT<int, MAX_N> bit;
/* subroutines */
/* main */
int main() {
int n;
scanf("%d", &n);
bit.init(n);
int cnt = 0;
for (int i = 0; i < n; i++) {
int pi;
scanf("%d", &pi);
int s = bit.sum(pi);
if (s == 0)
cnt++;
// printf("%d: %d\n", pi, s);
bit.add(pi, 1);
}
printf("%d\n", cnt);
return 0;
}
| replace | 28 | 29 | 28 | 29 | 0 | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int M;
int S = 0;
cin >> N;
vector<int> vec(N);
for (int X = 0; X < N; X++) {
cin >> vec.at(N);
}
M = vec.at(0);
for (int X = 1; X < N; X++) {
if (M >= vec.at(X)) {
M = vec.at(X);
S++;
}
}
cout << S + 1 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int M;
int S = 0;
cin >> N;
vector<int> vec(N);
for (int X = 0; X < N; X++) {
cin >> vec.at(X);
}
M = vec.at(0);
for (int X = 1; X < N; X++) {
if (M >= vec.at(X)) {
M = vec.at(X);
S++;
}
}
cout << S + 1 << endl;
} | replace | 10 | 11 | 10 | 11 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 5) >= this->size() (which is 5)
|
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long int ll;
#define MAXSIZE 10000000;
const int MAX = 510000;
const int MOD = 1000000007;
const long long INF = 1LL << 60;
const ll MAXINDx = 3000;
const ll MAXINDy = 3000;
double dp[MAXINDx][MAXINDy] = {0};
struct UnionFind {
vector<int> par;
vector<int> rank;
UnionFind(int N) : par(N + 1), rank(N + 1) {
for (int i = 1; i <= N; i++) {
par[i] = i;
rank[i] = 0;
}
}
int root(int x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) { // xとyの木を併合
int rx = root(x); // xの根をrx
int ry = root(y); // yの根をry
if (rx == ry)
return; // xとyの根が同じ(=同じ木にある)時はそのまま
if (rank[rx] < rank[ry]) {
par[rx] = ry;
} else {
par[ry] = rx;
if (rank[rx] == rank[ry])
rank[rx]++;
}
}
bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
struct edge {
int from, to;
ll cost;
};
vector<edge> edges;
// vector<pair<int, int>>; edge[from] => <to, cost>
bool comp(const edge &a, const edge &b) { return a.cost < b.cost; }
ll d[1001];
ll ans = 0;
bool neg[1001] = {false};
int V, E;
bool existNegLoop = false;
void BellmanFord(int s) {
for (int i = 0; i < V; i++) {
d[i] = INF;
}
d[s] = 0;
int cnt = 0;
while (true) {
bool updated = false;
for (int i = 0; i < E; i++) {
edge e = edges[i];
if (d[e.from] != INF && d[e.to] > d[e.from] + e.cost) {
d[e.to] = d[e.from] + e.cost;
updated = true;
}
}
cnt++;
if (!updated)
break;
if (cnt == V - 1)
break;
}
ans = -d[V - 1];
}
void BellmanFordNeg(int s) {
for (int i = 0; i < V; i++) {
neg[i] = false;
}
int cnt = 0;
while (true) {
bool updated = false;
for (int i = 0; i < E; i++) {
edge e = edges[i];
if (d[e.from] != INF && d[e.to] > d[e.from] + e.cost) {
d[e.to] = d[e.from] + e.cost;
neg[e.to] = true;
updated = true;
}
if (neg[e.from])
neg[e.to] = true;
}
cnt++;
if (!updated)
break;
if (cnt == V) {
if (neg[V - 1])
existNegLoop = true;
break;
}
}
}
bool findNegativeLoop() {
for (int i = 0; i < V; i++) {
d[i] = 0;
}
for (int i = 0; i < V; i++) {
for (int j = 0; j < E; j++) {
edge e = edges[j];
if (d[e.to] > d[e.from] + e.cost) {
d[e.to] = d[e.from] + e.cost;
if (i == V - 1)
return true;
}
}
}
return false;
}
ll gcd(ll a, ll b) {
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
ll pow(ll a, ll b) {
if (b == 0) {
return 1;
}
ll ans = 1;
for (int i = 0; i < b; i++) {
ans *= a;
}
return ans;
}
int main() {
int N;
cin >> N;
int ans = 0;
int P[100001] = {0};
for (int i = 0; i < N; i++) {
cin >> P[i];
}
ans = 1;
int min = P[0];
for (int i = 1; i < N; i++) {
if (min >= P[i]) {
ans++;
min = P[i];
}
}
cout << ans << endl;
return 0;
}
/*Syakutori
cout << fixed << setprecision(10) << ans << endl;
while(cin >>b && b)){
ll t = 1;
long long int ansS = 1,ansT=0;
long long int sum = 0;
for(ll s = 1;s < 50000000;s++){
while(t < 50000000 && sum+Rsum[t] < b){
sum += Rsum[t];
t++;
}
if(b == sum+Rsum[t]){
if(ansT - ansS < t-s){
ansS = s;
ansT = t;
}
cout <<ansS<<" "<<ansT-ansS + 1<<endl;
break;
}
if(t == s)++t;
else sum -= Rsum[s];
}
}
//priority_queue<long long int,vector<long long int>, greater<long long int>>
PQ;
//priority_queue<long long int> PQ1;
ll gcd(ll a,ll b){
if(a%b == 0){
return b;
}else{
return gcd(b,a%b);
}
}
/*
int rec(int v){
int res = 0;
if(dp[v] > -1)return dp[v];
for(auto nv: edges[v]){
res = max(res, rec(nv) + 1);
}
return dp[v] = res;
}
int visi[100001] = {0};
void dfs(int u)
{
visi[u] = 1;
for (auto nv : edge[u])
{
if ((visi[nv.first] == 1))
continue;
node[nv.first] = (node[u] + nv.second) % 2;
dfs(nv.first);
}
}
ll d_to[100001] = {0};
ll d_re[100001] = {0};
vector<pair<int, int>>; edge[from] => <to, cost>
void dijkstra(int s, ll *d)
{
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int,
int>>> que; //{least distancem, nodeNUm} fill(d, d + N + 1, INF); d[s] = 0;
que.push(make_pair(0, s));
while (!que.empty())
{
pair<int, int> p = que.top();
que.pop();
int v = p.second;
if (d[v] < p.first)
continue;
for (auto nv : edge[v])
{
if (d[nv.first] > d[v] + nv.second)
{
d[nv.first] = d[v] + nv.second;
que.push(make_pair(d[nv.first], nv.first));
}
}
}
}
ll kruskal()
{
sort(edges.begin(), edges.end(), comp);
UnionFind Unitree(V);
ll res = 0;
for (auto edge : edges)
{
if (!Unitree.same(edge.from, edge.to))
{
Unitree.unite(edge.from, edge.to);
res += edge.cost;
}
}
return res;
}
bool check(ll mid)
{
if (mid > R || mid > B)
return false;
ll num = (R - mid) / (x - 1) + (B - mid) / (y - 1);
return (num >= mid);
}
*/
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long int ll;
#define MAXSIZE 10000000;
const int MAX = 510000;
const int MOD = 1000000007;
const long long INF = 1LL << 60;
const ll MAXINDx = 3000;
const ll MAXINDy = 3000;
double dp[MAXINDx][MAXINDy] = {0};
struct UnionFind {
vector<int> par;
vector<int> rank;
UnionFind(int N) : par(N + 1), rank(N + 1) {
for (int i = 1; i <= N; i++) {
par[i] = i;
rank[i] = 0;
}
}
int root(int x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) { // xとyの木を併合
int rx = root(x); // xの根をrx
int ry = root(y); // yの根をry
if (rx == ry)
return; // xとyの根が同じ(=同じ木にある)時はそのまま
if (rank[rx] < rank[ry]) {
par[rx] = ry;
} else {
par[ry] = rx;
if (rank[rx] == rank[ry])
rank[rx]++;
}
}
bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
struct edge {
int from, to;
ll cost;
};
vector<edge> edges;
// vector<pair<int, int>>; edge[from] => <to, cost>
bool comp(const edge &a, const edge &b) { return a.cost < b.cost; }
ll d[1001];
ll ans = 0;
bool neg[1001] = {false};
int V, E;
bool existNegLoop = false;
void BellmanFord(int s) {
for (int i = 0; i < V; i++) {
d[i] = INF;
}
d[s] = 0;
int cnt = 0;
while (true) {
bool updated = false;
for (int i = 0; i < E; i++) {
edge e = edges[i];
if (d[e.from] != INF && d[e.to] > d[e.from] + e.cost) {
d[e.to] = d[e.from] + e.cost;
updated = true;
}
}
cnt++;
if (!updated)
break;
if (cnt == V - 1)
break;
}
ans = -d[V - 1];
}
void BellmanFordNeg(int s) {
for (int i = 0; i < V; i++) {
neg[i] = false;
}
int cnt = 0;
while (true) {
bool updated = false;
for (int i = 0; i < E; i++) {
edge e = edges[i];
if (d[e.from] != INF && d[e.to] > d[e.from] + e.cost) {
d[e.to] = d[e.from] + e.cost;
neg[e.to] = true;
updated = true;
}
if (neg[e.from])
neg[e.to] = true;
}
cnt++;
if (!updated)
break;
if (cnt == V) {
if (neg[V - 1])
existNegLoop = true;
break;
}
}
}
bool findNegativeLoop() {
for (int i = 0; i < V; i++) {
d[i] = 0;
}
for (int i = 0; i < V; i++) {
for (int j = 0; j < E; j++) {
edge e = edges[j];
if (d[e.to] > d[e.from] + e.cost) {
d[e.to] = d[e.from] + e.cost;
if (i == V - 1)
return true;
}
}
}
return false;
}
ll gcd(ll a, ll b) {
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
ll pow(ll a, ll b) {
if (b == 0) {
return 1;
}
ll ans = 1;
for (int i = 0; i < b; i++) {
ans *= a;
}
return ans;
}
int main() {
int N;
cin >> N;
int ans = 0;
int P[200001] = {0};
for (int i = 0; i < N; i++) {
cin >> P[i];
}
ans = 1;
int min = P[0];
for (int i = 1; i < N; i++) {
if (min >= P[i]) {
ans++;
min = P[i];
}
}
cout << ans << endl;
return 0;
}
/*Syakutori
cout << fixed << setprecision(10) << ans << endl;
while(cin >>b && b)){
ll t = 1;
long long int ansS = 1,ansT=0;
long long int sum = 0;
for(ll s = 1;s < 50000000;s++){
while(t < 50000000 && sum+Rsum[t] < b){
sum += Rsum[t];
t++;
}
if(b == sum+Rsum[t]){
if(ansT - ansS < t-s){
ansS = s;
ansT = t;
}
cout <<ansS<<" "<<ansT-ansS + 1<<endl;
break;
}
if(t == s)++t;
else sum -= Rsum[s];
}
}
//priority_queue<long long int,vector<long long int>, greater<long long int>>
PQ;
//priority_queue<long long int> PQ1;
ll gcd(ll a,ll b){
if(a%b == 0){
return b;
}else{
return gcd(b,a%b);
}
}
/*
int rec(int v){
int res = 0;
if(dp[v] > -1)return dp[v];
for(auto nv: edges[v]){
res = max(res, rec(nv) + 1);
}
return dp[v] = res;
}
int visi[100001] = {0};
void dfs(int u)
{
visi[u] = 1;
for (auto nv : edge[u])
{
if ((visi[nv.first] == 1))
continue;
node[nv.first] = (node[u] + nv.second) % 2;
dfs(nv.first);
}
}
ll d_to[100001] = {0};
ll d_re[100001] = {0};
vector<pair<int, int>>; edge[from] => <to, cost>
void dijkstra(int s, ll *d)
{
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int,
int>>> que; //{least distancem, nodeNUm} fill(d, d + N + 1, INF); d[s] = 0;
que.push(make_pair(0, s));
while (!que.empty())
{
pair<int, int> p = que.top();
que.pop();
int v = p.second;
if (d[v] < p.first)
continue;
for (auto nv : edge[v])
{
if (d[nv.first] > d[v] + nv.second)
{
d[nv.first] = d[v] + nv.second;
que.push(make_pair(d[nv.first], nv.first));
}
}
}
}
ll kruskal()
{
sort(edges.begin(), edges.end(), comp);
UnionFind Unitree(V);
ll res = 0;
for (auto edge : edges)
{
if (!Unitree.same(edge.from, edge.to))
{
Unitree.unite(edge.from, edge.to);
res += edge.cost;
}
}
return res;
}
bool check(ll mid)
{
if (mid > R || mid > B)
return false;
ll num = (R - mid) / (x - 1) + (B - mid) / (y - 1);
return (num >= mid);
}
*/
| replace | 162 | 163 | 162 | 163 | 0 | |
p02791 | C++ | Time Limit Exceeded |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBAC
/*map<Keyの型, Valueの型> 変数名;
queue<型> 変数名;
priority_queue<型> 変数名;
priority_queue<型, vector<型>, greater<型>> 変数名;*/
// copy(v1.begin(), v1.end(), back_inserter(v2));
using namespace std;
int gcd(int a, int b) {
int c;
if (a < b) {
c = a;
a = b;
b = c;
}
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
int sort_greater(int m, int n) {
vector<int> a(m);
for (int i = 0; i < m; i++) {
cin >> a[i];
}
sort(a.begin(), a.end(), greater<int>());
for (int i = 0; i < n; i++) {
cout << a[i];
}
return 0;
}
int bubblesort(int a[], int n) {
int sw = 0;
bool flag = 1;
for (int i = 0; flag; i++) {
flag = 0;
for (int j = n - 1; j >= i + 1; j--) {
if (a[j] < a[j - 1]) {
swap(a[j], a[j - 1]);
flag = 1;
sw += 1;
}
}
}
return sw;
}
int a_z() {
for (int i = 0; i <= ('Z' - 'A'); i++) {
cout << (char)('A' + i);
}
return 0;
}
int selecttionsort(int a[], int n) {
int t, sw = 0, minj;
for (int i = 0; i < n - 1; i++) {
minj = i;
for (int j = 0; j < n - 1; j++) {
if (a[j] < a[minj]) {
minj = j;
}
}
t = a[i];
a[i] = a[minj];
a[minj] = t;
if (i != minj)
sw += 1;
}
return sw;
}
map<string, int> memo;
int main() {
// sort(a.begin(),a.end());
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
int ans = 0, b = p[0];
rep(i, n) {
bool a = true;
rep(j, i + 1) {
b = min(b, p[j]);
if (p[i] > b) {
a = false;
break;
}
}
if (a)
ans++;
}
cout << ans;
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBAC
/*map<Keyの型, Valueの型> 変数名;
queue<型> 変数名;
priority_queue<型> 変数名;
priority_queue<型, vector<型>, greater<型>> 変数名;*/
// copy(v1.begin(), v1.end(), back_inserter(v2));
using namespace std;
int gcd(int a, int b) {
int c;
if (a < b) {
c = a;
a = b;
b = c;
}
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
int sort_greater(int m, int n) {
vector<int> a(m);
for (int i = 0; i < m; i++) {
cin >> a[i];
}
sort(a.begin(), a.end(), greater<int>());
for (int i = 0; i < n; i++) {
cout << a[i];
}
return 0;
}
int bubblesort(int a[], int n) {
int sw = 0;
bool flag = 1;
for (int i = 0; flag; i++) {
flag = 0;
for (int j = n - 1; j >= i + 1; j--) {
if (a[j] < a[j - 1]) {
swap(a[j], a[j - 1]);
flag = 1;
sw += 1;
}
}
}
return sw;
}
int a_z() {
for (int i = 0; i <= ('Z' - 'A'); i++) {
cout << (char)('A' + i);
}
return 0;
}
int selecttionsort(int a[], int n) {
int t, sw = 0, minj;
for (int i = 0; i < n - 1; i++) {
minj = i;
for (int j = 0; j < n - 1; j++) {
if (a[j] < a[minj]) {
minj = j;
}
}
t = a[i];
a[i] = a[minj];
a[minj] = t;
if (i != minj)
sw += 1;
}
return sw;
}
map<string, int> memo;
int main() {
// sort(a.begin(),a.end());
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
int ans = 0, b = p[0];
rep(i, n) {
b = min(b, p[i]);
if (b == p[i])
ans++;
}
cout << ans;
return 0;
}
| replace | 96 | 105 | 96 | 98 | TLE | |
p02791 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++)
cin >> vec[i];
int count = 1;
for (int i = 1; i < n; i++) {
for (int j = 0; j < i; j++) {
if (vec[j] <= vec[i])
break;
if (j == i - 1)
count++;
}
}
cout << count << endl;
return 0;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++)
cin >> vec[i];
int count = 0;
int min_num = n + 1;
for (int i = 0; i < n; i++) {
if (vec[i] == 1) {
count++;
break;
}
if (vec[i] < min_num) {
min_num = vec[i];
count++;
}
}
cout << count << endl;
return 0;
}
| replace | 11 | 18 | 11 | 22 | TLE | |
p02791 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define io_optimized \
ios::sync_with_stdio(false); \
cin.tie(0);
using namespace std;
int main() {
io_optimized int n;
while (cin >> n) {
int a[n];
int sum = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
bool c = 1;
for (int j = 0; j < i; j++) {
if (a[j] < a[i]) {
c = 0;
break;
}
}
if (c) {
sum++;
}
}
cout << sum << "\n";
}
return 0;
}
| #include <bits/stdc++.h>
#define io_optimized \
ios::sync_with_stdio(false); \
cin.tie(0);
using namespace std;
int main() {
io_optimized int t, n, min;
while (cin >> t) {
t--;
int sum = 1;
cin >> min;
while (t--) {
cin >> n;
if (n <= min) {
min = n;
sum++;
}
}
cout << sum << "\n";
}
return 0;
}
| replace | 7 | 21 | 7 | 16 | TLE | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef int _loop_int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); ++i)
#define FOR(i, a, b) for (_loop_int i = (_loop_int)(a); i < (_loop_int)(b); ++i)
#define FORR(i, a, b) \
for (_loop_int i = (_loop_int)(b)-1; i >= (_loop_int)(a); --i)
#define DEBUG(x) cout << #x << ": " << x << endl
#define DEBUG2(x, y) cout << #x << ": " << x << " " << #y << ": " << y << endl
#define DEBUG_VEC(v) \
cout << #v << ":"; \
REP(i, v.size()) cout << " " << v[i]; \
cout << endl
#define DEBUG_ARR(v, n) \
cout << #v << ":"; \
REP(i, n) cout << " " << v[i]; \
cout << endl
#define ALL(a) (a).begin(), (a).end()
const ll MOD = 1000000007ll;
#define FIX(a) ((a) % MOD + MOD) % MOD
int n, s;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
int p[100010];
// int mx=-1;
REP(i, n) { cin >> p[i]; }
int mn = p[0];
int ans = 1;
FOR(i, 1, n) {
if (mn > p[i]) {
ans++;
mn = p[i];
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef int _loop_int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); ++i)
#define FOR(i, a, b) for (_loop_int i = (_loop_int)(a); i < (_loop_int)(b); ++i)
#define FORR(i, a, b) \
for (_loop_int i = (_loop_int)(b)-1; i >= (_loop_int)(a); --i)
#define DEBUG(x) cout << #x << ": " << x << endl
#define DEBUG2(x, y) cout << #x << ": " << x << " " << #y << ": " << y << endl
#define DEBUG_VEC(v) \
cout << #v << ":"; \
REP(i, v.size()) cout << " " << v[i]; \
cout << endl
#define DEBUG_ARR(v, n) \
cout << #v << ":"; \
REP(i, n) cout << " " << v[i]; \
cout << endl
#define ALL(a) (a).begin(), (a).end()
const ll MOD = 1000000007ll;
#define FIX(a) ((a) % MOD + MOD) % MOD
int n, s;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n;
int p[200010];
// int mx=-1;
REP(i, n) { cin >> p[i]; }
int mn = p[0];
int ans = 1;
FOR(i, 1, n) {
if (mn > p[i]) {
ans++;
mn = p[i];
}
}
cout << ans << endl;
return 0;
} | replace | 35 | 36 | 35 | 36 | 0 | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7;
int arr[N], mark[N];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> arr[i];
mark[1] = arr[1];
for (int i = 2; i <= n; i++) {
mark[i] = min(mark[i - 1], arr[i]);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
if (arr[i] <= mark[i]) {
ans++;
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 7;
int arr[N], mark[N];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> arr[i];
mark[1] = arr[1];
for (int i = 2; i <= n; i++) {
mark[i] = min(mark[i - 1], arr[i]);
}
int ans = 0;
for (int i = 1; i <= n; i++) {
if (arr[i] <= mark[i]) {
ans++;
}
}
cout << ans << endl;
return 0;
}
| replace | 2 | 3 | 2 | 3 | 0 | |
p02791 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define repp(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define reppe(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
#define repm(i, a, b) for (int i = (int)(a); i > (int)(b); --i)
#define repme(i, a, b) for (int i = (int)(a); i >= (int)(b); --i)
typedef long long ll;
long long GCD(long long a, long long b) {
if (b == 0)
return a;
return GCD(b, a % b);
}
int main() {
int N;
cin >> N;
vector<int> P(N);
repp(i, 0, N) cin >> P[i];
int res = 0;
repp(i, 0, N) {
bool b = true;
reppe(j, 0, i) { b &= P[j] >= P[i]; }
if (b)
++res;
}
cout << res << endl;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define repp(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define reppe(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
#define repm(i, a, b) for (int i = (int)(a); i > (int)(b); --i)
#define repme(i, a, b) for (int i = (int)(a); i >= (int)(b); --i)
typedef long long ll;
long long GCD(long long a, long long b) {
if (b == 0)
return a;
return GCD(b, a % b);
}
int main() {
int N;
cin >> N;
vector<int> P(N);
repp(i, 0, N) cin >> P[i];
int res = 1;
int minN = P[0];
repp(i, 1, N) {
if (minN > P[i])
res++;
minN = min(minN, P[i]);
}
cout << res << endl;
}
| replace | 28 | 34 | 28 | 34 | TLE | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define debug(x) cerr << #x << ' ' << x << '\n'
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
const int maxn = 1e5 + 10;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
int book[maxn];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, cnt = 0;
cin >> n;
rep(i, 1, n) cin >> book[i];
int Min = inf;
rep(i, 1, n) {
if (book[i] < Min) {
Min = book[i];
cnt++;
}
}
cout << cnt << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define debug(x) cerr << #x << ' ' << x << '\n'
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
const int maxn = 2e5 + 10;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
int book[maxn];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, cnt = 0;
cin >> n;
rep(i, 1, n) cin >> book[i];
int Min = inf;
rep(i, 1, n) {
if (book[i] < Min) {
Min = book[i];
cnt++;
}
}
cout << cnt << '\n';
return 0;
}
| replace | 13 | 14 | 13 | 14 | 0 | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int M = 1e5 + 10;
int a[M];
int main(int argc, char const *argv[]) {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int mn = a[1];
int ans = 0;
for (int i = 2; i <= n; i++) {
if (mn < a[i])
ans++;
mn = min(mn, a[i]);
}
cout << n - ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int M = 2e5 + 10;
int a[M];
int main(int argc, char const *argv[]) {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
int mn = a[1];
int ans = 0;
for (int i = 2; i <= n; i++) {
if (mn < a[i])
ans++;
mn = min(mn, a[i]);
}
cout << n - ans << endl;
return 0;
} | replace | 2 | 3 | 2 | 3 | 0 | |
p02791 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <stdio.h>
using namespace std;
#define N 50000
#define nmax 50000
#define INFTY 100000
int n;
int num[N];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
num[i] = a;
}
int count = 1;
int memo = num[0];
for (int i = 1; i < n; i++) {
if (memo > num[i]) {
count += 1;
memo = num[i];
}
}
cout << count << endl;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <stdio.h>
using namespace std;
#define N 500000
#define nmax 50000
#define INFTY 100000
int n;
int num[N];
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
num[i] = a;
}
int count = 1;
int memo = num[0];
for (int i = 1; i < n; i++) {
if (memo > num[i]) {
count += 1;
memo = num[i];
}
}
cout << count << endl;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02791 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define INF 4000000000000000000LL
#define MOD 1000000007
#define ALL(x) std::begin(x), std::end(x)
int main(int argc, char **argv) {
std::cin.tie(0);
std::ios_base::sync_with_stdio(0);
std::cout << std::fixed << std::setprecision(6);
std::cerr << std::fixed << std::setprecision(6);
int N, P[111111], C = 0;
std::cin >> N;
for (int i = 0; i < N; i++)
std::cin >> P[i];
std::set<int> set;
for (int i = 0; i < N; i++) {
if (set.empty()) {
C++;
} else if (*set.begin() >= P[i]) {
C++;
}
set.insert(P[i]);
}
std::cout << C << std::endl;
return 0;
}
| #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define INF 4000000000000000000LL
#define MOD 1000000007
#define ALL(x) std::begin(x), std::end(x)
int main(int argc, char **argv) {
std::cin.tie(0);
std::ios_base::sync_with_stdio(0);
std::cout << std::fixed << std::setprecision(6);
std::cerr << std::fixed << std::setprecision(6);
int N, P[222222], C = 0;
std::cin >> N;
for (int i = 0; i < N; i++)
std::cin >> P[i];
std::set<int> set;
for (int i = 0; i < N; i++) {
if (set.empty()) {
C++;
} else if (*set.begin() >= P[i]) {
C++;
}
set.insert(P[i]);
}
std::cout << C << std::endl;
return 0;
}
| replace | 32 | 33 | 32 | 33 | 0 | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
const int INF = 0x3f3f3f3f;
int a[maxn];
void fl() {
freopen(".in", "r", stdin);
freopen(".out", "w", stdout);
}
int main() {
// fl();
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
int minn = INF, ans = 0;
for (int i = 1; i <= n; i++) {
minn = min(minn, a[i]);
if (minn >= a[i])
ans++;
}
printf("%d\n", ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
const int INF = 0x3f3f3f3f;
int a[2 * maxn];
void fl() {
freopen(".in", "r", stdin);
freopen(".out", "w", stdout);
}
int main() {
// fl();
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
int minn = INF, ans = 0;
for (int i = 1; i <= n; i++) {
minn = min(minn, a[i]);
if (minn >= a[i])
ans++;
}
printf("%d\n", ans);
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
const ll INF = 1e18;
const int maxn = 2e5 + 10;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ll int n, m, a[maxn], i;
cin >> n;
for (i = 1; i <= n; i++)
cin >> a[i];
ll int mini = a[1], c = 1;
for (i = 2; i <= n; i++) {
if (a[i] <= mini)
c++;
mini = min(mini, a[i]);
}
cout << c;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
const ll INF = 1e18;
const int maxn = 2e5 + 10;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll int n, m, a[maxn], i;
cin >> n;
for (i = 1; i <= n; i++)
cin >> a[i];
ll int mini = a[1], c = 1;
for (i = 2; i <= n; i++) {
if (a[i] <= mini)
c++;
mini = min(mini, a[i]);
}
cout << c;
return 0;
} | delete | 11 | 15 | 11 | 11 | 0 | |
p02791 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <random>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
int ans = 0;
int nowMin = p[0];
rep(i, n) {
if (i != 0 && nowMin == 1)
break;
if (p[i] > nowMin) {
continue;
}
bool ok = true;
for (int j = 0; j < i; j++) {
if (p[i] > p[j]) {
ok = false;
break;
}
}
if (ok)
ans++;
nowMin = max(nowMin, p[i]);
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <random>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
int ans = 0;
int nowMin = p[0];
rep(i, n) {
if (i != 0 && nowMin == 1)
break;
if (p[i] > nowMin) {
continue;
}
ans++;
nowMin = min(nowMin, p[i]);
}
cout << ans << endl;
return 0;
} | replace | 26 | 36 | 26 | 28 | TLE | |
p02791 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define repe(i, n) for (int i = 0; i <= n; ++i)
#define repr(i, n) for (int i = n - 1; i > 0; --i)
#define all(x) (x).begin(), (x).end()
#define pb(x) push_back(x)
using namespace std;
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;
}
template <class T> using V = vector<T>;
typedef long long ll;
const int INF = 1e9;
const ll MOD = 1000000007;
const ll MAX = 510000;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
int n, p;
cin >> n;
vector<int> P;
vector<int> PP;
int cnt = 0;
rep(i, n) {
cin >> p;
P.pb(p);
if (p == *min_element(all(P))) {
cnt++;
}
}
cout << cnt << "\n";
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define repe(i, n) for (int i = 0; i <= n; ++i)
#define repr(i, n) for (int i = n - 1; i > 0; --i)
#define all(x) (x).begin(), (x).end()
#define pb(x) push_back(x)
using namespace std;
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;
}
template <class T> using V = vector<T>;
typedef long long ll;
const int INF = 1e9;
const ll MOD = 1000000007;
const ll MAX = 510000;
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a * b / gcd(a, b); }
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
int n, p;
cin >> n;
vector<int> P;
vector<int> PP;
int cnt = 0;
rep(i, n) {
cin >> p;
P.pb(p);
}
int minn = INF;
rep(i, P.size()) {
if (P[i] < minn) {
minn = P[i];
cnt++;
}
}
cout << cnt << "\n";
} | replace | 58 | 59 | 58 | 63 | TLE | |
p02791 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
int main() {
int n;
cin >> n;
int p[n];
int ans = 1;
cin >> p[0];
rep1(i, n) {
cin >> p[i];
bool ok = true;
rep(j, i) {
if (p[j] < p[i])
ok = false;
continue;
}
if (ok)
ans++;
}
cout << ans << endl;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
int main() {
int n;
cin >> n;
int ans = 0;
int m = 1e8;
rep(i, n) {
int p;
cin >> p;
m = min(m, p);
if (p == m)
ans++;
}
cout << ans << endl;
} | replace | 12 | 24 | 12 | 19 | TLE | |
p02791 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
signed main() {
int N;
cin >> N;
vector<int> P(N);
rep(i, N) cin >> P[i];
int cnt = 0;
rep(i, N) {
bool can = true;
rep(j, i) {
if (P[i] > P[j]) {
can = false;
break;
}
}
if (can)
cnt++;
}
cout << cnt;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define int long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
signed main() {
int N;
cin >> N;
vector<int> P(N);
rep(i, N) cin >> P[i];
int cnt = N;
int min = P[0];
rep(i, N - 1) {
if (P[i + 1] > min)
cnt--;
else
min = (min, P[i + 1]);
}
cout << cnt;
} | replace | 22 | 33 | 22 | 29 | TLE | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
// 1番目の数を見て、それよりも小さい数はいくつあるかを判定する
vector<int> vec(N);
for (int i = 0; i < N; i++)
cin >> vec.at(i);
int ans = 0;
int a = 0;
a = vec.at(1);
for (int i = 0; i < N; i++) {
if (a >= vec.at(i)) {
a = vec.at(i);
ans++;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
// 1番目の数を見て、それよりも小さい数はいくつあるかを判定する
vector<int> vec(N);
for (int i = 0; i < N; i++)
cin >> vec.at(i);
int ans = 0;
int a = 0;
a = vec.at(0);
for (int i = 0; i < N; i++) {
if (a >= vec.at(i)) {
a = vec.at(i);
ans++;
}
}
cout << ans << endl;
}
| replace | 13 | 14 | 13 | 14 | 0 | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, n) for (int i = (a); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define FOR(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
class BIT {
int n;
std::vector<int> bit;
public:
BIT(int n) : n(n), bit(n + 1, 0) {}
int sum(int i) {
int s = 0;
while (i > 0) {
s += bit[i];
i -= i & (-i);
}
return s;
}
void add(int i, int x) {
while (i <= n) {
bit[i] += x;
i += i & (-i);
}
}
};
int main() {
int N;
cin >> N;
vector<int> v;
rep(i, N) {
int a;
cin >> a;
v.push_back(a);
}
BIT bit(1 << 17);
int ret = 0;
rep(i, N) {
bit.add(v[i], 1);
if (bit.sum(v[i] - 1) == 0)
ret++;
}
cout << ret << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, n) for (int i = (a); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define FOR(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
class BIT {
int n;
std::vector<int> bit;
public:
BIT(int n) : n(n), bit(n + 1, 0) {}
int sum(int i) {
int s = 0;
while (i > 0) {
s += bit[i];
i -= i & (-i);
}
return s;
}
void add(int i, int x) {
while (i <= n) {
bit[i] += x;
i += i & (-i);
}
}
};
int main() {
int N;
cin >> N;
vector<int> v;
rep(i, N) {
int a;
cin >> a;
v.push_back(a);
}
BIT bit(N + 100);
int ret = 0;
rep(i, N) {
bit.add(v[i], 1);
if (bit.sum(v[i] - 1) == 0)
ret++;
}
cout << ret << endl;
return 0;
}
| replace | 43 | 44 | 43 | 44 | 0 | |
p02791 | Python | Time Limit Exceeded | N = int(input())
P = list(map(int, input().split()))
print(1 + sum([int(P[i] <= min(P[:i])) for i in range(1, N)]))
| N = int(input())
P = list(map(int, input().split()))
Q = []
m = 10**17
for p in P:
m = min(m, p)
Q.append(m)
c = 0
for x, y in zip(P, Q):
if x <= y:
c += 1
print(c)
| replace | 2 | 3 | 2 | 12 | TLE | |
p02791 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define ll long long
#define MOD 1000000007
using vi = vector<ll>; // intの1次元の型に vi という別名をつける
using vvi = vector<vi>; // intの2次元の型に vvi という別名をつける
ll n, k, x, y;
// Bitと転倒数
class Bit {
public:
ll size;
vector<ll> data;
Bit(ll num) {
data.resize(num + 1);
REP(i, num + 1)
data[i] = 0;
size = num;
}
//(1-i)までの合計を返す
ll Sum(ll i) {
ll s = 0;
while (i > 0) {
s += data[i];
i -= i & (-i);
}
return s;
}
// Add
void Add(ll i, ll x) {
while (i <= size) {
data[i] += x;
i += i & (-i);
}
}
};
int main() {
ll ans = 0;
cin >> n;
vi a(n);
Bit bit(65536);
REP(i, n) {
cin >> a[i];
bit.Add(a[i], 1);
if (bit.Sum(a[i]) == 1)
ans++;
}
cout << ans << endl;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define ll long long
#define MOD 1000000007
using vi = vector<ll>; // intの1次元の型に vi という別名をつける
using vvi = vector<vi>; // intの2次元の型に vvi という別名をつける
ll n, k, x, y;
// Bitと転倒数
class Bit {
public:
ll size;
vector<ll> data;
Bit(ll num) {
data.resize(num + 1);
REP(i, num + 1)
data[i] = 0;
size = num;
}
//(1-i)までの合計を返す
ll Sum(ll i) {
ll s = 0;
while (i > 0) {
s += data[i];
i -= i & (-i);
}
return s;
}
// Add
void Add(ll i, ll x) {
while (i <= size) {
data[i] += x;
i += i & (-i);
}
}
};
int main() {
ll ans = 0;
cin >> n;
vi a(n);
Bit bit(262144);
REP(i, n) {
cin >> a[i];
bit.Add(a[i], 1);
if (bit.Sum(a[i]) == 1)
ans++;
}
cout << ans << endl;
return 0;
} | replace | 44 | 45 | 44 | 45 | 0 | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, i, j, k, x = 1e6, cnt = 0;
cin >> n;
int p[n];
for (i = 0; i < n; i++)
cin >> p[i];
for (i = 0; i < n; i++) {
if (p[i] <= x) {
x = p[i];
cnt++;
}
}
cout << cnt << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
/*#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
#endif*/
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, i, j, k, x = 1e6, cnt = 0;
cin >> n;
int p[n];
for (i = 0; i < n; i++)
cin >> p[i];
for (i = 0; i < n; i++) {
if (p[i] <= x) {
x = p[i];
cnt++;
}
}
cout << cnt << endl;
}
| replace | 6 | 10 | 6 | 10 | -11 | |
p02791 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define ll long long
#define double long double
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define Rep(i, n) for (ll i = 1; i <= n; ++i)
#define loop(i, m, n) for (ll i = m; i < n; ++i)
#define ggr \
getchar(); \
getchar(); \
return 0;
#define pie 3.141592653589793238462643383279
#define elif else if
#define P pair<ll, ll>
#define prique priority_queue<ll>
#define ALL(a) (a).begin(), (a).end()
const int mod = 1000000007;
const int mod2 = 998244353;
int bin(int bina) {
int ans = 0;
for (int i = 0; bina > 0; i++) {
ans = ans + (bina % 2) * pow(10, i);
bina = bina / 2;
}
return ans;
}
bool prime(int n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int lcm(int x, int y) { return x * y / gcd(x, y); }
int kai(int x) {
if (x == 0)
return 1;
return kai(x - 1) * x % mod;
}
int mod_pow(int x, int y, int m) {
int res = 1;
while (y > 0) {
if (y & 1) {
res = res * x % m;
}
x = x * x % m;
y >>= 1;
}
return res;
}
int comb(int n, int r) {
int ans = 1;
for (ll i = n; i > n - r; --i) {
ans = ans * i;
}
for (ll i = 1; i < r + 1; ++i) {
ans = ans / i;
}
return ans;
}
int per(int n, int r) {
r = n - r;
int sum = 1;
int i;
for (i = n; i >= r + 1; i--)
sum *= i;
return sum;
}
struct union_find {
int par[200010], size_[200010];
void init(int x) {
rep(i, x) {
par[i] = i;
size_[i] = 1;
}
}
int find(int x) {
if (par[x] == x)
return x;
return par[x] = find(par[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (size_[x] < size_[y]) {
par[x] = y;
size_[y] += size_[x];
} else {
par[y] = x;
size_[x] += size_[y];
}
}
};
int ctoi(const char c) { return c - '0'; }
int keta(int a) { return to_string(a).size(); }
int a[100010], b[100010];
signed main() {
int n;
cin >> n;
rep(i, n) { cin >> a[i]; }
b[0] = a[0];
loop(i, 1, n) {
if (a[i] < b[i - 1])
b[i] = a[i];
else
b[i] = b[i - 1];
}
int ans = 0;
rep(i, n) {
if (a[i] <= b[i])
ans++;
}
cout << ans << endl;
}
| #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define int long long
#define ll long long
#define double long double
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define Rep(i, n) for (ll i = 1; i <= n; ++i)
#define loop(i, m, n) for (ll i = m; i < n; ++i)
#define ggr \
getchar(); \
getchar(); \
return 0;
#define pie 3.141592653589793238462643383279
#define elif else if
#define P pair<ll, ll>
#define prique priority_queue<ll>
#define ALL(a) (a).begin(), (a).end()
const int mod = 1000000007;
const int mod2 = 998244353;
int bin(int bina) {
int ans = 0;
for (int i = 0; bina > 0; i++) {
ans = ans + (bina % 2) * pow(10, i);
bina = bina / 2;
}
return ans;
}
bool prime(int n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int lcm(int x, int y) { return x * y / gcd(x, y); }
int kai(int x) {
if (x == 0)
return 1;
return kai(x - 1) * x % mod;
}
int mod_pow(int x, int y, int m) {
int res = 1;
while (y > 0) {
if (y & 1) {
res = res * x % m;
}
x = x * x % m;
y >>= 1;
}
return res;
}
int comb(int n, int r) {
int ans = 1;
for (ll i = n; i > n - r; --i) {
ans = ans * i;
}
for (ll i = 1; i < r + 1; ++i) {
ans = ans / i;
}
return ans;
}
int per(int n, int r) {
r = n - r;
int sum = 1;
int i;
for (i = n; i >= r + 1; i--)
sum *= i;
return sum;
}
struct union_find {
int par[200010], size_[200010];
void init(int x) {
rep(i, x) {
par[i] = i;
size_[i] = 1;
}
}
int find(int x) {
if (par[x] == x)
return x;
return par[x] = find(par[x]);
}
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (size_[x] < size_[y]) {
par[x] = y;
size_[y] += size_[x];
} else {
par[y] = x;
size_[x] += size_[y];
}
}
};
int ctoi(const char c) { return c - '0'; }
int keta(int a) { return to_string(a).size(); }
int a[200010], b[200010];
signed main() {
int n;
cin >> n;
rep(i, n) { cin >> a[i]; }
b[0] = a[0];
loop(i, 1, n) {
if (a[i] < b[i - 1])
b[i] = a[i];
else
b[i] = b[i - 1];
}
int ans = 0;
rep(i, n) {
if (a[i] <= b[i])
ans++;
}
cout << ans << endl;
}
| replace | 116 | 117 | 116 | 117 | 0 | |
p02791 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ll long long
#define sort(s) sort(s.begin(), s.end())
#define r(s) reverse(s.begin(), s.end())
#define come return
constexpr auto AC = 0;
using namespace std;
int aa(vector<int> s, int i) {
rep(j, i) {
if (s[j] <= s[i])
return 0;
}
return 1;
}
int main() {
int a;
int ans = 0;
cin >> a;
vector<int> s(a), t(a - 1);
rep(i, a) {
cin >> s[i];
if (i == 0)
t[i] = s[i];
else
t[i] = min(t[i - 1], s[i]);
if (t[i] >= s[i])
ans++;
}
cout << ans << endl;
come AC;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ll long long
#define sort(s) sort(s.begin(), s.end())
#define r(s) reverse(s.begin(), s.end())
#define come return
constexpr auto AC = 0;
using namespace std;
int aa(vector<int> s, int i) {
rep(j, i) {
if (s[j] <= s[i])
return 0;
}
return 1;
}
int main() {
int a;
int ans = 0;
cin >> a;
vector<int> s(a), t(a);
rep(i, a) {
cin >> s[i];
if (i == 0)
t[i] = s[i];
else
t[i] = min(t[i - 1], s[i]);
if (t[i] >= s[i])
ans++;
}
cout << ans << endl;
come AC;
}
| replace | 26 | 27 | 26 | 27 | 0 | |
p02791 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++)
cin >> p.at(i);
int ans = 1;
for (int i = n - 1; i > 0; i--) {
for (int j = i - 1; j >= 0; j--) {
if (p.at(i) > p.at(j)) {
break;
}
if (j == 0)
ans++;
}
}
cout << ans;
}
| #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++)
cin >> p.at(i);
int ans = 1;
int r = p.at(0);
for (int i = 1; i < n; i++) {
if (r > p.at(i)) {
ans++;
r = p.at(i);
}
}
cout << ans;
}
| replace | 16 | 24 | 16 | 21 | TLE | |
p02791 | C++ | Runtime Error | #include <climits> /* LLONG_MAX */
#include <cmath>
#include <algorithm>
#include <iomanip> /* setprecision */
#include <iostream>
#include <numeric> /* gcd, lcm, partial_sum, reduce*/
#include <string>
#include <vector>
using ll = long long; // c++11
const std::string ans[2] = {"No\n", "Yes\n"};
int main() {
using namespace std;
int n;
cin >> n;
vector<int> P;
for (int i = 0; i < n; i++)
cin >> P[i];
int min_p = P[0];
int ans = 1;
for (int i = 1; i < n; i++) {
if (P[i] < min_p) {
min_p = P[i];
ans++;
}
}
cout << ans << endl;
return 0;
}
| #include <climits> /* LLONG_MAX */
#include <cmath>
#include <algorithm>
#include <iomanip> /* setprecision */
#include <iostream>
#include <numeric> /* gcd, lcm, partial_sum, reduce*/
#include <string>
#include <vector>
using ll = long long; // c++11
const std::string ans[2] = {"No\n", "Yes\n"};
int main() {
using namespace std;
int n;
cin >> n;
vector<int> P;
for (int i = 0; i < n; i++) {
int p;
cin >> p;
P.push_back(p);
}
int min_p = P[0];
int ans = 1;
for (int i = 1; i < n; i++) {
if (P[i] < min_p) {
min_p = P[i];
ans++;
}
}
cout << ans << endl;
return 0;
}
| replace | 19 | 21 | 19 | 24 | -11 | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep_rev(n, i) for (ll i = n; i >= 0; --i)
using namespace std;
const long long INF = 1LL << 60;
ll N, m = INF, c = 0;
ll P[100100];
int main() {
cin >> N;
rep(i, N) cin >> P[i];
rep(i, N) {
if (m > P[i]) {
m = P[i];
c++;
}
}
cout << c << endl;
return 0;
}
| #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep_rev(n, i) for (ll i = n; i >= 0; --i)
using namespace std;
const long long INF = 1LL << 60;
ll N, m = INF, c = 0;
ll P[200010];
int main() {
cin >> N;
rep(i, N) cin >> P[i];
rep(i, N) {
if (m > P[i]) {
m = P[i];
c++;
}
}
cout << c << endl;
return 0;
}
| replace | 8 | 9 | 8 | 9 | 0 | |
p02791 | C++ | Time Limit Exceeded | #include <iostream>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
}
int ans = n;
for (int i = 0; i < n; i++) {
for (int j = 0; j <= i; j++) {
if (p.at(i) > p.at(j)) {
ans--;
break;
}
}
}
cout << ans << endl;
}
| #include <iostream>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> p(n);
for (int i = 0; i < n; i++) {
cin >> p.at(i);
}
int ans = n;
int mini = n;
for (int i = 0; i < p.size(); i++) {
mini = min(mini, p.at(i));
if (mini != p.at(i)) {
ans--;
}
}
cout << ans << endl;
}
| replace | 15 | 21 | 15 | 20 | TLE | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
struct SegmentTree {
int n;
int type;
vector<int> st;
int NEUTRO;
void init(int _, int __, int ___) {
n = _;
st.resize(2 * _);
NEUTRO = ___;
type = __;
}
SegmentTree() {}
int ope(int x, int y) {
if (type == 0)
return max(x, y);
if (type == 1)
return min(x, y);
if (type == 2)
return x + y;
return 0;
}
void update(int pos, int value) {
for (st[pos += n] = value; pos > 1; pos >>= 1) {
st[pos >> 1] = ope(st[pos], st[pos ^ 1]);
}
}
// interval[l,r)
int query(int l, int r) {
int ans = NEUTRO;
r++;
for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
if (l & 1)
ans = ope(ans, st[l++]);
if (r & 1)
ans = ope(ans, st[--r]);
}
return ans;
}
};
int v[200010];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i)
cin >> v[i];
SegmentTree st;
st.init(n, 2, 0);
int ans = 0;
for (int i = 0; i < n; ++i) {
st.update(v[i], 1);
ans += (st.query(v[i], n) == i + 1);
}
cout << ans << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
struct SegmentTree {
int n;
int type;
vector<int> st;
int NEUTRO;
void init(int _, int __, int ___) {
n = _;
st.resize(5 * _);
NEUTRO = ___;
type = __;
}
SegmentTree() {}
int ope(int x, int y) {
if (type == 0)
return max(x, y);
if (type == 1)
return min(x, y);
if (type == 2)
return x + y;
return 0;
}
void update(int pos, int value) {
for (st[pos += n] = value; pos > 1; pos >>= 1) {
st[pos >> 1] = ope(st[pos], st[pos ^ 1]);
}
}
// interval[l,r)
int query(int l, int r) {
int ans = NEUTRO;
r++;
for (l += n, r += n; l < r; l >>= 1, r >>= 1) {
if (l & 1)
ans = ope(ans, st[l++]);
if (r & 1)
ans = ope(ans, st[--r]);
}
return ans;
}
};
int v[200010];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i)
cin >> v[i];
SegmentTree st;
st.init(n, 2, 0);
int ans = 0;
for (int i = 0; i < n; ++i) {
st.update(v[i], 1);
ans += (st.query(v[i], n) == i + 1);
}
cout << ans << "\n";
return 0;
}
| replace | 11 | 12 | 11 | 12 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p02791 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define vi vector<int>
#define vivi vector<vi>
const int INF = 1 << 29;
typedef long long ll;
int main() {
int N;
cin >> N;
int p[N];
rep(i, N) cin >> p[i];
int ans = 0;
for (int i = 0; i < N; ++i) {
bool flg = true;
for (int j = 0; j < i; ++j) {
if (p[j] < p[i]) {
flg = false;
break;
}
}
ans += ((flg) ? 1 : 0);
}
cout << ans;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define vi vector<int>
#define vivi vector<vi>
const int INF = 1 << 29;
typedef long long ll;
int main() {
int N;
cin >> N;
int p[N];
rep(i, N) cin >> p[i];
int ans = 0;
int minv[N + 1];
minv[0] = INF;
rep(i, N) minv[i + 1] = min(minv[i], p[i]);
rep(i, N) {
if (minv[i] >= p[i])
ans += 1;
}
cout << ans;
}
| replace | 20 | 29 | 20 | 26 | TLE | |
p02791 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; ++i)
cin >> a[i];
int cnt = 1;
for (int i = 1; i < n; ++i) {
int res = 0;
for (int j = 0; j < i; ++j) {
if (a[i] <= a[j])
++res;
else
continue;
}
if (res == i)
++cnt;
}
cout << cnt << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; ++i)
cin >> a[i];
int cnt = 0;
int res = 10000000;
for (int i = 0; i < n; ++i) {
res = min(res, a[i]);
if (a[i] <= res)
++cnt;
}
cout << cnt << endl;
}
| replace | 9 | 19 | 9 | 14 | TLE | |
p02791 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
long long gcd(int x, int y) {
if (x == 0)
return y;
return gcd(y % x, x);
}
long long lcm(int x, int y) {
if (y == 0) {
return x;
}
return x * y / gcd(x, y);
}
int min(int a, int b) { return a > b ? b : a; }
int max(int a, int b) { return a > b ? a : b; }
int n;
vector<int> tree(400005, 0);
int query(int a) {
int res = 0;
for (; a > 0; a -= a & -a) {
res += tree[a];
}
return res;
}
int update(int a) {
for (; a <= 200000; a += a & -a) {
tree[a]++;
}
}
int main() {
cin.sync_with_stdio(false);
cin >> n;
int res = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (i == 0) {
update(a);
res++;
} else {
update(a);
if (query(a) - 1 == 0) {
res++;
}
}
}
cout << res << endl;
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
long long gcd(int x, int y) {
if (x == 0)
return y;
return gcd(y % x, x);
}
long long lcm(int x, int y) {
if (y == 0) {
return x;
}
return x * y / gcd(x, y);
}
int min(int a, int b) { return a > b ? b : a; }
int max(int a, int b) { return a > b ? a : b; }
int n;
vector<int> tree(400005, 0);
int query(int a) {
int res = 0;
for (; a > 0; a -= a & -a) {
res += tree[a];
}
return res;
}
void update(int a) {
for (; a <= 200000; a += a & -a) {
tree[a]++;
}
}
int main() {
cin.sync_with_stdio(false);
cin >> n;
int res = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (i == 0) {
update(a);
res++;
} else {
update(a);
if (query(a) - 1 == 0) {
res++;
}
}
}
cout << res << endl;
}
| replace | 42 | 43 | 42 | 43 | 0 | |
p02791 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> P(N);
for (ll i = 0; i < N; i++) {
cin >> P[i];
}
ll count = 0;
ll mini = P[0];
for (ll i = 0; i < N; i++) {
for (ll j = 0; j <= i; j++) {
mini = min(mini, P[j]);
}
if (P[i] <= mini) {
count++;
}
}
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> P(N);
for (ll i = 0; i < N; i++) {
cin >> P[i];
}
ll count = 0;
ll mini = P[0];
for (ll i = 0; i < N; i++) {
mini = min(mini, P[i]);
if (mini == P[i]) {
count++;
}
}
cout << count << endl;
}
| replace | 16 | 20 | 16 | 18 | TLE | |
p02791 | C++ | Runtime Error | #define ll long long
#define MOD 1000000007
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define set2d(array, val, m, n) memset(array, val, sizeof(array[0][0]) * m * n);
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif //*/
ll n;
cin >> n;
ll a[n + 1];
for (int i = 0; i < n; i++)
cin >> a[i];
ll mm = a[0];
int cnt = 0;
for (int i = 0; i < n; i++) {
if (mm >= a[i]) {
cnt++;
mm = min(mm, a[i]);
}
}
cout << cnt;
cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
return 0;
}
| #define ll long long
#define MOD 1000000007
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define set2d(array, val, m, n) memset(array, val, sizeof(array[0][0]) * m * n);
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif //*/
ll n;
cin >> n;
ll a[n + 1];
for (int i = 0; i < n; i++)
cin >> a[i];
ll mm = a[0];
int cnt = 0;
for (int i = 0; i < n; i++) {
if (mm >= a[i]) {
cnt++;
mm = min(mm, a[i]);
}
}
cout << cnt;
cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
return 0;
}
| replace | 13 | 17 | 13 | 17 | -11 | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define sz(x) ((int)(x).size())
#define in(x) \
int x; \
cin >> x
#define inn(x, y) \
int x, y; \
cin >> x >> y
#define innn(x, y, z) \
int x, y, z; \
cin >> x >> y >> z
#define bit(n) (1 << (n))
#define out(x) cout << (x) << endl;
#define err(x) cerr << (x) << endl;
#define errr(x, y) cerr << (x) << " " << (y) << endl;
#define errrr(x, y, z) cerr << (x) << " " << (y) << " " << (z) << endl;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repp(i, n) for (int i = 1; i <= (n); i++)
#define reppp(j, i, n) for (int j = i + 1; j < n; j++)
#define lim5 100002
#define lim9 1000000002
#define deg(rad) (((rad) / 2 / M_PI) * 360)
#define mid(min, max) ((min + max) / 2)
int main() {
in(n);
int p[lim5] = {}, cnt = 0, max = lim5;
rep(i, n) cin >> p[i];
rep(i, n) {
if (max > p[i]) {
max = p[i];
++cnt;
}
}
out(cnt);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define sz(x) ((int)(x).size())
#define in(x) \
int x; \
cin >> x
#define inn(x, y) \
int x, y; \
cin >> x >> y
#define innn(x, y, z) \
int x, y, z; \
cin >> x >> y >> z
#define bit(n) (1 << (n))
#define out(x) cout << (x) << endl;
#define err(x) cerr << (x) << endl;
#define errr(x, y) cerr << (x) << " " << (y) << endl;
#define errrr(x, y, z) cerr << (x) << " " << (y) << " " << (z) << endl;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repp(i, n) for (int i = 1; i <= (n); i++)
#define reppp(j, i, n) for (int j = i + 1; j < n; j++)
#define lim5 100002
#define lim9 1000000002
#define deg(rad) (((rad) / 2 / M_PI) * 360)
#define mid(min, max) ((min + max) / 2)
int main() {
in(n);
int p[200004] = {}, cnt = 0, max = 200004;
rep(i, n) cin >> p[i];
rep(i, n) {
if (max > p[i]) {
max = p[i];
++cnt;
}
}
out(cnt);
return 0;
}
| replace | 35 | 36 | 35 | 36 | 0 | |
p02791 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> per(n);
for (int i = 0; i < n; i++) {
cin >> per.at(i);
}
int ans = 0;
set<int> num;
for (int i = 0; i < n; i++) {
for (int j = i; j > -1; j--) {
num.insert(per.at(i));
}
if (*begin(num) == per.at(i))
ans += 1;
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> per(n);
for (int i = 0; i < n; i++) {
cin >> per.at(i);
}
int ans = 0;
set<int> num;
for (int i = 0; i < n; i++) {
num.insert(per.at(i));
if (*begin(num) == per.at(i))
ans += 1;
}
cout << ans;
} | replace | 13 | 16 | 13 | 14 | TLE | |
p02791 | Python | Runtime Error | N = int(input())
P = map(int, input().split())
ret = 0
currmin = P[0]
for i in range(N):
if P[i] <= currmin:
currmin = P[i]
ret += 1
print(ret)
| N = int(input())
P = list(map(int, input().split()))
ret = 0
currmin = P[0]
for i in range(N):
if P[i] <= currmin:
currmin = P[i]
ret += 1
print(ret)
| replace | 1 | 2 | 1 | 2 | TypeError: 'map' object is not subscriptable | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02791/Python/s629344950.py", line 5, in <module>
currmin = P[0]
TypeError: 'map' object is not subscriptable
|
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int a[100010];
int main() {
int mn = INT_MAX;
int i, j, n, m, cnt = 0;
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
for (i = 0; i < n; i++) {
if (mn > a[i]) {
mn = a[i];
cnt++;
}
}
cout << cnt << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int a[200010];
int main() {
int mn = INT_MAX;
int i, j, n, m, cnt = 0;
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
for (i = 0; i < n; i++) {
if (mn > a[i]) {
mn = a[i];
cnt++;
}
}
cout << cnt << endl;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02791 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<string> vs;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define UNIQUE(v) v.erase(unique(all(v)), v.end());
#define fill(a, x) memset(a, x, sizeof(a))
#define zero(a) fill(a, 0)
#define minus(a) fill(a, -1)
#define dbg(x) cout << #x "=" << x << endl
int main() {
int n;
cin >> n;
int count = 0;
int num;
int res = 0;
int minIndex = 0;
vi array;
while (count != n) {
cin >> num;
array.pb(num);
count++;
}
rep(i, n) {
if (i == 0) {
res += 1;
continue;
}
if (array[i] > array[minIndex])
continue;
for (int j = 0; j < i; j++) {
if (array[i] > array[j]) {
break;
}
if (j == i - 1) {
minIndex = j;
res += 1;
}
}
}
cout << res << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<string> vs;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) FOR(i, 0, n)
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define UNIQUE(v) v.erase(unique(all(v)), v.end());
#define fill(a, x) memset(a, x, sizeof(a))
#define zero(a) fill(a, 0)
#define minus(a) fill(a, -1)
#define dbg(x) cout << #x "=" << x << endl
int main() {
int n;
cin >> n;
int count = 0;
int num;
int res = 0;
int minIndex = 0;
vi array;
while (count != n) {
cin >> num;
array.pb(num);
count++;
}
rep(i, n) {
if (i == 0) {
res += 1;
continue;
}
if (array[i] > array[minIndex])
continue;
minIndex = i;
res += 1;
continue;
}
cout << res << endl;
return 0;
}
| replace | 36 | 45 | 36 | 39 | TLE | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, p[100100], i, ruimin = 300000, ans = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> p[i];
}
for (i = 0; i < n; i++) {
if (p[i] <= ruimin) {
ans++;
ruimin = p[i];
}
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, p[200100], i, ruimin = 300000, ans = 0;
cin >> n;
for (i = 0; i < n; i++) {
cin >> p[i];
}
for (i = 0; i < n; i++) {
if (p[i] <= ruimin) {
ans++;
ruimin = p[i];
}
}
cout << ans << endl;
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02791 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
#define fir first
#define sec second
#define sz(s) (s).size()
#define pb push_back
#define get(n) scanf("%d", &n);
#define gets(s) \
string s; \
cin >> (s);
#define prfi(n) printf("%d", &n);
#define prfd(n) printf("%lf", &n);
#define All(s) (s).begin(), (s).end()
#define rep(i, j) for (int(i) = 0; (i) < (j); (i)++)
#define For(i, j, k) for (int(i) = (j); (i) < (k); (i)++)
#define drep(i, j) for (int(i) = (j); (i) >= 0; (i)--)
#define Ford(i, j, k) for (int(i) = (j); i >= (k); i--)
#define vfor(c, v) for (auto(c) : (v))
#define lpi(n) for (int i = 0; i < (n); i++)
#define lpj(n) for (int j = 0; j < (n); j++)
#define lpz(n) for (int z = 0; z < (n); z++)
#define mem(a, b) memset(a, b, sizeof(a));
#define dump(x) std::cout << #x << " = " << (x) << std::endl;
#define debug(x) \
cout << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
using ll = long long;
using ld = long double;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;
using vi = std::vector<int>;
using vvi = std::vector<vi>;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vd = std::vector<double>;
using vvd = std::vector<vd>;
using qi = std::queue<int>;
using vpii = std::vector<std::pair<int, int>>;
using vpll = std::vector<pll>;
using namespace std;
const int Mod = (1e9) + 7;
const int INF = 1e9 + 19;
const ll INFL = 1e18 + 19;
const int dx[] = {-1, 0, 0, 1};
const int dy[] = {0, -1, 1, 0};
const int dx2[] = {-1, -1, -1, 0, 0, 0, 1, 1, 1};
const int dy2[] = {1, 0, -1, 1, 0, -1, 1, 0, -1};
//_____________________________________Templates_________________________________________//
template <class T1, class T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <class T1, class T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
template <class T> inline void swap(T &a, T &b) {
T c = a;
a = b;
b = c;
}
template <class T> inline void pri(T a) { cout << a << endl; }
template <class Z> using vec = vector<Z>;
// mainly use for dynamic prog
template <class T1, class T2> void update(T1 &a, T2 b) {
a += b;
if (a > Mod)
a %= Mod;
}
inline void IN(void) { return; }
template <typename First, typename... Rest>
void IN(First &first, Rest &...rest) {
cin >> first;
IN(rest...);
return;
}
inline void OUT(void) {
cout << "\n";
return;
}
template <typename First, typename... Rest>
void OUT(First first, Rest... rest) {
cout << first << " ";
OUT(rest...);
return;
}
bool pairsort(pll pl, pll pr) {
if (pl.first == pr.first)
return pl.second > pr.second;
return pl.first < pr.first;
}
int cntbit(ll a, int n, int j) {
int res = 0;
For(i, j, n) {
if (a >> i & 1) {
res++;
}
}
return res;
}
vector<int> make_bit(int a) {
vector<int> res;
lpi(32) if (a & (1 << i)) res.pb(i);
return res;
}
bool stdbit(int a, int b) { return a & (1 << b); }
int GCD(int a, int b) {
if (b > a)
return GCD(b, a);
if (a % b == 0)
return b;
else
return GCD(b, a % b);
}
int LCM(int a, int b) { return a * b / GCD(a, b); }
int roundup(int a, int b) {
if (a % b == 0)
return a / b;
else
return (a + b) / b;
}
int rounddown(int a, int b) {
if (a % b == 0)
return a / b;
else {
return (a - b) / b;
}
}
ll GetDiviserCount(ll N) // 約数の個数
{
ll res = 1;
For(i, 2, sqrt(N) + 1) {
ll cnt = 0;
while (N % i == 0) {
cnt++;
N /= i;
}
res *= (cnt + 1);
if (N == 1)
break;
}
if (N != 1)
res *= 2;
return res;
}
vll GetDivisor(ll N) // 約数列挙
{
vll res;
for (ll i = 1; i * i <= N; i++) {
if (N % i == 0) {
res.pb(i);
if (i * i != N)
res.pb(N / i);
}
}
sort(All(res));
return res;
}
//_____________________ following sorce code_________________________//
const int max_n = 3 * (1e5) + 1;
const int max_m = 83 * (1e5) + 1;
struct BIT {
using T = ll;
vector<T> data;
T UNIT;
int n;
BIT(int n, T a) : n(n), UNIT(a) { data.resize(n + 1, UNIT); }
T sum(int i) {
int s = 0;
while (i > 0) {
s += data[i];
i -= i & -i;
}
return s;
}
void add(int i, T x) {
while (i <= n) {
data[i] += x;
i += i & -i;
}
}
T range(int r, int l) { return sum(r) - sum(l - 1); }
int lower_bound(T w) {
if (w <= 0)
return 0;
int x = 0;
int pos = 1, N = n + 1;
while (pos * 2 <= N) {
pos *= 2;
}
for (int k = pos; k > 0; k /= 2) {
if (x + k <= N && data[x + k] <= w) {
w -= data[x + k];
x += k;
}
}
return x + 1;
}
};
int n, m, k, q;
ll N;
int h, w;
vvi tree;
string S;
int a, b, c;
vi v;
int ans;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
IN(n);
vi p(n);
lpi(n) IN(p[i]);
BIT bt(20020, 0);
ans = 0;
rep(i, n) {
int sum = bt.sum(p[i]);
if (sum == 0)
ans++;
bt.add(p[i], 1);
}
cout << ans << endl;
// for(auto c : ans){cout << c << endl;}
// cout << fixed << setprecision(15) << ans << endl;
return 0;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <utility>
#include <vector>
#define fir first
#define sec second
#define sz(s) (s).size()
#define pb push_back
#define get(n) scanf("%d", &n);
#define gets(s) \
string s; \
cin >> (s);
#define prfi(n) printf("%d", &n);
#define prfd(n) printf("%lf", &n);
#define All(s) (s).begin(), (s).end()
#define rep(i, j) for (int(i) = 0; (i) < (j); (i)++)
#define For(i, j, k) for (int(i) = (j); (i) < (k); (i)++)
#define drep(i, j) for (int(i) = (j); (i) >= 0; (i)--)
#define Ford(i, j, k) for (int(i) = (j); i >= (k); i--)
#define vfor(c, v) for (auto(c) : (v))
#define lpi(n) for (int i = 0; i < (n); i++)
#define lpj(n) for (int j = 0; j < (n); j++)
#define lpz(n) for (int z = 0; z < (n); z++)
#define mem(a, b) memset(a, b, sizeof(a));
#define dump(x) std::cout << #x << " = " << (x) << std::endl;
#define debug(x) \
cout << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
using ll = long long;
using ld = long double;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;
using vi = std::vector<int>;
using vvi = std::vector<vi>;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vd = std::vector<double>;
using vvd = std::vector<vd>;
using qi = std::queue<int>;
using vpii = std::vector<std::pair<int, int>>;
using vpll = std::vector<pll>;
using namespace std;
const int Mod = (1e9) + 7;
const int INF = 1e9 + 19;
const ll INFL = 1e18 + 19;
const int dx[] = {-1, 0, 0, 1};
const int dy[] = {0, -1, 1, 0};
const int dx2[] = {-1, -1, -1, 0, 0, 0, 1, 1, 1};
const int dy2[] = {1, 0, -1, 1, 0, -1, 1, 0, -1};
//_____________________________________Templates_________________________________________//
template <class T1, class T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <class T1, class T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
template <class T> inline void swap(T &a, T &b) {
T c = a;
a = b;
b = c;
}
template <class T> inline void pri(T a) { cout << a << endl; }
template <class Z> using vec = vector<Z>;
// mainly use for dynamic prog
template <class T1, class T2> void update(T1 &a, T2 b) {
a += b;
if (a > Mod)
a %= Mod;
}
inline void IN(void) { return; }
template <typename First, typename... Rest>
void IN(First &first, Rest &...rest) {
cin >> first;
IN(rest...);
return;
}
inline void OUT(void) {
cout << "\n";
return;
}
template <typename First, typename... Rest>
void OUT(First first, Rest... rest) {
cout << first << " ";
OUT(rest...);
return;
}
bool pairsort(pll pl, pll pr) {
if (pl.first == pr.first)
return pl.second > pr.second;
return pl.first < pr.first;
}
int cntbit(ll a, int n, int j) {
int res = 0;
For(i, j, n) {
if (a >> i & 1) {
res++;
}
}
return res;
}
vector<int> make_bit(int a) {
vector<int> res;
lpi(32) if (a & (1 << i)) res.pb(i);
return res;
}
bool stdbit(int a, int b) { return a & (1 << b); }
int GCD(int a, int b) {
if (b > a)
return GCD(b, a);
if (a % b == 0)
return b;
else
return GCD(b, a % b);
}
int LCM(int a, int b) { return a * b / GCD(a, b); }
int roundup(int a, int b) {
if (a % b == 0)
return a / b;
else
return (a + b) / b;
}
int rounddown(int a, int b) {
if (a % b == 0)
return a / b;
else {
return (a - b) / b;
}
}
ll GetDiviserCount(ll N) // 約数の個数
{
ll res = 1;
For(i, 2, sqrt(N) + 1) {
ll cnt = 0;
while (N % i == 0) {
cnt++;
N /= i;
}
res *= (cnt + 1);
if (N == 1)
break;
}
if (N != 1)
res *= 2;
return res;
}
vll GetDivisor(ll N) // 約数列挙
{
vll res;
for (ll i = 1; i * i <= N; i++) {
if (N % i == 0) {
res.pb(i);
if (i * i != N)
res.pb(N / i);
}
}
sort(All(res));
return res;
}
//_____________________ following sorce code_________________________//
const int max_n = 3 * (1e5) + 1;
const int max_m = 83 * (1e5) + 1;
struct BIT {
using T = ll;
vector<T> data;
T UNIT;
int n;
BIT(int n, T a) : n(n), UNIT(a) { data.resize(n + 1, UNIT); }
T sum(int i) {
int s = 0;
while (i > 0) {
s += data[i];
i -= i & -i;
}
return s;
}
void add(int i, T x) {
while (i <= n) {
data[i] += x;
i += i & -i;
}
}
T range(int r, int l) { return sum(r) - sum(l - 1); }
int lower_bound(T w) {
if (w <= 0)
return 0;
int x = 0;
int pos = 1, N = n + 1;
while (pos * 2 <= N) {
pos *= 2;
}
for (int k = pos; k > 0; k /= 2) {
if (x + k <= N && data[x + k] <= w) {
w -= data[x + k];
x += k;
}
}
return x + 1;
}
};
int n, m, k, q;
ll N;
int h, w;
vvi tree;
string S;
int a, b, c;
vi v;
int ans;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
IN(n);
vi p(n);
lpi(n) IN(p[i]);
BIT bt(200200, 0);
ans = 0;
rep(i, n) {
int sum = bt.sum(p[i]);
if (sum == 0)
ans++;
bt.add(p[i], 1);
}
cout << ans << endl;
// for(auto c : ans){cout << c << endl;}
// cout << fixed << setprecision(15) << ans << endl;
return 0;
}
| replace | 234 | 235 | 234 | 235 | 0 | |
p02791 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
using namespace std;
int minn[100010];
int main(void) {
// freopen("aaa.in","r",stdin);
int n;
int ans = 0;
scanf("%d", &n);
minn[0] = n + 1;
for (int i = 1, a; i <= n; i++) {
scanf("%d", &a);
minn[i] = min(minn[i - 1], a);
if (a <= minn[i])
ans++;
}
cout << ans << endl;
return 0;
} | #include <cstdio>
#include <iostream>
using namespace std;
int minn[300010];
int main(void) {
// freopen("aaa.in","r",stdin);
int n;
int ans = 0;
scanf("%d", &n);
minn[0] = n + 1;
for (int i = 1, a; i <= n; i++) {
scanf("%d", &a);
minn[i] = min(minn[i - 1], a);
if (a <= minn[i])
ans++;
}
cout << ans << endl;
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02791 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <unordered_map>
#include <utility>
#include <vector>
#define _USE_MATH_DEFINES
#include <iostream>
#include <math.h>
using namespace std;
#define REP(x, n) for (int x = 0; x < n; x++)
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, char> pic;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
#define bit(x, v) ((ll)x << v)
const ll INF = 1000000007;
const int MAX = 1000010;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int pr[100010];
void uini(int n) {
for (size_t i = 0; i <= n; i++) {
pr[i] = i;
}
}
int parent(int x) {
if (x == pr[x])
return x;
return pr[x] = parent(pr[x]);
}
int same(int x, int y) { return parent(x) == parent(y); }
bool unit(int x, int y) {
int px = parent(x);
int py = parent(y);
if (px == py)
return false;
if (px < py) {
pr[py] = px;
} else {
pr[px] = py;
}
return true;
}
ll bit[200010];
int max_n = 200000;
int pm = 0;
void add(int x) {
while (max_n >= x) {
bit[x]++;
x += x & -x;
}
}
void sub(int x) {
while (max_n >= x) {
bit[x]--;
x += x & -x;
}
}
ll merge(ll *a, int left, int mid, int right) {
ll n1 = mid - left;
ll n2 = right - mid;
vector<int> L(n1 + 1);
vector<int> R(n2 + 1);
for (size_t i = 0; i < n1; i++) {
L[i] = a[left + i];
}
for (size_t i = 0; i < n2; i++) {
R[i] = a[mid + i];
}
L[n1] = INF;
R[n2] = INF;
ll i = 0;
ll j = 0;
ll r = 0;
for (size_t k = left; k < right; k++) {
if (L[i] <= R[j]) {
a[k] = L[i];
i++;
} else {
a[k] = R[j];
r += n1 - i;
j++;
}
}
return r;
}
ll merge2(pair<int, char> *a, int left, int mid, int right) {
ll n1 = mid - left;
ll n2 = right - mid;
vector<pair<int, char>> L(n1 + 1);
vector<pair<int, char>> R(n2 + 1);
for (size_t i = 0; i < n1; i++) {
L[i] = a[left + i];
}
for (size_t i = 0; i < n2; i++) {
R[i] = a[mid + i];
}
L[n1] = make_pair(INF, ' ');
R[n2] = make_pair(INF, ' ');
ll i = 0;
ll j = 0;
ll r = 0;
for (size_t k = left; k < right; k++) {
if (L[i].first <= R[j].first) {
a[k] = L[i];
i++;
} else {
a[k] = R[j];
r += n1 - i;
j++;
}
}
return r;
}
ll mergeSort2(pair<int, char> *a, int left, int right) {
ll res = 0;
if (left + 1 < right) {
int mid = (left + right) / 2;
res = mergeSort2(a, left, mid);
res += mergeSort2(a, mid, right);
res += merge2(a, left, mid, right);
}
return res;
}
ll mergeSort(ll *a, int left, int right) {
ll res = 0;
if (left + 1 < right) {
int mid = (left + right) / 2;
res = mergeSort(a, left, mid);
res += mergeSort(a, mid, right);
res += merge(a, left, mid, right);
}
return res;
}
int partition(pair<int, char> *a, int p, int r) {
pair<int, char> x = a[r];
int i = p - 1;
for (size_t j = p; j < r; j++) {
if (a[j].first <= x.first) {
i++;
swap(a[i], a[j]);
}
}
swap(a[i + 1], a[r]);
return i + 1;
}
void quick(pair<int, char> *a, int p, int r) {
if (p < r) {
int q = partition(a, p, r);
quick(a, p, q - 1);
quick(a, q + 1, r);
}
}
ll n;
int ci = 0;
ll P[1000010];
struct Node {
int key;
int priority;
Node *parent, *left, *right;
Node(int key, int priority);
Node() {}
};
Node NIL;
Node::Node(int key, int priority) : key(key), priority(priority) {
left = &NIL;
right = &NIL;
}
Node *root = new Node();
void cenrec(Node *k) {
if (k->key == NIL.key)
return;
cenrec(k->left);
cout << " " << k->key;
cenrec(k->right);
}
void fastrec(Node *k) {
if (k->key == NIL.key)
return;
cout << " " << k->key;
fastrec(k->left);
fastrec(k->right);
}
void insert(Node *v) {
Node *y = &NIL;
Node *x = root;
while (x->key != NIL.key) {
y = x;
if (v->key < x->key) {
x = x->left;
} else {
x = x->right;
}
}
v->parent = y;
if (y->key == NIL.key) {
root = v;
} else if (v->key < y->key) {
y->left = v;
} else {
y->right = v;
}
}
Node *find(Node *k, ll v) {
if (k->key == NIL.key)
return &NIL;
if (k->key == v)
return k;
if (v < k->key)
return find(k->left, v);
return find(k->right, v);
}
void delp12(Node *x) {
if (x->key == NIL.key)
return;
Node *l = x->left;
Node *r = x->right;
Node *pr = x->parent;
if (l->key == NIL.key && r->key == NIL.key) {
if (pr->left == x) {
pr->left = &NIL;
} else
pr->right = &NIL;
} else if (l->key != NIL.key) {
if (pr->left == x) {
pr->left = l;
} else
pr->right = l;
l->parent = pr;
} else if (r->key != NIL.key) {
if (pr->left == x) {
pr->left = r;
} else
pr->right = r;
r->parent = pr;
}
}
Node *get_next(Node *k) {
if (k->key == NIL.key)
return &NIL;
Node *res = get_next(k->left);
if (res->key != NIL.key)
return res;
return k;
}
void del(Node *x) {
if (x->key == NIL.key)
return;
Node *l = x->left;
Node *r = x->right;
Node *pr = x->parent;
if (l->key != NIL.key && r->key != NIL.key) {
Node *nex = get_next(r);
x->key = nex->key;
delp12(nex);
} else {
delp12(x);
}
}
Node *rightRotate(Node *t) {
Node *s = t->left;
t->left = s->right;
s->right = t;
return s;
}
Node *leftRotate(Node *t) {
Node *s = t->right;
t->right = s->left;
s->left = t;
return s;
}
Node *_insert(Node *t, int key, int priority) {
if (t->key == NIL.key) {
return new Node(key, priority);
}
if (key == t->key) {
return t;
}
if (key < t->key) {
t->left = _insert(t->left, key, priority);
if (t->priority < t->left->priority) {
t = rightRotate(t);
}
} else {
t->right = _insert(t->right, key, priority);
if (t->priority < t->right->priority) {
t = leftRotate(t);
}
}
return t;
}
Node *delete1(Node *t, int key);
Node *_delete(Node *t, int key) {
if (t->left->key == NIL.key && t->right->key == NIL.key) {
return &NIL;
} else if (t->left->key == NIL.key) {
t = leftRotate(t);
} else if (t->right->key == NIL.key) {
t = rightRotate(t);
} else {
if (t->left->priority > t->right->priority) {
t = rightRotate(t);
} else
t = leftRotate(t);
}
return delete1(t, key);
}
Node *delete1(Node *t, int key) {
if (t->key == NIL.key) {
return &NIL;
}
if (key < t->key) {
t->left = delete1(t->left, key);
} else if (key > t->key) {
t->right = delete1(t->right, key);
} else
return _delete(t, key);
return t;
}
int H;
int left(int i) { return i * 2 + 1; }
int right(int i) { return i * 2 + 2; }
struct edge {
int from, to;
ll val;
edge(int from, int to, ll val) : from(from), to(to), val(val) {}
};
int k;
int _rank[1010];
int temp[1010];
bool compare_sa(int i, int j) {
if (_rank[i] != _rank[j])
return _rank[i] < _rank[j];
else {
int ri = i + k <= n ? _rank[i + k] : -1;
int rj = j + k <= n ? _rank[j + k] : -1;
return ri < rj;
}
}
void construct_sa(string S, int *sa) {
n = S.length();
for (size_t i = 0; i <= n; i++) {
sa[i] = i;
_rank[i] = i < n ? S[i] : -1;
}
for (k = 1; k <= n; k *= 2) {
sort(sa, sa + n + 1, compare_sa);
// saはソート後の接尾辞の並びになっている、rankは元の位置のindexを保持したまま、更新されている。
// ピンとこなかった部分
temp[sa[0]] = 0;
for (size_t i = 1; i <= n; i++) {
temp[sa[i]] = temp[sa[i - 1]] + (compare_sa(sa[i - 1], sa[i]) ? 1 : 0);
}
for (size_t i = 0; i <= n; i++) {
_rank[i] = temp[i];
}
}
}
bool contain(string S, int *sa, string T) {
int a = 0, b = S.length();
// sa は 接尾辞が辞書順に並んでいる、入っているのはその位置のインデックス
while (b - a > 1) {
int c = (a + b) / 2;
if (S.compare(sa[c], T.length(), T) < 0)
a = c;
else
b = c;
}
return S.compare(sa[b], T.length(), T) == 0;
}
#define bit(x, v) ((ll)x << v)
class BIT {
static const int MAX_N = 400010;
public:
BIT() { memset(bit, 0, sizeof(bit)); }
ll bit[MAX_N + 1], n;
ll sum(int i) {
ll s = 0;
while (i > 0) {
s += bit[i];
i -= i & -i;
}
return s;
}
void add(int i, int x) {
while (i <= n) {
bit[i] += x;
i += i & -i;
}
}
};
struct UnionFind {
vector<int> A;
UnionFind(int n) : A(n, -1) {}
int find(int x) {
if (A[x] < 0)
return x;
return A[x] = find(A[x]);
}
void unite(int x, int y) {
x = find(x), y = find(y);
if (x == y)
return;
if (A[x] > A[y])
swap(x, y);
A[x] += A[y];
A[y] = x;
}
int ngroups() {
int ans = 0;
for (auto a : A)
if (a < 0)
ans++;
return ans;
}
};
void yes() {
cout << "Yes\n";
exit(0);
}
void no() {
cout << "No\n";
exit(0);
}
vector<ll> getp(ll n) {
vector<ll> res;
ll a = 2;
if (n % 2 == 0) {
res.push_back(2);
while (n % 2 == 0)
n /= 2;
}
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
res.push_back(i);
while (n % i == 0)
n /= i;
}
}
if (n != 1)
res.push_back(n);
return res;
}
vector<ll> getp2(ll n) {
vector<ll> res;
ll a = 2;
if (n % 2 == 0) {
while (n % 2 == 0) {
n /= 2;
res.push_back(2);
}
}
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
while (n % i == 0) {
n /= i;
res.push_back(i);
}
}
}
if (n != 1)
res.push_back(n);
return res;
}
vector<ll> getDivisors(ll n) {
vector<ll> res;
ll a = 2;
res.push_back(1);
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (n / i != i)
res.push_back(n / i);
}
}
return res;
}
struct ve {
public:
vector<ve> child;
int _t = INF;
ve(int t) : _t(t) {}
ve(ve _left, ve _right) {
_t = _left._t + _right._t;
child.push_back(_left);
child.push_back(_right);
}
bool operator<(const ve &t) const { return _t > t._t; }
};
vector<bool> elas(ll n) {
vector<bool> r(n);
fill(r.begin(), r.end(), 1);
r[0] = 0;
r[1] = 0;
for (ll i = 2; i * i < n; i++) {
if (!r[i])
continue;
ll ti = i * 2;
while (ti < n) {
r[ti] = false;
ti += i;
}
}
return r;
}
bool isPrime(ll v) {
for (ll i = 2; i * i <= v; i++) {
if (v % i == 0)
return false;
}
return true;
}
void solv() {
cin >> n;
int p[100010];
for (size_t i = 0; i < n; i++) {
cin >> p[i];
}
int mi = INF;
int cnt = 0;
for (size_t i = 0; i < n; i++) {
if (p[i] <= mi) {
cnt++;
}
mi = min(p[i], mi);
}
cout << cnt << endl;
}
int main() {
// COMinit();
solv();
return 0;
} | #include <algorithm>
#include <array>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <unordered_map>
#include <utility>
#include <vector>
#define _USE_MATH_DEFINES
#include <iostream>
#include <math.h>
using namespace std;
#define REP(x, n) for (int x = 0; x < n; x++)
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, char> pic;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
#define bit(x, v) ((ll)x << v)
const ll INF = 1000000007;
const int MAX = 1000010;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int pr[100010];
void uini(int n) {
for (size_t i = 0; i <= n; i++) {
pr[i] = i;
}
}
int parent(int x) {
if (x == pr[x])
return x;
return pr[x] = parent(pr[x]);
}
int same(int x, int y) { return parent(x) == parent(y); }
bool unit(int x, int y) {
int px = parent(x);
int py = parent(y);
if (px == py)
return false;
if (px < py) {
pr[py] = px;
} else {
pr[px] = py;
}
return true;
}
ll bit[200010];
int max_n = 200000;
int pm = 0;
void add(int x) {
while (max_n >= x) {
bit[x]++;
x += x & -x;
}
}
void sub(int x) {
while (max_n >= x) {
bit[x]--;
x += x & -x;
}
}
ll merge(ll *a, int left, int mid, int right) {
ll n1 = mid - left;
ll n2 = right - mid;
vector<int> L(n1 + 1);
vector<int> R(n2 + 1);
for (size_t i = 0; i < n1; i++) {
L[i] = a[left + i];
}
for (size_t i = 0; i < n2; i++) {
R[i] = a[mid + i];
}
L[n1] = INF;
R[n2] = INF;
ll i = 0;
ll j = 0;
ll r = 0;
for (size_t k = left; k < right; k++) {
if (L[i] <= R[j]) {
a[k] = L[i];
i++;
} else {
a[k] = R[j];
r += n1 - i;
j++;
}
}
return r;
}
ll merge2(pair<int, char> *a, int left, int mid, int right) {
ll n1 = mid - left;
ll n2 = right - mid;
vector<pair<int, char>> L(n1 + 1);
vector<pair<int, char>> R(n2 + 1);
for (size_t i = 0; i < n1; i++) {
L[i] = a[left + i];
}
for (size_t i = 0; i < n2; i++) {
R[i] = a[mid + i];
}
L[n1] = make_pair(INF, ' ');
R[n2] = make_pair(INF, ' ');
ll i = 0;
ll j = 0;
ll r = 0;
for (size_t k = left; k < right; k++) {
if (L[i].first <= R[j].first) {
a[k] = L[i];
i++;
} else {
a[k] = R[j];
r += n1 - i;
j++;
}
}
return r;
}
ll mergeSort2(pair<int, char> *a, int left, int right) {
ll res = 0;
if (left + 1 < right) {
int mid = (left + right) / 2;
res = mergeSort2(a, left, mid);
res += mergeSort2(a, mid, right);
res += merge2(a, left, mid, right);
}
return res;
}
ll mergeSort(ll *a, int left, int right) {
ll res = 0;
if (left + 1 < right) {
int mid = (left + right) / 2;
res = mergeSort(a, left, mid);
res += mergeSort(a, mid, right);
res += merge(a, left, mid, right);
}
return res;
}
int partition(pair<int, char> *a, int p, int r) {
pair<int, char> x = a[r];
int i = p - 1;
for (size_t j = p; j < r; j++) {
if (a[j].first <= x.first) {
i++;
swap(a[i], a[j]);
}
}
swap(a[i + 1], a[r]);
return i + 1;
}
void quick(pair<int, char> *a, int p, int r) {
if (p < r) {
int q = partition(a, p, r);
quick(a, p, q - 1);
quick(a, q + 1, r);
}
}
ll n;
int ci = 0;
ll P[1000010];
struct Node {
int key;
int priority;
Node *parent, *left, *right;
Node(int key, int priority);
Node() {}
};
Node NIL;
Node::Node(int key, int priority) : key(key), priority(priority) {
left = &NIL;
right = &NIL;
}
Node *root = new Node();
void cenrec(Node *k) {
if (k->key == NIL.key)
return;
cenrec(k->left);
cout << " " << k->key;
cenrec(k->right);
}
void fastrec(Node *k) {
if (k->key == NIL.key)
return;
cout << " " << k->key;
fastrec(k->left);
fastrec(k->right);
}
void insert(Node *v) {
Node *y = &NIL;
Node *x = root;
while (x->key != NIL.key) {
y = x;
if (v->key < x->key) {
x = x->left;
} else {
x = x->right;
}
}
v->parent = y;
if (y->key == NIL.key) {
root = v;
} else if (v->key < y->key) {
y->left = v;
} else {
y->right = v;
}
}
Node *find(Node *k, ll v) {
if (k->key == NIL.key)
return &NIL;
if (k->key == v)
return k;
if (v < k->key)
return find(k->left, v);
return find(k->right, v);
}
void delp12(Node *x) {
if (x->key == NIL.key)
return;
Node *l = x->left;
Node *r = x->right;
Node *pr = x->parent;
if (l->key == NIL.key && r->key == NIL.key) {
if (pr->left == x) {
pr->left = &NIL;
} else
pr->right = &NIL;
} else if (l->key != NIL.key) {
if (pr->left == x) {
pr->left = l;
} else
pr->right = l;
l->parent = pr;
} else if (r->key != NIL.key) {
if (pr->left == x) {
pr->left = r;
} else
pr->right = r;
r->parent = pr;
}
}
Node *get_next(Node *k) {
if (k->key == NIL.key)
return &NIL;
Node *res = get_next(k->left);
if (res->key != NIL.key)
return res;
return k;
}
void del(Node *x) {
if (x->key == NIL.key)
return;
Node *l = x->left;
Node *r = x->right;
Node *pr = x->parent;
if (l->key != NIL.key && r->key != NIL.key) {
Node *nex = get_next(r);
x->key = nex->key;
delp12(nex);
} else {
delp12(x);
}
}
Node *rightRotate(Node *t) {
Node *s = t->left;
t->left = s->right;
s->right = t;
return s;
}
Node *leftRotate(Node *t) {
Node *s = t->right;
t->right = s->left;
s->left = t;
return s;
}
Node *_insert(Node *t, int key, int priority) {
if (t->key == NIL.key) {
return new Node(key, priority);
}
if (key == t->key) {
return t;
}
if (key < t->key) {
t->left = _insert(t->left, key, priority);
if (t->priority < t->left->priority) {
t = rightRotate(t);
}
} else {
t->right = _insert(t->right, key, priority);
if (t->priority < t->right->priority) {
t = leftRotate(t);
}
}
return t;
}
Node *delete1(Node *t, int key);
Node *_delete(Node *t, int key) {
if (t->left->key == NIL.key && t->right->key == NIL.key) {
return &NIL;
} else if (t->left->key == NIL.key) {
t = leftRotate(t);
} else if (t->right->key == NIL.key) {
t = rightRotate(t);
} else {
if (t->left->priority > t->right->priority) {
t = rightRotate(t);
} else
t = leftRotate(t);
}
return delete1(t, key);
}
Node *delete1(Node *t, int key) {
if (t->key == NIL.key) {
return &NIL;
}
if (key < t->key) {
t->left = delete1(t->left, key);
} else if (key > t->key) {
t->right = delete1(t->right, key);
} else
return _delete(t, key);
return t;
}
int H;
int left(int i) { return i * 2 + 1; }
int right(int i) { return i * 2 + 2; }
struct edge {
int from, to;
ll val;
edge(int from, int to, ll val) : from(from), to(to), val(val) {}
};
int k;
int _rank[1010];
int temp[1010];
bool compare_sa(int i, int j) {
if (_rank[i] != _rank[j])
return _rank[i] < _rank[j];
else {
int ri = i + k <= n ? _rank[i + k] : -1;
int rj = j + k <= n ? _rank[j + k] : -1;
return ri < rj;
}
}
void construct_sa(string S, int *sa) {
n = S.length();
for (size_t i = 0; i <= n; i++) {
sa[i] = i;
_rank[i] = i < n ? S[i] : -1;
}
for (k = 1; k <= n; k *= 2) {
sort(sa, sa + n + 1, compare_sa);
// saはソート後の接尾辞の並びになっている、rankは元の位置のindexを保持したまま、更新されている。
// ピンとこなかった部分
temp[sa[0]] = 0;
for (size_t i = 1; i <= n; i++) {
temp[sa[i]] = temp[sa[i - 1]] + (compare_sa(sa[i - 1], sa[i]) ? 1 : 0);
}
for (size_t i = 0; i <= n; i++) {
_rank[i] = temp[i];
}
}
}
bool contain(string S, int *sa, string T) {
int a = 0, b = S.length();
// sa は 接尾辞が辞書順に並んでいる、入っているのはその位置のインデックス
while (b - a > 1) {
int c = (a + b) / 2;
if (S.compare(sa[c], T.length(), T) < 0)
a = c;
else
b = c;
}
return S.compare(sa[b], T.length(), T) == 0;
}
#define bit(x, v) ((ll)x << v)
class BIT {
static const int MAX_N = 400010;
public:
BIT() { memset(bit, 0, sizeof(bit)); }
ll bit[MAX_N + 1], n;
ll sum(int i) {
ll s = 0;
while (i > 0) {
s += bit[i];
i -= i & -i;
}
return s;
}
void add(int i, int x) {
while (i <= n) {
bit[i] += x;
i += i & -i;
}
}
};
struct UnionFind {
vector<int> A;
UnionFind(int n) : A(n, -1) {}
int find(int x) {
if (A[x] < 0)
return x;
return A[x] = find(A[x]);
}
void unite(int x, int y) {
x = find(x), y = find(y);
if (x == y)
return;
if (A[x] > A[y])
swap(x, y);
A[x] += A[y];
A[y] = x;
}
int ngroups() {
int ans = 0;
for (auto a : A)
if (a < 0)
ans++;
return ans;
}
};
void yes() {
cout << "Yes\n";
exit(0);
}
void no() {
cout << "No\n";
exit(0);
}
vector<ll> getp(ll n) {
vector<ll> res;
ll a = 2;
if (n % 2 == 0) {
res.push_back(2);
while (n % 2 == 0)
n /= 2;
}
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
res.push_back(i);
while (n % i == 0)
n /= i;
}
}
if (n != 1)
res.push_back(n);
return res;
}
vector<ll> getp2(ll n) {
vector<ll> res;
ll a = 2;
if (n % 2 == 0) {
while (n % 2 == 0) {
n /= 2;
res.push_back(2);
}
}
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
while (n % i == 0) {
n /= i;
res.push_back(i);
}
}
}
if (n != 1)
res.push_back(n);
return res;
}
vector<ll> getDivisors(ll n) {
vector<ll> res;
ll a = 2;
res.push_back(1);
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (n / i != i)
res.push_back(n / i);
}
}
return res;
}
struct ve {
public:
vector<ve> child;
int _t = INF;
ve(int t) : _t(t) {}
ve(ve _left, ve _right) {
_t = _left._t + _right._t;
child.push_back(_left);
child.push_back(_right);
}
bool operator<(const ve &t) const { return _t > t._t; }
};
vector<bool> elas(ll n) {
vector<bool> r(n);
fill(r.begin(), r.end(), 1);
r[0] = 0;
r[1] = 0;
for (ll i = 2; i * i < n; i++) {
if (!r[i])
continue;
ll ti = i * 2;
while (ti < n) {
r[ti] = false;
ti += i;
}
}
return r;
}
bool isPrime(ll v) {
for (ll i = 2; i * i <= v; i++) {
if (v % i == 0)
return false;
}
return true;
}
void solv() {
cin >> n;
int p[200010];
for (size_t i = 0; i < n; i++) {
cin >> p[i];
}
int mi = INF;
int cnt = 0;
for (size_t i = 0; i < n; i++) {
if (p[i] <= mi) {
cnt++;
}
mi = min(p[i], mi);
}
cout << cnt << endl;
}
int main() {
// COMinit();
solv();
return 0;
} | replace | 595 | 596 | 595 | 596 | 0 | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= (n); i++)
#define all(x) begin(x), end(x)
#define uniq(x) (x).erase(unique(all(x)), end(x))
#define bit(n) (1LL << (n))
#define dump(x) cerr << #x " = " << (x) << endl
using vint = vector<int>;
using vvint = vector<vint>;
using pint = pair<int, int>;
using vpint = vector<pint>;
template <typename T>
using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
constexpr double pi = 3.1415926535897932384626433832795028L;
constexpr int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
constexpr int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int gcd(int a, int b) {
while (b) {
swap(a %= b, b);
}
return a;
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
template <typename T> void fin(T mes) {
cout << mes << endl;
exit(0);
}
template <typename T, typename U> bool chmax(T &a, const U &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T, typename U> bool chmin(T &a, const U &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &rhs) {
os << "(" << rhs.first << ", " << rhs.second << ")";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &rhs) {
os << "{";
for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
os << *itr << (next(itr) != rhs.end() ? ", " : "");
}
os << "}";
return os;
}
struct setup {
static constexpr int PREC = 20;
setup() {
cout << fixed << setprecision(PREC);
cerr << fixed << setprecision(PREC);
};
} setup;
int N;
int P[110000];
signed main() {
cin >> N;
rep(i, N) { cin >> P[i]; }
int ans = 0, lb = LLONG_MAX;
rep(i, N) {
if (P[i] < lb) {
lb = P[i];
ans++;
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= (n); i++)
#define all(x) begin(x), end(x)
#define uniq(x) (x).erase(unique(all(x)), end(x))
#define bit(n) (1LL << (n))
#define dump(x) cerr << #x " = " << (x) << endl
using vint = vector<int>;
using vvint = vector<vint>;
using pint = pair<int, int>;
using vpint = vector<pint>;
template <typename T>
using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
constexpr double pi = 3.1415926535897932384626433832795028L;
constexpr int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
constexpr int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int gcd(int a, int b) {
while (b) {
swap(a %= b, b);
}
return a;
}
int lcm(int a, int b) { return a / gcd(a, b) * b; }
template <typename T> void fin(T mes) {
cout << mes << endl;
exit(0);
}
template <typename T, typename U> bool chmax(T &a, const U &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T, typename U> bool chmin(T &a, const U &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &rhs) {
os << "(" << rhs.first << ", " << rhs.second << ")";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &rhs) {
os << "{";
for (auto itr = rhs.begin(); itr != rhs.end(); itr++) {
os << *itr << (next(itr) != rhs.end() ? ", " : "");
}
os << "}";
return os;
}
struct setup {
static constexpr int PREC = 20;
setup() {
cout << fixed << setprecision(PREC);
cerr << fixed << setprecision(PREC);
};
} setup;
int N;
int P[220000];
signed main() {
cin >> N;
rep(i, N) { cin >> P[i]; }
int ans = 0, lb = LLONG_MAX;
rep(i, N) {
if (P[i] < lb) {
lb = P[i];
ans++;
}
}
cout << ans << endl;
}
| replace | 67 | 68 | 67 | 68 | 0 | |
p02791 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long lint;
using namespace std;
int main() {
lint n, ans = 0;
cin >> n;
vector<lint> p(n), c(n);
rep(i, n) cin >> p.at(i);
c = p;
rep(i, n) {
sort(c.begin(), c.begin() + i);
if (p.at(i) <= c.at(0))
ans++;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long lint;
using namespace std;
int main() {
lint n, ans = 0;
cin >> n;
vector<lint> p(n), c(n);
rep(i, n) cin >> p.at(i);
c = p;
rep(i, n) {
if (c.at(i) < c.at(0))
c.at(0) = c.at(i);
if (p.at(i) <= c.at(0))
ans++;
}
cout << ans << endl;
} | replace | 12 | 13 | 12 | 14 | TLE | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// Optimization
// #pragma GCC optimize("O3")
#define endl '\n'
// Shortcut
#define int long long
#define eb emplace_back
#define pb push_back
#define pob pop_back
#define mp make_pair
#define upb upper_bound
#define lwb lower_bound
#define fi first
#define se second
#define For(i, l, r) for (int i = l; i < r; i++)
#define ForE(i, l, r) for (int i = l; i <= r; i++)
#define Ford(i, r, l) for (int i = r; i > l; i--)
#define FordE(i, r, l) for (int i = r; i >= l; i--)
#define Fora(i, a) for (auto i : a)
// I/O & Debug
#define PrintV(a) Fora(iiii, a) cout << iiii << ' ';
#define PrintVl(a) Fora(iiii, a) cout << iiii << endl;
#define PrintA(a, l, r) \
for (int iiii = l; iiii <= r; iiii++) \
cout << a[iiii] << ' ';
#define PrintAl(a, l, r) \
for (int iiii = l; iiii <= r; iiii++) \
cout << a[iiii] << endl;
#define Ptest(x) return cout << x, 0;
#define gl(s) getline(cin, s);
#define setpre(x) fixed << setprecision(x)
/*
#define debug(args...){ string _sDEB = #args; replace(_sDEB.begin(),
_sDEB.end(), ',', ' '); stringstream _ssDEB(_sDEB); istream_iterator<string>
_itDEB(_ssDEB); DEB(_itDEB, args); } void DEB(istream_iterator<string> it) {}
template<typename T, typename... Args>
void DEB(istream_iterator<string> it, T a, Args... args){
cout << *it << " = " << a << endl;
DEB(++it, args...);
}
*/
// Functions
// #define isvowel(a) (a == 'a' || a == 'e' || a == 'i' || a == 'o' || a == 'u')
#define bend(a) a.begin(), a.end()
#define rbend(a) a.rbegin(), a.rend()
#define mset(a) memset(a, 0, sizeof(a))
#define mset1(a) memset(a, 1, sizeof(a))
#define msetn1(a) memset(a, -1, sizeof(a))
#define msetinf(a) memset(a, 0x3f, sizeof(a))
#define gcd __gcd
#define __builtin_popcount __builtin_popcountll
// mt19937 rando(chrono::steady_clock::now().time_since_epoch().count());
// Data Structure
#define pque priority_queue
#define mts multiset
#define y0 _y0_
#define y1 _y1_
#define div divi
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
const int N = 1e5 + 5, mod = 1e9 + 7, mod1 = 998244353, mod2 = 1e9 + 9,
inf = 1e9 + 7;
const ll infll = 1e18 + 7;
int n, m, k;
int q = 1;
int ans, tmp, cnt, idx, mx, mn, sum;
int x, y, z;
int a[N], b[N];
string s, t;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// cin >> q;
while (q--) {
cin >> n;
mn = inf;
ForE(i, 1, n) {
cin >> a[i];
if (a[i] < mn) {
mn = a[i];
ans++;
}
}
cout << ans;
}
}
/*
==================================+
INPUT: |
------------------------------ |
------------------------------ |
==================================+
OUTPUT: |
------------------------------ |
------------------------------ |
==================================+
*/ | #include <bits/stdc++.h>
using namespace std;
// Optimization
// #pragma GCC optimize("O3")
#define endl '\n'
// Shortcut
#define int long long
#define eb emplace_back
#define pb push_back
#define pob pop_back
#define mp make_pair
#define upb upper_bound
#define lwb lower_bound
#define fi first
#define se second
#define For(i, l, r) for (int i = l; i < r; i++)
#define ForE(i, l, r) for (int i = l; i <= r; i++)
#define Ford(i, r, l) for (int i = r; i > l; i--)
#define FordE(i, r, l) for (int i = r; i >= l; i--)
#define Fora(i, a) for (auto i : a)
// I/O & Debug
#define PrintV(a) Fora(iiii, a) cout << iiii << ' ';
#define PrintVl(a) Fora(iiii, a) cout << iiii << endl;
#define PrintA(a, l, r) \
for (int iiii = l; iiii <= r; iiii++) \
cout << a[iiii] << ' ';
#define PrintAl(a, l, r) \
for (int iiii = l; iiii <= r; iiii++) \
cout << a[iiii] << endl;
#define Ptest(x) return cout << x, 0;
#define gl(s) getline(cin, s);
#define setpre(x) fixed << setprecision(x)
/*
#define debug(args...){ string _sDEB = #args; replace(_sDEB.begin(),
_sDEB.end(), ',', ' '); stringstream _ssDEB(_sDEB); istream_iterator<string>
_itDEB(_ssDEB); DEB(_itDEB, args); } void DEB(istream_iterator<string> it) {}
template<typename T, typename... Args>
void DEB(istream_iterator<string> it, T a, Args... args){
cout << *it << " = " << a << endl;
DEB(++it, args...);
}
*/
// Functions
// #define isvowel(a) (a == 'a' || a == 'e' || a == 'i' || a == 'o' || a == 'u')
#define bend(a) a.begin(), a.end()
#define rbend(a) a.rbegin(), a.rend()
#define mset(a) memset(a, 0, sizeof(a))
#define mset1(a) memset(a, 1, sizeof(a))
#define msetn1(a) memset(a, -1, sizeof(a))
#define msetinf(a) memset(a, 0x3f, sizeof(a))
#define gcd __gcd
#define __builtin_popcount __builtin_popcountll
// mt19937 rando(chrono::steady_clock::now().time_since_epoch().count());
// Data Structure
#define pque priority_queue
#define mts multiset
#define y0 _y0_
#define y1 _y1_
#define div divi
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vi> vvi;
typedef vector<vll> vvll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
const int N = 2e5 + 5, mod = 1e9 + 7, mod1 = 998244353, mod2 = 1e9 + 9,
inf = 1e9 + 7;
const ll infll = 1e18 + 7;
int n, m, k;
int q = 1;
int ans, tmp, cnt, idx, mx, mn, sum;
int x, y, z;
int a[N], b[N];
string s, t;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// cin >> q;
while (q--) {
cin >> n;
mn = inf;
ForE(i, 1, n) {
cin >> a[i];
if (a[i] < mn) {
mn = a[i];
ans++;
}
}
cout << ans;
}
}
/*
==================================+
INPUT: |
------------------------------ |
------------------------------ |
==================================+
OUTPUT: |
------------------------------ |
------------------------------ |
==================================+
*/ | replace | 82 | 83 | 82 | 83 | 0 | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef int64_t Int;
int main() {
Int N;
vector<Int> P(N);
rep(i, N) cin >> P[i];
Int m = P[0], ans = 1;
rep1(i, N - 1) {
if (m >= P[i])
ans++;
m = min(m, P[i]);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef int64_t Int;
int main() {
Int N;
cin >> N;
vector<Int> P(N);
rep(i, N) cin >> P[i];
Int m = P[0], ans = 1;
rep1(i, N - 1) {
if (m >= P[i])
ans++;
m = min(m, P[i]);
}
cout << ans << endl;
}
| insert | 8 | 8 | 8 | 9 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02791 | C++ | Runtime Error | #include <iostream>
#define N 100005
#define INF 0x3f3f3f3f
using namespace std;
int main() {
int min0 = INF;
int ans = 0;
int n;
cin >> n;
int a[N];
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
if (a[i] < min0) {
ans++;
min0 = a[i];
}
}
cout << ans << endl;
return 0;
} | #include <iostream>
#define N 1000005
#define INF 0x3f3f3f3f
using namespace std;
int main() {
int min0 = INF;
int ans = 0;
int n;
cin >> n;
int a[N];
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
if (a[i] < min0) {
ans++;
min0 = a[i];
}
}
cout << ans << endl;
return 0;
} | replace | 1 | 2 | 1 | 2 | 0 | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int a[40005];
int d[40005];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
if (n == 0) // 0个元素特判一下
{
printf("0\n");
return 0;
}
d[1] = a[1]; // 初始化
int len = 1;
for (int i = 2; i <= n; i++) {
if (a[i] <= d[len])
d[++len] = a[i]; // 如果可以接在len后面就接上
else // 否则就找一个最该替换的替换掉
{
int j = lower_bound(d + 1, d + len + 1, a[i]) -
d; // 找到第一个大于它的d的下标
d[j] = a[i];
}
}
printf("%d\n", len);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int a[200005];
int d[200005];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
if (n == 0) // 0个元素特判一下
{
printf("0\n");
return 0;
}
d[1] = a[1]; // 初始化
int len = 1;
for (int i = 2; i <= n; i++) {
if (a[i] <= d[len])
d[++len] = a[i]; // 如果可以接在len后面就接上
else // 否则就找一个最该替换的替换掉
{
int j = lower_bound(d + 1, d + len + 1, a[i]) -
d; // 找到第一个大于它的d的下标
d[j] = a[i];
}
}
printf("%d\n", len);
return 0;
}
| replace | 3 | 5 | 3 | 5 | 0 | |
p02791 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> VI;
typedef vector<VI> VVI; // 例: VVI dp(10, vector<int>(10, INF);
typedef priority_queue<int, vector<int>, less<int>> QUE_int;
const int INF =
pow(10, 5) + 1; //+1しないとREになる(out of rangeになるんかな?? )
int main() {
int N;
cin >> N;
vector<int> P(N);
for (int i = 0; i < N; i++)
cin >> P[i];
// for(int i=0; i<N; i++) cout << P[i] << " " ;
// cout << endl;
int ans = 0;
int now_num = 1001001;
for (int i = 0; i < N; i++) { // 注目するP
for (int j = 0; j <= i; j++) {
if (P[i] > P[j])
break;
if (P[i] > now_num)
break;
if (j == i) {
ans++;
now_num = P[i];
}
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> VI;
typedef vector<VI> VVI; // 例: VVI dp(10, vector<int>(10, INF);
typedef priority_queue<int, vector<int>, less<int>> QUE_int;
const int INF =
pow(10, 5) + 1; //+1しないとREになる(out of rangeになるんかな?? )
int main() {
int N;
cin >> N;
vector<int> P(N);
for (int i = 0; i < N; i++)
cin >> P[i];
// for(int i=0; i<N; i++) cout << P[i] << " " ;
// cout << endl;
int ans = 1;
int now_num = P[0];
for (int i = 1; i < N; i++) {
if (P[i] > P[i - 1])
continue;
if (P[i] > now_num)
continue;
ans++;
now_num = P[i];
// cout << "i : " << i << endl;
}
cout << ans << endl;
}
| replace | 21 | 34 | 21 | 31 | TLE | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define pb push_back
#define inf 1e9
int v[100005];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int ans = 0;
int menor = v[0];
for (int i = 0; i < n; i++) {
if (v[i] <= menor) {
ans++;
}
menor = min(menor, v[i]);
}
cout << ans << endl;
// Dado um v[i], todos os seus antecessores devem ser menor que ele;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define pb push_back
#define inf 1e9
int v[200005];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int ans = 0;
int menor = v[0];
for (int i = 0; i < n; i++) {
if (v[i] <= menor) {
ans++;
}
menor = min(menor, v[i]);
}
cout << ans << endl;
// Dado um v[i], todos os seus antecessores devem ser menor que ele;
return 0;
}
| replace | 9 | 10 | 9 | 10 | 0 | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, i, j, a, b, arr[100009];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &arr[i]);
m = arr[0];
a = 1;
for (i = 1; i < n; i++) {
if (arr[i] <= m) {
m = arr[i];
a++;
}
}
printf("%d\n", a);
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m, i, j, a, b, arr[200009];
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &arr[i]);
m = arr[0];
a = 1;
for (i = 1; i < n; i++) {
if (arr[i] <= m) {
m = arr[i];
a++;
}
}
printf("%d\n", a);
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02791 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
int min = 2000001, ans = 0;
int P[10000] = {0};
cin >> N;
for (int i = 0; i < N; i++) {
cin >> P[i];
}
for (int i = 0; i < N; i++) {
if (min > P[i]) {
min = P[i];
ans++;
}
}
cout << ans;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
int min = 200001, ans = 0;
int P[200000] = {0};
cin >> N;
for (int i = 0; i < N; i++) {
cin >> P[i];
}
for (int i = 0; i < N; i++) {
if (min > P[i]) {
min = P[i];
ans++;
}
}
cout << ans;
} | replace | 6 | 8 | 6 | 8 | 0 | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define MOD7 1000000007
#define MOD9 1e9 + 9
#define SCD(t) scanf("%d", &t)
#define SCLD(t) scanf("%ld", &t)
#define SCLLD(t) scanf("%lld", &t)
#define SCC(t) scanf("%c", &t)
#define SCS(t) scanf("%s", t)
#define SCF(t) scanf("%f", &t)
#define SCLF(t) scanf("%lf", &t)
#define MEM(a, b) memset(a, (b), sizeof(a))
typedef long long ll;
typedef long double ld;
typedef string str;
typedef double d;
typedef unsigned u;
typedef unsigned long long ull;
const long long BIGINF = 2e18 + 7;
const int INF = 2e9 + 7;
int main() {
#ifndef ONLINE_JUDGE
freopen("inputf.txt", "r", stdin);
freopen("outputf.txt", "w", stdout);
#endif
int n;
SCD(n);
int x;
vector<pair<int, int>> v;
for (int i = 0; i < n; i++) {
SCD(x);
v.emplace_back(x, i);
}
sort(v.begin(), v.end());
int ans = 1;
int ind = v[0].second;
for (int i = 1; i < n; i++) {
if (v[i].second < ind)
ans++;
ind = min(ind, v[i].second);
}
printf("%d", ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define MOD7 1000000007
#define MOD9 1e9 + 9
#define SCD(t) scanf("%d", &t)
#define SCLD(t) scanf("%ld", &t)
#define SCLLD(t) scanf("%lld", &t)
#define SCC(t) scanf("%c", &t)
#define SCS(t) scanf("%s", t)
#define SCF(t) scanf("%f", &t)
#define SCLF(t) scanf("%lf", &t)
#define MEM(a, b) memset(a, (b), sizeof(a))
typedef long long ll;
typedef long double ld;
typedef string str;
typedef double d;
typedef unsigned u;
typedef unsigned long long ull;
const long long BIGINF = 2e18 + 7;
const int INF = 2e9 + 7;
int main() {
/*#ifndef ONLINE_JUDGE
freopen("inputf.txt", "r", stdin);
freopen("outputf.txt", "w", stdout);
#endif*/
int n;
SCD(n);
int x;
vector<pair<int, int>> v;
for (int i = 0; i < n; i++) {
SCD(x);
v.emplace_back(x, i);
}
sort(v.begin(), v.end());
int ans = 1;
int ind = v[0].second;
for (int i = 1; i < n; i++) {
if (v[i].second < ind)
ans++;
ind = min(ind, v[i].second);
}
printf("%d", ans);
return 0;
}
| replace | 23 | 27 | 23 | 27 | 0 | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define f(i, n) for (i = 0; i < n; i++)
#define F(i, a, b) for (i = a; a <= b; i++)
#define arr(a, n) \
for (i = 0; i < n; i++) \
cin >> a[i];
#define fi first
#define se second
#define mp make_pair
#define mod 1000000007
#define YES cout << "YES" << endl;
#define Yes cout << "Yes" << endl;
#define NO cout << "NO" << endl;
#define No cout << "No" << endl;
#define yes cout << "yes" << endl;
#define no cout << "no" << endl;
#define vi vector<ll>
#define ed end()
#define bg begin()
#define sz size()
#define ln length()
#define s() sort(a, a + n);
#define sr() sort(a, a + n, greater<ll>());
#define v() sort(v.begin(), v.end());
#define vr() sort(v.begin(), v.end(), greater<ll>());
#define mod 1000000007
#define fast() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
ll gcd(ll a, ll b) {
if (!b)
return a;
return gcd(b, a % b);
}
ll power(ll x, ll y, ll p) {
ll res = 1;
x %= p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int main() {
#ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output.txt", "w", stdout);
#endif
fast();
// ll t;cin>>t;while(t--)
{
ll n, s = 0, i = 0, c = 1;
cin >> n;
ll a[n];
f(i, n) { cin >> a[i]; }
ll temp = a[0];
for (i = 1; i < n; i++) {
if (temp >= a[i]) {
temp = a[i];
c++;
}
}
cout << c << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl "\n"
#define pb push_back
#define f(i, n) for (i = 0; i < n; i++)
#define F(i, a, b) for (i = a; a <= b; i++)
#define arr(a, n) \
for (i = 0; i < n; i++) \
cin >> a[i];
#define fi first
#define se second
#define mp make_pair
#define mod 1000000007
#define YES cout << "YES" << endl;
#define Yes cout << "Yes" << endl;
#define NO cout << "NO" << endl;
#define No cout << "No" << endl;
#define yes cout << "yes" << endl;
#define no cout << "no" << endl;
#define vi vector<ll>
#define ed end()
#define bg begin()
#define sz size()
#define ln length()
#define s() sort(a, a + n);
#define sr() sort(a, a + n, greater<ll>());
#define v() sort(v.begin(), v.end());
#define vr() sort(v.begin(), v.end(), greater<ll>());
#define mod 1000000007
#define fast() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
ll gcd(ll a, ll b) {
if (!b)
return a;
return gcd(b, a % b);
}
ll power(ll x, ll y, ll p) {
ll res = 1;
x %= p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int main() {
/* #ifndef ONLINE_JUDGE
// for getting input from input.txt
freopen("input.txt", "r", stdin);
// for writing output to output.txt
freopen("output.txt", "w", stdout);
#endif*/
fast();
// ll t;cin>>t;while(t--)
{
ll n, s = 0, i = 0, c = 1;
cin >> n;
ll a[n];
f(i, n) { cin >> a[i]; }
ll temp = a[0];
for (i = 1; i < n; i++) {
if (temp >= a[i]) {
temp = a[i];
c++;
}
}
cout << c << endl;
}
return 0;
} | replace | 51 | 57 | 51 | 57 | -11 | |
p02791 | C++ | Runtime Error | #pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define ms(a, b) memset(a, b, sizeof(a))
#define msn(a, n, b) \
for (int i = 0; i <= n; i++) \
a[i] = b
#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
#define fi first
#define se second
using namespace std;
mt19937 rng_32(chrono::steady_clock::now().time_since_epoch().count());
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
const int mod = 1e9 + 7;
const int seed = 233;
const double PI = acos(-1.0);
const double eps = 1e-7;
const int inf = 0x3f3f3f3f;
const int max_n = 100005;
ll ceil(ll x, ll y) {
if (x == 0)
return 0;
if (y < 0)
x = -x, y = -y;
bool sign = x > 0;
x = abs(x);
return sign ? (x + y - 1) / y : -x / y;
}
ll floor(ll x, ll y) {
if (x == 0)
return 0;
if (y < 0)
x = -x, y = -y;
bool sign = x > 0;
x = abs(x);
return sign ? x / y : -(x + y - 1) / y;
}
namespace {
inline int Add(int x, int y) { return (x += y) >= mod ? x - mod : x; }
inline int Sub(int x, int y) { return (x -= y) < 0 ? x + mod : x; }
inline int Mul(int x, int y) { return 1ll * x * y % mod; }
inline int Pow(int x, int y = mod - 2) {
if (y == 0)
return 1;
int res = 1;
while (y) {
if (y & 1)
res = 1ll * res * x % mod;
x = 1ll * x * x % mod;
y >>= 1;
}
return res;
}
} // namespace
/**********************head************************/
int p[max_n], n;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", p + i);
int mx = inf;
int ans = 0;
for (int i = 1; i <= n; i++) {
mx = min(mx, p[i]);
if (mx == p[i])
ans++;
}
printf("%d\n", ans);
return 0;
} | #pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define ms(a, b) memset(a, b, sizeof(a))
#define msn(a, n, b) \
for (int i = 0; i <= n; i++) \
a[i] = b
#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
#define fi first
#define se second
using namespace std;
mt19937 rng_32(chrono::steady_clock::now().time_since_epoch().count());
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
const int mod = 1e9 + 7;
const int seed = 233;
const double PI = acos(-1.0);
const double eps = 1e-7;
const int inf = 0x3f3f3f3f;
const int max_n = 200005;
ll ceil(ll x, ll y) {
if (x == 0)
return 0;
if (y < 0)
x = -x, y = -y;
bool sign = x > 0;
x = abs(x);
return sign ? (x + y - 1) / y : -x / y;
}
ll floor(ll x, ll y) {
if (x == 0)
return 0;
if (y < 0)
x = -x, y = -y;
bool sign = x > 0;
x = abs(x);
return sign ? x / y : -(x + y - 1) / y;
}
namespace {
inline int Add(int x, int y) { return (x += y) >= mod ? x - mod : x; }
inline int Sub(int x, int y) { return (x -= y) < 0 ? x + mod : x; }
inline int Mul(int x, int y) { return 1ll * x * y % mod; }
inline int Pow(int x, int y = mod - 2) {
if (y == 0)
return 1;
int res = 1;
while (y) {
if (y & 1)
res = 1ll * res * x % mod;
x = 1ll * x * x % mod;
y >>= 1;
}
return res;
}
} // namespace
/**********************head************************/
int p[max_n], n;
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", p + i);
int mx = inf;
int ans = 0;
for (int i = 1; i <= n; i++) {
mx = min(mx, p[i]);
if (mx == p[i])
ans++;
}
printf("%d\n", ans);
return 0;
} | replace | 21 | 22 | 21 | 22 | 0 | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int p[20005], n, ans = 0, ma = 9999999;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &p[i]);
for (int i = 0; i < n; i++) {
if (p[i] <= ma)
ans++;
ma = min(p[i], ma);
}
printf("%d", ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int p[200006], n, ans = 0, ma = 9999999;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &p[i]);
for (int i = 0; i < n; i++) {
if (p[i] <= ma)
ans++;
ma = min(p[i], ma);
}
printf("%d", ans);
return 0;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02791 | C++ | Runtime Error | /*
* Author: pawanmsr
*/
/*
* Run in Mac using the following command:
* g++ -std=c++14 <cpp_filename>
* A binary will be generated. Then run:
* ./a.out
*/
#include <algorithm>
#include <bitset>
#include <climits>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
// #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
// Macro //
#define X first
#define Y second
#define pii pair<int, int>
#define pll pair<ll, ll>
// Global //
int n, p[100005];
// Functions //
// Main //
int main(int argc, char const *argv[]) {
// ios_base::sync_with_stdio(false);
// cin.tie(NULL);
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// // freopen("output.txt", "w", stdout);
// #else
// // online submission
// #endif
/* code */
cin >> n;
int mn = INT_MAX;
int res = 0;
for (int i = 0; i < n; i++) {
cin >> p[i];
if (p[i] <= mn) {
mn = p[i];
res++;
}
}
cout << res << endl;
return 0;
} | /*
* Author: pawanmsr
*/
/*
* Run in Mac using the following command:
* g++ -std=c++14 <cpp_filename>
* A binary will be generated. Then run:
* ./a.out
*/
#include <algorithm>
#include <bitset>
#include <climits>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
// #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
// Macro //
#define X first
#define Y second
#define pii pair<int, int>
#define pll pair<ll, ll>
// Global //
int n, p[200005];
// Functions //
// Main //
int main(int argc, char const *argv[]) {
// ios_base::sync_with_stdio(false);
// cin.tie(NULL);
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// // freopen("output.txt", "w", stdout);
// #else
// // online submission
// #endif
/* code */
cin >> n;
int mn = INT_MAX;
int res = 0;
for (int i = 0; i < n; i++) {
cin >> p[i];
if (p[i] <= mn) {
mn = p[i];
res++;
}
}
cout << res << endl;
return 0;
} | replace | 44 | 45 | 44 | 45 | 0 | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int a[10005];
int main() {
int n;
cin >> n;
int k = 0;
int mina = 0xfffff;
for (int i = 0; i < n; ++i) {
cin >> a[i];
if (a[i] <= mina) {
k++;
mina = a[i];
}
}
cout << k << endl;
} | #include <bits/stdc++.h>
using namespace std;
int a[2000005];
int main() {
int n;
cin >> n;
int k = 0;
int mina = 0xfffff;
for (int i = 0; i < n; ++i) {
cin >> a[i];
if (a[i] <= mina) {
k++;
mina = a[i];
}
}
cout << k << endl;
} | replace | 2 | 3 | 2 | 3 | 0 | |
p02791 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1000000000000000000
#define MOD 1000000007
typedef pair<int, int> P;
bool prime(int n) {
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int lcm(int x, int y) { return x / gcd(x, y) * y; }
int mod_pow(int n, int p, int m) {
if (p == 0)
return 1;
if (p % 2 == 0) {
int t = mod_pow(n, p / 2, m);
return (t * t) % m;
}
return n * mod_pow(n, p - 1, m) % m;
}
int extGCD(int a, int b, int &x, int &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
long long d = extGCD(b, a % b, y, x);
y -= a / b * x;
return d;
}
int modinv(int a, int m) {
int b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
int digit(int x) {
int cnt = 0;
while (x > 0) {
cnt += x % 10;
x /= 10;
}
return cnt;
}
int read() {
int tmp;
cin >> tmp;
return tmp;
}
int xor128() {
static int x = 123456789, y = 362436069, z = 521288629, w = 88675123;
int t = (x xor (x << 11));
x = y;
y = z;
z = w;
return (w = (w xor (w >> 19)) xor (t xor (t >> 8)));
}
signed main() {
int n;
cin >> n;
int p[100005];
rep(i, n) { cin >> p[i]; }
int mi = INF, ans = 0;
rep(i, n) {
if (mi >= p[i]) {
mi = p[i];
ans++;
}
}
cout << ans << endl;
return 0;
}
| #pragma GCC optimize("Ofast")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1000000000000000000
#define MOD 1000000007
typedef pair<int, int> P;
bool prime(int n) {
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int lcm(int x, int y) { return x / gcd(x, y) * y; }
int mod_pow(int n, int p, int m) {
if (p == 0)
return 1;
if (p % 2 == 0) {
int t = mod_pow(n, p / 2, m);
return (t * t) % m;
}
return n * mod_pow(n, p - 1, m) % m;
}
int extGCD(int a, int b, int &x, int &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
long long d = extGCD(b, a % b, y, x);
y -= a / b * x;
return d;
}
int modinv(int a, int m) {
int b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
int digit(int x) {
int cnt = 0;
while (x > 0) {
cnt += x % 10;
x /= 10;
}
return cnt;
}
int read() {
int tmp;
cin >> tmp;
return tmp;
}
int xor128() {
static int x = 123456789, y = 362436069, z = 521288629, w = 88675123;
int t = (x xor (x << 11));
x = y;
y = z;
z = w;
return (w = (w xor (w >> 19)) xor (t xor (t >> 8)));
}
signed main() {
int n;
cin >> n;
int p[200005];
rep(i, n) { cin >> p[i]; }
int mi = INF, ans = 0;
rep(i, n) {
if (mi >= p[i]) {
mi = p[i];
ans++;
}
}
cout << ans << endl;
return 0;
}
| replace | 81 | 82 | 81 | 82 | 0 | |
p02791 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
vector<int> p(n);
for (size_t i = 0; i < n; i++)
cin >> p[i];
int ans = 0;
for (size_t i = 1; i <= n; i++) {
int minidx = min_element(p.begin(), p.begin() + i) - p.begin();
if (p[minidx] == p[i - 1])
++ans;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
vector<int> p(n);
for (size_t i = 0; i < n; i++)
cin >> p[i];
int ans = 0;
int min = 3000000;
for (size_t i = 0; i < n; i++) {
if (p[i] < min)
min = p[i];
if (min == p[i])
++ans;
}
cout << ans << endl;
return 0;
}
| replace | 11 | 14 | 11 | 16 | TLE | |
p02791 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
typedef long long ll;
const ll mod = 1e9 + 7;
int a[maxn];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", a + i);
}
int ans = 0;
int mn = 0x3f3f3f3f;
for (int i = 0; i < n; i++) {
if (mn < a[i])
continue;
mn = min(mn, a[i]);
ans++;
}
printf("%d", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
typedef long long ll;
const ll mod = 1e9 + 7;
int a[maxn];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", a + i);
}
int ans = 0;
int mn = 0x3f3f3f3f;
for (int i = 0; i < n; i++) {
if (mn < a[i])
continue;
mn = min(mn, a[i]);
ans++;
}
printf("%d", ans);
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02791 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define REP(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define Cout(x) cout << x << endl;
#define check(v) rep(i, v.size()) cout << v[i] << endl;
#define vint(x) vector<int> x
#define vll(x) vector<long long> x
#define vstr(x) vector<string> x
const long long LLINF = 1LL << 60;
const int INF = 1e9;
const long long MOD = 1000000007;
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;
}
typedef long long ll;
#define pint pair<int, int>
using namespace std;
// オーバーフローに気をつけろよおおおおおお
// 確認忘れるなよおおおおおお
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vint(v);
rep(i, n) cin >> v[i];
int cnt = 1;
int minnum = v[0];
REP(i, 1, n) {
if (v[i] < minnum) {
cnt++;
minnum = v[i];
}
}
cout << cnt << endl;
return 0;
} | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define REP(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define Cout(x) cout << x << endl;
#define check(v) rep(i, v.size()) cout << v[i] << endl;
#define vint(x) vector<int> x
#define vll(x) vector<long long> x
#define vstr(x) vector<string> x
const long long LLINF = 1LL << 60;
const int INF = 1e9;
const long long MOD = 1000000007;
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;
}
typedef long long ll;
#define pint pair<int, int>
using namespace std;
// オーバーフローに気をつけろよおおおおおお
// 確認忘れるなよおおおおおお
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> v(n);
rep(i, n) cin >> v[i];
int cnt = 1;
int minnum = v[0];
REP(i, 1, n) {
if (v[i] < minnum) {
cnt++;
minnum = v[i];
}
}
cout << cnt << endl;
return 0;
} | replace | 49 | 50 | 49 | 50 | -11 | |
p02791 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int INF = 1001001001;
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
int ans = n;
for (int i = 0; i < n; i++) {
for (int j = 0; j < i; j++) {
if (p[i] > p[j]) {
--ans;
break;
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int INF = 1001001001;
int main() {
int n;
cin >> n;
vector<int> p(n);
rep(i, n) cin >> p[i];
int ans = n;
int low = p[0];
for (int i = 1; i < n; i++) {
if (p[i] > low) {
--ans;
} else
low = p[i];
}
cout << ans << endl;
} | replace | 13 | 20 | 13 | 19 | TLE | |
p02792 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define debug(x) \
do { \
cerr << #x << ": " << x << "\n"; \
} while (0)
#define debugv(x) \
do { \
cerr << #x << ": "; \
for (auto &e : (x)) \
cerr << e << " "; \
cerr << "\n"; \
} while (0)
#define fori(i, n) for (int i = 0; i < (int)(n); ++i)
#define forn(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n); i >= 0; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
template <typename T> bool mmax(T &m, const T q) {
if (m < q) {
m = q;
return true;
} else
return false;
}
template <typename T> bool mmin(T &m, const T q) {
if (m > q) {
m = q;
return true;
} else
return false;
}
#define RETURN(x) \
do { \
cout << x << '\n'; \
return 0; \
} while (0)
const int MOD = 1e9 + 7;
const int MAXN = 5e3 + 5;
int main(int argc, char **argv) {
#ifdef OJ
freopen("input.txt", "rt", stdin);
// freopen("output.txt", "wt", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<pii> p(n);
vector<vector<int>> cnt(10, vector<int>(10));
fore(i, 1, n) {
int r = i % 10;
int l = i;
while (l / 10 > 0)
l /= 10;
p[i] = {l, r};
cnt[l][r]++;
}
LL ans = 0;
fore(i, 1, n) {
int l = p[i].fi;
int r = p[i].se;
ans += cnt[r][l];
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define debug(x) \
do { \
cerr << #x << ": " << x << "\n"; \
} while (0)
#define debugv(x) \
do { \
cerr << #x << ": "; \
for (auto &e : (x)) \
cerr << e << " "; \
cerr << "\n"; \
} while (0)
#define fori(i, n) for (int i = 0; i < (int)(n); ++i)
#define forn(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n); i >= 0; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
template <typename T> bool mmax(T &m, const T q) {
if (m < q) {
m = q;
return true;
} else
return false;
}
template <typename T> bool mmin(T &m, const T q) {
if (m > q) {
m = q;
return true;
} else
return false;
}
#define RETURN(x) \
do { \
cout << x << '\n'; \
return 0; \
} while (0)
const int MOD = 1e9 + 7;
const int MAXN = 5e3 + 5;
int main(int argc, char **argv) {
#ifdef OJ
freopen("input.txt", "rt", stdin);
// freopen("output.txt", "wt", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<pii> p(n + 1);
vector<vector<int>> cnt(10, vector<int>(10));
fore(i, 1, n) {
int r = i % 10;
int l = i;
while (l / 10 > 0)
l /= 10;
p[i] = {l, r};
cnt[l][r]++;
}
LL ans = 0;
fore(i, 1, n) {
int l = p[i].fi;
int r = p[i].se;
ans += cnt[r][l];
}
cout << ans << endl;
return 0;
}
| replace | 59 | 60 | 59 | 60 | 0 | |
p02792 | C++ | Runtime Error | #include <bits/stdc++.h>
int main() {
int N;
std::cin >> N;
// 組み合わせ配列初期化
int cmb[10][10]; // 先頭, 末尾
for (int head = 0; head < 11; head++) {
for (int tail = 0; tail < 11; tail++) {
cmb[head][tail] = 0;
}
}
// 組み合わせ配列を先に求める
for (int i = 1; i <= N; i++) {
std::string s = std::to_string(i);
int head = s[0] - '0';
int tail = s[s.size() - 1] - '0';
cmb[head][tail]++;
}
// AとBの組み合わせ数を求める
int ans = 0;
for (int head = 1; head <= 9; head++) {
for (int tail = 1; tail <= 9; tail++) {
ans += cmb[head][tail] * cmb[tail][head];
}
}
std::cout << ans << std::endl;
return 0;
}
| #include <bits/stdc++.h>
int main() {
int N;
std::cin >> N;
// 組み合わせ配列初期化
int cmb[10][10]; // 先頭, 末尾
for (int head = 0; head < 10; head++) {
for (int tail = 0; tail < 10; tail++) {
cmb[head][tail] = 0;
}
}
// 組み合わせ配列を先に求める
for (int i = 1; i <= N; i++) {
std::string s = std::to_string(i);
int head = s[0] - '0';
int tail = s[s.size() - 1] - '0';
cmb[head][tail]++;
}
// AとBの組み合わせ数を求める
int ans = 0;
for (int head = 1; head <= 9; head++) {
for (int tail = 1; tail <= 9; tail++) {
ans += cmb[head][tail] * cmb[tail][head];
}
}
std::cout << ans << std::endl;
return 0;
}
| replace | 8 | 10 | 8 | 10 | -6 | *** stack smashing detected ***: terminated
|
p02792 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N = 0;
cin >> N;
vector<vector<int>> c(9, vector<int>(9));
for (int i = 1; i <= N; i++) {
int keta = to_string(i).length();
// cout << keta << endl;
int last_num = i % 10;
if (last_num == 0)
continue;
int first_num = 0;
if (keta == 1) {
first_num = i;
} else {
first_num = i / ((keta - 1) * 10);
}
// cout << first_num << endl;
// cout << last_num << endl;
c.at(last_num - 1).at(first_num - 1) += 1;
}
int cnt = 0;
for (int i = 0; i < 9; i++) {
for (int j = 0; j < 9; j++) {
cnt += c.at(i).at(j) * c.at(j).at(i);
}
}
cout << cnt;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N = 0;
cin >> N;
vector<vector<int>> c(9, vector<int>(9));
for (int i = 1; i <= N; i++) {
int keta = to_string(i).length();
// cout << keta << endl;
int last_num = i % 10;
if (last_num == 0)
continue;
int first_num = 0;
if (keta == 1) {
first_num = i;
} else {
first_num = i / pow(10, (keta - 1));
}
if (last_num > 9 || first_num > 9) {
cout << i << endl;
cout << pow(10, (keta - 1)) << endl;
cout << first_num << endl;
cout << last_num << endl;
exit(1);
}
// cout << first_num << endl;
// cout << last_num << endl;
c.at(last_num - 1).at(first_num - 1) += 1;
}
int cnt = 0;
for (int i = 0; i < 9; i++) {
for (int j = 0; j < 9; j++) {
cnt += c.at(i).at(j) * c.at(j).at(i);
}
}
cout << cnt;
} | replace | 16 | 17 | 16 | 24 | 0 | |
p02792 | C++ | Time Limit Exceeded | #pragma warning(disable : 4996)
#pragma comment(linker, "/STACK:336777216")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
#define int long long int
typedef complex<long double> cd;
const long double pi = acos(-1);
typedef double db;
typedef long double ldb;
typedef pair<int, int> pii;
typedef pair<db, db> pdd;
typedef vector<int> vi;
typedef vector<vector<int>> matrix;
#define m1 make_pair
#define pb push_back
#define flush fflush(stdout)
#define IOS \
std::ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define reset(x, v) memset(x, v, sizeof(x))
#define sz(x) (int)(x.size())
#define fi first
#define se second
#define endl "\n"
#define debug(x) (cerr << #x << ": " << x << "\n")
#define setbits(x) __builtin_popcount(x)
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
inline ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
inline ll power(ll a, ll n, ll m) {
if (n == 0)
return 1;
ll p = power(a, n / 2, m);
p = (p % m * p % m) % m;
if (n % 2)
return (p % m * a % m) % m;
else
return p;
}
const ll MOD = 998244353;
const ll hell = 1000000007;
const int INF = 1e18;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
const int N = 200005;
int pr[11];
int cnt;
void recur(int x, int l, int dg, int n) {
if (dg == 1) {
x = x * 10 + l;
if (x <= n)
cnt++;
return;
}
for (int i = 0; i < 10; i++) {
recur(x * 10 + i, l, dg - 1, n);
}
}
int count(int f, int l, int n) {
// int cnt=0;
cnt = 0;
if (f == l && f <= n)
cnt++;
int dg = log10(n);
dg++;
if (dg >= 2) {
for (int i = 2; i < dg; i++) {
cnt = cnt + pr[i - 2];
}
recur(f, l, dg - 1, n);
}
return cnt;
}
void solve() {
int n;
cin >> n;
pr[0] = 1;
for (int i = 1; i <= 10; i++)
pr[i] = 10 * pr[i - 1];
int ans = 0;
for (int i = 1; i <= n; i++) {
int last = i % 10;
int z = log10(i);
int x = i / pr[z];
int first = x % 10;
if (last) {
int lst = first;
int fst = last;
ans = ans + count(fst, lst, n);
}
}
cout << ans << endl;
}
int32_t main() {
IOS;
int t;
t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
}
| #pragma warning(disable : 4996)
#pragma comment(linker, "/STACK:336777216")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
#define int long long int
typedef complex<long double> cd;
const long double pi = acos(-1);
typedef double db;
typedef long double ldb;
typedef pair<int, int> pii;
typedef pair<db, db> pdd;
typedef vector<int> vi;
typedef vector<vector<int>> matrix;
#define m1 make_pair
#define pb push_back
#define flush fflush(stdout)
#define IOS \
std::ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define reset(x, v) memset(x, v, sizeof(x))
#define sz(x) (int)(x.size())
#define fi first
#define se second
#define endl "\n"
#define debug(x) (cerr << #x << ": " << x << "\n")
#define setbits(x) __builtin_popcount(x)
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
inline ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
inline ll power(ll a, ll n, ll m) {
if (n == 0)
return 1;
ll p = power(a, n / 2, m);
p = (p % m * p % m) % m;
if (n % 2)
return (p % m * a % m) % m;
else
return p;
}
const ll MOD = 998244353;
const ll hell = 1000000007;
const int INF = 1e18;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
const int N = 200005;
int pr[11];
int cnt;
void recur(int x, int l, int dg, int n) {
if (dg == 1) {
x = x * 10 + l;
if (x <= n)
cnt++;
return;
}
for (int i = 0; i < 10; i++) {
recur(x * 10 + i, l, dg - 1, n);
}
}
int count(int f, int l, int n) {
// int cnt=0;
cnt = 0;
if (f == l && f <= n)
cnt++;
int dg = log10(n);
dg++;
if (dg >= 2) {
for (int i = 2; i < dg; i++) {
cnt = cnt + pr[i - 2];
}
int v = n / pr[dg - 1];
v = v % 10;
if (f == v)
recur(f, l, dg - 1, n);
else if (f < v) {
cnt = cnt + pr[dg - 2];
}
}
return cnt;
}
void solve() {
int n;
cin >> n;
pr[0] = 1;
for (int i = 1; i <= 10; i++)
pr[i] = 10 * pr[i - 1];
int ans = 0;
for (int i = 1; i <= n; i++) {
int last = i % 10;
int z = log10(i);
int x = i / pr[z];
int first = x % 10;
if (last) {
int lst = first;
int fst = last;
ans = ans + count(fst, lst, n);
}
}
cout << ans << endl;
}
int32_t main() {
IOS;
int t;
t = 1;
// cin>>t;
while (t--) {
solve();
}
return 0;
}
| replace | 87 | 88 | 87 | 94 | TLE | |
p02792 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(v) (v).begin(), (v).end()
#define INF 2e9
typedef long long ll;
typedef pair<int, int> P;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll y) { return x * y / gcd(x, y); }
P f(int n) {
int a, b = n % 10;
while (n)
n / 10;
a = n;
return P(a, b);
}
int main() {
int n;
cin >> n;
map<P, int> freq;
REP2(i, 1, n + 1) {
P p = f(i);
freq[p]++;
}
ll ans = 0;
REP2(i, 1, 10) {
REP2(j, 1, 10) {
P p = make_pair(i, j), q = make_pair(j, i);
ans += freq[p] * freq[q];
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(v) (v).begin(), (v).end()
#define INF 2e9
typedef long long ll;
typedef pair<int, int> P;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll y) { return x * y / gcd(x, y); }
P f(int n) {
int a, b = n % 10;
while (n) {
a = n;
n /= 10;
}
return P(a, b);
}
int main() {
int n;
cin >> n;
map<P, int> freq;
REP2(i, 1, n + 1) {
P p = f(i);
freq[p]++;
}
ll ans = 0;
REP2(i, 1, 10) {
REP2(j, 1, 10) {
P p = make_pair(i, j), q = make_pair(j, i);
ans += freq[p] * freq[q];
}
}
cout << ans << endl;
return 0;
}
| replace | 14 | 17 | 14 | 18 | TLE | |
p02792 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
const long double EPS = 0.0000000001;
const long double PI = (acos(-1));
const ll MOD = 1e9 + 7;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
ll comb(ll n, ll r) {
ll ret = 1;
for (ll i = 0; i < r; i++)
ret = ret * (n - i);
for (ll i = 1; i <= r; i++)
ret /= i;
return ret;
}
int main() {
ll n, l, r;
cin >> n;
vector<vector<ll>> c(9, vector<ll>(9, 0));
ll ans = 0;
for (int i = 1; i <= n; i++) {
r = i % 10;
l = i;
while (l / 10 != 0) {
l /= 10;
}
c[l - 1][r - 1]++;
}
rep(i, 9) { rep(j, 9) ans += c[i][j] * c[j][i]; }
cout << ans;
} | #include <bits/stdc++.h>
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
static const ll MAX = 1000000000000000;
static const int NIL = -1;
using namespace std;
const long double EPS = 0.0000000001;
const long double PI = (acos(-1));
const ll MOD = 1e9 + 7;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
ll comb(ll n, ll r) {
ll ret = 1;
for (ll i = 0; i < r; i++)
ret = ret * (n - i);
for (ll i = 1; i <= r; i++)
ret /= i;
return ret;
}
int main() {
ll n, l, r;
cin >> n;
vector<vector<ll>> c(9, vector<ll>(9, 0));
ll ans = 0;
for (int i = 1; i <= n; i++) {
r = i % 10;
l = i;
while (l / 10 != 0) {
l /= 10;
}
if (l != 0 && r != 0)
c[l - 1][r - 1]++;
}
rep(i, 9) { rep(j, 9) ans += c[i][j] * c[j][i]; }
cout << ans;
} | replace | 35 | 36 | 35 | 37 | -6 | munmap_chunk(): invalid pointer
|
p02792 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> p(10, vector<int>(10, 0));
for (int i = 1; i <= 9; i++) {
for (int j = i; j <= 9; j++) {
for (int k = 1; k <= n; k++) {
ostringstream oss2;
oss2 << k;
string num = oss2.str();
int begin = int(num[0] - '0');
int end = int(num[num.size() - 1] - '0');
if (i == begin && j == end) {
p[i][j]++;
}
if (i != j && i == end && j == begin) {
p[j][i]++;
}
}
}
}
int ans = 0;
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++) {
ans += p[i][j] * p[j][i];
}
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<vector<int>> p(10, vector<int>(10, 0));
for (int k = 1; k <= n; k++) {
ostringstream oss2;
oss2 << k;
string num = oss2.str();
int begin = int(num[0] - '0');
int end = int(num[num.size() - 1] - '0');
p[begin][end]++;
}
int ans = 0;
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++) {
ans += p[i][j] * p[j][i];
}
}
cout << ans << endl;
return 0;
}
| replace | 10 | 26 | 10 | 18 | TLE | |
p02792 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
int mod = 1e9 + 7;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("INPUT.txt", "r", stdin);
freopen("OUTPUT.txt", "w", stdout);
#endif
// -------------------------------------Code starts
// here---------------------------------------------------------------------
int n;
cin >> n;
int zz[10][10] = {};
int cnt = 0;
for (int i = 0; i <= n; i++) {
string a = to_string(i);
zz[a[0] - '0'][a[a.length() - 1] - '0']++;
}
// for(int i=1;i<=9;i++)
// {
// if(i<=n)
// zz[i][i]++;
// }
// for(int i=1;i<=9;i++)
// {
// for(int j=1;j<=9;j++)
// {
// if(10*i+j<=n)
// zz[i][j]++;
// }
// }
// cout<<zz[1][1]<<'\n';
int ans = 0;
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++) {
ans += zz[i][j] * zz[j][i];
}
}
cout << ans;
// -------------------------------------Code ends
// here------------------------------------------------------------------
clock_t clk;
clk = clock();
clk = clock() - clk;
cerr << fixed << setprecision(6) << "Time: " << ((double)clk) / CLOCKS_PER_SEC
<< "\n";
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define int long long
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
int mod = 1e9 + 7;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// #ifndef ONLINE_JUDGE
// freopen ("INPUT.txt" , "r" , stdin);
// freopen ("OUTPUT.txt" , "w" , stdout);
// #endif
// -------------------------------------Code starts
// here---------------------------------------------------------------------
int n;
cin >> n;
int zz[10][10] = {};
int cnt = 0;
for (int i = 0; i <= n; i++) {
string a = to_string(i);
zz[a[0] - '0'][a[a.length() - 1] - '0']++;
}
// for(int i=1;i<=9;i++)
// {
// if(i<=n)
// zz[i][i]++;
// }
// for(int i=1;i<=9;i++)
// {
// for(int j=1;j<=9;j++)
// {
// if(10*i+j<=n)
// zz[i][j]++;
// }
// }
// cout<<zz[1][1]<<'\n';
int ans = 0;
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++) {
ans += zz[i][j] * zz[j][i];
}
}
cout << ans;
// -------------------------------------Code ends
// here------------------------------------------------------------------
clock_t clk;
clk = clock();
clk = clock() - clk;
cerr << fixed << setprecision(6) << "Time: " << ((double)clk) / CLOCKS_PER_SEC
<< "\n";
return 0;
} | replace | 14 | 18 | 14 | 18 | 0 | Time: 0.000003
|
p02792 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
// freopen("test.in","r",stdin);
// freopen("test.ok","w",stdout);
int64_t n, a = 0;
cin >> n;
for (int i = 1; i <= n; i++)
for (int j = 1; j <= n; j++) {
int64_t x = i, y = j, z = i, t = j;
while (x >= 10)
x = x / 10;
while (t >= 10)
t = t / 10;
if (x == (y % 10) && t == (z % 10))
a++;
}
cout << a;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
// freopen("test.in","r",stdin);
// freopen("test.ok","w",stdout);
int64_t n, a = 0;
cin >> n;
/*for (int i=1;i<=n;i++)
for (int j=1;j<=n;j++)
{
int64_t x=i,y=j,
z=i,
t=j;
while (x>=10)
x=x/10;
while (t>=10)
t=t/10;
if (x==(y%10)&&t==(z%10)) a++;
}*/
int64_t s[20][20];
memset(s, 0, sizeof(s));
for (int i = 1; i <= n; i++) {
int x = i;
while (x >= 10)
x = x / 10;
s[x][i % 10]++;
}
for (int i = 1; i <= 9; i++)
for (int j = 1; j <= 9; j++)
a = a + s[i][j] * s[j][i];
cout << a;
} | replace | 8 | 18 | 8 | 31 | TLE | |
p02792 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
ll modpow(ll a, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
ll comb(ll a, ll b) {
ll ans = 1;
for (ll i = a; i > a - b; i--) {
ans = ans * i % mod;
}
for (ll i = 1; i <= b; i++) {
ans = (ans * modpow(i, mod - 2)) % mod;
}
return ans;
}
int main() {
int N;
cin >> N;
ll res = 0;
vector<vector<ll>> num(10, vector<ll>(10, 0));
for (int i = 0; i <= N; i++) {
vector<int> d;
int nn = i;
while (nn) {
d.push_back(nn % 10);
nn /= 10;
}
int a = d[0];
int b = d.back();
if (!a || !b)
continue;
++num[a][b];
}
for (int a = 1; a < 10; a++) {
for (int b = 1; b < 10; b++) {
res += num[a][b] * num[b][a];
}
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
ll modpow(ll a, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
ll comb(ll a, ll b) {
ll ans = 1;
for (ll i = a; i > a - b; i--) {
ans = ans * i % mod;
}
for (ll i = 1; i <= b; i++) {
ans = (ans * modpow(i, mod - 2)) % mod;
}
return ans;
}
int main() {
int N;
cin >> N;
ll res = 0;
vector<vector<ll>> num(10, vector<ll>(10, 0));
for (int i = 1; i <= N; i++) {
vector<int> d;
int nn = i;
while (nn) {
d.push_back(nn % 10);
nn /= 10;
}
int a = d[0];
int b = d.back();
if (!a || !b)
continue;
++num[a][b];
}
for (int a = 1; a < 10; a++) {
for (int b = 1; b < 10; b++) {
res += num[a][b] * num[b][a];
}
}
cout << res << endl;
return 0;
} | replace | 33 | 34 | 33 | 34 | -11 | |
p02792 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
ll modpow(ll a, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
ll comb(ll a, ll b) {
ll ans = 1;
for (ll i = a; i > a - b; i--) {
ans = ans * i % mod;
}
for (ll i = 1; i <= b; i++) {
ans = (ans * modpow(i, mod - 2)) % mod;
}
return ans;
}
int main() {
ll N;
cin >> N;
ll num[N][N];
for (ll i = 1; i <= N; i++) {
string str = to_string(i);
int size = str.size();
const char *cstr = str.c_str();
string f(cstr, 0, 1);
string e(cstr, size - 1, 1);
int a = stoi(f);
int b = stoi(e);
num[a][b] += 1;
}
ll ans = 0;
for (int i = 1; i <= N; i++) {
string str = to_string(i);
int size = str.size();
const char *cstr = str.c_str();
string f(cstr, 0, 1);
string e(cstr, size - 1, 1);
int a = stoi(f);
int b = stoi(e);
ans += num[b][a];
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
ll modpow(ll a, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
ll comb(ll a, ll b) {
ll ans = 1;
for (ll i = a; i > a - b; i--) {
ans = ans * i % mod;
}
for (ll i = 1; i <= b; i++) {
ans = (ans * modpow(i, mod - 2)) % mod;
}
return ans;
}
int main() {
ll N;
cin >> N;
ll num[10][10];
for (int i = 0; i < 10; i++) {
for (int j = 0; j < 10; j++) {
num[i][j] = 0;
}
}
for (ll i = 1; i <= N; i++) {
string str = to_string(i);
int size = str.size();
const char *cstr = str.c_str();
string f(cstr, 0, 1);
string e(cstr, size - 1, 1);
int a = stoi(f);
int b = stoi(e);
num[a][b] += 1;
}
ll ans = 0;
for (int i = 1; i <= N; i++) {
string str = to_string(i);
int size = str.size();
const char *cstr = str.c_str();
string f(cstr, 0, 1);
string e(cstr, size - 1, 1);
int a = stoi(f);
int b = stoi(e);
ans += num[b][a];
}
cout << ans << endl;
return 0;
} | replace | 31 | 32 | 31 | 37 | 0 | |
p02792 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pi 3.14159265359
#define int long long
#define pii pair<int, int>
const int mod = 1e9 + 7;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "rt", stdin);
freopen("output.txt", "wt", stdout);
#endif
map<pii, int> mp;
int n;
cin >> n;
int ans = 0;
for (int i = 1; i <= n; i++) {
int k1 = i % 10;
int k2 = i;
int j = i;
while (j >= 10) {
j /= 10;
}
k2 = j;
mp[{k2, k1}]++;
}
map<pii, int> z = mp;
for (auto i : mp) {
int x = i.first.first;
int y = i.first.second;
ans += z[{x, y}] * z[{y, x}];
}
cout << ans << "\n";
}
| #include <bits/stdc++.h>
using namespace std;
#define pi 3.14159265359
#define int long long
#define pii pair<int, int>
const int mod = 1e9 + 7;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
map<pii, int> mp;
int n;
cin >> n;
int ans = 0;
for (int i = 1; i <= n; i++) {
int k1 = i % 10;
int k2 = i;
int j = i;
while (j >= 10) {
j /= 10;
}
k2 = j;
mp[{k2, k1}]++;
}
map<pii, int> z = mp;
for (auto i : mp) {
int x = i.first.first;
int y = i.first.second;
ans += z[{x, y}] * z[{y, x}];
}
cout << ans << "\n";
}
| delete | 14 | 19 | 14 | 14 | 0 | |
p02792 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
using P = pair<int, int>;
P f(int x) {
int fst;
string s = to_string(x);
fst = s[0] - '0';
int last = x % 10;
return P(fst, last);
}
int main() {
int n;
cin >> n;
int si = to_string(n).size();
if (si == 1) {
cout << n << endl;
} else {
map<P, int> num;
for (int i = 1; i <= n; i++) {
P p = f(i);
num.at(p)++;
}
int ans = 0;
for (int i = 1; i <= n; i++) {
P p = f(i);
P q(p.second, p.first);
ans += num[q];
}
cout << ans << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (n); i++)
using P = pair<int, int>;
P f(int x) {
int fst;
string s = to_string(x);
fst = s[0] - '0';
int last = x % 10;
return P(fst, last);
}
int main() {
int n;
cin >> n;
int si = to_string(n).size();
if (si == 1) {
cout << n << endl;
} else {
map<P, int> num;
for (int i = 1; i <= n; i++) {
P p = f(i);
num[p]++;
}
int ans = 0;
for (int i = 1; i <= n; i++) {
P p = f(i);
P q(p.second, p.first);
ans += num[q];
}
cout << ans << endl;
}
} | replace | 22 | 23 | 22 | 23 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): map::at
|
p02792 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
long long n, fl[10][10], ans = 0;
cin >> n;
for (int i = 0; i < 10; i++)
for (int j = 0; j < 10; j++)
fl[i][j] = 0;
for (int i = 1; i <= n; i++) {
int x = i;
while (x > 10)
x /= 10;
fl[x][i % 10]++;
}
for (int i = 0; i < 10; i++)
for (int j = 0; j < 10; j++)
ans += fl[i][j] * fl[j][i];
cout << ans << endl;
}
| #include <iostream>
using namespace std;
int main() {
long long n, fl[10][10], ans = 0;
cin >> n;
for (int i = 0; i < 10; i++)
for (int j = 0; j < 10; j++)
fl[i][j] = 0;
for (int i = 1; i <= n; i++) {
int x = i;
while (x >= 10)
x /= 10;
fl[x][i % 10]++;
}
for (int i = 0; i < 10; i++)
for (int j = 0; j < 10; j++)
ans += fl[i][j] * fl[j][i];
cout << ans << endl;
}
| replace | 10 | 11 | 10 | 11 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.