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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03096 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vect... | #include <algorithm>
#include <array>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vect... | replace | 30 | 31 | 30 | 31 | 0 | |
p03096 | 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, x, n) for (int i = x; i < n; i++)
#define rep3(i, n) for (int i = n - 1; i >= 0; i--)
#define rep4(i, x, n) for (int i = x; i > n; i--)
#define elif else if
typedef long long ll;
typedef pair<ll, ll> P;
const ll ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, x, n) for (int i = x; i < n; i++)
#define rep3(i, n) for (int i = n - 1; i >= 0; i--)
#define rep4(i, x, n) for (int i = x; i > n; i--)
#define elif else if
typedef long long ll;
typedef pair<ll, ll> P;
const ll ... | replace | 35 | 43 | 35 | 38 | TLE | |
p03096 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define... | replace | 29 | 30 | 29 | 30 | 0 | |
p03096 | C++ | Runtime Error | /*やったぜ。 投稿者：変態糞土方 (8月16日（水）07時14分22秒)
昨日の8月15日にいつもの浮浪者のおっさん（60歳）と先日メールくれた汚れ好きの土方のにいちゃん
（45歳）とわし（53歳）の3人で県北にある川の土手の下で盛りあったぜ。
今日は明日が休みなんでコンビニで酒とつまみを買ってから滅多に人が来ない所なんで、
そこでしこたま酒を飲んでからやりはじめたんや。
3人でちんぽ舐めあいながら地下足袋だけになり持って来たいちぢく浣腸を3本ずつ入れあった。
しばらくしたら、けつの穴がひくひくして来るし、糞が出口を求めて腹の中でぐるぐるしている。
浮浪者のおっさんにけつの穴をなめさせながら、兄ちゃんのけつの穴を舐め... | /*やったぜ。 投稿者：変態糞土方 (8月16日（水）07時14分22秒)
昨日の8月15日にいつもの浮浪者のおっさん（60歳）と先日メールくれた汚れ好きの土方のにいちゃん
（45歳）とわし（53歳）の3人で県北にある川の土手の下で盛りあったぜ。
今日は明日が休みなんでコンビニで酒とつまみを買ってから滅多に人が来ない所なんで、
そこでしこたま酒を飲んでからやりはじめたんや。
3人でちんぽ舐めあいながら地下足袋だけになり持って来たいちぢく浣腸を3本ずつ入れあった。
しばらくしたら、けつの穴がひくひくして来るし、糞が出口を求めて腹の中でぐるぐるしている。
浮浪者のおっさんにけつの穴をなめさせながら、兄ちゃんのけつの穴を舐め... | replace | 74 | 75 | 74 | 75 | 0 | |
p03096 | C++ | Runtime Error | /*----------------by syr----------------*/
/*
iii ii
rBQBBBBBBE BBR iBBBBQBBL XBBBBBBQBBBBB
iBBQJ 7BBB BBsSBBr BBQ i cBBB
rBBU iBBw BBBQi HBBi KBBi
BBH BB5 iBBB isL wBB5
GBB iBBi 6BB ... | /*----------------by syr----------------*/
/*
iii ii
rBQBBBBBBE BBR iBBBBQBBL XBBBBBBQBBBBB
iBBQJ 7BBB BBsSBBr BBQ i cBBB
rBBU iBBw BBBQi HBBi KBBi
BBH BB5 iBBB isL wBB5
GBB iBBi 6BB ... | replace | 54 | 55 | 54 | 55 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll, ll>
#define FOR(I, A, B) for (ll I = int(A); I < int(B); ++I)
#define FORR(I, A, B) for (ll I = int((B)-1); I >= int(A); --I)
#define TO(x, t, f) ((x) ? (t) : (f))
#define SORT(x) (sort(x.begin(), x.end())) // 0 2 2 3 4 5 8 9
#define... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define P pair<ll, ll>
#define FOR(I, A, B) for (ll I = int(A); I < int(B); ++I)
#define FORR(I, A, B) for (ll I = int((B)-1); I >= int(A); --I)
#define TO(x, t, f) ((x) ? (t) : (f))
#define SORT(x) (sort(x.begin(), x.end())) // 0 2 2 3 4 5 8 9
#define... | insert | 35 | 35 | 35 | 39 | 0 | |
p03096 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
const int MOD = 1000000007;
int dp[100010];
vector<int> before(100010, -1); // ある色の直前の位置
int main() {
int n;
cin >> n;
vector<int> lc(n);
for (int i = 0; i < n; ++i) {
cin >> lc[i];
}
dp[0] = 1;
for (int i = 0; i < n; ++i) {
int c = lc[i... | #include <iostream>
#include <vector>
using namespace std;
const int MOD = 1000000007;
int dp[200010];
vector<int> before(200010, -1); // ある色の直前の位置
int main() {
int n;
cin >> n;
vector<int> lc(n);
for (int i = 0; i < n; ++i) {
cin >> lc[i];
}
dp[0] = 1;
for (int i = 0; i < n; ++i) {
int c = lc[i... | replace | 5 | 7 | 5 | 7 | 0 | |
p03096 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
int main() {
ios_base::sync_with_stdio(0);
int n;
cin >> n;
vector<int> a;
for (int i = 0; i < n; ++i) {
int c;
cin >> c;
--c;
if (a.size() == 0)
a.push_back(c);
else if (a... | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
int main() {
ios_base::sync_with_stdio(0);
int n;
cin >> n;
vector<int> a;
for (int i = 0; i < n; ++i) {
int c;
cin >> c;
--c;
if (a.size() == 0)
a.push_back(c);
else if (a... | replace | 25 | 26 | 25 | 26 | 0 | |
p03096 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for (int(i)... | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for (int(i)... | replace | 103 | 104 | 103 | 104 | 0 | |
p03096 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
using namespace std;
const int mod = 1e9 + 7;
int n, c[100010], lst[100010], f[100010];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &c[i]);
f[0] = 1;
for (int i = 1; i <= n; ++i) {
f[i] = f[i - 1];
if (lst[c[i]] && lst[c[i]] != i ... | #include <cstdio>
#include <iostream>
using namespace std;
const int mod = 1e9 + 7;
int n, c[200010], lst[200010], f[200010];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &c[i]);
f[0] = 1;
for (int i = 1; i <= n; ++i) {
f[i] = f[i - 1];
if (lst[c[i]] && lst[c[i]] != i ... | replace | 7 | 8 | 7 | 8 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int md = 1e9 + 7;
inline void add(int &a, int b) {
a += b;
if (a >= md)
a -= md;
}
int main() {
int n;
cin >> n;
vector<int> c(n + 1);
c[0] = -1;
for (int i = 1; i <= n; i++) {
cin >> c[i];
c[i]--;
}
vector<int> dp(n + 1, 0), ep(n, 0);
... | #include <bits/stdc++.h>
using namespace std;
const int md = 1e9 + 7;
inline void add(int &a, int b) {
a += b;
if (a >= md)
a -= md;
}
int main() {
int n;
cin >> n;
vector<int> c(n + 1);
c[0] = -1;
for (int i = 1; i <= n; i++) {
cin >> c[i];
c[i]--;
}
vector<int> dp(n + 1, 0), ep(2e5, 0);
... | replace | 17 | 18 | 17 | 18 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF = 1e9 + 7;
const ll LINF = 1LL << 60;
const ll MOD = 1e9 + 7;
const ld PI = acos(-1);
const ld EPS = 1e-9; // 微調整用（EPSより小さいと0と判定など）
#define gcd __gcd // llは受け取っ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF = 1e9 + 7;
const ll LINF = 1LL << 60;
const ll MOD = 1e9 + 7;
const ld PI = acos(-1);
const ld EPS = 1e-9; // 微調整用（EPSより小さいと0と判定など）
#define gcd __gcd // llは受け取っ... | replace | 50 | 51 | 50 | 51 | 0 | |
p03096 | C++ | Runtime Error | /* -*- coding: utf-8 -*-
*
* b.cc: B: Reversi
*/
#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 <st... | /* -*- coding: utf-8 -*-
*
* b.cc: B: Reversi
*/
#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 <st... | replace | 28 | 30 | 28 | 30 | 0 | |
p03096 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
/////////////////// TYPES & MACROS ///////////////////////////////
#define mp make_pair
#define eb emplace_back
#define pb push_back
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
#define vv vector
#define exist(s, e) (s.find(e) != s.end())
#define sz(... | #include "bits/stdc++.h"
using namespace std;
/////////////////// TYPES & MACROS ///////////////////////////////
#define mp make_pair
#define eb emplace_back
#define pb push_back
#define all(x) x.begin(), x.end()
#define ff first
#define ss second
#define vv vector
#define exist(s, e) (s.find(e) != s.end())
#define sz(... | replace | 66 | 67 | 66 | 67 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007LL;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
int c[n];
for (int i = 0; i < n; ++i) {
cin >> c[i];
}
long long ans[n], memo[100005] = {};
ans[0] = 1LL;
memo[c[0]] = 1LL;
for (int i = 1; i < n; ++i) {
... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007LL;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
int c[n];
for (int i = 0; i < n; ++i) {
cin >> c[i];
}
long long ans[n + 5], memo[200005] = {};
ans[0] = 1LL;
memo[c[0]] = 1LL;
for (int i = 1; i < n; ++i) ... | replace | 12 | 13 | 12 | 13 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> C;
for (int i = 0; i < N; i++) {
int c;
cin >> c;
if (i == 0) {
C.emplace_back(c);
} else if (C.back() != c) {
C.emplace_back(c);
}
}
vec... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
typedef long long ll;
int main() {
ll N;
cin >> N;
vector<ll> C;
for (int i = 0; i < N; i++) {
int c;
cin >> c;
if (i == 0) {
C.emplace_back(c);
} else if (C.back() != c) {
C.emplace_back(c);
}
}
vec... | replace | 19 | 20 | 19 | 20 | 0 | |
p03096 | C++ | Runtime Error | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
... | replace | 79 | 80 | 79 | 80 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = long long;
using std::cin;
using std::cout;
using std::endl;
int main() {
int n;
scanf("%d", &n);
std::vector<int> c(n);
for (int i = 0; i < n; i++) {
scanf("%d", &c[i]);
c[i]--;
}
const int M = 2e5 + 10;
std::... | #include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = long long;
using std::cin;
using std::cout;
using std::endl;
int main() {
int n;
scanf("%d", &n);
std::vector<int> c(n);
for (int i = 0; i < n; i++) {
scanf("%d", &c[i]);
c[i]--;
}
const int M = 2e5 + 10;
std::... | replace | 18 | 20 | 18 | 20 | 0 | |
p03096 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int N;
int mod = 1e9 + 7;
int main() {
cin >> N;
vector<long long> dp(N + 1, 1);
vector<int> p(N + 1, -1); // p[i]: 最後の色iの位置
int c;
cin >> c;
p[c] = 1;
dp[0] = 1;
for (int i = 1; i < N; i++) {
cin >> c;
dp[i] = dp[i - 1];
if (p[c] ... | #include <iostream>
#include <vector>
using namespace std;
int N;
int mod = 1e9 + 7;
int main() {
cin >> N;
vector<long long> dp(N + 1, 1);
vector<int> p(2e5 + 1, -1); // p[i]: 最後の色iの位置
int c;
cin >> c;
p[c] = 1;
dp[0] = 1;
for (int i = 1; i < N; i++) {
cin >> c;
dp[i] = dp[i - 1];
if (p[c... | replace | 10 | 11 | 10 | 11 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <stdio.h>
#define FOR(i, n) for (lli i = 0; i < (lli)(n); ++i)
#define FORU(i, j, k) for (lli i = (j); i <= (lli)(k); ++i)
#define FORD(i, j, k) for (lli i = (j); i >= (lli)(k); --i)
#define SQ(x) ((x) * (x))
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define... | #include <bits/stdc++.h>
#include <stdio.h>
#define FOR(i, n) for (lli i = 0; i < (lli)(n); ++i)
#define FORU(i, j, k) for (lli i = (j); i <= (lli)(k); ++i)
#define FORD(i, j, k) for (lli i = (j); i >= (lli)(k); --i)
#define SQ(x) ((x) * (x))
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define... | replace | 222 | 224 | 222 | 224 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
#define M 100005
using namespace std;
const int mod = 1e9 + 7;
int n, c[M];
int dp[M], val[M];
void Add(int &x, int y) {
x += y;
if (x >= mod)
x -= mod;
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &c[i]);
dp[0] = 1;
c[0] = -1;
for (int i = 1; i... | #include <bits/stdc++.h>
#define M 200005
using namespace std;
const int mod = 1e9 + 7;
int n, c[M];
int dp[M], val[M];
void Add(int &x, int y) {
x += y;
if (x >= mod)
x -= mod;
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &c[i]);
dp[0] = 1;
c[0] = -1;
for (int i = 1; i... | replace | 1 | 2 | 1 | 2 | 0 | |
p03096 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#define x first
#define y second
#define bug(x) cerr << #x << '=' << x << ' '
#define debug(x) cerr << #x << '=' << x << '\n'
#define FOR(a, b, c) for (int a = (b), a##_end = (c); a <= a##_end; ++a)
#define ROF(a, b, c) for (int a = (b), a##_... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#define x first
#define y second
#define bug(x) cerr << #x << '=' << x << ' '
#define debug(x) cerr << #x << '=' << x << '\n'
#define FOR(a, b, c) for (int a = (b), a##_end = (c); a <= a##_end; ++a)
#define ROF(a, b, c) for (int a = (b), a##_... | replace | 13 | 14 | 13 | 14 | 0 | |
p03096 | C++ | Runtime Error | // 高知能系Vtuberの高井茅乃です。
// Twitter: https://twitter.com/takaichino
// YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INTINF 1999999999
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP1(i, n) for (int i = 1; i <= n; i... | // 高知能系Vtuberの高井茅乃です。
// Twitter: https://twitter.com/takaichino
// YouTube: https://www.youtube.com/channel/UCTOxnI3eOI_o1HRgzq-LEZw
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INTINF 1999999999
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP1(i, n) for (int i = 1; i <= n; i... | replace | 78 | 80 | 78 | 80 | 0 | |
p03096 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
constexpr ll MOD = 1e9 + 7;
vector<ll> pos[200001];
ll N;
vector<ll> C;
vector<ll> memo;
ll solve(ll left) {
if (left >= N) {
return 1;
}
if (memo[left] != -1) {
return memo[left];
}
ll next = *upper_bound(pos[C[left]].begin(), pos[... | #include "bits/stdc++.h"
using namespace std;
using ll = int64_t;
constexpr ll MOD = 1e9 + 7;
vector<ll> pos[200001];
ll N;
vector<ll> C;
vector<ll> memo;
ll solve(ll left) {
if (left >= N) {
return 1;
}
if (memo[left] != -1) {
return memo[left];
}
ll next = *upper_bound(pos[C[left]].begin(), pos[... | replace | 31 | 32 | 31 | 32 | TLE | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define endl '\n'
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0... | #include <bits/stdc++.h>
#define int long long
#define endl '\n'
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0... | replace | 55 | 56 | 55 | 56 | 0 | |
p03096 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long int LL;
typedef pair<int, int> P;
typedef pair<int, pair<int, int>> PP;
typedef pair<LL, int> LP;
con... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
typedef long long int LL;
typedef pair<int, int> P;
typedef pair<int, pair<int, int>> PP;
typedef pair<LL, int> LP;
con... | replace | 28 | 29 | 28 | 29 | 0 | |
p03096 | C++ | Runtime Error | #include <iostream>
#include <vector>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> arr;
int pre = 0;
for (int i = 0; i < n; i++) {
int c;
cin >> c;
if (pre != c) {
arr.push_back(c);
pre = c;
}
}
n = arr.size();
... | #include <iostream>
#include <vector>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> arr;
int pre = 0;
for (int i = 0; i < n; i++) {
int c;
cin >> c;
if (pre != c) {
arr.push_back(c);
pre = c;
}
}
n = arr.size();
... | replace | 21 | 22 | 21 | 22 | 0 | |
p03096 | C++ | Runtime Error | #include <iostream>
#include <stdio.h>
// #include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
... | #include <iostream>
#include <stdio.h>
// #include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
... | replace | 42 | 43 | 42 | 43 | 0 | |
p03096 | C++ | Runtime Error | #pragma region
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
// #... | #pragma region
#define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
// #... | replace | 27 | 28 | 27 | 28 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long md = 1e9 + 7;
int N;
cin >> N;
int bef = -1;
vector<int> C;
for (int i = 0; i < N; i++) {
int c;
cin >> c;
if (c != bef)
C.push_back(c);
bef = c;
}
int Clen = C.size();
vector<long long> dp(Clen, 0);
dp[0]++;... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long md = 1e9 + 7;
int N;
cin >> N;
int bef = -1;
vector<int> C;
for (int i = 0; i < N; i++) {
int c;
cin >> c;
if (c != bef)
C.push_back(c);
bef = c;
}
int Clen = C.size();
vector<long long> dp(Clen, 0);
dp[0]++;... | replace | 19 | 20 | 19 | 20 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll mod = 1000000007;
const ll INF = 1001001001;
const ll LINF = 1001001001001001001;
ll n;
vector<ll> c(0);
vector<ll> mem;
vector<vector<ll>> place(20... | #include <bits/stdc++.h>
#include <math.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const ll mod = 1000000007;
const ll INF = 1001001001;
const ll LINF = 1001001001001001001;
ll n;
vector<ll> c(0);
vector<ll> mem;
vector<vector<ll>> place(20... | replace | 12 | 13 | 12 | 13 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod = 1e9 + 7;
const int maxn = 5e5 + 7;
int sum[maxn];
stack<int> sta;
std::vector<int> v;
int a[maxn];
int pre[maxn], pos[maxn];
ll dp[maxn];
int main() {
int n;
cin >> n;
for (int i = 0; i < n * 10; i++)
pre[i] = 0;
for (int... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod = 1e9 + 7;
const int maxn = 5e5 + 7;
int sum[maxn];
stack<int> sta;
std::vector<int> v;
int a[maxn];
int pre[maxn], pos[maxn];
ll dp[maxn];
int main() {
int n;
cin >> n;
for (int i = 0; i < n * 2; i++)
pre[i] = 0;
for (int ... | replace | 19 | 20 | 19 | 20 | 0 | |
p03096 | C++ | Runtime Error | #include <iostream>
#include <map>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#define MOD 1000000007
#define N_MAX 100005
using namespace std;
typedef long long ll;
int main() {
int N;
int C[N_MAX];
ll dp[N_MAX];
int m[N_MAX];
C[0] = 200005;
cin >> N;
for (int i = 1; i <=... | #include <iostream>
#include <map>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#define MOD 1000000007
#define N_MAX 200006
using namespace std;
typedef long long ll;
int main() {
int N;
int C[N_MAX];
ll dp[N_MAX];
int m[N_MAX];
C[0] = 200005;
cin >> N;
for (int i = 1; i <=... | replace | 7 | 8 | 7 | 8 | 0 | |
p03096 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using vll = vector<ll>;
using pl4 = pair<ll, ll>;
using str = string;
using vpl4 = vector<pair<ll, ll>>;
#define sz size()
#define be begin()
#define en end()
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define llin... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using vll = vector<ll>;
using pl4 = pair<ll, ll>;
using str = string;
using vpl4 = vector<pair<ll, ll>>;
#define sz size()
#define be begin()
#define en end()
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define llin... | replace | 56 | 57 | 56 | 57 | 0 | |
p03096 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
using namespace std;
const int N = 1e5 + 10;
typedef long long ll;
const ll mod = 1e9 + 7;
ll coldp[N];
ll dp[N];
int c[N];
int n;
int main() {
dp[0] = 1;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &c[i]);
for (int i = 1; i <= n; i++) {
dp[i] = dp[i ... | #include <algorithm>
#include <cstdio>
using namespace std;
const int N = 2 * 1e5 + 10;
typedef long long ll;
const ll mod = 1e9 + 7;
ll coldp[N];
ll dp[N];
int c[N];
int n;
int main() {
dp[0] = 1;
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &c[i]);
for (int i = 1; i <= n; i++) {
dp[i] = d... | replace | 3 | 4 | 3 | 4 | 0 | |
p03096 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> C(N + 1);
vector<int> latest(N + 1, -1);
vector<int> DP(N + 1, 0);
for (int i = 1; i <= N; i++) {
cin >> C[i];
}
DP[0] = 1;
for (int i = 1; i <= N; i++) {
if (latest[C[i]] >= 0 && latest[C[... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> C(N + 1);
vector<int> latest(200002, -1);
vector<unsigned int> DP(N + 1, 0);
for (int i = 1; i <= N; i++) {
cin >> C[i];
}
DP[0] = 1;
for (int i = 1; i <= N; i++) {
if (latest[C[i]] >= 0 &&... | replace | 10 | 12 | 10 | 12 | 0 | |
p03096 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
const int mo = 1e9 + 7;
cons... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
const int mo = 1e9 + 7;
cons... | replace | 42 | 52 | 42 | 46 | TLE | |
p03096 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#define FOR(i, x, y) for (int i = (x), i##END = (y); i <= i##END; ++i)
#define DOR(i, x, y) for (int i = (x), i##END = (y); i >= i##END; --i)
template <typename T, typename _T> inline bool chk_min(T &x, con... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#define FOR(i, x, y) for (int i = (x), i##END = (y); i <= i##END; ++i)
#define DOR(i, x, y) for (int i = (x), i##END = (y); i >= i##END; --i)
template <typename T, typename _T> inline bool chk_min(T &x, con... | replace | 15 | 16 | 15 | 16 | 0 | |
p03096 | C++ | Runtime Error | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <vector>
#define N 100005
#define mod 1000000007ll
using namespace std;
typedef long long ll;
inline int rd() {
int x = 0;
char c = getchar();
while (!isdigit(c))
c = g... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <vector>
#define N 200005
#define mod 1000000007ll
using namespace std;
typedef long long ll;
inline int rd() {
int x = 0;
char c = getchar();
while (!isdigit(c))
c = g... | replace | 8 | 9 | 8 | 9 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fo(i, a, b) for (int i = a; i <= b; ++i)
#define fod(i, a, b) for (int i = a; i >= b; --i)
#define N 100005
#define LL long long
#define mo 1000000007
using namespace std;
LL f[N];
int lst[N], a[N], n;
int main() {
cin >> n;
fo(i, 1, n) scanf("%d", &a[i]);
f[0] = 1;
fo(i, 1, n) ... | #include <bits/stdc++.h>
#define fo(i, a, b) for (int i = a; i <= b; ++i)
#define fod(i, a, b) for (int i = a; i >= b; --i)
#define N 300005
#define LL long long
#define mo 1000000007
using namespace std;
LL f[N];
int lst[N], a[N], n;
int main() {
cin >> n;
fo(i, 1, n) scanf("%d", &a[i]);
f[0] = 1;
fo(i, 1, n) ... | replace | 3 | 4 | 3 | 4 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, st, ed) for (register int i = st, i##end = ed; i <= i##end; ++i)
#define DREP(i, st, ed) for (register int i = st, i##end = ed; i >= i##end; --i)
template <typename T> inline bool chkmin(T &x, T y) {
return (y < x) ? (x = y, 1) : 0;
}
template <typename T> ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, st, ed) for (register int i = st, i##end = ed; i <= i##end; ++i)
#define DREP(i, st, ed) for (register int i = st, i##end = ed; i >= i##end; --i)
template <typename T> inline bool chkmin(T &x, T y) {
return (y < x) ? (x = y, 1) : 0;
}
template <typename T> ... | replace | 37 | 38 | 37 | 38 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define sz(x) int(x.size())
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.b... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define sz(x) int(x.size())
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.b... | replace | 42 | 43 | 42 | 43 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define PI 3.141592653589793
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, a, n) for (int i = a; i < (n); i++)
#define rrep(i, n, k) \
for (int i = (n); i >= (k); i--) ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define PI 3.141592653589793
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, a, n) for (int i = a; i < (n); i++)
#define rrep(i, n, k) \
for (int i = (n); i >= (k); i--) ... | replace | 110 | 111 | 110 | 111 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
const i64 MOD = 1e9 + 7;
const i64 INF = 1e18 + 7;
// pythonのrangeのような範囲for文用のclass for(const auto& i : Range<>(10))
// のように書く
template <typename T = i64> struct Range {
struct iterator {
T value;
const T step, last;
const T &operator... | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
const i64 MOD = 1e9 + 7;
const i64 INF = 1e18 + 7;
// pythonのrangeのような範囲for文用のclass for(const auto& i : Range<>(10))
// のように書く
template <typename T = i64> struct Range {
struct iterator {
T value;
const T step, last;
const T &operator... | replace | 191 | 192 | 191 | 192 | 0 | |
p03096 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define LL long long
#define clr(x, y) memset(x, y, sizeof(x))
#define FOR(x, l, r) for (int x = l, x##_ = r; x <= x##_; x++)
#define FR(x, l, r) for (int x = l, x##_ = r; x < x##_; x++)
#define DOR(x, r, l) for (int x = r, x##_ = l; x >= x##_; x--)
using namespace std;
const int N = 200005;
co... | #include <bits/stdc++.h>
#define LL long long
#define clr(x, y) memset(x, y, sizeof(x))
#define FOR(x, l, r) for (int x = l, x##_ = r; x <= x##_; x++)
#define FR(x, l, r) for (int x = l, x##_ = r; x < x##_; x++)
#define DOR(x, r, l) for (int x = r, x##_ = l; x >= x##_; x--)
using namespace std;
const int N = 200005;
co... | replace | 15 | 16 | 15 | 17 | TLE | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
int main() {
ll n;
cin >> n;
vector<ll> c(1);
cin >> c[0];
for (ll i = 1; i < n; ++i) {
ll ci;
cin >> ci;
if (c.back() != ci)
c.push_back(ci);
}
map<ll, ll> m;
m.insert({c[0], 1});
vector<l... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
int main() {
ll n;
cin >> n;
vector<ll> c(1);
cin >> c[0];
for (ll i = 1; i < n; ++i) {
ll ci;
cin >> ci;
if (c.back() != ci)
c.push_back(ci);
}
n = c.size();
map<ll, ll> m;
m.insert({c[0],... | insert | 17 | 17 | 17 | 18 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
const int mod = 1000000007;
int n, patterns = 1, prev = 0;
cin >> n;
vector<int> p(n + 1);
for (int i = 0; i < n; i++) {
int c, w;
cin >> c;
if (c == prev)
continue;
w = (patterns + p.at(c)) % mod;
patterns = w;
p.at(c) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
const int mod = 1000000007;
int n, patterns = 1, prev = 0;
cin >> n;
vector<int> p(200001);
for (int i = 0; i < n; i++) {
int c, w;
cin >> c;
if (c == prev)
continue;
w = (patterns + p.at(c)) % mod;
patterns = w;
p.at(c)... | replace | 7 | 8 | 7 | 8 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
/*
struct Edge
{
int to;
int weight;
Edge(int t, int w) : to(t), weight(w) {}
};
using Graph = vector<vector<Edge>>;
*/
using Graph = vector<vector... | #include <bits/stdc++.h>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
/*
struct Edge
{
int to;
int weight;
Edge(int t, int w) : to(t), weight(w) {}
};
using Graph = vector<vector<Edge>>;
*/
using Graph = vector<vector... | replace | 93 | 95 | 93 | 95 | 0 | |
p03096 | C++ | Runtime Error | #include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> C(N, 0);
for (int i... | #include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> C(N, 0);
for (int i... | replace | 26 | 27 | 26 | 27 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, N) for (int i = 0; i < (int)N; i++)
#define FOR(i, a, b) for (int i = a; i < (int)b; i++)
#define ALL(x) (x).begin(), (x).end()
#define INF (1 << 30)
#define LLINF (1LL << 62)
#define DEBUG(...) debug(__LINE__, ":" __VA_ARGS__)
constexpr int MOD = 10000000... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, N) for (int i = 0; i < (int)N; i++)
#define FOR(i, a, b) for (int i = a; i < (int)b; i++)
#define ALL(x) (x).begin(), (x).end()
#define INF (1 << 30)
#define LLINF (1LL << 62)
#define DEBUG(...) debug(__LINE__, ":" __VA_ARGS__)
constexpr int MOD = 10000000... | replace | 133 | 134 | 133 | 134 | 0 | |
p03096 | C++ | Runtime Error | #include <stdint.h>
#include <stdlib.h>
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
using default_counter_t = int64_t;
// macro
#define let auto const &
#define overload4(a, b, c, d, name, ...) name
#define rep1(n) ... | #include <stdint.h>
#include <stdlib.h>
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
using default_counter_t = int64_t;
// macro
#define let auto const &
#define overload4(a, b, c, d, name, ...) name
#define rep1(n) ... | replace | 141 | 142 | 141 | 142 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> C(N);
for (int i = 0; i < N; ++i)
cin >> C[i];
C.erase(unique(begin(C), end(C)), end(C));
const long long MOD = 1000000007;
vector<long long> sum(N + 1);
sum[C[0]] = 1;
for (int i = 1; i < C.size(); ++i) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> C(N);
for (int i = 0; i < N; ++i)
cin >> C[i];
C.erase(unique(begin(C), end(C)), end(C));
const long long MOD = 1000000007;
long long sum[200001] = {};
sum[C[0]] = 1;
for (int i = 1; i < C.size(); ++i) {
... | replace | 12 | 13 | 12 | 13 | 0 | |
p03096 | C++ | Runtime Error | #include <cstdio>
#include <cstring>
using namespace std;
using ll = long long;
const static int MOD = 1000000007;
int main() {
int N;
scanf("%d", &N);
int C[N];
scanf("%d", C);
int id = 0;
for (int i = 0; i < N - 1; ++i) {
int tmp;
scanf("%d", &tmp);
if (tmp != C[id])
C[++id] = tmp;
}
... | #include <cstdio>
#include <cstring>
using namespace std;
using ll = long long;
const static int MOD = 1000000007;
int main() {
int N;
scanf("%d", &N);
int C[N];
scanf("%d", C);
int id = 0;
for (int i = 0; i < N - 1; ++i) {
int tmp;
scanf("%d", &tmp);
if (tmp != C[id])
C[++id] = tmp;
}
... | replace | 18 | 19 | 18 | 19 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define For(i, a, b) for (int(i) = (a); (i) < (b); i++)
#define Rep(i, n) For((i), 0, (n))
#define All(a) (a).begin(), (a).end()
#define sp " "
#define INF 1e18
#define INT_INF 1e9
typedef long long ll;
const ll MOD = 1000000007;
const ll MOD_9 = 998244353;
int N;
int m... | #include <bits/stdc++.h>
using namespace std;
#define For(i, a, b) for (int(i) = (a); (i) < (b); i++)
#define Rep(i, n) For((i), 0, (n))
#define All(a) (a).begin(), (a).end()
#define sp " "
#define INF 1e18
#define INT_INF 1e9
typedef long long ll;
const ll MOD = 1000000007;
const ll MOD_9 = 998244353;
int N;
int m... | replace | 18 | 19 | 18 | 19 | 0 | |
p03096 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define all(s) s.begin(), s.end()
#define vi vector<int>
#define pb push_back
#define ii pair<int, int>
#define x first
#define y second
const int N = 200005;
const int MOD = 1000000007;
int dp[N], c[N];
vi v[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);... | #include <bits/stdc++.h>
using namespace std;
#define all(s) s.begin(), s.end()
#define vi vector<int>
#define pb push_back
#define ii pair<int, int>
#define x first
#define y second
const int N = 200005;
const int MOD = 1000000007;
int dp[N], c[N];
vi v[N];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);... | replace | 26 | 31 | 26 | 35 | TLE | |
p03096 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include ... | replace | 40 | 41 | 40 | 41 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
#define P 1000000007
using namespace std;
int f[120000], sum[120000];
int a[120000];
int n;
int main() {
scanf("%d", &n);
f[0] = 1;
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = 1; i <= n; i++) {
f[i] = f[i - 1];
if (a[i] != a[i - 1])
(f[i] += sum[a[i]]... | #include <bits/stdc++.h>
#define P 1000000007
using namespace std;
int f[220000], sum[220000];
int a[220000];
int n;
int main() {
scanf("%d", &n);
f[0] = 1;
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
for (int i = 1; i <= n; i++) {
f[i] = f[i - 1];
if (a[i] != a[i - 1])
(f[i] += sum[a[i]]... | replace | 3 | 5 | 3 | 5 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#defin... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#defin... | replace | 365 | 366 | 365 | 366 | 0 | |
p03096 | C++ | Runtime Error | #include <array>
#include <bits/stdc++.h>
using namespace std;
using ULL = unsigned long long;
using UL = unsigned;
using LL = long long;
#define rep(i, n) for (UL i = 0; i < (n); i++)
struct Problem {
void Solve() {
UL N;
cin >> N;
vector<UL> C(N);
rep(i, N) {
cin >> C[i];
C[i]--;
}... | #include <array>
#include <bits/stdc++.h>
using namespace std;
using ULL = unsigned long long;
using UL = unsigned;
using LL = long long;
#define rep(i, n) for (UL i = 0; i < (n); i++)
struct Problem {
void Solve() {
UL N;
cin >> N;
vector<UL> C(N);
rep(i, N) {
cin >> C[i];
C[i]--;
}... | replace | 22 | 23 | 22 | 23 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll MOD = 1e9 + 7;
int N;
cin >> N;
vector<int> C(N, 0);
for (int i = 0; i < N; i++) {
int c;
cin >> c;
c--;
C[i] = c;
}
vector<ll> ans(N, 0);
vector<ll> pos(N,... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll MOD = 1e9 + 7;
int N;
cin >> N;
vector<int> C(N, 0);
for (int i = 0; i < N; i++) {
int c;
cin >> c;
c--;
C[i] = c;
}
vector<ll> ans(N, 0);
vector<ll> pos(2e... | replace | 20 | 21 | 20 | 21 | 0 | |
p03096 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define sz(x) (int)(x).size()
#define uni(x) x.erase(unique(rng(x)), x.end()... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define sz(x) (int)(x).size()
#define uni(x) x.erase(unique(rng(x)), x.end()... | replace | 38 | 42 | 38 | 41 | TLE | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL_DEBUG
#include "LOCAL_DEBUG.hpp"
#endif
#define int long long
const int MOD = 1e9 + 7;
signed main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> dp(n + 1, 0), pos(n + 1, -1);
for (int i = 0;... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL_DEBUG
#include "LOCAL_DEBUG.hpp"
#endif
#define int long long
const int MOD = 1e9 + 7;
signed main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> dp(n + 1, 0), pos(n + 1 + 2e5, -1);
for (int ... | replace | 17 | 18 | 17 | 18 | 0 | |
p03096 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
const long mod = 1e9 + 7;
void solve() {
int N;
cin >> N;
vector<int> as(N), nx[200020];
for (int i = 0; i < N; i++) {
cin >> as[i];
nx[as[i]].push_back(i);
}
for (int i = 0; i < 200020; i++) {
nx[i].push_back(N + 1);
}
vector<long> dp(N + 1);... | #include "bits/stdc++.h"
using namespace std;
const long mod = 1e9 + 7;
void solve() {
int N;
cin >> N;
vector<int> as(N), nx[200020];
for (int i = 0; i < N; i++) {
cin >> as[i];
nx[as[i]].push_back(i);
}
for (int i = 0; i < 200020; i++) {
nx[i].push_back(N + 1);
}
vector<long> dp(N + 1);... | replace | 21 | 23 | 21 | 22 | TLE | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define all(a) begin(a), end(a)
#define FOR(x, val, to) for (int x = (val); x < int((to)); ++x)
#define FORE(x, val, to) for (auto x = (val); x <= (to); ++x)
#define FORR(x, a... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pb push_back
#define mp make_pair
#define all(a) begin(a), end(a)
#define FOR(x, val, to) for (int x = (val); x < int((to)); ++x)
#define FORE(x, val, to) for (auto x = (val); x <= (to); ++x)
#define FORR(x, a... | replace | 144 | 146 | 144 | 146 | 0 | |
p03096 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// #include<ext/pb_ds/tag_and_trait.hpp>
// using namespace __gnu_pbds;
// #include<boost/multiprecision/cpp_int.hpp>
// namespace multiprecisioninteger = boost::multiprecision;
// us... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// #include<ext/pb_ds/tag_and_trait.hpp>
// using namespace __gnu_pbds;
// #include<boost/multiprecision/cpp_int.hpp>
// namespace multiprecisioninteger = boost::multiprecision;
// us... | replace | 87 | 88 | 87 | 88 | 0 | |
p03096 | C++ | Runtime Error | #pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #pragma comment(linker, "/stack:200000000")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double ld... | #pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #pragma comment(linker, "/stack:200000000")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double ld... | replace | 145 | 146 | 145 | 146 | 0 | |
p03096 | C++ | Runtime Error | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define debug(x) std::cerr << #x << " = " << (x) << std::endl
using namespace std;
typedef long long LL;
const int MAXN = 1e5 + 17;
const int MOD = 1e9 + 7;
LL f[MAXN], lst[MAXN], pre[MAXN], a[MA... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define debug(x) std::cerr << #x << " = " << (x) << std::endl
using namespace std;
typedef long long LL;
const int MAXN = 2e5 + 17;
const int MOD = 1e9 + 7;
LL f[MAXN], lst[MAXN], pre[MAXN], a[MA... | replace | 10 | 11 | 10 | 11 | 0 | |
p03096 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#define _USE_MATH_DEFINES
#include <functional>
#include <math.h>
using namespace std;
#define rep(i, x) for (ll i = 0; i < x; i++)
#define repn(i, x) for (ll i... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#define _USE_MATH_DEFINES
#include <functional>
#include <math.h>
using namespace std;
#define rep(i, x) for (ll i = 0; i < x; i++)
#define repn(i, x) for (ll i... | replace | 64 | 65 | 64 | 65 | 0 | sh: 1: PAUSE: not found
|
p03096 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(a) a.begin(), a.end()
const int MOD = 1e9 + 7;
struct mint {
int n;
mint(int n_ = 0) : n(n... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(a) a.begin(), a.end()
const int MOD = 1e9 + 7;
struct mint {
int n;
mint(int n_ = 0) : n(n... | replace | 42 | 43 | 42 | 43 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef set<int> si;
typedef set<ii> sii;
ty... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef set<int> si;
typedef set<ii> sii;
ty... | insert | 65 | 65 | 65 | 66 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (ll(i) = 0; (i) < (ll)(n); (i)++)
#define frep(i, m, n) for (ll(i) = (m); (i) <= (ll)(n); (i)++)
#define rrep(i, n) for (ll(i) = (n)-1; (i) > -1; (i)--)
#define frrep(i, m, n) for (ll(i) = (n); (i) > (ll)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (ll(i) = 0; (i) < (ll)(n); (i)++)
#define frep(i, m, n) for (ll(i) = (m); (i) <= (ll)(n); (i)++)
#define rrep(i, n) for (ll(i) = (n)-1; (i) > -1; (i)--)
#define frrep(i, m, n) for (ll(i) = (n); (i) > (ll)... | replace | 34 | 35 | 34 | 35 | 0 | |
p03096 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using... | replace | 32 | 33 | 32 | 33 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 100050;
const ll MOD = 1e9 + 7;
int n;
int a[N], p[N];
ll f[N];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
f[0] = 0;
f[1] = 1;
memset(p, 0, sizeof(p));
p[a[1]] = 1;
for (int i = 2;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 200050;
const ll MOD = 1e9 + 7;
int n;
int a[N], p[N];
ll f[N];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
f[0] = 0;
f[1] = 1;
memset(p, 0, sizeof(p));
p[a[1]] = 1;
for (int i = 2;... | replace | 6 | 7 | 6 | 7 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const int MAXN = 1e5;
int N;
int C[MAXN + 10];
long long dp[MAXN + 10], ss[MAXN + 10];
int main() {
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d", &C[i]);
}
dp[N] = 1;
for (int i = N - 1; i >= 0; i--) {
int c ... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const int MAXN = 2e5;
int N;
int C[MAXN + 10];
long long dp[MAXN + 10], ss[MAXN + 10];
int main() {
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d", &C[i]);
}
dp[N] = 1;
for (int i = N - 1; i >= 0; i--) {
int c ... | replace | 4 | 5 | 4 | 5 | 0 | |
p03096 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define vel vector<int>
#define vvel vector<vel>
#define vvvel vector<vvel>
#define veb vector<bool>
long long rui(long long a, long long n, long l... | #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define vel vector<int>
#define vvel vector<vel>
#define vvvel vector<vvel>
#define veb vector<bool>
long long rui(long long a, long long n, long l... | replace | 43 | 44 | 43 | 44 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
#define INF 5000000000000000000
#define ll long long
#define pll pair<ll, ll>
using namespace std;
int main() {
ll mod = 1000000007;
ll N;
cin >> N;
vector<ll> C(N);
vector<vector<ll>> color(N);
for (ll i = 0; i < N; ++i) {
ll c;
cin >> c;
C.at(i) = c - 1;
color.at(... | #include <bits/stdc++.h>
#define INF 5000000000000000000
#define ll long long
#define pll pair<ll, ll>
using namespace std;
int main() {
ll mod = 1000000007;
ll N;
cin >> N;
vector<ll> C(N);
vector<vector<ll>> color(2 * 100000);
for (ll i = 0; i < N; ++i) {
ll c;
cin >> c;
C.at(i) = c - 1;
... | replace | 11 | 12 | 11 | 12 | 0 | |
p03096 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
#define ll long long
#define to_mod 1000000007
#define MAX_COLOR 200000
int main() {
int n;
cin >> n;
vector<int> each_color[MAX_COLOR];
int num_each_color[MAX_COLOR];
int color_coll[n];
int idx_each_color[n];
ll comb_points[n];
comb_points[0] ... | #include <iostream>
#include <vector>
using namespace std;
#define ll long long
#define to_mod 1000000007
#define MAX_COLOR 200001
int main() {
int n;
cin >> n;
vector<int> each_color[MAX_COLOR];
int num_each_color[MAX_COLOR];
int color_coll[n];
int idx_each_color[n];
ll comb_points[n];
comb_points[0] ... | replace | 5 | 6 | 5 | 6 | 0 | |
p03096 | C++ | Runtime Error | // Created by sz
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e1 + 5, mod = 1e9 + 7;
int n, c[N], dp[N], last[N];
int main() {
#ifdef LOCAL
freopen("./input.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n;
int cnt = 1, temp;
for (int ... | // Created by sz
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5 + 5, mod = 1e9 + 7;
int n, c[N], dp[N], last[N];
int main() {
#ifdef LOCAL
freopen("./input.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n;
int cnt = 1, temp;
for (int ... | replace | 5 | 6 | 5 | 6 | 0 | |
p03096 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <... | replace | 50 | 51 | 50 | 51 | 0 | |
p03096 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
#define set0(x) memset(x, 0, sizeof(x))
#define FF first
#define SS second
#define PB push_back
#define MP make_pair
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
temp... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
#define set0(x) memset(x, 0, sizeof(x))
#define FF first
#define SS second
#define PB push_back
#define MP make_pair
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
temp... | replace | 41 | 42 | 41 | 42 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, l, r) for (int i = (int)(l); i < (int)(r); i++)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)x.size())
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, l, r) for (int i = (int)(l); i < (int)(r); i++)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)x.size())
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> ... | replace | 43 | 44 | 43 | 44 | 0 | |
p03096 | C++ | Runtime Error |
// #pragma GCC target("avx2")
#pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() { cerr... |
// #pragma GCC target("avx2")
#pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() { cerr... | replace | 116 | 117 | 116 | 117 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vb = vector<bool>;
using vvb = vector<vb>;
using vd = vector<double>;
using vvd = vector<vd>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
usi... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vb = vector<bool>;
using vvb = vector<vb>;
using vd = vector<double>;
using vvd = vector<vd>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
usi... | replace | 89 | 90 | 89 | 90 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
int main() {
int N;
cin >> N;
int C[N], Sum[20001] = {}, DP[N];
for (int i = 0; i < N; i++) {
cin >> C[i];
}
DP[0] = 1;
Sum[C[0]] = 1;
for (int i = 1; i < N; i++) {
if (C[i] == C[i - 1]) {
DP[i] = DP[i - 1];
} else ... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
int main() {
int N;
cin >> N;
int C[N], Sum[200001] = {}, DP[N];
for (int i = 0; i < N; i++) {
cin >> C[i];
}
DP[0] = 1;
Sum[C[0]] = 1;
for (int i = 1; i < N; i++) {
if (C[i] == C[i - 1]) {
DP[i] = DP[i - 1];
} else... | replace | 7 | 8 | 7 | 8 | 0 | |
p03096 | C++ | Runtime Error | // B.
#include <iostream>
#include <sstream>
#include <vector>
using namespace std;
typedef long long LL;
static const LL MOD = 1000000007LL;
int n;
vector<int> c;
LL solve() {
vector<LL> memo = vector<LL>(n + 1, 1);
vector<int> p(100001, -1);
LL r = 1;
int last = c[0];
p[c[0]] = 0;
memo[0] = r;
for ... | // B.
#include <iostream>
#include <sstream>
#include <vector>
using namespace std;
typedef long long LL;
static const LL MOD = 1000000007LL;
int n;
vector<int> c;
LL solve() {
vector<LL> memo = vector<LL>(n + 1, 1);
vector<int> p(200001, -1);
LL r = 1;
int last = c[0];
p[c[0]] = 0;
memo[0] = r;
for ... | replace | 16 | 17 | 16 | 17 | 0 | |
p03096 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__... | replace | 133 | 134 | 133 | 134 | 0 | |
p03096 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#define _GLIBCXX_DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
#define int long long
#define ll long long
#define ll1 1ll
#define ONE 1ll
#define DBG 1
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; ... | #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#define _GLIBCXX_DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
#define int long long
#define ll long long
#define ll1 1ll
#define ONE 1ll
#define DBG 1
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; ... | replace | 218 | 219 | 218 | 219 | 0 | |
p03096 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const double EPS = 1e-10;
const ll MOD = 7 + (1e+9);
int main() {
ll n;
cin >> n;
vector<ll> ... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const double EPS = 1e-10;
const ll MOD = 7 + (1e+9);
int main() {
ll n;
cin >> n;
if (n == 1 ... | insert | 18 | 18 | 18 | 22 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define MAX 200005
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define f first
#define s second
ll n, m, i, j, k, t, l, r, tmp, ans, cnt, curr, flag, sum, mn, mx, mxi, x, pre,
strt, en;
ll brr[MAX], arr[M... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define MAX 200005
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define f first
#define s second
ll n, m, i, j, k, t, l, r, tmp, ans, cnt, curr, flag, sum, mn, mx, mxi, x, pre,
strt, en;
ll brr[MAX], arr[M... | delete | 22 | 25 | 22 | 22 | 0 | |
p03096 | C++ | Runtime Error | /*input
7
1
3
1
2
3
3
2
*/
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 3;
const int MOD = 1e9 + 7;
int add(int a, int b) {
int r = a + b;
if (r >= MOD)
r -= MOD;
return r;
}
int mul(int a, int b) { return int((long long)a * b % MOD); }
int sub(int a, int b) {
int r = MOD + a - b;... | /*input
7
1
3
1
2
3
3
2
*/
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 3;
const int MOD = 1e9 + 7;
int add(int a, int b) {
int r = a + b;
if (r >= MOD)
r -= MOD;
return r;
}
int mul(int a, int b) { return int((long long)a * b % MOD); }
int sub(int a, int b) {
int r = MOD + a - b;... | replace | 15 | 16 | 15 | 16 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
// definition {{{ 1
// scaning {{{ 2
#define Scd(x) scanf("%d", &x)
#define Scd2(x, y) scanf("%d%d", &x, &y)
#define Scd3(x, y, z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%llu", &x)
#define Scll2(x, y) scanf("%llu%llu", &x, &... | #include <bits/stdc++.h>
using namespace std;
typedef long long unsigned int ll;
// definition {{{ 1
// scaning {{{ 2
#define Scd(x) scanf("%d", &x)
#define Scd2(x, y) scanf("%d%d", &x, &y)
#define Scd3(x, y, z) scanf("%d%d%d", &x, &y, &z)
#define Scll(x) scanf("%llu", &x)
#define Scll2(x, y) scanf("%llu%llu", &x, &... | replace | 44 | 46 | 44 | 46 | 0 | |
p03096 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
void solve() {
int N;
cin >> N;
vector<int> C(N + 1);
for (int i = 1; i <= N; i++)
cin >> C.at(i);
vector<int> DP(N + 1), s(N + 1);
DP.at(0) = 1;
for (int i = 1; i <= N; i++) {
if (C.at(i) != C.at(i - 1)) {
s.at(C.at(i)) += DP.at(i - 1);
s... | #include "bits/stdc++.h"
using namespace std;
void solve() {
int N;
cin >> N;
vector<int> C(N + 1);
for (int i = 1; i <= N; i++)
cin >> C.at(i);
vector<int> DP(N + 1), s(200001);
DP.at(0) = 1;
for (int i = 1; i <= N; i++) {
if (C.at(i) != C.at(i - 1)) {
s.at(C.at(i)) += DP.at(i - 1);
... | replace | 9 | 10 | 9 | 10 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
vector<long long> factors;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define _ << '\n'
#define __ << ' '
#define all(x) (x).begin(), (x).end()
#define gcd __gcd
int IT_MAX = 1 << 17;
int MOD = 1000'000'007;
const int INF = 0x3f3f3f3f;
const ... | #include <bits/stdc++.h>
using namespace std;
vector<long long> factors;
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define _ << '\n'
#define __ << ' '
#define all(x) (x).begin(), (x).end()
#define gcd __gcd
int IT_MAX = 1 << 17;
int MOD = 1000'000'007;
const int INF = 0x3f3f3f3f;
const ... | replace | 50 | 51 | 50 | 51 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// #define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop ... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
const int INF_N = 1e+9;
typedef pair<int, int> P;
#define stop ... | replace | 108 | 109 | 108 | 109 | 0 | |
p03096 | C++ | Runtime Error | #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define debug(x) cout << #x << " " << x << endl
#define fast ios... | #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define debug(x) cout << #x << " " << x << endl
#define fast ios... | replace | 18 | 19 | 18 | 19 | 0 | |
p03096 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
typedef long long ll;
#define pb push_back
using namespace std;
ll n, a[200006];
ll dp[200006];
ll c[200006];
const ll mod = 1e9 + 7;
int main() {
cin >> n;
for (ll i = 1; i <= n; i++)
cin >> a[i];
dp[0] = 1;
for (ll i = 1; i <= n; i++) {
ll j = i;
while (j <= n && a[j] == ... | #include <bits/stdc++.h>
typedef long long ll;
#define pb push_back
using namespace std;
ll n, a[200006];
ll dp[200006];
ll c[200006];
const ll mod = 1e9 + 7;
int main() {
cin >> n;
for (ll i = 1; i <= n; i++)
cin >> a[i];
dp[0] = 1;
for (ll i = 1; i <= n; i++) {
ll j = i;
while (j <= n && a[j] == ... | insert | 23 | 23 | 23 | 24 | TLE | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e5 + 10;
#define mod 1000000007
int C[maxn], lst[maxn];
ll dp[maxn], sum[maxn];
bool hsr[maxn];
struct seg {
int l, r;
seg() {}
seg(int l, int r) : l(l), r(r) {}
bool operator<(const seg &t) const { return l < t.l; }
};
vector... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e5 + 10;
#define mod 1000000007
int C[maxn], lst[maxn];
ll dp[maxn], sum[maxn];
bool hsr[maxn];
struct seg {
int l, r;
seg() {}
seg(int l, int r) : l(l), r(r) {}
bool operator<(const seg &t) const { return l < t.l; }
};
vector... | replace | 41 | 42 | 41 | 42 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
int main() {
long long n, c;
vector<long long> v;
cin >> n;
long long prev = -1;
for (int i = 0; i < n; i++) {
cin >> c;
if (c != prev) {
v.push_back(c);
prev = c;
}
}
if (n == 1) {
cout << 1 << endl... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
int main() {
long long n, c;
vector<long long> v;
cin >> n;
long long prev = -1;
for (int i = 0; i < n; i++) {
cin >> c;
if (c != prev) {
v.push_back(c);
prev = c;
}
}
if (n == 1) {
cout << 1 << endl... | replace | 21 | 22 | 21 | 22 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
#define FOR(v, a, b) for (int v = (a); v < (b); ++v)
#define FORE(v, a, b) for (int v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for (int v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define ITR(it, c) for (auto it... | #include <bits/stdc++.h>
#define FOR(v, a, b) for (int v = (a); v < (b); ++v)
#define FORE(v, a, b) for (int v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for (int v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define ITR(it, c) for (auto it... | replace | 71 | 72 | 71 | 72 | 0 | |
p03096 | C++ | Runtime Error | /*------------------------------------
........Bismillahir Rahmanir Rahim....
..........created by Abdul Aziz.......
------------------------------------*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#i... | /*------------------------------------
........Bismillahir Rahmanir Rahim....
..........created by Abdul Aziz.......
------------------------------------*/
#include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#i... | replace | 36 | 37 | 36 | 37 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.