problem_id
stringlengths 6
6
| buggy_code
stringlengths 8
526k
| fixed_code
stringlengths 12
526k
| labels
listlengths 0
15
⌀ | buggy_submission_id
int64 1
1.54M
| fixed_submission_id
int64 2
1.54M
| user_id
stringlengths 10
10
| language
stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p02936
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e5 + 6;
vector<int> e[maxn];
ll a[maxn];
void dfs(int u, int fa) {
a[u] += a[fa];
for (int i = 0; i < e[u].size(); i++) {
int v = e[u][i];
if (v == fa)
continue;
dfs(v, u);
}
}
int main() {
int n, q;
cin >> n >> q;
for (int i = 1; i < n; i++) {
int x, y;
cin >> x >> y;
e[y].push_back(x);
e[x].push_back(y);
}
while (q--) {
int x;
ll y;
cin >> x >> y;
a[x] = y;
}
dfs(1, 0);
for (int i = 1; i <= n; i++)
cout << a[i] << " ";
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e5 + 6;
vector<int> e[maxn];
ll a[maxn];
void dfs(int u, int fa) {
a[u] += a[fa];
for (int i = 0; i < e[u].size(); i++) {
int v = e[u][i];
if (v == fa)
continue;
dfs(v, u);
}
}
int main() {
int n, q;
cin >> n >> q;
for (int i = 1; i < n; i++) {
int x, y;
cin >> x >> y;
e[y].push_back(x);
e[x].push_back(y);
}
while (q--) {
int x;
ll y;
cin >> x >> y;
a[x] += y;
}
dfs(1, 0);
for (int i = 1; i <= n; i++)
cout << a[i] << " ";
cout << endl;
}
|
[
"assignment.value.change"
] | 738,734
| 738,735
|
u491404948
|
cpp
|
p02936
|
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
typedef vector<int> vi;
void dfs(vi e[], int x, int p, int c[]) {
for (int y : e[x]) {
if (y != p) {
c[y] += c[x];
dfs(e, y, x, c);
}
}
}
int main() {
ios::sync_with_stdio(false);
int n, q;
cin >> n >> q;
vi e[n];
for (int i = 0; i < n - 1; i++) {
int a, b;
cin >> a >> b;
a--, b--;
e[a].push_back(b);
e[b].push_back(a);
}
int c[n];
memset(c, 0, sizeof(c));
for (int i = 0; i < n - 1; i++) {
int p, x;
cin >> p >> x;
c[p - 1] += x;
}
dfs(e, 0, -1, c);
for (int i = 0; i < n; i++) {
cout << c[i] << " \n"[i == n - 1];
}
return 0;
}
|
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
typedef vector<int> vi;
void dfs(vi e[], int x, int p, int c[]) {
for (int y : e[x]) {
if (y != p) {
c[y] += c[x];
dfs(e, y, x, c);
}
}
}
int main() {
ios::sync_with_stdio(false);
int n, q;
cin >> n >> q;
vi e[n];
for (int i = 0; i < n - 1; i++) {
int a, b;
cin >> a >> b;
a--, b--;
e[a].push_back(b);
e[b].push_back(a);
}
int c[n];
memset(c, 0, sizeof(c));
for (int i = 0; i < q; i++) {
int p, x;
cin >> p >> x;
c[p - 1] += x;
}
dfs(e, 0, -1, c);
for (int i = 0; i < n; i++) {
cout << c[i] << " \n"[i == n - 1];
}
return 0;
}
|
[
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 738,740
| 738,741
|
u587665681
|
cpp
|
p02936
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define ll long long
#define endl '\n'
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
int x, y, cnt[200001], fnt[200002];
vector<int> vec[200001];
bitset<200001> vis;
void dfs(int a) {
static int ans = 1;
vis[a] = true;
cnt[a] = ans;
ans++;
for (int i = 0; i < vec[a].size(); i++) {
if (!vis[vec[a][i]]) {
dfs(vec[a][i]);
}
}
fnt[a] = ans;
}
class FT {
private:
vector<ll> ft;
public:
FT(int n) { ft.assign(n + 1, 0); }
ll sum(int a) {
ll ans = 0;
for (; a; a -= (a & -a))
ans += ft[a];
return ans;
}
ll rsq(int a, int b) {
ll x = sum(b) - sum(a - 1);
return x;
}
void update(int a, int b) {
for (; a < (int)ft.size(); a += (a & -a))
ft[a] += b;
}
};
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> x >> y;
for (int i = 0; i < x - 1; i++) {
int a, b;
cin >> a >> b;
vec[a].push_back(b);
vec[b].push_back(a);
}
dfs(1);
FT bit(x + 1);
for (int i = 1; i <= x; i++) {
bit.update(cnt[i], 0);
}
for (int i = 0; i < y; i++) {
int a, b;
cin >> a >> b;
bit.update(cnt[a], b);
bit.update(fnt[a], -b);
}
for (int i = 1; i <= x; i++)
cout << bit.sum(i) << ' ';
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define ll long long
#define endl '\n'
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
int x, y, cnt[200001], fnt[200002];
vector<int> vec[200001];
bitset<200001> vis;
void dfs(int a) {
static int ans = 1;
vis[a] = true;
cnt[a] = ans;
ans++;
for (int i = 0; i < vec[a].size(); i++) {
if (!vis[vec[a][i]]) {
dfs(vec[a][i]);
}
}
fnt[a] = ans;
}
class FT {
private:
vector<ll> ft;
public:
FT(int n) { ft.assign(n + 1, 0); }
ll sum(int a) {
ll ans = 0;
for (; a; a -= (a & -a))
ans += ft[a];
return ans;
}
ll rsq(int a, int b) {
ll x = sum(b) - sum(a - 1);
return x;
}
void update(int a, int b) {
for (; a < (int)ft.size(); a += (a & -a))
ft[a] += b;
}
};
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> x >> y;
for (int i = 0; i < x - 1; i++) {
int a, b;
cin >> a >> b;
vec[a].push_back(b);
vec[b].push_back(a);
}
dfs(1);
FT bit(x + 1);
for (int i = 1; i <= x; i++) {
bit.update(cnt[i], 0);
}
for (int i = 0; i < y; i++) {
int a, b;
cin >> a >> b;
bit.update(cnt[a], b);
bit.update(fnt[a], -b);
}
for (int i = 1; i <= x; i++)
cout << bit.sum(cnt[i]) << ' ';
}
|
[
"call.arguments.change"
] | 738,775
| 738,776
|
u366023106
|
cpp
|
p02936
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define ll long long
#define endl '\n'
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
int x, y, cnt[200001], fnt[200002];
vector<int> vec[200001];
bitset<200001> vis;
void dfs(int a) {
static int ans = 1;
vis[a] = true;
cnt[a] = ans;
ans++;
for (int i = 0; i < vec[a].size(); i++) {
if (!vis[vec[a][i]]) {
dfs(vec[a][i]);
}
}
fnt[a] = ans;
}
class FT {
private:
vector<int> ft;
public:
FT(int n) { ft.assign(n + 1, 0); }
ll sum(int a) {
ll ans = 0;
for (; a; a -= (a & -a))
ans += ft[a];
return ans;
}
ll rsq(int a, int b) {
ll x = sum(b) - sum(a - 1);
return x;
}
void update(int a, int b) {
for (; a < (int)ft.size(); a += (a & -a))
ft[a] += b;
}
};
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> x >> y;
for (int i = 0; i < x - 1; i++) {
int a, b;
cin >> a >> b;
vec[a].push_back(b);
vec[b].push_back(a);
}
dfs(1);
FT bit(x + 1);
for (int i = 1; i <= x; i++) {
bit.update(cnt[i], 0);
}
for (int i = 0; i < y; i++) {
int a, b;
cin >> a >> b;
bit.update(cnt[a], b);
bit.update(fnt[a], -b);
}
for (int i = 1; i <= x; i++)
cout << bit.sum(i) << ' ';
}
|
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define ll long long
#define endl '\n'
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
int x, y, cnt[200001], fnt[200002];
vector<int> vec[200001];
bitset<200001> vis;
void dfs(int a) {
static int ans = 1;
vis[a] = true;
cnt[a] = ans;
ans++;
for (int i = 0; i < vec[a].size(); i++) {
if (!vis[vec[a][i]]) {
dfs(vec[a][i]);
}
}
fnt[a] = ans;
}
class FT {
private:
vector<ll> ft;
public:
FT(int n) { ft.assign(n + 1, 0); }
ll sum(int a) {
ll ans = 0;
for (; a; a -= (a & -a))
ans += ft[a];
return ans;
}
ll rsq(int a, int b) {
ll x = sum(b) - sum(a - 1);
return x;
}
void update(int a, int b) {
for (; a < (int)ft.size(); a += (a & -a))
ft[a] += b;
}
};
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> x >> y;
for (int i = 0; i < x - 1; i++) {
int a, b;
cin >> a >> b;
vec[a].push_back(b);
vec[b].push_back(a);
}
dfs(1);
FT bit(x + 1);
for (int i = 1; i <= x; i++) {
bit.update(cnt[i], 0);
}
for (int i = 0; i < y; i++) {
int a, b;
cin >> a >> b;
bit.update(cnt[a], b);
bit.update(fnt[a], -b);
}
for (int i = 1; i <= x; i++)
cout << bit.sum(cnt[i]) << ' ';
}
|
[
"call.arguments.change"
] | 738,777
| 738,776
|
u366023106
|
cpp
|
p02936
|
#include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
vi adj[200001];
int d[200001];
void dfs(int x, int p, int s) {
for (int y : adj[x]) {
if (y == p)
continue;
dfs(y, x, s + d[x]);
}
d[x] += s;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, q;
cin >> n >> q;
for (int i = 1; i < n; ++i) {
int a, b;
cin >> a >> b;
adj[a].push_back(b);
adj[b].push_back(a);
}
while (q--) {
int p, x;
cin >> p >> x;
d[p] += x;
}
dfs(1, -1, 0);
for (int i = 1; i < n; ++i)
cout << d[i] << ' ';
}
|
#include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
vi adj[200001];
int d[200001];
void dfs(int x, int p, int s) {
for (int y : adj[x]) {
if (y == p)
continue;
dfs(y, x, s + d[x]);
}
d[x] += s;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, q;
cin >> n >> q;
for (int i = 1; i < n; ++i) {
int a, b;
cin >> a >> b;
adj[a].push_back(b);
adj[b].push_back(a);
}
while (q--) {
int p, x;
cin >> p >> x;
d[p] += x;
}
dfs(1, -1, 0);
for (int i = 1; i <= n; ++i)
cout << d[i] << ' ';
}
|
[
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 738,788
| 738,789
|
u562319622
|
cpp
|
p02936
|
#include <bits/stdc++.h>
using namespace std;
void dfs(auto &tree, auto &count, auto &ans, int parent, int node, int sum) {
sum += count.at(node);
ans.at(node) = sum;
for (auto i : tree.at(node)) {
if (i == parent)
continue;
dfs(tree, count, ans, i, node, sum);
}
}
int main(void) {
int N, Q;
cin >> N >> Q;
vector<int> count(N), ans(N);
vector<vector<int>> tree(N);
for (int i = 1; i < N; i++) {
int a, b;
cin >> a >> b;
--a;
--b;
tree.at(a).push_back(b);
tree.at(b).push_back(a);
}
for (int i = 0; i < N; i++)
count[i] = 0;
for (int i = 0; i < Q; i++) {
int cnt, x;
cin >> cnt;
--cnt;
cin >> x;
count.at(cnt) += x;
}
dfs(tree, count, ans, -1, 0, 0);
for (int i = 0; i < N; i++) {
cout << ans.at(i) << " ";
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
void dfs(auto &tree, auto &count, auto &ans, int parent, int node, int sum) {
sum += count.at(node);
ans.at(node) = sum;
for (auto i : tree.at(node)) {
if (i == parent)
continue;
dfs(tree, count, ans, node, i, sum);
}
}
int main(void) {
int N, Q;
cin >> N >> Q;
vector<int> count(N), ans(N);
vector<vector<int>> tree(N);
for (int i = 1; i < N; i++) {
int a, b;
cin >> a >> b;
--a;
--b;
tree.at(a).push_back(b);
tree.at(b).push_back(a);
}
for (int i = 0; i < N; i++)
count[i] = 0;
for (int i = 0; i < Q; i++) {
int cnt, x;
cin >> cnt;
--cnt;
cin >> x;
count.at(cnt) += x;
}
dfs(tree, count, ans, -1, 0, 0);
for (int i = 0; i < N; i++) {
cout << ans.at(i) << " ";
}
cout << endl;
}
|
[
"call.arguments.change",
"call.arguments.add"
] | 738,795
| 738,796
|
u090084494
|
cpp
|
p02936
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define vs vector<string>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
#define tll tuple<ll, ll, ll>
#define all(c) c.begin(), c.end()
const ll inf = 1000000001;
const ll INF = 1e18;
const ll MOD = 1000000007;
vector<ll> g[202020];
ll score[202020];
void dfs(int node, ll prev) {
score[node] += score[prev];
for (int i = 0; i < g[node].size(); i++) {
if (g[node][i] == prev)
continue;
dfs(g[node][i], node);
}
}
int main() {
fill(score, score + 202020, 0);
ll n, q;
cin >> n >> q;
for (int i = 0; i < n - 1; i++) {
int a, b;
cin >> a >> b;
g[a].push_back(b);
g[b].push_back(a);
}
for (int i = 0; i < q; i++) {
int p;
ll x;
cin >> p >> x;
score[p] += x;
}
dfs(1, score[1]);
for (int i = 1; i <= n; i++)
cout << score[i] << " ";
cout << endl;
// cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector<vector<int>>
#define vll vector<vector<ll>>
#define vs vector<string>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
#define tll tuple<ll, ll, ll>
#define all(c) c.begin(), c.end()
const ll inf = 1000000001;
const ll INF = 1e18;
const ll MOD = 1000000007;
vector<ll> g[202020];
ll score[202020];
void dfs(int node, ll prev) {
score[node] += score[prev];
for (int i = 0; i < g[node].size(); i++) {
if (g[node][i] == prev)
continue;
dfs(g[node][i], node);
}
}
int main() {
fill(score, score + 202020, 0);
ll n, q;
cin >> n >> q;
for (int i = 0; i < n - 1; i++) {
int a, b;
cin >> a >> b;
g[a].push_back(b);
g[b].push_back(a);
}
for (int i = 0; i < q; i++) {
int p;
ll x;
cin >> p >> x;
score[p] += x;
}
dfs(1, 0);
for (int i = 1; i <= n; i++)
cout << score[i] << " ";
cout << endl;
// cout << ans << endl;
}
|
[
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 738,815
| 738,816
|
u390193191
|
cpp
|
p02936
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const double pi = acos(-1);
#define FOR(i, a, b) for (ll i = (a), __last_##i = (b); i < __last_##i; i++)
#define RFOR(i, a, b) for (ll i = (b)-1, __last_##i = (a); i >= __last_##i; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define __GET_MACRO3(_1, _2, _3, NAME, ...) NAME
#define rep(...) __GET_MACRO3(__VA_ARGS__, FOR, REP)(__VA_ARGS__)
#define rrep(...) __GET_MACRO3(__VA_ARGS__, RFOR, RREP)(__VA_ARGS__)
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
REP(i, v.size()) {
if (i)
os << " ";
os << v[i];
}
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<vector<T>> &v) {
REP(i, v.size()) {
if (i)
os << endl;
os << v[i];
}
return os;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
vector<vector<int>> Graph;
vector<int> value;
void dfs(int now, int parent, int score) {
value[now] += score;
rep(i, Graph[now].size()) {
// Don't search parent nood.
if (Graph[now][i] == parent)
continue;
// Graph[now][i] is a nood which conect with now nood.
dfs(Graph[now][i], now, value[now]);
}
}
int main(int argc, const char *argv[]) {
int n, q;
cin >> n >> q;
Graph.resize(n);
value.resize(n);
rep(i, n - 1) {
int u, v;
cin >> u >> v;
u--;
v--;
Graph[u].push_back(v);
Graph[v].push_back(u);
}
rep(i, q) {
int u, x;
cin >> u >> x;
u--;
value[u] = x;
}
dfs(0, -1, 0);
rep(i, n) cout << value[i] << " ";
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const double pi = acos(-1);
#define FOR(i, a, b) for (ll i = (a), __last_##i = (b); i < __last_##i; i++)
#define RFOR(i, a, b) for (ll i = (b)-1, __last_##i = (a); i >= __last_##i; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define __GET_MACRO3(_1, _2, _3, NAME, ...) NAME
#define rep(...) __GET_MACRO3(__VA_ARGS__, FOR, REP)(__VA_ARGS__)
#define rrep(...) __GET_MACRO3(__VA_ARGS__, RFOR, RREP)(__VA_ARGS__)
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
REP(i, v.size()) {
if (i)
os << " ";
os << v[i];
}
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<vector<T>> &v) {
REP(i, v.size()) {
if (i)
os << endl;
os << v[i];
}
return os;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
vector<vector<int>> Graph;
vector<int> value;
void dfs(int now, int parent, int score) {
value[now] += score;
rep(i, Graph[now].size()) {
// Don't search parent nood.
if (Graph[now][i] == parent)
continue;
// Graph[now][i] is a nood which conect with now nood.
dfs(Graph[now][i], now, value[now]);
}
}
int main(int argc, const char *argv[]) {
int n, q;
cin >> n >> q;
Graph.resize(n);
value.resize(n);
rep(i, n - 1) {
int u, v;
cin >> u >> v;
u--;
v--;
Graph[u].push_back(v);
Graph[v].push_back(u);
}
rep(i, q) {
int u, x;
cin >> u >> x;
u--;
value[u] += x;
}
dfs(0, -1, 0);
rep(i, n) cout << value[i] << " ";
cout << endl;
}
|
[
"assignment.value.change"
] | 738,828
| 738,829
|
u430974466
|
cpp
|
p02936
|
#include <deque>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
vector<vector<int>> edge(N);
vector<int> value(N);
vector<int> total(N);
// cout << "NQ " << N << Q << endl;
for (int i = 0; i < N - 1; ++i) {
int a, b;
cin >> a >> b;
// cout << "ab " << a << " " << b << endl;
edge[a - 1].push_back(b - 1);
edge[b - 1].push_back(a - 1);
}
for (int i = 0; i < Q; ++i) {
int p, x;
cin >> p >> x;
value[p - 1] = x;
// cout << "out " << p << " " << x << endl;
}
/*for(int i=0; i < N; ++i){
cout << " " << value[i] << endl;
}*/
deque<pair<int, int>> dq;
pair<int, int> x;
x.first = 0;
x.second = -1;
dq.push_back(x);
while (!(dq.empty())) {
pair<int, int> st = dq[0];
dq.pop_front();
int node = st.first, parent = st.second;
vector<int> children = edge[node];
int l = children.size();
for (int i = 0; i < l; ++i) {
int child = children[i];
if (child == parent)
continue;
// cout << "add " << child << " " << node << endl;
value[child] += value[node];
x.first = child;
x.second = node;
dq.push_back(x);
// cout << "i " << i << endl;
}
}
bool not_first = false;
for (int i = 0; i < N; ++i) {
if (not_first)
cout << " ";
else
not_first = true;
cout << value[i];
}
cout << endl;
}
|
#include <deque>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, Q;
cin >> N >> Q;
vector<vector<int>> edge(N);
vector<int> value(N, 0);
vector<int> total(N);
// cout << "NQ " << N << Q << endl;
for (int i = 0; i < N - 1; ++i) {
int a, b;
cin >> a >> b;
// cout << "ab " << a << " " << b << endl;
edge[a - 1].push_back(b - 1);
edge[b - 1].push_back(a - 1);
}
for (int i = 0; i < Q; ++i) {
int p, x;
cin >> p >> x;
value[p - 1] += x;
// cout << "out " << p << " " << x << endl;
}
/*for(int i=0; i < N; ++i){
cout << " " << value[i] << endl;
}*/
deque<pair<int, int>> dq;
pair<int, int> x;
x.first = 0;
x.second = -1;
dq.push_back(x);
while (!(dq.empty())) {
pair<int, int> st = dq[0];
dq.pop_front();
int node = st.first, parent = st.second;
vector<int> children = edge[node];
int l = children.size();
for (int i = 0; i < l; ++i) {
int child = children[i];
if (child == parent)
continue;
// cout << "add " << child << " " << node << endl;
value[child] += value[node];
x.first = child;
x.second = node;
dq.push_back(x);
// cout << "i " << i << endl;
}
}
bool not_first = false;
for (int i = 0; i < N; ++i) {
if (not_first)
cout << " ";
else
not_first = true;
cout << value[i];
}
cout << endl;
}
|
[
"call.arguments.add",
"assignment.value.change"
] | 738,830
| 738,831
|
u463950771
|
cpp
|
p02936
|
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <vector>
using namespace std;
void AddScore(map<long long, vector<long long>> &C, long long *S, long long i,
int *visited) {
const auto r = C[i];
if (r.size() == 0) {
return;
}
const auto s = S[i - 1];
visited[i] = true;
for (auto j : r) {
if (visited[j] != 0) {
continue;
}
S[j - 1] += s;
AddScore(C, S, j, visited);
}
}
int main() {
long long N, Q;
cin >> N;
cin >> Q;
map<long long, vector<long long>> C;
for (long long i = 0; i < N - 1; i++) {
long long a, b;
cin >> a >> b;
C[a].push_back(b);
C[b].push_back(a);
}
vector<long long> S;
S.resize(N);
memset(S.data(), 0, sizeof(S[0]) * N);
for (long long i = 0; i < Q; i++) {
long long p, x;
cin >> p >> x;
S[p - 1] += x;
}
vector<int> visited;
visited.resize(N);
memset(visited.data(), 0, sizeof(visited[0]) * N);
AddScore(C, S.data(), 1, visited.data());
for (long long i = 0; i < N; ++i) {
cout << S[i] << " ";
}
cout << endl;
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <vector>
using namespace std;
void AddScore(map<long long, vector<long long>> &C, long long *S, long long i,
int *visited) {
const auto r = C[i];
if (r.size() == 0) {
return;
}
const auto s = S[i - 1];
visited[i - 1] = true;
for (auto j : r) {
if (visited[j - 1] != 0) {
continue;
}
S[j - 1] += s;
AddScore(C, S, j, visited);
}
}
int main() {
long long N, Q;
cin >> N;
cin >> Q;
map<long long, vector<long long>> C;
for (long long i = 0; i < N - 1; i++) {
long long a, b;
cin >> a >> b;
C[a].push_back(b);
C[b].push_back(a);
}
vector<long long> S;
S.resize(N);
memset(S.data(), 0, sizeof(S[0]) * N);
for (long long i = 0; i < Q; i++) {
long long p, x;
cin >> p >> x;
S[p - 1] += x;
}
vector<int> visited;
visited.resize(N);
memset(visited.data(), 0, sizeof(visited[0]) * N);
AddScore(C, S.data(), 1, visited.data());
for (long long i = 0; i < N; ++i) {
cout << S[i] << " ";
}
cout << endl;
return 0;
}
|
[
"assignment.change",
"control_flow.branch.if.condition.change"
] | 738,836
| 738,837
|
u838644735
|
cpp
|
p02936
|
#include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
int n, q;
vector<vector<int>> adj;
vector<int> dfsn;
vector<int> range;
int dfsnum = -1;
vector<int> bitree;
void update(int pos, int value) {
while (pos <= n) {
bitree[pos] += value;
pos += pos & -pos;
}
}
void rangeupdate(int l, int r, int value) {
update(l, value);
update(r + 1, -value);
}
int query(int pos) {
int ret = 0;
while (pos >= 1) {
ret += bitree[pos];
pos -= pos & -pos;
}
return ret;
}
void dfs(int now) {
if (dfsn[now] != -1)
return;
dfsn[now] = ++dfsnum;
for (int nxt : adj[now]) {
dfs(nxt);
}
range[now] = dfsnum;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> q;
adj.resize(n);
dfsn.resize(n, -1);
range.resize(n);
bitree.resize(n + 1);
for (int i = 0; i < n - 1; i++) {
int a, b;
cin >> a >> b;
adj[a - 1].push_back(b - 1);
adj[b - 1].push_back(a - 1);
}
dfs(0);
while (q--) {
int p, x;
cin >> p >> x;
rangeupdate(dfsn[p - 1] + 1, range[p - 1] + 1, x);
}
for (int i = 0; i < n; i++)
cout << query(i + 1) << " ";
return 0;
}
|
#include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
int n, q;
vector<vector<int>> adj;
vector<int> dfsn;
vector<int> range;
int dfsnum = -1;
vector<int> bitree;
void update(int pos, int value) {
while (pos <= n) {
bitree[pos] += value;
pos += pos & -pos;
}
}
void rangeupdate(int l, int r, int value) {
update(l, value);
update(r + 1, -value);
}
int query(int pos) {
int ret = 0;
while (pos >= 1) {
ret += bitree[pos];
pos -= pos & -pos;
}
return ret;
}
void dfs(int now) {
if (dfsn[now] != -1)
return;
dfsn[now] = ++dfsnum;
for (int nxt : adj[now]) {
dfs(nxt);
}
range[now] = dfsnum;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> q;
adj.resize(n);
dfsn.resize(n, -1);
range.resize(n);
bitree.resize(n + 1);
for (int i = 0; i < n - 1; i++) {
int a, b;
cin >> a >> b;
adj[a - 1].push_back(b - 1);
adj[b - 1].push_back(a - 1);
}
dfs(0);
while (q--) {
int p, x;
cin >> p >> x;
rangeupdate(dfsn[p - 1] + 1, range[p - 1] + 1, x);
}
for (int i = 0; i < n; i++)
cout << query(dfsn[i] + 1) << " ";
return 0;
}
|
[
"call.arguments.change"
] | 738,855
| 738,856
|
u827841970
|
cpp
|
p02936
|
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define endl '\n'
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
template <typename T = long long> T gcd(T a, T b) {
return b ? gcd(b, a % b) : a;
}
// value
int N, Q;
vector<vector<int>> G;
map<int, int> W;
ll ans[200020];
void dfs(int n, int w) {
ans[n] = w + W[n];
for (int i = 0; i < G[n].size(); i++) {
if (ans[G[n][i]] == -1) {
dfs(G[n][i], ans[n]);
}
}
return;
}
void solve() {
cin >> N >> Q;
G.resize(N);
for (int i = 0; i < N - 1; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
G[a].push_back(b);
G[b].push_back(a);
}
for (int i = 0; i < Q; i++) {
int p, x;
cin >> p >> x;
p--;
W[p] = x;
}
for (int i = 0; i < N; i++) {
ans[i] = -1;
}
dfs(0, 0);
for (int i = 0; i < N - 1; i++) {
cout << ans[i] << " ";
}
cout << ans[N - 1] << endl;
return;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define endl '\n'
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
template <typename T = long long> T gcd(T a, T b) {
return b ? gcd(b, a % b) : a;
}
// value
int N, Q;
vector<vector<int>> G;
map<int, int> W;
ll ans[200020];
void dfs(int n, int w) {
ans[n] = w + W[n];
for (int i = 0; i < G[n].size(); i++) {
if (ans[G[n][i]] == -1) {
dfs(G[n][i], ans[n]);
}
}
return;
}
void solve() {
cin >> N >> Q;
G.resize(N);
for (int i = 0; i < N - 1; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
G[a].push_back(b);
G[b].push_back(a);
}
for (int i = 0; i < Q; i++) {
int p, x;
cin >> p >> x;
p--;
W[p] += x;
}
for (int i = 0; i < N; i++) {
ans[i] = -1;
}
dfs(0, 0);
for (int i = 0; i < N - 1; i++) {
cout << ans[i] << " ";
}
cout << ans[N - 1] << endl;
return;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
|
[
"assignment.value.change"
] | 738,872
| 738,873
|
u381714561
|
cpp
|
p02936
|
#include <bits/stdc++.h>
using namespace std;
#define INF 987654321
typedef long long ll;
typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
#define MAX_N 200010
int in[MAX_N];
int out[MAX_N];
int trace_num = 0;
vector<int> edge[200010];
int N, Q;
void dfs(int start) {
in[start] = ++trace_num;
for (auto next : edge[start]) {
if (in[next])
continue; // 이미 방문한 노드
dfs(next);
}
out[start] = trace_num;
}
long long init(vector<long long> &a, vector<long long> &tree, int node,
int start, int end) {
if (start == end) {
return tree[node] = a[start];
} else {
return tree[node] = init(a, tree, node * 2, start, (start + end) / 2) +
init(a, tree, node * 2 + 1, (start + end) / 2 + 1, end);
}
}
void update_lazy(vector<long long> &tree, vector<long long> &lazy, int node,
int start, int end) {
if (lazy[node] != 0) {
tree[node] += (end - start + 1) * lazy[node];
// leaf가 아니면 아래로 내려버린다.
if (start != end) {
lazy[node * 2] += lazy[node];
lazy[node * 2 + 1] += lazy[node];
}
lazy[node] = 0;
}
}
void update_range(vector<long long> &tree, vector<long long> &lazy, int node,
int start, int end, int left, int right, long long diff) {
update_lazy(tree, lazy, node, start, end);
if (left > end || right < start) {
return;
}
if (left <= start && end <= right) {
tree[node] += (end - start + 1) * diff;
if (start != end) {
lazy[node * 2] += diff;
lazy[node * 2 + 1] += diff;
}
return;
}
update_range(tree, lazy, node * 2, start, (start + end) / 2, left, right,
diff);
update_range(tree, lazy, node * 2 + 1, (start + end) / 2 + 1, end, left,
right, diff);
tree[node] = tree[node * 2] + tree[node * 2 + 1];
}
long long sum(vector<long long> &tree, vector<long long> &lazy, int node,
int start, int end, int left, int right) {
update_lazy(tree, lazy, node, start, end);
if (left > end || right < start) {
return 0;
}
if (left <= start && end <= right) {
return tree[node];
}
return sum(tree, lazy, node * 2, start, (start + end) / 2, left, right) +
sum(tree, lazy, node * 2 + 1, (start + end) / 2 + 1, end, left, right);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N >> Q;
for (int i = 1; i < N; i++) {
int a, b;
cin >> a >> b;
edge[a].push_back(b);
edge[b].push_back(a);
}
dfs(1);
int n = 2 * N; // 모든 노드가 2번씩 나오니까
vector<ll> a(n);
int h = (int)ceil(log2(n));
int tree_size = (1 << (h + 1)) - 1;
vector<ll> tree(tree_size);
vector<ll> lazy(tree_size);
init(a, tree, 1, 0, n - 1); // 모두 0으로 초기화(A는 아무 값도 없으므로)
int p, x;
while (Q--) {
cin >> p >> x;
// p를 root로 하는 subtree는 모두 x만큼 더해주자.
// in[p] ~ out[p] 사이 구간에 모두 x만큼 lazy propagation
int start = in[p];
int end = out[p];
update_range(tree, lazy, 1, 0, n - 1, start - 1, end - 1, x);
}
for (int i = 1; i <= N; i++) {
// in[i]번째의 세그먼트 트리 값을 모두 출력
int start = in[i];
cout << sum(tree, lazy, 1, 0, n - 1, start - 1, start - 1) << " ";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define INF 987654321
typedef long long ll;
typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
#define MAX_N 220010
int in[MAX_N];
int out[MAX_N];
int trace_num = 0;
vector<int> edge[MAX_N];
int N, Q;
void dfs(int start) {
in[start] = ++trace_num;
for (auto next : edge[start]) {
if (in[next])
continue; // 이미 방문한 노드
dfs(next);
}
out[start] = trace_num;
}
long long init(vector<long long> &a, vector<long long> &tree, int node,
int start, int end) {
if (start == end) {
return tree[node] = a[start];
} else {
return tree[node] = init(a, tree, node * 2, start, (start + end) / 2) +
init(a, tree, node * 2 + 1, (start + end) / 2 + 1, end);
}
}
void update_lazy(vector<long long> &tree, vector<long long> &lazy, int node,
int start, int end) {
if (lazy[node] != 0) {
tree[node] += (end - start + 1) * lazy[node];
// leaf가 아니면 아래로 내려버린다.
if (start != end) {
lazy[node * 2] += lazy[node];
lazy[node * 2 + 1] += lazy[node];
}
lazy[node] = 0;
}
}
void update_range(vector<long long> &tree, vector<long long> &lazy, int node,
int start, int end, int left, int right, long long diff) {
update_lazy(tree, lazy, node, start, end);
if (left > end || right < start) {
return;
}
if (left <= start && end <= right) {
tree[node] += (end - start + 1) * diff;
if (start != end) {
lazy[node * 2] += diff;
lazy[node * 2 + 1] += diff;
}
return;
}
update_range(tree, lazy, node * 2, start, (start + end) / 2, left, right,
diff);
update_range(tree, lazy, node * 2 + 1, (start + end) / 2 + 1, end, left,
right, diff);
tree[node] = tree[node * 2] + tree[node * 2 + 1];
}
long long sum(vector<long long> &tree, vector<long long> &lazy, int node,
int start, int end, int left, int right) {
update_lazy(tree, lazy, node, start, end);
if (left > end || right < start) {
return 0;
}
if (left <= start && end <= right) {
return tree[node];
}
return sum(tree, lazy, node * 2, start, (start + end) / 2, left, right) +
sum(tree, lazy, node * 2 + 1, (start + end) / 2 + 1, end, left, right);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> N >> Q;
for (int i = 1; i < N; i++) {
int a, b;
cin >> a >> b;
edge[a].push_back(b);
edge[b].push_back(a);
}
dfs(1);
int n = 3 * N; // 모든 노드가 2번씩 나오니까
vector<ll> a(n);
int h = (int)ceil(log2(n));
int tree_size = (1 << (h + 2)) - 1;
vector<ll> tree(tree_size);
vector<ll> lazy(tree_size);
init(a, tree, 1, 0, n - 1); // 모두 0으로 초기화(A는 아무 값도 없으므로)
int p, x;
while (Q--) {
cin >> p >> x;
// p를 root로 하는 subtree는 모두 x만큼 더해주자.
// in[p] ~ out[p] 사이 구간에 모두 x만큼 lazy propagation
int start = in[p];
int end = out[p];
update_range(tree, lazy, 1, 0, n - 1, start - 1, end - 1, x);
}
for (int i = 1; i <= N; i++) {
// in[i]번째의 세그먼트 트리 값을 모두 출력
int start = in[i];
cout << sum(tree, lazy, 1, 0, n - 1, start - 1, start - 1) << " ";
}
return 0;
}
|
[
"preprocessor.define.value.change",
"literal.integer.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_declaration.array_dimensions.change",
"literal.number.change",
"expression.operation.binary.change"
] | 738,887
| 738,888
|
u112681763
|
cpp
|
p02936
|
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
using namespace std;
const int MAX_N = 200005;
const int MAX_Q = 200005;
int p[MAX_N], Q[MAX_Q], ans[MAX_N];
queue<int> V[MAX_N];
void init() {
for (int i = 0; i < MAX_N; ++i) {
p[i] = -1;
}
p[1] = 1;
return;
}
void tree(int n) {
// cout << "a";
while (!V[n].empty()) {
int temp = V[n].front();
V[n].pop();
if (p[n] != temp) {
p[temp] = n;
tree(temp);
}
}
return;
}
int main() {
int n, q;
cin >> n >> q;
p[1] = 1;
int a, b;
for (int i = 0; i < n - 1; ++i) {
cin >> a >> b;
p[b] = p[a];
}
// cout << "b";
//木を構成
// init();
// tree(1);
/*
for (int i = 1; i <= n; ++i)
{
cout << i << "'s parent is " << p[i] << endl;
}
*/
int t1, t2;
for (int i = 1; i <= n; ++i) {
Q[i] = 0;
}
for (int i = 0; i < q; ++i) {
cin >> t1 >> t2;
Q[t1] += t2;
}
for (int i = 1; i <= n; ++i) {
ans[i] = -1;
}
ans[1] = Q[1];
for (int i = 2; i <= n; ++i) {
int temp = i;
ans[temp] = Q[temp];
while (ans[p[temp]] == -1) {
ans[i] += Q[p[temp]];
temp = p[temp];
}
ans[i] += ans[p[temp]];
}
for (int i = 1; i <= n; ++i) {
if (i != 1)
cout << " ";
cout << ans[i];
}
cout << endl;
return 0;
}
|
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
using namespace std;
const int MAX_N = 200005;
const int MAX_Q = 200005;
int p[MAX_N], Q[MAX_Q], ans[MAX_N];
queue<int> V[MAX_N];
void init() {
for (int i = 0; i < MAX_N; ++i) {
p[i] = -1;
}
p[1] = 1;
return;
}
void tree(int n) {
// cout << "a";
while (!V[n].empty()) {
int temp = V[n].front();
V[n].pop();
if (p[n] != temp) {
p[temp] = n;
tree(temp);
}
}
return;
}
int main() {
int n, q;
cin >> n >> q;
p[1] = 1;
int a, b;
for (int i = 0; i < n - 1; ++i) {
cin >> a >> b;
p[b] = a;
}
// cout << "b";
//木を構成
// init();
// tree(1);
/*
for (int i = 1; i <= n; ++i)
{
cout << i << "'s parent is " << p[i] << endl;
}
*/
int t1, t2;
for (int i = 1; i <= n; ++i) {
Q[i] = 0;
}
for (int i = 0; i < q; ++i) {
cin >> t1 >> t2;
Q[t1] += t2;
}
for (int i = 1; i <= n; ++i) {
ans[i] = -1;
}
ans[1] = Q[1];
for (int i = 2; i <= n; ++i) {
int temp = i;
ans[temp] = Q[temp];
while (ans[p[temp]] == -1) {
ans[i] += Q[p[temp]];
temp = p[temp];
}
ans[i] += ans[p[temp]];
}
for (int i = 1; i <= n; ++i) {
if (i != 1)
cout << " ";
cout << ans[i];
}
cout << endl;
return 0;
}
|
[] | 738,889
| 738,890
|
u352969025
|
cpp
|
p02936
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 99999999
#define rep(i, n) for (int i = 0, temp = (int)(n); i < temp; ++i)
#define repi(i, start, end) for (int i = start, temp = (int)(end); i < end; ++i)
#define rfor(v, x) for (const auto &x : v) // xは値を表す
#define all(x) (x).begin(), (x).end()
#define SORT(v, n) sort(v, v + n)
#define vsort(v) sort(v.begin(), v.end())
#define vfsort(v, lambda) sort(v.begin(), v.end(), lambda)
#define vint vector<int>
#define vvint vector<vector<int>>
#define vin(v) \
rep(i, v.size()) { cin >> v[i]; }
//最終奥義
//#define int long long
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;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int ctoi(char c) { return c - '0'; }
//(lambda (x y) (< x y)) => [](int x, int y) -> int { return x<y; }
signed main(void) {
int n, q;
cin >> n >> q;
vint super(n, -1);
rep(i, n - 1) {
int a, b;
cin >> a >> b;
super[b - 1] = a - 1;
}
vint c(n, 0);
rep(i, q) {
int p, x;
cin >> p >> x;
c[p - 1] += x;
}
rep(i, n - 1) c[i + 1] = c[super[i + 1]];
rep(i, n) cout << c[i] << " ";
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 99999999
#define rep(i, n) for (int i = 0, temp = (int)(n); i < temp; ++i)
#define repi(i, start, end) for (int i = start, temp = (int)(end); i < end; ++i)
#define rfor(v, x) for (const auto &x : v) // xは値を表す
#define all(x) (x).begin(), (x).end()
#define SORT(v, n) sort(v, v + n)
#define vsort(v) sort(v.begin(), v.end())
#define vfsort(v, lambda) sort(v.begin(), v.end(), lambda)
#define vint vector<int>
#define vvint vector<vector<int>>
#define vin(v) \
rep(i, v.size()) { cin >> v[i]; }
//最終奥義
//#define int long long
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;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int ctoi(char c) { return c - '0'; }
//(lambda (x y) (< x y)) => [](int x, int y) -> int { return x<y; }
signed main(void) {
int n, q;
cin >> n >> q;
vint super(n, -1);
rep(i, n - 1) {
int a, b;
cin >> a >> b;
super[b - 1] = a - 1;
}
vint c(n, 0);
rep(i, q) {
int p, x;
cin >> p >> x;
c[p - 1] += x;
}
rep(i, n - 1) c[i + 1] += c[super[i + 1]];
rep(i, n) cout << c[i] << " ";
cout << endl;
}
|
[
"assignment.value.change"
] | 738,895
| 738,896
|
u432998668
|
cpp
|
p02936
|
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define For(i, m, n) for (ll i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
ll gcd(ll a, ll b) {
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
ll lcm(ll x, ll y) {
if (x == 0 || y == 0) {
return -1;
}
return (x * y / gcd(x, y));
}
using namespace std;
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
ll nCr(ll n, ll r) {
if (r * 2 > n)
r = n - r;
ll dividend = 1;
ll divisor = 1;
for (ll i = 1; i <= r; ++i) {
dividend *= (n - i + 1);
divisor *= i;
}
return dividend / divisor;
}
bool compare_by_b(pair<int, int> a, pair<int, int> b) {
if (a.second != b.second) {
return a.second < b.second;
} else {
return a.first < b.first;
}
}
int main(int argc, char *argv[]) {
ll N, Q;
cin >> N >> Q;
vector<pair<ll, ll>> ab;
vector<pair<ll, ll>> px;
rep(i, N - 1) {
ll a, b;
cin >> a >> b;
ab.push_back(make_pair(a, b));
}
sort(ALL(ab));
rep(i, Q) {
ll p, x;
cin >> p >> x;
px.push_back(make_pair(p, x));
}
sort(ALL(px));
vector<ll> result(N);
ll posLast1 = -1;
rep(i, Q) {
if (px[i].first == 1) {
result[0] += px[i].second;
} else {
posLast1 = i;
break;
}
}
if (posLast1 != -1) {
For(i, posLast1, Q) { result[px[i].first - 1] += px[i].second; }
}
rep(i, N - 1) {
if (ab[i].first == 1) {
result[ab[i].second - 1] = result[0];
} else {
result[ab[i].second - 1] += result[ab[i].first - 1];
}
}
rep(i, N) { cout << result[i] << " "; }
return 0;
}
|
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define For(i, m, n) for (ll i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
ll gcd(ll a, ll b) {
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
ll lcm(ll x, ll y) {
if (x == 0 || y == 0) {
return -1;
}
return (x * y / gcd(x, y));
}
using namespace std;
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
ll nCr(ll n, ll r) {
if (r * 2 > n)
r = n - r;
ll dividend = 1;
ll divisor = 1;
for (ll i = 1; i <= r; ++i) {
dividend *= (n - i + 1);
divisor *= i;
}
return dividend / divisor;
}
bool compare_by_b(pair<int, int> a, pair<int, int> b) {
if (a.second != b.second) {
return a.second < b.second;
} else {
return a.first < b.first;
}
}
int main(int argc, char *argv[]) {
ll N, Q;
cin >> N >> Q;
vector<pair<ll, ll>> ab;
vector<pair<ll, ll>> px;
rep(i, N - 1) {
ll a, b;
cin >> a >> b;
ab.push_back(make_pair(a, b));
}
sort(ALL(ab));
rep(i, Q) {
ll p, x;
cin >> p >> x;
px.push_back(make_pair(p, x));
}
sort(ALL(px));
vector<ll> result(N);
ll posLast1 = -1;
rep(i, Q) {
if (px[i].first == 1) {
result[0] += px[i].second;
} else {
posLast1 = i;
break;
}
}
if (posLast1 != -1) {
For(i, posLast1, Q) { result[px[i].first - 1] += px[i].second; }
}
/*
rep(i, N){
cout << result[i] << endl;
}
*/
rep(i, N - 1) {
if (ab[i].first == 1) {
result[ab[i].second - 1] += result[0];
} else {
result[ab[i].second - 1] += result[ab[i].first - 1];
}
}
rep(i, N) { cout << result[i] << " "; }
return 0;
}
|
[
"assignment.value.change"
] | 738,932
| 738,933
|
u050445028
|
cpp
|
p02936
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using pll = pair<ll, ll>;
using vpl = vector<pll>;
using vb = vector<bool>;
using vs = vector<string>;
const ll oo = 0x3f3f3f3f3f3f3f3fLL;
const double eps = 1e-9;
#define sz(c) ll((c).size())
#define all(c) begin(c), end(c)
#define mp make_pair
#define pb push_back
#define xx first
#define yy second
#define has(c, i) (c.find() != end(c))
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORD(i, a, b) for (ll i = ll(b) - 1; i >= (a); i--)
#define DBG 1
#define TR(X) \
({ \
if (DBG) \
cerr << "TR: " << (#X) << " = " << (X) << endl; \
})
vb mark;
vvl children;
vl vals;
void rek(ll cur, ll val) {
mark[cur] = true;
vals[cur] += val;
for (const auto &it : children[cur]) {
if (!mark[cur])
rek(it, vals[cur]);
}
}
int main() {
ios::sync_with_stdio(false);
ll N, Q;
cin >> N >> Q;
children.assign(N, vl());
vals.assign(N, 0);
mark.assign(N, false);
FOR(i, 0, N - 1) {
ll a, b;
cin >> a >> b;
a--;
b--;
children[a].pb(b);
children[b].pb(a);
}
FOR(i, 0, Q) {
ll p, x;
cin >> p >> x;
p--;
vals[p] += x;
}
rek(0, 0);
FOR(i, 0, N) { cout << vals[i] << " "; }
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using pll = pair<ll, ll>;
using vpl = vector<pll>;
using vb = vector<bool>;
using vs = vector<string>;
const ll oo = 0x3f3f3f3f3f3f3f3fLL;
const double eps = 1e-9;
#define sz(c) ll((c).size())
#define all(c) begin(c), end(c)
#define mp make_pair
#define pb push_back
#define xx first
#define yy second
#define has(c, i) (c.find() != end(c))
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORD(i, a, b) for (ll i = ll(b) - 1; i >= (a); i--)
#define DBG 1
#define TR(X) \
({ \
if (DBG) \
cerr << "TR: " << (#X) << " = " << (X) << endl; \
})
vb mark;
vvl children;
vl vals;
void rek(ll cur, ll val) {
mark[cur] = true;
vals[cur] += val;
for (const auto &it : children[cur]) {
if (!mark[it])
rek(it, vals[cur]);
}
}
int main() {
ios::sync_with_stdio(false);
ll N, Q;
cin >> N >> Q;
children.assign(N, vl());
vals.assign(N, 0);
mark.assign(N, false);
FOR(i, 0, N - 1) {
ll a, b;
cin >> a >> b;
a--;
b--;
children[a].pb(b);
children[b].pb(a);
}
FOR(i, 0, Q) {
ll p, x;
cin >> p >> x;
p--;
vals[p] += x;
}
rek(0, 0);
FOR(i, 0, N) { cout << vals[i] << " "; }
cout << endl;
}
|
[
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 738,964
| 738,965
|
u615346437
|
cpp
|
p02936
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod = 1e9 + 7;
const ll MAXX = 1e18;
vector<ll> hold[1000001];
// for eTour
pair<ll, ll> tim[1000001];
bool pass[1000001];
ll cnt = 0;
void eTour(ll sta = 1) {
pass[sta] = true;
tim[sta].first = ++cnt;
for (ll i = 0; i < hold[sta].size(); i++) {
if (!pass[hold[sta][i]]) {
eTour(hold[sta][i]);
}
}
tim[sta].second = cnt;
}
// for Tree
ll tree[1000001];
ll lazy[1000001];
void propa(ll node, ll left, ll right) {
if (lazy[node]) {
tree[node] += (right - left + 1) * lazy[node];
if (left != right) {
lazy[node * 2] += lazy[node];
lazy[node * 2 + 1] += lazy[node];
}
lazy[node] = 0;
}
}
void update(ll node, ll left, ll right, ll uLeft, ll uRight, ll val) {
propa(node, left, right);
if (uLeft > right || uRight < left) {
return;
}
if (uLeft <= left && right <= uRight) {
lazy[node] = val;
propa(node, left, right);
return;
}
ll mid = (left + right) / 2;
update(node * 2, left, mid, uLeft, uRight, val);
update(node * 2 + 1, mid + 1, right, uLeft, uRight, val);
tree[node] = tree[node * 2] + tree[node * 2 + 1];
}
ll query(ll node, ll left, ll right, ll pos) {
propa(node, left, right);
if (pos < left || pos > right) {
return 0;
}
if (left == right && pos == left) {
return tree[node];
}
ll mid = (left + right) / 2;
return query(node * 2, left, mid, pos) +
query(node * 2 + 1, mid + 1, right, pos);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// freopen("INP.txt", "r", stdin);
// freopen("OUT.txt", "w", stdout);
ll n, m;
cin >> n >> m;
for (ll i = 1; i < n; i++) {
ll a, b;
cin >> a >> b;
hold[a].push_back(b);
hold[b].push_back(a);
}
eTour();
// cerr << 1 << '\n';
// for (ll i = 1; i <= n; i++) {
// cerr << tim[i].first << ' ' << tim[i].second << '\n';
// }
for (ll i = 0; i < m; i++) {
ll a, b;
cin >> a >> b;
ll l = tim[a].first, r = tim[a].second;
update(1, 1, n, l, r, b);
}
// cerr << 1 << '\n';
for (ll i = 1; i <= n; i++) {
cout << query(1, 1, n, i) << ' ';
}
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod = 1e9 + 7;
const ll MAXX = 1e18;
vector<ll> hold[1000001];
// for eTour
pair<ll, ll> tim[1000001];
bool pass[1000001];
ll cnt = 0;
void eTour(ll sta = 1) {
pass[sta] = true;
tim[sta].first = ++cnt;
for (ll i = 0; i < hold[sta].size(); i++) {
if (!pass[hold[sta][i]]) {
eTour(hold[sta][i]);
}
}
tim[sta].second = cnt;
}
// for Tree
ll tree[1000001];
ll lazy[1000001];
void propa(ll node, ll left, ll right) {
if (lazy[node]) {
tree[node] += (right - left + 1) * lazy[node];
if (left != right) {
lazy[node * 2] += lazy[node];
lazy[node * 2 + 1] += lazy[node];
}
lazy[node] = 0;
}
}
void update(ll node, ll left, ll right, ll uLeft, ll uRight, ll val) {
propa(node, left, right);
if (uLeft > right || uRight < left) {
return;
}
if (uLeft <= left && right <= uRight) {
lazy[node] = val;
propa(node, left, right);
return;
}
ll mid = (left + right) / 2;
update(node * 2, left, mid, uLeft, uRight, val);
update(node * 2 + 1, mid + 1, right, uLeft, uRight, val);
tree[node] = tree[node * 2] + tree[node * 2 + 1];
}
ll query(ll node, ll left, ll right, ll pos) {
propa(node, left, right);
if (pos < left || pos > right) {
return 0;
}
if (left == right && pos == left) {
return tree[node];
}
ll mid = (left + right) / 2;
return query(node * 2, left, mid, pos) +
query(node * 2 + 1, mid + 1, right, pos);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// freopen("INP.txt", "r", stdin);
// freopen("OUT.txt", "w", stdout);
ll n, m;
cin >> n >> m;
for (ll i = 1; i < n; i++) {
ll a, b;
cin >> a >> b;
hold[a].push_back(b);
hold[b].push_back(a);
}
eTour();
// cerr << 1 << '\n';
// for (ll i = 1; i <= n; i++) {
// cerr << tim[i].first << ' ' << tim[i].second << '\n';
// }
for (ll i = 0; i < m; i++) {
ll a, b;
cin >> a >> b;
ll l = tim[a].first, r = tim[a].second;
update(1, 1, n, l, r, b);
}
// cerr << 1 << '\n';
for (ll i = 1; i <= n; i++) {
cout << query(1, 1, n, tim[i].first) << ' ';
}
return 0;
}
|
[] | 739,004
| 739,005
|
u508700891
|
cpp
|
p02936
|
#include <bits/stdc++.h>
using namespace std;
int id, n, q, a, b, p;
vector<int> graph[200005];
int masuk[200005], keluar[200005];
long long arr[200005], tmp, x, ans[200005];
void dfs(int now, int par) {
id++;
masuk[now] = id;
for (int i = 0; i < graph[now].size(); i++) {
int nex = graph[now][i];
if (nex == par)
continue;
dfs(nex, now);
}
keluar[now] = id;
}
int main() {
scanf("%d%d", &n, &q);
for (int i = 0; i < n - 1; i++) {
scanf("%d%d", &a, &b);
graph[a].push_back(b);
graph[b].push_back(a);
}
id = 0;
dfs(1, -1);
// for(int i =1;i<=n;i++){
// printf("node %d(%d) = %d - %d\n",i,masuk[i],masuk[i],keluar[i]);
// }
while (q--) {
scanf("%d%lld", &p, &x);
arr[masuk[p]] += x;
arr[keluar[p] + 1] -= x;
}
tmp = 0;
for (int i = 1; i <= n; i++) {
tmp += arr[i];
ans[masuk[i]] = tmp;
}
for (int i = 1; i <= n; i++) {
if (i != 1)
printf(" ");
printf("%lld", ans[masuk[i]]);
}
printf("\n");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int id, n, q, a, b, p;
vector<int> graph[200005];
int masuk[200005], keluar[200005];
long long arr[200005], tmp, x, ans[200005];
void dfs(int now, int par) {
id++;
masuk[now] = id;
for (int i = 0; i < graph[now].size(); i++) {
int nex = graph[now][i];
if (nex == par)
continue;
dfs(nex, now);
}
keluar[now] = id;
}
int main() {
scanf("%d%d", &n, &q);
for (int i = 0; i < n - 1; i++) {
scanf("%d%d", &a, &b);
graph[a].push_back(b);
graph[b].push_back(a);
}
id = 0;
dfs(1, -1);
// for(int i =1;i<=n;i++){
// printf("node %d(%d) = %d - %d\n",i,masuk[i],masuk[i],keluar[i]);
// }
while (q--) {
scanf("%d%lld", &p, &x);
arr[masuk[p]] += x;
arr[keluar[p] + 1] -= x;
}
tmp = 0;
for (int i = 1; i <= n; i++) {
tmp += arr[i];
ans[i] = tmp;
}
for (int i = 1; i <= n; i++) {
if (i != 1)
printf(" ");
printf("%lld", ans[masuk[i]]);
}
printf("\n");
return 0;
}
|
[] | 739,017
| 739,018
|
u547105766
|
cpp
|
p02936
|
#include <bits/stdc++.h>
#define whlie while
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define rep(i, N) for (int i = 0; i < (N); i++)
#define repr(i, N) for (auto i = (N)-1; i >= 0; i -= 1)
#define each(x, v) for (auto &x : v)
#define all(v) (v).begin(), (v).end()
#define sz(v) ((int)(v).size())
#define vrep(v, it) for (auto it = v.begin(); it != v.end(); it++)
#define vrepr(v, it) for (auto it = v.rbegin(); it != v.rend(); it++)
#define ini(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define inl(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define ins(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define rand mtrand
#ifdef NyaanDebug
#include "NyaanDebug.h"
#define trc(...) \
do { \
cout << #__VA_ARGS__ << " = "; \
dbg_out(__VA_ARGS__); \
} while (0)
#define trca(v, N) \
do { \
cout << #v << " = "; \
array_out(v, N); \
cout << endl; \
} while (0)
#else
#define trc(...)
#define trca(...)
#endif
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vector<int>>;
constexpr int inf = 1001001001;
constexpr ll infLL = 0x1FFFFFFFFFFFFFFFLL;
struct IoSetupNya {
IoSetupNya() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
cerr << fixed << setprecision(15);
}
} iosetupnya;
template <typename T, typename U> inline bool amin(T &x, U y) {
return (y < x) ? (x = y, true) : false;
}
template <typename T, typename U> inline bool amax(T &x, U y) {
return (x < y) ? (x = y, true) : false;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << p.first << " " << p.second;
return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
int s = (int)v.size();
rep(i, s) os << (i ? " " : "") << v[i];
return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v)
is >> x;
return is;
}
void in() {}
template <typename T, class... U> void in(T &t, U &...u) {
cin >> t;
in(u...);
}
void out() { cout << "\n"; }
template <typename T, class... U> void out(const T &t, const U &...u) {
cout << t;
if (sizeof...(u))
cout << " ";
out(u...);
}
template <typename T> void die(T x) {
out(x);
exit(0);
}
using P = pair<int, int>;
random_device seed_gen;
mt19937_64 mtrand(seed_gen());
constexpr int MOD = 1000000007;
//////////////////////////////////////////
// セグ木
template <typename T, typename F, T UNIT> struct ST {
int size;
vector<T> seg;
F func;
ST(int N, F func) : func(func) {
size = 1;
while (size < N)
size <<= 1;
seg.assign(2 * size, UNIT);
build();
}
ST(const vector<T> &v, F func) : func(func) {
// initialize
int N = (int)v.size();
size = 1;
while (size < N)
size <<= 1;
seg.resize(2 * size);
// set
for (int i = 0; i < N; i++) {
seg[i + size] = v[i];
}
build();
}
void set(int k, T &x) { seg[k + size] = x; }
void build() {
for (int k = size - 1; k > 0; k--) {
seg[k] = func(seg[2 * k], seg[2 * k + 1]);
}
}
void update(int k, T x) {
k += size;
seg[k] = x;
while (k >>= 1) {
seg[k] = func(seg[2 * k], seg[2 * k + 1]);
}
}
T query(int a, int b) {
T L = UNIT, R = UNIT;
for (a += size, b += size; a < b; a >>= 1, b >>= 1) {
if (a & 1)
L = func(L, seg[a++]);
if (b & 1)
R = func(seg[--b], R);
}
return func(L, R);
}
T operator[](const int &k) const { return seg[k + size]; }
};
// HL分解
// 木の内部の任意の2点間をO(log_V)個に分割するデータ構造。
// これを用いることで木に対してセグ木やbitなどのデータ構造を用いることが出来る。
// 以下、内部のデータの説明。(頂点0を根とした。)
// size[i] ... iの部分木の要素数 depth[i] ... iの深さ(depth[0] = 0)
// nxt[i] ... vから根に向かって伸びるheavy pathの終着点(nxt[0] = 0)
// in[i],out[i] ... オイラーツアーした時の順番。
// [ in[i] , out[i] )で部分木へのクエリとなる。
// [ in[nxt[i]] , in[v] ]でheavy pathへのクエリとなる。
// par[i] ... iの親ノード。 (par[0] = 0)
// verify
// ABC133F https://atcoder.jp/contests/abc133/submissions/6357522
// AOJ-GRL-5C http://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=3742268#1
// AOJ-GRL-5D
// https://onlinejudge.u-aizu.ac.jp/status/users/NyaanNyaan/submissions/1/GRL_5_D/judge/3742298/C++14
// AOJ-GRL-5E
// https://onlinejudge.u-aizu.ac.jp/status/users/NyaanNyaan/submissions/1/GRL_5_E/judge/3742347/C++14
vector<vector<int>> g;
struct HLD {
int idx;
vector<int> size, depth, in, out, nxt, par;
HLD(int N, int root = 0)
: idx(0), size(N, 0), depth(N, 0), in(N, -1), out(N, -1), nxt(N, 0),
par(N, 0) {
dfs_sz(root);
trc(size);
trc(depth);
dfs_hld(root);
trc(in);
trc(out);
trc(nxt);
trc(par);
}
void build(int root) {
dfs_sz(root);
dfs_hld(root);
}
// 構築
void dfs_sz(int cur) {
size[cur] = 1;
for (auto &dst : g[cur]) {
if (dst == par[cur]) {
if (g[cur].size() >= 2 && int(dst) == int(g[cur][0]))
swap(g[cur][0], g[cur][1]);
else
continue;
}
depth[dst] = depth[cur] + 1;
par[dst] = cur;
dfs_sz(dst);
size[cur] += size[dst];
if (size[dst] > size[g[cur][0]]) {
swap(dst, g[cur][0]);
}
}
}
void dfs_hld(int cur) {
in[cur] = idx++;
for (auto dst : g[cur]) {
if (dst == par[cur])
continue;
nxt[dst] = (int(dst) == int(g[cur][0]) ? nxt[cur] : int(dst));
dfs_hld(dst);
}
out[cur] = idx;
}
// 辺クエリ
// aからbへの辺(aが根の側,bが葉の側)の持つ値をstのdata[b]に代入しているとする。
// (すなわち、辺のデータを葉の方の頂点に移し替える。)
// (注: 例外処理のためdata[0] = fの単位元とする。)
// この時、st.query(u,v + 1)はpar[u]からvまでの辺へのクエリとなる。
// (注: st.query()は引数に半開区間をため第二引数のvに1を足している。)
// これをもとに[u , v]の辺へのクエリを実装する。
template <typename F> void edge_query(int u, int v, const F &f) {
while (1) {
if (in[u] > in[v])
swap(u, v);
trc(u, v);
if (nxt[u] != nxt[v]) {
f(in[nxt[v]], in[v] + 1);
v = par[nxt[v]];
} else {
trc(u, v, in[u], in[v]);
if (u != v)
f(in[u] + 1, in[v] + 1);
break;
}
}
}
// 頂点クエリ (verifyしていない)
// 辺クエリと同様の議論をする。
// たぶん最後の同じheavy pathに載ったところを、
// in[u]+1からin[u]にかえれば正しく動くと思う。
template <typename F> void node_query(int u, int v, const F &f) {
while (1) {
if (in[u] > in[v])
swap(u, v);
trc(u, v);
if (nxt[u] != nxt[v]) {
f(in[nxt[v]], in[v] + 1);
v = par[nxt[v]];
} else {
trc(u, v, in[u], in[v]);
f(in[u], in[v] + 1);
break;
}
}
}
// 部分木クエリ
template <typename F> void sub_edge_query(int u, const F &f) {
f(in[u] + 1, out[u]);
}
template <typename F> void sub_node_query(int u, const F &f) {
f(in[u], out[u]);
}
// 最小共通祖先
int lca(int a, int b) {
while (nxt[a] != nxt[b]) {
if (in[a] < in[b])
swap(a, b);
a = par[nxt[a]];
}
return depth[a] < depth[b] ? a : b;
}
};
int main() {
ini(N, Q);
g.resize(N);
rep(i, N - 1) {
ini(a, b);
a--;
b--;
g[a].pb(b);
g[b].pb(a);
}
HLD hld(N);
auto f = [](ll a, ll b) { return a + b; };
ST<ll, decltype(f), 0LL> st(N + 1, f);
int p = 0;
ll x = 0;
auto fq = [&](int a, int b) {
st.update(a, x + st[a]);
st.update(b, -x + st[b]);
};
rep(i, Q) {
in(p, x);
p--;
hld.sub_node_query<decltype(fq)>(p, fq);
}
rep(i, N) { cout << (i ? " " : "") << st.query(0, i + 1); }
out();
}
|
#include <bits/stdc++.h>
#define whlie while
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define rep(i, N) for (int i = 0; i < (N); i++)
#define repr(i, N) for (auto i = (N)-1; i >= 0; i -= 1)
#define each(x, v) for (auto &x : v)
#define all(v) (v).begin(), (v).end()
#define sz(v) ((int)(v).size())
#define vrep(v, it) for (auto it = v.begin(); it != v.end(); it++)
#define vrepr(v, it) for (auto it = v.rbegin(); it != v.rend(); it++)
#define ini(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define inl(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define ins(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define rand mtrand
#ifdef NyaanDebug
#include "NyaanDebug.h"
#define trc(...) \
do { \
cout << #__VA_ARGS__ << " = "; \
dbg_out(__VA_ARGS__); \
} while (0)
#define trca(v, N) \
do { \
cout << #v << " = "; \
array_out(v, N); \
cout << endl; \
} while (0)
#else
#define trc(...)
#define trca(...)
#endif
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vector<int>>;
constexpr int inf = 1001001001;
constexpr ll infLL = 0x1FFFFFFFFFFFFFFFLL;
struct IoSetupNya {
IoSetupNya() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
cerr << fixed << setprecision(15);
}
} iosetupnya;
template <typename T, typename U> inline bool amin(T &x, U y) {
return (y < x) ? (x = y, true) : false;
}
template <typename T, typename U> inline bool amax(T &x, U y) {
return (x < y) ? (x = y, true) : false;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << p.first << " " << p.second;
return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
int s = (int)v.size();
rep(i, s) os << (i ? " " : "") << v[i];
return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v)
is >> x;
return is;
}
void in() {}
template <typename T, class... U> void in(T &t, U &...u) {
cin >> t;
in(u...);
}
void out() { cout << "\n"; }
template <typename T, class... U> void out(const T &t, const U &...u) {
cout << t;
if (sizeof...(u))
cout << " ";
out(u...);
}
template <typename T> void die(T x) {
out(x);
exit(0);
}
using P = pair<int, int>;
random_device seed_gen;
mt19937_64 mtrand(seed_gen());
constexpr int MOD = 1000000007;
//////////////////////////////////////////
// セグ木
template <typename T, typename F, T UNIT> struct ST {
int size;
vector<T> seg;
F func;
ST(int N, F func) : func(func) {
size = 1;
while (size < N)
size <<= 1;
seg.assign(2 * size, UNIT);
build();
}
ST(const vector<T> &v, F func) : func(func) {
// initialize
int N = (int)v.size();
size = 1;
while (size < N)
size <<= 1;
seg.resize(2 * size);
// set
for (int i = 0; i < N; i++) {
seg[i + size] = v[i];
}
build();
}
void set(int k, T &x) { seg[k + size] = x; }
void build() {
for (int k = size - 1; k > 0; k--) {
seg[k] = func(seg[2 * k], seg[2 * k + 1]);
}
}
void update(int k, T x) {
k += size;
seg[k] = x;
while (k >>= 1) {
seg[k] = func(seg[2 * k], seg[2 * k + 1]);
}
}
T query(int a, int b) {
T L = UNIT, R = UNIT;
for (a += size, b += size; a < b; a >>= 1, b >>= 1) {
if (a & 1)
L = func(L, seg[a++]);
if (b & 1)
R = func(seg[--b], R);
}
return func(L, R);
}
T operator[](const int &k) const { return seg[k + size]; }
};
// HL分解
// 木の内部の任意の2点間をO(log_V)個に分割するデータ構造。
// これを用いることで木に対してセグ木やbitなどのデータ構造を用いることが出来る。
// 以下、内部のデータの説明。(頂点0を根とした。)
// size[i] ... iの部分木の要素数 depth[i] ... iの深さ(depth[0] = 0)
// nxt[i] ... vから根に向かって伸びるheavy pathの終着点(nxt[0] = 0)
// in[i],out[i] ... オイラーツアーした時の順番。
// [ in[i] , out[i] )で部分木へのクエリとなる。
// [ in[nxt[i]] , in[v] ]でheavy pathへのクエリとなる。
// par[i] ... iの親ノード。 (par[0] = 0)
// verify
// ABC133F https://atcoder.jp/contests/abc133/submissions/6357522
// AOJ-GRL-5C http://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=3742268#1
// AOJ-GRL-5D
// https://onlinejudge.u-aizu.ac.jp/status/users/NyaanNyaan/submissions/1/GRL_5_D/judge/3742298/C++14
// AOJ-GRL-5E
// https://onlinejudge.u-aizu.ac.jp/status/users/NyaanNyaan/submissions/1/GRL_5_E/judge/3742347/C++14
vector<vector<int>> g;
struct HLD {
int idx;
vector<int> size, depth, in, out, nxt, par;
HLD(int N, int root = 0)
: idx(0), size(N, 0), depth(N, 0), in(N, -1), out(N, -1), nxt(N, 0),
par(N, 0) {
dfs_sz(root);
trc(size);
trc(depth);
dfs_hld(root);
trc(in);
trc(out);
trc(nxt);
trc(par);
}
void build(int root) {
dfs_sz(root);
dfs_hld(root);
}
// 構築
void dfs_sz(int cur) {
size[cur] = 1;
for (auto &dst : g[cur]) {
if (dst == par[cur]) {
if (g[cur].size() >= 2 && int(dst) == int(g[cur][0]))
swap(g[cur][0], g[cur][1]);
else
continue;
}
depth[dst] = depth[cur] + 1;
par[dst] = cur;
dfs_sz(dst);
size[cur] += size[dst];
if (size[dst] > size[g[cur][0]]) {
swap(dst, g[cur][0]);
}
}
}
void dfs_hld(int cur) {
in[cur] = idx++;
for (auto dst : g[cur]) {
if (dst == par[cur])
continue;
nxt[dst] = (int(dst) == int(g[cur][0]) ? nxt[cur] : int(dst));
dfs_hld(dst);
}
out[cur] = idx;
}
// 辺クエリ
// aからbへの辺(aが根の側,bが葉の側)の持つ値をstのdata[b]に代入しているとする。
// (すなわち、辺のデータを葉の方の頂点に移し替える。)
// (注: 例外処理のためdata[0] = fの単位元とする。)
// この時、st.query(u,v + 1)はpar[u]からvまでの辺へのクエリとなる。
// (注: st.query()は引数に半開区間をため第二引数のvに1を足している。)
// これをもとに[u , v]の辺へのクエリを実装する。
template <typename F> void edge_query(int u, int v, const F &f) {
while (1) {
if (in[u] > in[v])
swap(u, v);
trc(u, v);
if (nxt[u] != nxt[v]) {
f(in[nxt[v]], in[v] + 1);
v = par[nxt[v]];
} else {
trc(u, v, in[u], in[v]);
if (u != v)
f(in[u] + 1, in[v] + 1);
break;
}
}
}
// 頂点クエリ (verifyしていない)
// 辺クエリと同様の議論をする。
// たぶん最後の同じheavy pathに載ったところを、
// in[u]+1からin[u]にかえれば正しく動くと思う。
template <typename F> void node_query(int u, int v, const F &f) {
while (1) {
if (in[u] > in[v])
swap(u, v);
trc(u, v);
if (nxt[u] != nxt[v]) {
f(in[nxt[v]], in[v] + 1);
v = par[nxt[v]];
} else {
trc(u, v, in[u], in[v]);
f(in[u], in[v] + 1);
break;
}
}
}
// 部分木クエリ
template <typename F> void sub_edge_query(int u, const F &f) {
f(in[u] + 1, out[u]);
}
template <typename F> void sub_node_query(int u, const F &f) {
f(in[u], out[u]);
}
// 最小共通祖先
int lca(int a, int b) {
while (nxt[a] != nxt[b]) {
if (in[a] < in[b])
swap(a, b);
a = par[nxt[a]];
}
return depth[a] < depth[b] ? a : b;
}
};
int main() {
ini(N, Q);
g.resize(N);
rep(i, N - 1) {
ini(a, b);
a--;
b--;
g[a].pb(b);
g[b].pb(a);
}
HLD hld(N);
auto f = [](ll a, ll b) { return a + b; };
ST<ll, decltype(f), 0LL> st(N + 1, f);
int p = 0;
ll x = 0;
auto fq = [&](int a, int b) {
st.update(a, x + st[a]);
st.update(b, -x + st[b]);
};
rep(i, Q) {
in(p, x);
p--;
hld.sub_node_query<decltype(fq)>(p, fq);
}
rep(i, N) { cout << (i ? " " : "") << st.query(0, hld.in[i] + 1); }
out();
}
|
[
"call.arguments.change"
] | 739,030
| 739,031
|
u168578024
|
cpp
|
p02936
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(x, to) for (x = 0; x < (to); x++)
std::vector<int> to[200000];
std::vector<int> ans;
void dfs(int v, int p = -1) {
for (int u : to[v]) {
if (u == p)
continue;
ans[u] += ans[v];
dfs(u, v);
}
}
int main() {
int n, q;
cin >> n >> q;
for (int i = 0; i < n - 1; ++i) {
int a, b;
cin >> a >> b;
--a;
--b;
to[a].push_back(b);
to[b].push_back(a);
}
ans.resize(n);
for (int i = 0; i < q; ++i) {
int p, x;
std::cin >> p >> x;
--p;
ans[p] += x;
}
dfs(0);
for (int i = 0; i < n - 1; i++) {
cout << ans[i] << ' ';
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(x, to) for (x = 0; x < (to); x++)
std::vector<int> to[200000];
std::vector<int> ans;
void dfs(int v, int p = -1) {
for (int u : to[v]) {
if (u == p)
continue;
ans[u] += ans[v];
dfs(u, v);
}
}
int main() {
int n, q;
cin >> n >> q;
for (int i = 0; i < n - 1; ++i) {
int a, b;
cin >> a >> b;
--a;
--b;
to[a].push_back(b);
to[b].push_back(a);
}
ans.resize(n);
for (int i = 0; i < q; ++i) {
int p, x;
std::cin >> p >> x;
--p;
ans[p] += x;
}
dfs(0);
for (int i = 0; i < n; i++) {
cout << ans[i] << ' ';
}
}
|
[
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 739,049
| 739,050
|
u579754454
|
cpp
|
p02936
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n, x) for (int i = n; i < x; i++)
using ll = long long;
int main() {
int n, q;
cin >> n >> q;
vector<int> a(n - 1), b(n - 1), p(q), x(q);
rep(i, 0, n - 1) cin >> a[i] >> b[i];
rep(i, 0, q) cin >> p[i] >> x[i];
vector<ll> ans(n), r(n), ad(n);
rep(i, 0, n - 1) r[b[i] - 1] = a[i] - 1;
rep(i, 0, q) ad[p[i] - 1] = x[i];
rep(i, 0, n) ans[i] = ans[r[i]] + ad[i];
rep(i, 0, n) {
if (i > 0)
cout << " ";
cout << ans[i];
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n, x) for (int i = n; i < x; i++)
using ll = long long;
int main() {
int n, q;
cin >> n >> q;
vector<int> a(n - 1), b(n - 1), p(q), x(q);
rep(i, 0, n - 1) cin >> a[i] >> b[i];
rep(i, 0, q) cin >> p[i] >> x[i];
vector<ll> ans(n), r(n), ad(n);
rep(i, 0, n - 1) r[b[i] - 1] = a[i] - 1;
rep(i, 0, q) ad[p[i] - 1] += x[i];
rep(i, 0, n) ans[i] = ans[r[i]] + ad[i];
rep(i, 0, n) {
if (i > 0)
cout << " ";
cout << ans[i];
}
cout << endl;
return 0;
}
|
[
"assignment.value.change"
] | 739,103
| 739,104
|
u526854325
|
cpp
|
p02936
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
int main(void) {
int N, Q;
cin >> N >> Q;
vector<pair<int, int>> ab(N - 1);
vector<int> ans(N);
rep(i, N - 1) cin >> ab[i].first >> ab[i].second;
sort(ab.begin(), ab.end());
rep(i, Q) {
int p, x;
cin >> p >> x;
ans[i] += x;
}
rep(i, N - 1) ans[ab[i].second - 1] += ans[ab[i].first - 1];
rep(i, N) cout << ans[i] << " ";
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
int main(void) {
int N, Q;
cin >> N >> Q;
vector<pair<int, int>> ab(N - 1);
vector<int> ans(N);
rep(i, N - 1) cin >> ab[i].first >> ab[i].second;
sort(ab.begin(), ab.end());
rep(i, Q) {
int p, x;
cin >> p >> x;
ans[p - 1] += x;
}
rep(i, N - 1) ans[ab[i].second - 1] += ans[ab[i].first - 1];
rep(i, N) cout << ans[i] << " ";
return 0;
}
|
[
"assignment.variable.change",
"variable_access.subscript.index.change",
"assignment.change"
] | 739,107
| 739,108
|
u895536055
|
cpp
|
p02936
|
#include <bits/stdc++.h>
using namespace std;
vector<int64_t> counter;
unordered_map<int, vector<int>> edges;
void recur(int prev, int cur) {
counter[cur] += counter[prev];
for (auto next : edges[cur]) {
if (prev != next) {
recur(cur, next);
}
}
}
int main() {
int N, Q;
cin >> N >> Q;
edges.reserve((N - 1) * 2);
for (int i = 0; i < N - 1; ++i) {
int ai, bi;
cin >> ai >> bi;
edges[ai].push_back(bi);
edges[bi].push_back(ai);
}
counter.resize(N + 1);
for (int i = 0; i < Q; ++i) {
int pi, xi;
cin >> pi >> xi;
counter[pi] += xi;
}
recur(-1, 1);
bool first = true;
for (auto it = counter.cbegin() + 1; it != counter.cend(); ++it) {
if (first)
first = false;
else
cout << " ";
cout << *it;
}
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int64_t> counter;
unordered_map<int, vector<int>> edges;
void recur(int prev, int cur) {
counter[cur] += counter[prev];
for (auto next : edges[cur]) {
if (prev != next) {
recur(cur, next);
}
}
}
int main() {
int N, Q;
cin >> N >> Q;
edges.reserve((N - 1) * 2);
for (int i = 0; i < N - 1; ++i) {
int ai, bi;
cin >> ai >> bi;
edges[ai].push_back(bi);
edges[bi].push_back(ai);
}
counter.resize(N + 1);
for (int i = 0; i < Q; ++i) {
int pi, xi;
cin >> pi >> xi;
counter[pi] += xi;
}
recur(0, 1);
bool first = true;
for (auto it = counter.cbegin() + 1; it != counter.cend(); ++it) {
if (first)
first = false;
else
cout << " ";
cout << *it;
}
cout << endl;
}
|
[
"literal.number.change",
"call.arguments.change"
] | 739,109
| 739,110
|
u072825550
|
cpp
|
p02936
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const int BIG = 1e9 + 555;
const int maxN = 500 * 1000 + 9;
ll fwt[maxN];
int n, q;
int tIn[maxN], tOut[maxN], dfsTime;
bool visited[maxN];
vector<int> g[maxN];
void upd(int idx, ll v) {
for (; idx <= n; idx += idx & -idx) {
fwt[idx] += v;
}
}
ll tot(int idx) {
ll sum = 0;
for (; idx > 0; idx -= idx & -idx) {
sum += fwt[idx];
}
return sum;
}
void updTree(int root, ll v) {
int lf = tIn[root], rt = tOut[root];
upd(lf, v);
upd(rt + 1, -v);
}
void dfs(int u) {
visited[u] = true;
tIn[u] = ++dfsTime;
for (int i = 0, L = g[u].size(); i < L; i++) {
int v = g[u][i];
if (visited[v]) {
continue;
}
dfs(v);
}
tOut[u] = dfsTime;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> q;
for (int i = 0; i < n - 1; i++) {
int u, v;
cin >> u >> v;
g[u].push_back(v);
}
dfs(1);
while (q--) {
int p;
ll x;
cin >> p >> x;
updTree(p, x);
}
for (int i = 1; i <= n; i++) {
cout << tot(i) << ' ';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const int BIG = 1e9 + 555;
const int maxN = 500 * 1000 + 9;
ll fwt[maxN];
int n, q;
int tIn[maxN], tOut[maxN], dfsTime;
bool visited[maxN];
vector<int> g[maxN];
void upd(int idx, ll v) {
for (; idx < maxN; idx += idx & -idx) {
fwt[idx] += v;
}
}
ll tot(int idx) {
ll sum = 0;
for (; idx > 0; idx -= idx & -idx) {
sum += fwt[idx];
}
return sum;
}
void updTree(int root, ll v) {
int lf = tIn[root], rt = tOut[root];
upd(lf, v);
upd(rt + 1, -v);
}
void dfs(int u) {
visited[u] = true;
tIn[u] = ++dfsTime;
for (int i = 0, L = g[u].size(); i < L; i++) {
int v = g[u][i];
if (visited[v]) {
continue;
}
dfs(v);
}
tOut[u] = dfsTime;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> q;
for (int i = 0; i < n - 1; i++) {
int u, v;
cin >> u >> v;
g[u].push_back(v);
}
dfs(1);
while (q--) {
int p;
ll x;
cin >> p >> x;
updTree(p, x);
}
for (int i = 1; i <= n; i++) {
cout << tot(tIn[i]) << ' ';
}
return 0;
}
|
[
"control_flow.loop.for.condition.change",
"call.arguments.change"
] | 739,147
| 739,148
|
u482794458
|
cpp
|
p02936
|
#include <bits/stdc++.h>
using namespace std;
#define TRACE
#define M 1000000007
#define oo 1000000000000000007
#define F first
#define S second
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
#define pb push_back
#define M6 1000009
#define M5 500009
#define pi 3.14159265
#define epsilon 1e-6
#ifdef TRACE
#define trace1(x) cerr << #x << ": " << x << endl;
#define trace2(x, y) \
cerr << #x << ": " << x << " | " << #y << ": " << y << endl;
#define trace3(x, y, z) \
cerr << #x << ": " << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl;
#define trace4(a, b, c, d) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl;
#define trace5(a, b, c, d, e) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl;
#define trace6(a, b, c, d, e, f) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << endl;
#else
#define trace1(x)
#define trace2(x, y)
#define trace3(x, y, z)
#define trace4(a, b, c, d)
#define trace5(a, b, c, d, e)
#define trace6(a, b, c, d, e, f)
#endif
ll power(ll x, ll n, ll m) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = (res * x) % m;
n /= 2;
x = (x * x) % m;
}
return res;
}
ll n, m, A[M5], timer = 0, st[M5], en[M5], sum[M5], id[M5];
vector<ll> g[M5];
void dfs(ll cur, ll par) {
st[cur] = ++timer;
id[timer] = cur;
for (auto u : g[cur])
if (u != par)
dfs(u, cur);
en[cur] = timer;
}
int main() { // ios_base::sync_with_stdio (0), cin.tie (0);
// sieve();
// init();
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
ll tc = 1, t = 0, i, j, k, a, b, c, d, l, r;
// cin>>tc;
while (t++ < tc) {
// cout<<"Case #"<<t<<": ";
cin >> n >> m;
for (i = 1; i < n; i++) {
cin >> a >> b;
g[a].pb(b);
g[b].pb(a);
}
dfs(1, 0);
while (m--) {
cin >> a >> b;
sum[st[a]] += b;
sum[en[a] + 1] -= b;
}
for (i = 1; i <= n; i++)
sum[i] += sum[i - 1];
for (i = 1; i <= n; i++)
cout << sum[id[i]] << " ";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define TRACE
#define M 1000000007
#define oo 1000000000000000007
#define F first
#define S second
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
#define pb push_back
#define M6 1000009
#define M5 500009
#define pi 3.14159265
#define epsilon 1e-6
#ifdef TRACE
#define trace1(x) cerr << #x << ": " << x << endl;
#define trace2(x, y) \
cerr << #x << ": " << x << " | " << #y << ": " << y << endl;
#define trace3(x, y, z) \
cerr << #x << ": " << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl;
#define trace4(a, b, c, d) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl;
#define trace5(a, b, c, d, e) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << endl;
#define trace6(a, b, c, d, e, f) \
cerr << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << " | " << #e << ": " << e << " | " \
<< #f << ": " << f << endl;
#else
#define trace1(x)
#define trace2(x, y)
#define trace3(x, y, z)
#define trace4(a, b, c, d)
#define trace5(a, b, c, d, e)
#define trace6(a, b, c, d, e, f)
#endif
ll power(ll x, ll n, ll m) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = (res * x) % m;
n /= 2;
x = (x * x) % m;
}
return res;
}
ll n, m, A[M5], timer = 0, st[M5], en[M5], sum[M5], id[M5];
vector<ll> g[M5];
void dfs(ll cur, ll par) {
st[cur] = ++timer;
id[cur] = timer;
for (auto u : g[cur])
if (u != par)
dfs(u, cur);
en[cur] = timer;
}
int main() { // ios_base::sync_with_stdio (0), cin.tie (0);
// sieve();
// init();
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
ll tc = 1, t = 0, i, j, k, a, b, c, d, l, r;
// cin>>tc;
while (t++ < tc) {
// cout<<"Case #"<<t<<": ";
cin >> n >> m;
for (i = 1; i < n; i++) {
cin >> a >> b;
g[a].pb(b);
g[b].pb(a);
}
dfs(1, 0);
while (m--) {
cin >> a >> b;
sum[st[a]] += b;
sum[en[a] + 1] -= b;
}
for (i = 1; i <= n; i++)
sum[i] += sum[i - 1];
for (i = 1; i <= n; i++)
cout << sum[id[i]] << " ";
}
return 0;
}
|
[
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.value.change"
] | 739,149
| 739,150
|
u374517378
|
cpp
|
p02936
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define _min(x, y) x = min(x, y)
#define _max(x, y) x = max(x, y)
using namespace std;
#define MAX_NUM 200000
vector<vector<int>> path(MAX_NUM);
vector<int> p2score(MAX_NUM, 0);
void printQueue(queue<int> q) {
// printing content of queue
while (!q.empty()) {
cout << " " << q.front();
q.pop();
}
cout << endl;
}
int main() {
int n, q;
cin >> n >> q;
path[0].push_back(1);
rep(i, n - 1) {
int a, b;
cin >> a >> b;
path[a].push_back(b);
}
rep(i, q) {
int p, x;
cin >> p >> x;
p2score[p] += x;
}
queue<int> rest;
rest.push(0);
while (!rest.empty()) {
int _p = rest.front();
rest.pop();
if (path[_p].empty())
continue;
for (auto it = path[_p].begin(); it != path[_p].end(); it++) {
p2score[*it] += p2score[_p];
rest.push(*it);
}
}
rep1(i, n - 1) { cout << p2score[i] << " "; }
cout << p2score[n - 1] << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define _min(x, y) x = min(x, y)
#define _max(x, y) x = max(x, y)
using namespace std;
#define MAX_NUM 200000
vector<vector<int>> path(MAX_NUM);
vector<int> p2score(MAX_NUM, 0);
void printQueue(queue<int> q) {
// printing content of queue
while (!q.empty()) {
cout << " " << q.front();
q.pop();
}
cout << endl;
}
int main() {
int n, q;
cin >> n >> q;
path[0].push_back(1);
rep(i, n - 1) {
int a, b;
cin >> a >> b;
path[a].push_back(b);
}
rep(i, q) {
int p, x;
cin >> p >> x;
p2score[p] += x;
}
queue<int> rest;
rest.push(0);
while (!rest.empty()) {
int _p = rest.front();
rest.pop();
if (path[_p].empty())
continue;
for (auto it = path[_p].begin(); it != path[_p].end(); it++) {
p2score[*it] += p2score[_p];
rest.push(*it);
}
}
rep1(i, n - 1) { cout << p2score[i] << " "; }
cout << p2score[n] << endl;
return 0;
}
|
[
"expression.operation.binary.remove"
] | 739,164
| 739,165
|
u778614444
|
cpp
|
p02936
|
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author jcg
*/
#include <iostream>
#include <functional>
#include <iostream>
#include <numeric>
#include <vector>
class DKi {
public:
void solve(std::istream &in, std::ostream &out) {
int N, Q;
in >> N >> Q;
std::vector<std::vector<int>> g(N);
for (int i = 1; i < N; ++i) {
int a, b;
in >> a >> b;
--a, --b;
g[a].emplace_back(b);
g[b].emplace_back(a);
}
std::vector<int> ord, first(N), last(N);
std::function<void(int, int)> dfs = [&](int u, int p) {
first[u] = ord.size();
ord.emplace_back(u);
for (int v : g[u])
if (v != p)
dfs(v, u);
last[u] = ord.size();
};
dfs(0, 0);
std::vector<long long> data(N + 1);
for (int j = 0; j < Q; ++j) {
int p;
long long x;
in >> p >> x;
--p;
data[first[p]] += x;
data[last[p]] -= x;
}
std::partial_sum(data.begin(), data.end(), data.begin());
for (int i = 0; i < N; ++i)
out << data[i] << " \n"[i + 1 == N];
}
};
int main() {
std::ios_base::sync_with_stdio(0);
std::istream &in(std::cin);
std::ostream &out(std::cout);
in.tie(0);
DKi solver;
solver.solve(in, out);
return 0;
}
|
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author jcg
*/
#include <iostream>
#include <functional>
#include <iostream>
#include <numeric>
#include <vector>
class DKi {
public:
void solve(std::istream &in, std::ostream &out) {
int N, Q;
in >> N >> Q;
std::vector<std::vector<int>> g(N);
for (int i = 1; i < N; ++i) {
int a, b;
in >> a >> b;
--a, --b;
g[a].emplace_back(b);
g[b].emplace_back(a);
}
std::vector<int> ord, first(N), last(N);
std::function<void(int, int)> dfs = [&](int u, int p) {
first[u] = ord.size();
ord.emplace_back(u);
for (int v : g[u])
if (v != p)
dfs(v, u);
last[u] = ord.size();
};
dfs(0, 0);
std::vector<long long> data(N + 1);
for (int i = 0; i < Q; ++i) {
int p;
long long x;
in >> p >> x;
--p;
data[first[p]] += x;
data[last[p]] -= x;
}
std::partial_sum(data.begin(), data.end(), data.begin());
for (int i = 0; i < N; ++i)
out << data[first[i]] << " \n"[i + 1 == N];
}
};
int main() {
std::ios_base::sync_with_stdio(0);
std::istream &in(std::cin);
std::ostream &out(std::cout);
in.tie(0);
DKi solver;
solver.solve(in, out);
return 0;
}
|
[
"variable_declaration.name.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 739,166
| 739,167
|
u428138331
|
cpp
|
p02936
|
#include <bits/stdc++.h>
#define int long long
const int N = 3e5 + 10;
using namespace std;
vector<int> adj[N];
int arr[N];
void dfs(int start, int par, int sum) {
arr[start] += sum;
sum = arr[start];
for (auto v : adj[start]) {
if (v != par) {
dfs(v, start, sum);
}
}
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, q;
cin >> n >> q;
for (int i = 0; i < n - 1; i++) {
int a, b;
cin >> a >> b;
adj[a].push_back(b);
adj[b].push_back(a);
}
while (q--) {
int node, val;
cin >> node >> val;
arr[node] = val;
}
dfs(1, 0, 0);
for (int i = 1; i <= n; i++) {
cout << arr[i] << " ";
}
}
|
#include <bits/stdc++.h>
#define int long long
const int N = 3e5 + 10;
using namespace std;
vector<int> adj[N];
int arr[N];
void dfs(int start, int par, int sum) {
arr[start] += sum;
sum = arr[start];
for (auto v : adj[start]) {
if (v != par) {
dfs(v, start, sum);
}
}
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, q;
cin >> n >> q;
for (int i = 0; i < n - 1; i++) {
int a, b;
cin >> a >> b;
adj[a].push_back(b);
adj[b].push_back(a);
}
while (q--) {
int node, val;
cin >> node >> val;
arr[node] += val;
}
dfs(1, 0, 0);
for (int i = 1; i <= n; i++) {
cout << arr[i] << " ";
}
}
|
[
"assignment.value.change"
] | 739,184
| 739,185
|
u715191077
|
cpp
|
p02936
|
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vii vector<int>
#define vll vector<ll>
#define lb lower_bound
#define pb push_back
#define mp make_pair
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep2(i, a, b) for (ll i = a; i < b; i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define all(x) x.begin(), x.end()
#define INF (ll)1e9 + 7
#define LLINF (ll)1e30
// #define int ll
using namespace std;
const int MAX = 101010;
const int MOD = 1e9 + 7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
ll n, q, sum[200010];
vector<ll> G[200010];
bool V[200010];
cin >> n >> q;
rep(i, n - 1) {
int a, b;
cin >> a >> b;
G[a].pb(b);
G[b].pb(a);
}
rep(i, q) {
int p, x;
cin >> p >> x;
sum[p] += x;
}
queue<ll> que;
que.push(1);
while (!que.empty()) {
ll u = que.front();
que.pop();
V[u] = 1;
for (auto i : G[u]) {
if (V[i] = 1)
continue;
sum[i] += sum[u];
que.push(i);
}
}
rep2(i, 1, n + 1) { cout << sum[i] << " "; }
cout << endl;
return 0;
}
|
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vii vector<int>
#define vll vector<ll>
#define lb lower_bound
#define pb push_back
#define mp make_pair
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep2(i, a, b) for (ll i = a; i < b; i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define all(x) x.begin(), x.end()
#define INF (ll)1e9 + 7
#define LLINF (ll)1e30
// #define int ll
using namespace std;
const int MAX = 101010;
const int MOD = 1e9 + 7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
ll n, q, sum[200010];
vector<ll> G[200010];
bool V[200010];
cin >> n >> q;
rep(i, n - 1) {
int a, b;
cin >> a >> b;
G[a].pb(b);
G[b].pb(a);
}
rep(i, q) {
int p, x;
cin >> p >> x;
sum[p] += x;
}
queue<ll> que;
que.push(1);
while (!que.empty()) {
ll u = que.front();
que.pop();
V[u] = 1;
for (auto i : G[u]) {
if (V[i] == 1)
continue;
sum[i] += sum[u];
que.push(i);
}
}
rep2(i, 1, n + 1) { cout << sum[i] << " "; }
cout << endl;
return 0;
}
|
[
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 739,200
| 739,201
|
u241367243
|
cpp
|
p02936
|
// Sani buyuk Osman Pasa Plevneden cikmam diyor.
// FatihSultanMehmedHan
// Abdulhamid Han
// Bismillahirrahmanirrahim
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█▄█
//█─█─█▄─█▄─█─█─█─█
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef pair<int, int> PII;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define int long long int
#define fio() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define FOR for (lo i = 1; i <= n; i++)
#define mid ((start + end) / 2)
#define ort ((bas + son) / 2)
const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;
int n, sz, m, b[li], a[li], k, flag, t, basla[li], bitir[li], x, y,
tree[4 * li], lazy[li * 4], vis[li];
int cev;
string s;
vector<int> v[li];
inline void push(int node, int start, int end) {
if (lazy[node] == 0)
return;
tree[node] += lazy[node];
if (start != end) {
lazy[node * 2] += lazy[node];
lazy[node * 2 + 1] += lazy[node];
}
lazy[node] = 0;
}
inline void update(int node, int start, int end, int l, int r, int val) {
push(node, start, end);
if (start > end || start > r || end < l)
return;
if (start >= l && end <= r) {
lazy[node] += val;
push(node, start, end);
return;
}
update(node * 2, start, mid, l, r, val),
update(node * 2 + 1, mid + 1, end, l, r, val);
tree[node] = tree[node * 2] + tree[node * 2 + 1];
}
inline int query(int node, int start, int end, int l, int r) {
if (start > end || start > r || end < l)
return 0;
push(node, start, end);
if (start >= l && end <= r) {
return tree[node];
}
return query(node * 2, start, mid, l, r) +
query(node * 2 + 1, mid + 1, end, l, r);
}
inline void dfs(lo node) {
vis[node] = 1;
//~ if()
a[node] = ++sz;
basla[node] = sz;
bitir[node] = sz;
for (lo i = 0; i < (lo)v[node].size(); i++) {
lo go = v[node][i];
if (vis[go] == 1)
continue;
dfs(go);
bitir[node] = max(bitir[node], bitir[go]);
}
}
main(void) {
scanf("%lld %lld", &n, &m);
for (lo i = 1; i < n; i++) {
scanf("%lld %lld", &x, &y);
v[x].pb(y);
v[y].pb(x);
}
dfs(1);
for (lo i = 1; i <= m; i++) {
scanf("%lld %lld", &x, &y);
update(1, 1, n, basla[a[x]], bitir[a[x]], y);
}
FOR { printf("%lld ", query(1, 1, n, a[i], a[i])); }
return 0;
}
|
// Sani buyuk Osman Pasa Plevneden cikmam diyor.
// FatihSultanMehmedHan
// Abdulhamid Han
// Bismillahirrahmanirrahim
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█▄█
//█─█─█▄─█▄─█─█─█─█
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long lo;
typedef pair<int, int> PII;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define int long long int
#define fio() \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define FOR for (lo i = 1; i <= n; i++)
#define mid ((start + end) / 2)
#define ort ((bas + son) / 2)
const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;
int n, sz, m, b[li], a[li], k, flag, t, basla[li], bitir[li], x, y,
tree[4 * li], lazy[li * 4], vis[li];
int cev;
string s;
vector<int> v[li];
inline void push(int node, int start, int end) {
if (lazy[node] == 0)
return;
tree[node] += lazy[node];
if (start != end) {
lazy[node * 2] += lazy[node];
lazy[node * 2 + 1] += lazy[node];
}
lazy[node] = 0;
}
inline void update(int node, int start, int end, int l, int r, int val) {
push(node, start, end);
if (start > end || start > r || end < l)
return;
if (start >= l && end <= r) {
lazy[node] += val;
push(node, start, end);
return;
}
update(node * 2, start, mid, l, r, val),
update(node * 2 + 1, mid + 1, end, l, r, val);
tree[node] = tree[node * 2] + tree[node * 2 + 1];
}
inline int query(int node, int start, int end, int l, int r) {
if (start > end || start > r || end < l)
return 0;
push(node, start, end);
if (start >= l && end <= r) {
return tree[node];
}
return query(node * 2, start, mid, l, r) +
query(node * 2 + 1, mid + 1, end, l, r);
}
inline void dfs(lo node) {
vis[node] = 1;
//~ if()
a[node] = ++sz;
basla[node] = sz;
bitir[node] = sz;
for (lo i = 0; i < (lo)v[node].size(); i++) {
lo go = v[node][i];
if (vis[go] == 1)
continue;
dfs(go);
bitir[node] = max(bitir[node], bitir[go]);
}
}
main(void) {
scanf("%lld %lld", &n, &m);
for (lo i = 1; i < n; i++) {
scanf("%lld %lld", &x, &y);
v[x].pb(y);
v[y].pb(x);
}
dfs(1);
for (lo i = 1; i <= m; i++) {
scanf("%lld %lld", &x, &y);
update(1, 1, n, basla[x], bitir[x], y);
}
FOR { printf("%lld ", query(1, 1, n, a[i], a[i])); }
return 0;
}
|
[
"call.arguments.change"
] | 739,217
| 739,218
|
u050607149
|
cpp
|
p02936
|
#include <bits/stdc++.h>
using namespace std;
int n, q, va[200010], ans[200010];
vector<int> my_map[200010];
bool visited[200010];
void dfs(int now, int value) {
value += va[now];
ans[now] = value;
int t = my_map[now].size();
for (int i = 0; i < t; ++i) {
if (visited[my_map[now][i]])
continue;
visited[now] = 1;
dfs(my_map[now][i], value);
}
}
int main() {
cin >> n >> q;
memset(va, 0, sizeof(va));
memset(ans, 0, sizeof(ans));
for (int i = 1; i < n; ++i) {
int x, y;
cin >> x >> y;
my_map[x].push_back(y);
my_map[y].push_back(x);
}
for (int i = 1; i <= q; ++i) {
int x, y;
cin >> x >> y;
va[x] = y;
}
visited[1] = 1;
dfs(1, 0);
for (int i = 1; i <= n; ++i)
cout << ans[i] << ' ';
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, q, va[200010], ans[200010];
vector<int> my_map[200010];
bool visited[200010];
void dfs(int now, int value) {
value += va[now];
ans[now] = value;
int t = my_map[now].size();
for (int i = 0; i < t; ++i) {
if (visited[my_map[now][i]])
continue;
visited[now] = 1;
dfs(my_map[now][i], value);
}
}
int main() {
cin >> n >> q;
memset(va, 0, sizeof(va));
memset(ans, 0, sizeof(ans));
for (int i = 1; i < n; ++i) {
int x, y;
cin >> x >> y;
my_map[x].push_back(y);
my_map[y].push_back(x);
}
for (int i = 1; i <= q; ++i) {
int x, y;
cin >> x >> y;
va[x] += y;
}
visited[1] = 1;
dfs(1, 0);
for (int i = 1; i <= n; ++i)
cout << ans[i] << ' ';
cout << endl;
return 0;
}
|
[
"assignment.value.change"
] | 739,219
| 739,220
|
u611637797
|
cpp
|
p02936
|
/**
OJ :
Program Code :
Md. Mujahedul Azad (Turin)
Hajee Mohammad Danesh Science & Technology University
**/
#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
/// #include<bits/stdc++.h>
using namespace std;
#define ff first
#define se second
#define nl << '\n'
#define gf << ' ' <<
#define pb push_back
#define pi 2 * acos(0.0)
#define sq(a) ((a) * (a))
#define Sort(a) sort(all(a))
#define sz(x) (int)x.size()
#define fillAra(a, n, v) fill(a, a + n, v)
#define fillVec(a, v) fill(all(a), v)
#define btz(a) __builtin_ctz(a)
#define all(v) v.begin(), v.end()
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define abs(x) (((x) < 0) ? -(x) : (x))
#define parity(a) __builtin_parity(a)
#define maxall(v) *max_element(all(v))
#define minall(v) *min_element(all(v))
#define cinIg \
cin.sync(); \
cin.get()
#define countOne(a) __builtin_popcount(a)
#define mem(a, v) memset(a, v, sizeof(a))
#define RSort(a) Sort(a), reverse(all(a))
#define precision(x) cout << setprecision(x) << fixed
#define un(a) Sort(a), (a).erase(unique(all(a)), a.end())
#define FasterIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define TestCases \
int cases, tc; \
sfi(tc); \
for (cases = 1; cases <= tc; cases++)
#define TestCasespp \
int cases, tc; \
cin >> tc; \
for (cases = 1; cases <= tc; cases++)
#define common(a, b) \
Sort(a), Sort(b), \
a.erase(set_intersection(all(a), all(b), a.begin()), a.end())
#define uncommon(a, b) \
Sort(a), Sort(b), \
a.erase(set_symmetric_difference(all(a), all(b), a.begin()), a.end())
/**------- ShortCuts----------*/
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> iii;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vii;
typedef vector<iii> viii;
typedef vector<vi> vvi;
typedef map<int, int> mapii;
typedef map<int, bool> mapib;
typedef map<int, string> mapis;
typedef set<int> seti;
/**------- Char Chk----------*/
inline bool isLow(char ch) {
if (ch >= 'a' && ch <= 'z')
return true;
return false;
}
inline bool isUpp(char ch) {
if (ch >= 'A' && ch <= 'Z')
return true;
return false;
}
inline bool isDig(char ch) {
if (ch >= '0' && ch <= '9')
return true;
return false;
}
/**------- Double Chk----------*/
inline bool are_equal(db a, db b) {
return fabs(a - b) < numeric_limits<db>::epsilon();
}
inline bool less_than(db a, db b) {
return (b - a) > ((fabs(a) < fabs(b) ? fabs(b) : fabs(a)) *
numeric_limits<db>::epsilon());
}
inline bool greater_than(db a, db b) {
return (a - b) > ((fabs(a) < fabs(b) ? fabs(b) : fabs(a)) *
numeric_limits<db>::epsilon());
}
/**------- Functions ---------*/
template <typename T> string toString(T x) {
stringstream ss;
ss << x;
return ss.str();
}
template <typename T> T stringToT(string s, T a) {
T p;
istringstream ss(s);
ss >> p;
return p;
}
template <typename T> T SOD(T n) {
__typeof(n) sum = 0, i = 1;
for (; i * i <= n; i++)
sum += (n % i) ? 0 : ((sq(i) == n) ? i : i + n / i);
return sum;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, const pair<T, S> &v) {
os << "(" << v.ff << ", " << v.se << ")";
return os;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, const map<T, S> &v) {
for (auto it : v)
os << it.ff << " : " << it.se nl;
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &v) {
os << "[";
for (auto it : v) {
os << it;
if (it != *v.rbegin())
os << ", ";
}
os << "]";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "[";
for (int i = 0; i < v.size(); i++) {
os << v[i];
if (i != sz(v) - 1)
os << ", ";
}
os << "]";
return os;
}
/**--------Loops--------------*/
#define frab(i, a, b) for (__typeof(b) i = (a); i <= (b); i++)
#define fr0(i, n) frab(i, 0, n - 1)
#define fr1(i, n) frab(i, 1, n)
#define rfab(i, a, b) for (__typeof(b) i = (b); i >= (a); i--)
#define rf0(i, n) rfab(i, 0, n - 1)
#define rf1(i, n) rfab(i, 1, n)
/**------- Scanf----------*/
#define sf scanf
#define sfs(a) scanf("%s", a)
#define sfc(a) scanf("%c", &a)
#define sfi(a) scanf("%d", &a)
#define sfd(a) scanf("%lf", &a)
#define sfl(a) scanf("%lld", &a)
#define sfu(a) scanf("%llu", &a)
#define sfin(a, i, n) fr0(i, n) sfi(a[i])
#define sfln(a, i, n) fr0(i, n) sfl(a[i])
#define sfii(a, b) scanf("%d %d", &a, &b)
#define sfdd(a, b) scanf("%lf %lf", &a, &b)
#define sfll(a, b) scanf("%lld %lld", &a, &b)
#define sfuu(a, b) scanf("%llu %llu", &a, &b)
#define sfiii(a, b, c) scanf("%d %d %d", &a, &b, &c)
#define sfddd(a, b, c) scanf("%lf %lf %lf", &a, &b, &c)
#define sflll(a, b, c) scanf("%lld %lld %lld", &a, &b, &c)
#define sfuuu(a, b, c) scanf("%llu %llu %llu", &a, &b, &c)
/**------- Printf----------*/
#define pf printf
#define pnl puts("")
#define pfgap printf(" ")
#define pfig(a) printf("%d ", a)
#define pfc(a) printf("%c\n", a)
#define pfi(a) printf("%d\n", a)
#define pfs(a) printf("%s\n", a)
#define pflg(a) printf("%lld ", a)
#define pfl(a) printf("%lld\n", a)
#define pfu(a) printf("%llu\n", a)
#define pfd(a) printf("%.2lf\n", a)
#define pfii(a, b) printf("%d %d\n", a, b)
#define pfll(a, b) printf("%lld %lld\n", a, b)
#define pfuu(a, b) printf("%llu %llu\n", a, b)
#define pfdd(a, b) printf("%.2lf %.2lf\n", a, b)
#define pfiii(a, b, c) printf("%d %d %d\n", a, b, c)
#define pflll(a, b, c) printf("%lld %lld %lld\n", a, b, c)
#define pfuuu(a, b, c) printf("%llu %llu %llu\n", a, b, c)
#define pfin(a, i, n) \
fr0(i, n) { \
if (i) \
pfgap; \
pfig(a[i]); \
}
#define pfln(a, i, n) \
fr0(i, n) { \
if (i) \
pfgap; \
pflg(a[i]); \
}
#define pfddd(a, b, c) printf("%.2lf %.2lf %.2lf\n", a, b, c)
/**--------File------------*/
#define inOut \
{ \
input; \
output; \
}
#define Case printf("Case %d: ", cases)
#define input freopen("input.txt", "r", stdin)
#define Casepp cout << "Case " << cases << ": "
#define output freopen("output.txt", "w", stdout)
/**--------Constant------------*/
#define eps 1e-9
#define mx2 101
#define mx3 1001
#define mx4 10001
#define mx5 100001
#define mx6 1000001
#define INF 0x3f3f3f3f
/**-------Upper & Lower Bound-------*/
#define LB(a, v) (lower_bound(all(a), v))
#define UB(a, v) (upper_bound(all(a), v))
/**--------DeBug------------*/
#define watch(x) cout << (#x) << " is " << x << "\n"
#define chk \
cout << "Wtf" \
<< "\n"
const int mod = 1e9 + 7;
const int mx = 2 * mx5;
int n, q;
vi adj[mx];
int val[mx], vis[mx];
void dfs(int u, int v) {
val[u] += v;
vis[u] = 1;
for (auto vv : adj[u])
if (!vis[vv])
dfs(vv, val[u]);
}
int main() {
FasterIO;
cin >> n >> q;
int m = n - 1;
while (m--) {
int u, v;
cin >> u >> v;
adj[u].pb(v);
adj[v].pb(u);
}
while (q--) {
int u, v;
cin >> u >> v;
val[u] = v;
}
dfs(1, 0);
fr1(i, n) if (i == 1) cout << val[i];
else cout << " " << val[i];
cout << endl;
return 0;
}
|
/**
OJ :
Program Code :
Md. Mujahedul Azad (Turin)
Hajee Mohammad Danesh Science & Technology University
**/
#include <algorithm>
#include <cassert>
#include <cctype>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
/// #include<bits/stdc++.h>
using namespace std;
#define ff first
#define se second
#define nl << '\n'
#define gf << ' ' <<
#define pb push_back
#define pi 2 * acos(0.0)
#define sq(a) ((a) * (a))
#define Sort(a) sort(all(a))
#define sz(x) (int)x.size()
#define fillAra(a, n, v) fill(a, a + n, v)
#define fillVec(a, v) fill(all(a), v)
#define btz(a) __builtin_ctz(a)
#define all(v) v.begin(), v.end()
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define abs(x) (((x) < 0) ? -(x) : (x))
#define parity(a) __builtin_parity(a)
#define maxall(v) *max_element(all(v))
#define minall(v) *min_element(all(v))
#define cinIg \
cin.sync(); \
cin.get()
#define countOne(a) __builtin_popcount(a)
#define mem(a, v) memset(a, v, sizeof(a))
#define RSort(a) Sort(a), reverse(all(a))
#define precision(x) cout << setprecision(x) << fixed
#define un(a) Sort(a), (a).erase(unique(all(a)), a.end())
#define FasterIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define TestCases \
int cases, tc; \
sfi(tc); \
for (cases = 1; cases <= tc; cases++)
#define TestCasespp \
int cases, tc; \
cin >> tc; \
for (cases = 1; cases <= tc; cases++)
#define common(a, b) \
Sort(a), Sort(b), \
a.erase(set_intersection(all(a), all(b), a.begin()), a.end())
#define uncommon(a, b) \
Sort(a), Sort(b), \
a.erase(set_symmetric_difference(all(a), all(b), a.begin()), a.end())
/**------- ShortCuts----------*/
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> iii;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vii;
typedef vector<iii> viii;
typedef vector<vi> vvi;
typedef map<int, int> mapii;
typedef map<int, bool> mapib;
typedef map<int, string> mapis;
typedef set<int> seti;
/**------- Char Chk----------*/
inline bool isLow(char ch) {
if (ch >= 'a' && ch <= 'z')
return true;
return false;
}
inline bool isUpp(char ch) {
if (ch >= 'A' && ch <= 'Z')
return true;
return false;
}
inline bool isDig(char ch) {
if (ch >= '0' && ch <= '9')
return true;
return false;
}
/**------- Double Chk----------*/
inline bool are_equal(db a, db b) {
return fabs(a - b) < numeric_limits<db>::epsilon();
}
inline bool less_than(db a, db b) {
return (b - a) > ((fabs(a) < fabs(b) ? fabs(b) : fabs(a)) *
numeric_limits<db>::epsilon());
}
inline bool greater_than(db a, db b) {
return (a - b) > ((fabs(a) < fabs(b) ? fabs(b) : fabs(a)) *
numeric_limits<db>::epsilon());
}
/**------- Functions ---------*/
template <typename T> string toString(T x) {
stringstream ss;
ss << x;
return ss.str();
}
template <typename T> T stringToT(string s, T a) {
T p;
istringstream ss(s);
ss >> p;
return p;
}
template <typename T> T SOD(T n) {
__typeof(n) sum = 0, i = 1;
for (; i * i <= n; i++)
sum += (n % i) ? 0 : ((sq(i) == n) ? i : i + n / i);
return sum;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, const pair<T, S> &v) {
os << "(" << v.ff << ", " << v.se << ")";
return os;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, const map<T, S> &v) {
for (auto it : v)
os << it.ff << " : " << it.se nl;
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &v) {
os << "[";
for (auto it : v) {
os << it;
if (it != *v.rbegin())
os << ", ";
}
os << "]";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "[";
for (int i = 0; i < v.size(); i++) {
os << v[i];
if (i != sz(v) - 1)
os << ", ";
}
os << "]";
return os;
}
/**--------Loops--------------*/
#define frab(i, a, b) for (__typeof(b) i = (a); i <= (b); i++)
#define fr0(i, n) frab(i, 0, n - 1)
#define fr1(i, n) frab(i, 1, n)
#define rfab(i, a, b) for (__typeof(b) i = (b); i >= (a); i--)
#define rf0(i, n) rfab(i, 0, n - 1)
#define rf1(i, n) rfab(i, 1, n)
/**------- Scanf----------*/
#define sf scanf
#define sfs(a) scanf("%s", a)
#define sfc(a) scanf("%c", &a)
#define sfi(a) scanf("%d", &a)
#define sfd(a) scanf("%lf", &a)
#define sfl(a) scanf("%lld", &a)
#define sfu(a) scanf("%llu", &a)
#define sfin(a, i, n) fr0(i, n) sfi(a[i])
#define sfln(a, i, n) fr0(i, n) sfl(a[i])
#define sfii(a, b) scanf("%d %d", &a, &b)
#define sfdd(a, b) scanf("%lf %lf", &a, &b)
#define sfll(a, b) scanf("%lld %lld", &a, &b)
#define sfuu(a, b) scanf("%llu %llu", &a, &b)
#define sfiii(a, b, c) scanf("%d %d %d", &a, &b, &c)
#define sfddd(a, b, c) scanf("%lf %lf %lf", &a, &b, &c)
#define sflll(a, b, c) scanf("%lld %lld %lld", &a, &b, &c)
#define sfuuu(a, b, c) scanf("%llu %llu %llu", &a, &b, &c)
/**------- Printf----------*/
#define pf printf
#define pnl puts("")
#define pfgap printf(" ")
#define pfig(a) printf("%d ", a)
#define pfc(a) printf("%c\n", a)
#define pfi(a) printf("%d\n", a)
#define pfs(a) printf("%s\n", a)
#define pflg(a) printf("%lld ", a)
#define pfl(a) printf("%lld\n", a)
#define pfu(a) printf("%llu\n", a)
#define pfd(a) printf("%.2lf\n", a)
#define pfii(a, b) printf("%d %d\n", a, b)
#define pfll(a, b) printf("%lld %lld\n", a, b)
#define pfuu(a, b) printf("%llu %llu\n", a, b)
#define pfdd(a, b) printf("%.2lf %.2lf\n", a, b)
#define pfiii(a, b, c) printf("%d %d %d\n", a, b, c)
#define pflll(a, b, c) printf("%lld %lld %lld\n", a, b, c)
#define pfuuu(a, b, c) printf("%llu %llu %llu\n", a, b, c)
#define pfin(a, i, n) \
fr0(i, n) { \
if (i) \
pfgap; \
pfig(a[i]); \
}
#define pfln(a, i, n) \
fr0(i, n) { \
if (i) \
pfgap; \
pflg(a[i]); \
}
#define pfddd(a, b, c) printf("%.2lf %.2lf %.2lf\n", a, b, c)
/**--------File------------*/
#define inOut \
{ \
input; \
output; \
}
#define Case printf("Case %d: ", cases)
#define input freopen("input.txt", "r", stdin)
#define Casepp cout << "Case " << cases << ": "
#define output freopen("output.txt", "w", stdout)
/**--------Constant------------*/
#define eps 1e-9
#define mx2 101
#define mx3 1001
#define mx4 10001
#define mx5 100001
#define mx6 1000001
#define INF 0x3f3f3f3f
/**-------Upper & Lower Bound-------*/
#define LB(a, v) (lower_bound(all(a), v))
#define UB(a, v) (upper_bound(all(a), v))
/**--------DeBug------------*/
#define watch(x) cout << (#x) << " is " << x << "\n"
#define chk \
cout << "Wtf" \
<< "\n"
const int mod = 1e9 + 7;
const int mx = 2 * mx5;
int n, q;
vi adj[mx];
int val[mx], vis[mx];
void dfs(int u, int v) {
val[u] += v;
vis[u] = 1;
for (auto vv : adj[u])
if (!vis[vv])
dfs(vv, val[u]);
}
int main() {
FasterIO;
cin >> n >> q;
int m = n - 1;
while (m--) {
int u, v;
cin >> u >> v;
adj[u].pb(v);
adj[v].pb(u);
}
while (q--) {
int u, v;
cin >> u >> v;
val[u] += v;
}
dfs(1, 0);
fr1(i, n) if (i == 1) cout << val[i];
else cout << " " << val[i];
cout << endl;
return 0;
}
|
[
"assignment.value.change"
] | 739,231
| 739,232
|
u294473317
|
cpp
|
p02936
|
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author tatsumack
*/
#include <fstream>
#include <iostream>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define int long long
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPS(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define FOR(i, a, b) for (int i = (a), i##_len = (b); i <= i##_len; ++i)
#define REV(i, a, b) for (int i = (a); i >= (b); --i)
#define CLR(a, b) memset((a), (b), sizeof(a))
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define INF 1001001001001001001ll
#define fcout cout << fixed << setprecision(12)
using namespace std;
typedef pair<int, int> P;
class DKi {
public:
static constexpr int kStressIterations = 0;
static void generateTest(std::ostream &test) {}
vector<vector<int>> G;
vector<int> res, P;
void dfs(int v, int p, int cur) {
res[v] = cur + P[v];
REP(i, G[v].size()) {
int to = G[v][i];
if (to == p)
continue;
dfs(to, v, cur + P[v]);
}
}
void solve(std::istream &cin, std::ostream &cout) {
int N, Q;
cin >> N >> Q;
G.resize(N), res.resize(N);
REP(i, N - 1) {
int a, b;
cin >> a >> b;
a--, b--;
G[a].push_back(b);
G[b].push_back(a);
}
P.resize(Q);
REP(i, Q) {
int p, x;
cin >> p >> x;
p--;
P[p] += x;
}
dfs(0, -1, 0);
REP(i, N) { cout << res[i] << " "; }
}
};
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
std::istream &in(std::cin);
std::ostream &out(std::cout);
DKi solver;
solver.solve(in, out);
return 0;
}
|
/**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author tatsumack
*/
#include <fstream>
#include <iostream>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define int long long
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPS(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define FOR(i, a, b) for (int i = (a), i##_len = (b); i <= i##_len; ++i)
#define REV(i, a, b) for (int i = (a); i >= (b); --i)
#define CLR(a, b) memset((a), (b), sizeof(a))
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define INF 1001001001001001001ll
#define fcout cout << fixed << setprecision(12)
using namespace std;
typedef pair<int, int> P;
class DKi {
public:
static constexpr int kStressIterations = 0;
static void generateTest(std::ostream &test) {}
vector<vector<int>> G;
vector<int> res, P;
void dfs(int v, int p, int cur) {
res[v] = cur + P[v];
REP(i, G[v].size()) {
int to = G[v][i];
if (to == p)
continue;
dfs(to, v, cur + P[v]);
}
}
void solve(std::istream &cin, std::ostream &cout) {
int N, Q;
cin >> N >> Q;
G.resize(N), res.resize(N);
REP(i, N - 1) {
int a, b;
cin >> a >> b;
a--, b--;
G[a].push_back(b);
G[b].push_back(a);
}
P.resize(N);
REP(i, Q) {
int p, x;
cin >> p >> x;
p--;
P[p] += x;
}
dfs(0, -1, 0);
REP(i, N) { cout << res[i] << " "; }
}
};
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
std::istream &in(std::cin);
std::ostream &out(std::cout);
DKi solver;
solver.solve(in, out);
return 0;
}
|
[
"identifier.change",
"call.arguments.change"
] | 739,233
| 739,234
|
u516353059
|
cpp
|
p02936
|
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mod 1000000007
#define all(v) v.begin(), v.end()
#define MP make_pair
#define F first
#define S second
#define sz(v) (ll) v.size()
#define inf 100000000000000
#define vll vector<ll>
#define pll pair<ll, ll> nnnn
using namespace std;
const int N = 200004;
ll a[N], vis[N], tim, in[N], out[N];
vll adj[N];
void dfs(ll r) {
vis[r] = 1;
in[r] = ++tim;
for (auto it : adj[r]) {
if (!vis[it])
dfs(it);
}
out[r] = tim;
}
void solve() {
ll n, q, u, v, i, x, y;
cin >> n >> q;
for (i = 1; i < n; i++) {
cin >> u >> v;
adj[u].pb(v);
adj[v].pb(u);
}
dfs(1);
while (q--) {
cin >> x >> y;
a[in[x]] += y;
a[out[x] + 1] -= y;
}
for (i = 2; i <= n; i++)
a[i] += a[i - 1];
for (i = 1; i <= n; i++)
cout << a[i] << " ";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll t = 1;
// cin>>t;
while (t--)
solve();
return 0;
}
|
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mod 1000000007
#define all(v) v.begin(), v.end()
#define MP make_pair
#define F first
#define S second
#define sz(v) (ll) v.size()
#define inf 100000000000000
#define vll vector<ll>
#define pll pair<ll, ll> nnnn
using namespace std;
const int N = 200004;
ll a[N], vis[N], tim, in[N], out[N];
vll adj[N];
void dfs(ll r) {
vis[r] = 1;
in[r] = ++tim;
for (auto it : adj[r])
if (!vis[it])
dfs(it);
out[r] = tim;
}
void solve() {
ll n, q, u, v, i, x, y;
cin >> n >> q;
for (i = 1; i < n; i++) {
cin >> u >> v;
adj[u].pb(v);
adj[v].pb(u);
}
dfs(1);
while (q--) {
cin >> x >> y;
a[in[x]] += y;
a[out[x] + 1] -= y;
}
for (i = 2; i <= n; i++)
a[i] += a[i - 1];
for (i = 1; i <= n; i++)
cout << a[in[i]] << " ";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll t = 1;
// cin>>t;
while (t--)
solve();
return 0;
}
|
[] | 739,250
| 739,251
|
u850006519
|
cpp
|
p02936
|
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define pb push_back
#define umax(x, y) x = max(x, (y))
#define umin(x, y) x = min(x, (y))
#define For(i, a) for (int i = 1; i <= a; i++)
#define ort (b + s) / 2
#define y2 asrwjaelkf
#define y1 asseopirwjaelkf
#define set multiset
using namespace std;
typedef long long Lint;
typedef double db;
typedef pair<int, int> ii;
typedef pair<int, char> ic;
typedef pair<db, db> dd;
typedef pair<ii, int> iii;
typedef pair<ii, ii> i4;
const int maxn = 1000020;
const int maxm = 1000020;
const int MOd = 998244353;
int a, q, ar[maxn];
int beg[maxn], en[maxn], cnt;
Lint T[maxn];
vector<int> w[maxn];
void dfs(int n, int back) {
beg[n] = ++cnt;
for (int i = 0; i < w[n].size(); i++)
if (w[n][i] != back)
dfs(w[n][i], n);
en[n] = cnt;
}
int main() {
// freopen("asd.in","r",stdin);
// freopen("output17.txt","w",stdout);
string s;
scanf("%d %d", &a, &q);
for (int i = 1, j, k; i < a; i++) {
scanf("%d %d", &j, &k);
w[j].pb(k);
w[k].pb(j);
}
dfs(1, 0);
for (int i = 1, x, y; i <= q; i++) {
scanf("%d %d", &x, &y);
T[beg[x]] += y;
T[en[x] + 1] -= y;
}
for (int i = 2; i <= a; i++)
T[i] += T[i - 1];
for (int i = 1; i <= a; i++)
printf("%lld ", T[i]);
printf("\n");
return 0;
}
|
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define pb push_back
#define umax(x, y) x = max(x, (y))
#define umin(x, y) x = min(x, (y))
#define For(i, a) for (int i = 1; i <= a; i++)
#define ort (b + s) / 2
#define y2 asrwjaelkf
#define y1 asseopirwjaelkf
#define set multiset
using namespace std;
typedef long long Lint;
typedef double db;
typedef pair<int, int> ii;
typedef pair<int, char> ic;
typedef pair<db, db> dd;
typedef pair<ii, int> iii;
typedef pair<ii, ii> i4;
const int maxn = 1000020;
const int maxm = 1000020;
const int MOd = 998244353;
int a, q, ar[maxn];
int beg[maxn], en[maxn], cnt;
Lint T[maxn];
vector<int> w[maxn];
void dfs(int n, int back) {
beg[n] = ++cnt;
for (int i = 0; i < w[n].size(); i++)
if (w[n][i] != back)
dfs(w[n][i], n);
en[n] = cnt;
}
int main() {
// freopen("asd.in","r",stdin);
// freopen("output17.txt","w",stdout);
string s;
scanf("%d %d", &a, &q);
for (int i = 1, j, k; i < a; i++) {
scanf("%d %d", &j, &k);
w[j].pb(k);
w[k].pb(j);
}
dfs(1, 0);
for (int i = 1, x, y; i <= q; i++) {
scanf("%d %d", &x, &y);
T[beg[x]] += y;
T[en[x] + 1] -= y;
}
for (int i = 2; i <= a; i++)
T[i] += T[i - 1];
for (int i = 1; i <= a; i++)
printf("%lld ", T[beg[i]]);
printf("\n");
return 0;
}
|
[
"call.arguments.change"
] | 739,254
| 739,255
|
u175295878
|
cpp
|
p02936
|
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define pb push_back
#define umax(x, y) x = max(x, (y))
#define umin(x, y) x = min(x, (y))
#define For(i, a) for (int i = 1; i <= a; i++)
#define ort (b + s) / 2
#define y2 asrwjaelkf
#define y1 asseopirwjaelkf
#define set multiset
using namespace std;
typedef long long Lint;
typedef double db;
typedef pair<int, int> ii;
typedef pair<int, char> ic;
typedef pair<db, db> dd;
typedef pair<ii, int> iii;
typedef pair<ii, ii> i4;
const int maxn = 100020;
const int maxm = 1000020;
const int MOd = 998244353;
int a, q, ar[maxn];
int beg[maxn], en[maxn], cnt;
Lint T[maxn];
vector<int> w[maxn];
void dfs(int n, int back) {
beg[n] = ++cnt;
for (int i = 0; i < w[n].size(); i++)
if (w[n][i] != back)
dfs(w[n][i], n);
en[n] = cnt;
}
int main() {
// freopen("asd.in","r",stdin);
// freopen("output17.txt","w",stdout);
string s;
scanf("%d %d", &a, &q);
for (int i = 1, j, k; i < a; i++) {
scanf("%d %d", &j, &k);
w[j].pb(k);
w[k].pb(j);
}
dfs(1, 0);
for (int i = 1, x, y; i <= q; i++) {
scanf("%d %d", &x, &y);
T[beg[x]] += y;
T[en[x] + 1] -= y;
}
for (int i = 2; i <= a; i++)
T[i] += T[i - 1];
for (int i = 1; i <= a; i++)
printf("%lld ", T[i]);
printf("\n");
return 0;
}
|
#include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define all(x) x.begin(), x.end()
#define fi first
#define se second
#define pb push_back
#define umax(x, y) x = max(x, (y))
#define umin(x, y) x = min(x, (y))
#define For(i, a) for (int i = 1; i <= a; i++)
#define ort (b + s) / 2
#define y2 asrwjaelkf
#define y1 asseopirwjaelkf
#define set multiset
using namespace std;
typedef long long Lint;
typedef double db;
typedef pair<int, int> ii;
typedef pair<int, char> ic;
typedef pair<db, db> dd;
typedef pair<ii, int> iii;
typedef pair<ii, ii> i4;
const int maxn = 1000020;
const int maxm = 1000020;
const int MOd = 998244353;
int a, q, ar[maxn];
int beg[maxn], en[maxn], cnt;
Lint T[maxn];
vector<int> w[maxn];
void dfs(int n, int back) {
beg[n] = ++cnt;
for (int i = 0; i < w[n].size(); i++)
if (w[n][i] != back)
dfs(w[n][i], n);
en[n] = cnt;
}
int main() {
// freopen("asd.in","r",stdin);
// freopen("output17.txt","w",stdout);
string s;
scanf("%d %d", &a, &q);
for (int i = 1, j, k; i < a; i++) {
scanf("%d %d", &j, &k);
w[j].pb(k);
w[k].pb(j);
}
dfs(1, 0);
for (int i = 1, x, y; i <= q; i++) {
scanf("%d %d", &x, &y);
T[beg[x]] += y;
T[en[x] + 1] -= y;
}
for (int i = 2; i <= a; i++)
T[i] += T[i - 1];
for (int i = 1; i <= a; i++)
printf("%lld ", T[beg[i]]);
printf("\n");
return 0;
}
|
[
"literal.number.change",
"variable_declaration.value.change",
"call.arguments.change"
] | 739,256
| 739,255
|
u175295878
|
cpp
|
p02936
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
#define MAXN 200000
#define DB double
int n, Q, ct;
vector<int> G[MAXN + 1];
int dfn[MAXN + 2], ot[MAXN + 1];
int sum[MAXN + 1], id[MAXN + 2];
void dfs(int x, int fa) {
dfn[x] = ++ct;
id[ct] = x;
for (int i = 0; i < G[x].size(); i++) {
int nxt = G[x][i];
if (nxt == fa)
continue;
dfs(nxt, x);
}
ot[x] = ct;
}
int main() {
scanf("%d%d", &n, &Q);
for (int i = 1; i < n; i++) {
int u, v;
scanf("%d%d", &u, &v);
G[u].push_back(v);
}
dfs(1, 0);
while (Q--) {
int a, b;
scanf("%d%d", &a, &b);
sum[dfn[a]] += b;
sum[ot[a] + 1] -= b;
}
for (int i = 1; i <= n; i++) {
sum[i] += sum[i - 1];
}
for (int i = 1; i <= n; i++)
printf("%d ", sum[id[i]]);
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
#define MAXN 200000
#define DB double
int n, Q, ct;
vector<int> G[MAXN + 1];
int dfn[MAXN + 2], ot[MAXN + 1];
int sum[MAXN + 1], id[MAXN + 2];
void dfs(int x, int fa) {
dfn[x] = ++ct;
id[ct] = x;
for (int i = 0; i < G[x].size(); i++) {
int nxt = G[x][i];
if (nxt == fa)
continue;
dfs(nxt, x);
}
ot[x] = ct;
}
int main() {
scanf("%d%d", &n, &Q);
for (int i = 1; i < n; i++) {
int u, v;
scanf("%d%d", &u, &v);
G[u].push_back(v);
}
dfs(1, 0);
while (Q--) {
int a, b;
scanf("%d%d", &a, &b);
sum[dfn[a]] += b;
sum[ot[a] + 1] -= b;
}
for (int i = 1; i <= n; i++) {
sum[i] += sum[i - 1];
}
for (int i = 1; i <= n; i++)
printf("%d ", sum[dfn[i]]);
}
|
[
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"io.output.change"
] | 739,259
| 739,260
|
u778193086
|
cpp
|
p02936
|
#include <bits/stdc++.h>
using namespace std;
using Int = long long;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
struct FastIO {
FastIO() {
cin.tie(0);
ios::sync_with_stdio(0);
}
} fastio_beet;
class EulerTourForVertex {
private:
vector<Int> ls, rs;
Int pos;
void dfs(Int v, Int p) {
ls[v] = pos++;
for (Int u : G[v])
if (u != p)
dfs(u, v);
rs[v] = pos;
}
public:
vector<vector<Int>> G;
EulerTourForVertex() {}
EulerTourForVertex(Int n) : ls(n), rs(n), G(n) {}
void add_edge(Int u, Int v) {
G[u].emplace_back(v);
G[v].emplace_back(u);
}
void build(Int r = 0) {
pos = 0;
dfs(r, -1);
}
Int idx(Int v) { return ls[v]; }
template <typename F> void exec(Int v, F f) { f(ls[v], rs[v]); }
};
// INSERT ABOVE HERE
signed main() {
Int n, q;
cin >> n >> q;
EulerTourForVertex G(n);
for (Int i = 1; i < n; i++) {
Int a, b;
cin >> a >> b;
a--;
b--;
G.add_edge(a, b);
}
G.build(0);
vector<Int> sm(n + 1, 0);
for (Int i = 0; i < q; i++) {
Int p, x;
cin >> p >> x;
p--;
G.exec(p, [&](Int l, Int r) {
sm[l] += x;
sm[r] -= x;
});
}
for (Int i = 0; i < n; i++)
sm[i + 1] += sm[i];
for (Int i = 0; i < n; i++) {
if (i)
cout << " ";
cout << sm[i];
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using Int = long long;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
struct FastIO {
FastIO() {
cin.tie(0);
ios::sync_with_stdio(0);
}
} fastio_beet;
class EulerTourForVertex {
private:
vector<Int> ls, rs;
Int pos;
void dfs(Int v, Int p) {
ls[v] = pos++;
for (Int u : G[v])
if (u != p)
dfs(u, v);
rs[v] = pos;
}
public:
vector<vector<Int>> G;
EulerTourForVertex() {}
EulerTourForVertex(Int n) : ls(n), rs(n), G(n) {}
void add_edge(Int u, Int v) {
G[u].emplace_back(v);
G[v].emplace_back(u);
}
void build(Int r = 0) {
pos = 0;
dfs(r, -1);
}
Int idx(Int v) { return ls[v]; }
template <typename F> void exec(Int v, F f) { f(ls[v], rs[v]); }
};
// INSERT ABOVE HERE
signed main() {
Int n, q;
cin >> n >> q;
EulerTourForVertex G(n);
for (Int i = 1; i < n; i++) {
Int a, b;
cin >> a >> b;
a--;
b--;
G.add_edge(a, b);
}
G.build(0);
vector<Int> sm(n + 1, 0);
for (Int i = 0; i < q; i++) {
Int p, x;
cin >> p >> x;
p--;
G.exec(p, [&](Int l, Int r) {
sm[l] += x;
sm[r] -= x;
});
}
for (Int i = 0; i < n; i++)
sm[i + 1] += sm[i];
for (Int i = 0; i < n; i++) {
if (i)
cout << " ";
cout << sm[G.idx(i)];
}
cout << endl;
return 0;
}
|
[
"call.add",
"call.arguments.change"
] | 739,285
| 739,286
|
u687214625
|
cpp
|
p02937
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
int ctoi(char c) { return (int)c - (int)'a'; }
int main() {
string s, t;
cin >> s >> t;
vector<vi> char_pos(26);
for (int i = 0; i < s.size(); i++) {
char_pos[ctoi(s[i])].push_back(i);
}
vi count(26, 0);
vi reset = count;
int pos = 0;
ll ans = 1;
for (int i = 0; i < t.size(); i++) {
int ci = ctoi(t[i]);
if (char_pos[ci].size() == 0) {
cout << -1 << endl;
return 0;
}
while (1) {
count[ci]++;
if (count[ci] - 1 == char_pos[ci].size()) {
ans += s.size() - 1 - pos;
ans += char_pos[ci][0] + 1;
pos = char_pos[ci][0];
count = reset;
count[ci] = 1;
break;
}
if (char_pos[ci][count[ci] - 1] > pos) {
ans += char_pos[ci][count[ci] - 1] - pos;
pos = char_pos[ci][count[ci] - 1];
break;
}
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
int ctoi(char c) { return (int)c - (int)'a'; }
int main() {
string s, t;
cin >> s >> t;
vector<vi> char_pos(26);
for (int i = 0; i < s.size(); i++) {
char_pos[ctoi(s[i])].push_back(i);
}
vi count(26, 0);
vi reset = count;
int pos = -1;
ll ans = 0;
for (int i = 0; i < t.size(); i++) {
int ci = ctoi(t[i]);
if (char_pos[ci].size() == 0) {
cout << -1 << endl;
return 0;
}
while (1) {
count[ci]++;
if (count[ci] - 1 == char_pos[ci].size()) {
ans += s.size() - 1 - pos;
ans += char_pos[ci][0] + 1;
pos = char_pos[ci][0];
count = reset;
count[ci] = 1;
break;
}
if (char_pos[ci][count[ci] - 1] > pos) {
ans += char_pos[ci][count[ci] - 1] - pos;
pos = char_pos[ci][count[ci] - 1];
break;
}
}
}
cout << ans << endl;
}
|
[
"literal.number.change",
"variable_declaration.value.change"
] | 739,291
| 739,292
|
u495692658
|
cpp
|
p02937
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll mod = 1e9 + 7;
int main() {
string s, t;
cin >> s >> t;
map<char, vector<ll>> mp;
set<char> st;
for (ll i = 0; i < s.size(); ++i) {
mp[s[i]].push_back(i + 1);
st.insert(s[i]);
}
bool flag = true;
for (int i = 0; i < t.size(); ++i) {
if (st.find(t[i]) == st.end()) {
flag = false;
break;
}
}
if (!flag) {
cout << -1 << endl;
return 0;
}
vector<ll> index(t.size(), -1);
index[0] = mp[t[0]].front();
for (int i = 1; i < t.size(); ++i) {
auto itr = upper_bound(mp[t[i]].begin(), mp[t[i]].end(), index[i - 1]);
if (itr != mp[t[i]].end()) {
index[i] = *itr;
} else {
index[i] = mp[t[i]].front();
}
}
// for(const auto& e: index)
// {
// cout<<e<<" ";
// }cout<<endl;
ll ans = 0;
for (int i = 1; i < index.size(); ++i) {
if (index[i - 1] > index[i]) {
ans++;
}
}
ans *= s.size();
ans += index.back();
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll mod = 1e9 + 7;
int main() {
string s, t;
cin >> s >> t;
map<char, vector<ll>> mp;
set<char> st;
for (ll i = 0; i < s.size(); ++i) {
mp[s[i]].push_back(i + 1);
st.insert(s[i]);
}
bool flag = true;
for (int i = 0; i < t.size(); ++i) {
if (st.find(t[i]) == st.end()) {
flag = false;
break;
}
}
if (!flag) {
cout << -1 << endl;
return 0;
}
vector<ll> index(t.size(), -1);
index[0] = mp[t[0]].front();
for (int i = 1; i < t.size(); ++i) {
auto itr = upper_bound(mp[t[i]].begin(), mp[t[i]].end(), index[i - 1]);
if (itr != mp[t[i]].end()) {
index[i] = *itr;
} else {
index[i] = mp[t[i]].front();
}
}
// for(const auto& e: index)
// {
// cout<<e<<" ";
// }cout<<endl;
ll ans = 0;
for (int i = 1; i < index.size(); ++i) {
if (index[i - 1] >= index[i]) {
ans++;
}
}
ans *= s.size();
ans += index.back();
cout << ans << endl;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 739,303
| 739,304
|
u849073847
|
cpp
|
p02937
|
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
string s, t;
cin >> s >> t;
ll n = s.size();
ll m = t.size();
vector<vector<int>> cnt(26);
rep(i, n) { cnt[s[i] - 'a'].push_back(i); }
rep(i, 26) { sort(cnt[i].begin(), cnt[i].end()); }
// rep(i, 26){
// for(auto el: cnt[i]) cout << el << " ";
// cout << endl;
// }
rep(i, m) {
if (cnt[t[i] - 'a'].empty()) {
cout << -1 << endl;
return 0;
}
}
ll res = 0;
int ptr = cnt[t[0] - 'a'].front();
vector<int> a;
rep1(i, m) {
a = cnt[t[i] - 'a'];
if (a.back() < ptr) {
res += n;
ptr = a.front();
} else {
int idx = upper_bound(a.begin(), a.end(), ptr) - a.begin();
ptr = a[idx];
}
}
cout << res + ptr + 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
typedef long long ll;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
string s, t;
cin >> s >> t;
ll n = s.size();
ll m = t.size();
vector<vector<int>> cnt(26);
rep(i, n) { cnt[s[i] - 'a'].push_back(i); }
rep(i, 26) { sort(cnt[i].begin(), cnt[i].end()); }
// rep(i, 26){
// for(auto el: cnt[i]) cout << el << " ";
// cout << endl;
// }
rep(i, m) {
if (cnt[t[i] - 'a'].empty()) {
cout << -1 << endl;
return 0;
}
}
ll res = 0;
int ptr = cnt[t[0] - 'a'].front();
vector<int> a;
rep1(i, m) {
a = cnt[t[i] - 'a'];
if (a.back() <= ptr) {
res += n;
ptr = a.front();
} else {
int idx = upper_bound(a.begin(), a.end(), ptr) - a.begin();
ptr = a[idx];
}
}
cout << res + ptr + 1 << endl;
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 739,307
| 739,308
|
u374051158
|
cpp
|
p02937
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
int main() {
string s;
string t;
cin >> s >> t;
vector<ll> alph[26];
rep(i, s.size()) alph[s[i] - 'a'].push_back(i);
ll idx = 0; // s中のどの文字を使ったか
ll d = 0; // 繰り返し数
rep(i, t.size()) {
char c = t[i];
if (alph[c - 'a'].size() == 0) {
cout << -1 << endl;
return 0;
} else if (idx >= alph[c - 'a'].back()) {
idx = alph[c - 'a'][0];
d++;
} else {
int nxt = *upper_bound(alph[c - 'a'].begin(), alph[c - 'a'].end(), idx);
idx = nxt;
}
}
cout << ll(s.size()) * d + idx + 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
int main() {
string s;
string t;
cin >> s >> t;
vector<ll> alph[26];
rep(i, s.size()) alph[s[i] - 'a'].push_back(i);
ll idx = -1; // s中のどの文字を使ったか
ll d = 0; // 繰り返し数
rep(i, t.size()) {
char c = t[i];
if (alph[c - 'a'].size() == 0) {
cout << -1 << endl;
return 0;
} else if (idx >= alph[c - 'a'].back()) {
idx = alph[c - 'a'][0];
d++;
} else {
ll nxt = *upper_bound(alph[c - 'a'].begin(), alph[c - 'a'].end(), idx);
idx = nxt;
}
// cout << idx << " " << d << endl;
}
cout << ll(s.size()) * d + idx + 1 << endl;
return 0;
}
|
[
"literal.number.change",
"variable_declaration.value.change",
"variable_declaration.type.change"
] | 739,311
| 739,312
|
u501163846
|
cpp
|
p02937
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
int main() {
string s;
string t;
cin >> s >> t;
vector<int> alph[26];
rep(i, s.size()) alph[s[i] - 'a'].push_back(i);
int idx = 0; // s中のどの文字を使ったか
ll d = 0; // 繰り返し数
rep(i, t.size()) {
char c = t[i];
if (alph[c - 'a'].size() == 0) {
cout << -1 << endl;
return 0;
} else if (idx >= alph[c - 'a'].back()) {
idx = alph[c - 'a'][0];
d++;
} else {
int nxt = *upper_bound(alph[c - 'a'].begin(), alph[c - 'a'].end(), idx);
idx = nxt;
}
}
cout << ll(s.size()) * d + idx + 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
int main() {
string s;
string t;
cin >> s >> t;
vector<ll> alph[26];
rep(i, s.size()) alph[s[i] - 'a'].push_back(i);
ll idx = -1; // s中のどの文字を使ったか
ll d = 0; // 繰り返し数
rep(i, t.size()) {
char c = t[i];
if (alph[c - 'a'].size() == 0) {
cout << -1 << endl;
return 0;
} else if (idx >= alph[c - 'a'].back()) {
idx = alph[c - 'a'][0];
d++;
} else {
ll nxt = *upper_bound(alph[c - 'a'].begin(), alph[c - 'a'].end(), idx);
idx = nxt;
}
// cout << idx << " " << d << endl;
}
cout << ll(s.size()) * d + idx + 1 << endl;
return 0;
}
|
[
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change"
] | 739,313
| 739,312
|
u501163846
|
cpp
|
p02937
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define rrep(i, n) RREP(i, n - 1, 0)
#define all(v) v.begin(), v.end()
#define endk '\n'
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
const ld eps = 1e-10;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s, t;
cin >> s >> t;
int n = s.size();
map<char, vector<int>> mp;
rep(i, n) { mp[s[i]].push_back(i); }
int m = t.size();
int cnt = 0;
int pos = 0;
rep(i, m) {
if (!mp.count(t[i])) {
cout << -1 << endk;
return 0;
}
while (1) {
auto itr = lower_bound(all(mp[t[i]]), pos);
if (itr == mp[t[i]].end()) {
cnt++;
pos = 0;
continue;
}
pos = *itr + 1;
break;
}
}
cout << 1LL * cnt * n + pos + 1 << endk;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define rrep(i, n) RREP(i, n - 1, 0)
#define all(v) v.begin(), v.end()
#define endk '\n'
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
const ld eps = 1e-10;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s, t;
cin >> s >> t;
int n = s.size();
map<char, vector<int>> mp;
rep(i, n) { mp[s[i]].push_back(i); }
int m = t.size();
int cnt = 0;
int pos = 0;
rep(i, m) {
if (!mp.count(t[i])) {
cout << -1 << endk;
return 0;
}
while (1) {
auto itr = lower_bound(all(mp[t[i]]), pos);
if (itr == mp[t[i]].end()) {
cnt++;
pos = 0;
continue;
}
pos = *itr + 1;
break;
}
}
cout << 1LL * cnt * n + pos << endk;
return 0;
}
|
[
"expression.operation.binary.remove"
] | 739,314
| 739,315
|
u137747137
|
cpp
|
p02937
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define rrep(i, n) RREP(i, n - 1, 0)
#define all(v) v.begin(), v.end()
#define endk '\n'
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
const ld eps = 1e-10;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s, t;
cin >> s >> t;
int n = s.size();
map<char, vector<int>> mp;
rep(i, n) { mp[s[i]].push_back(i); }
int m = t.size();
int cnt = 0;
int pos = 0;
rep(i, m) {
if (!mp.count(t[i])) {
cout << -1 << endk;
return 0;
}
while (1) {
auto itr = lower_bound(all(mp[t[i]]), pos);
if (itr == mp[t[i]].end()) {
cnt++;
pos = 0;
continue;
}
pos = *itr;
break;
}
}
cout << 1LL * cnt * n + pos + 1 << endk;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define rrep(i, n) RREP(i, n - 1, 0)
#define all(v) v.begin(), v.end()
#define endk '\n'
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
const ld eps = 1e-10;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string s, t;
cin >> s >> t;
int n = s.size();
map<char, vector<int>> mp;
rep(i, n) { mp[s[i]].push_back(i); }
int m = t.size();
int cnt = 0;
int pos = 0;
rep(i, m) {
if (!mp.count(t[i])) {
cout << -1 << endk;
return 0;
}
while (1) {
auto itr = lower_bound(all(mp[t[i]]), pos);
if (itr == mp[t[i]].end()) {
cnt++;
pos = 0;
continue;
}
pos = *itr + 1;
break;
}
}
cout << 1LL * cnt * n + pos << endk;
return 0;
}
|
[
"assignment.change",
"expression.operation.binary.remove"
] | 739,316
| 739,315
|
u137747137
|
cpp
|
p02937
|
/*
-ensure correct output format
-ensure printing required output
-reread the problem statement
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<ll, pair<ll, ll>> plll;
#define fastread() (ios_base::sync_with_stdio(false), cin.tie(NULL));
#define vll(v) v.begin(), v.end()
#define all(x) x.rbegin(), x.rend()
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define F first
#define S second
#define in freopen("input.txt", "r", stdin)
#define out freopen("output.txt", "w", stdout)
#define minheap int, vector<int>, greater<int>
#define pb push_back
#define eb emplace_back
#define ischar(x) (('a' <= x && x <= 'z') || ('A' <= x && x <= 'Z'))
#define isvowel(ch) \
((ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u') || \
(ch == 'A' || ch == 'E' || ch == 'I' || ch == 'O' || ch == 'U'))
#define bug cout << "BUG" << endl;
const int Max = 2e6 + 10;
const int Mod = 1e9 + 7;
const double PI = 3.141592653589793238463;
bool compare(const pair<ll, ll> &a, const pair<ll, ll> &b) {
return (a.first > b.first);
}
ll lcm(ll a, ll b) {
if (a == 0 || b == 0)
return 0;
return a / __gcd(a, b) * b;
}
void input(ll ara[], ll n) {
for (ll i = 0; i < n; i++)
cin >> ara[i];
}
void print(ll ara[], ll n) {
for (ll i = 0; i < n; i++)
cout << ara[i] << " ";
cout << endl;
}
vector<ll> v[200];
int main() {
fastread();
ll i, j, n, m, p, a, sum = 0, k, t, b, c, d, cnt = 0, q, l, r, ans = 0;
bool flag = false;
string str, ptr;
cin >> str >> ptr;
n = str.size();
m = ptr.size();
for (i = 0; i < n; i++) {
v[str[i]].eb(i);
}
for (i = 0; i < m; i++) {
if (v[ptr[i]].size() == 0)
break;
}
if (i == m) {
ans = 0;
ll last = -1;
for (auto x : ptr) {
auto xp = lower_bound(vll(v[x]), last);
if (xp == v[x].end()) {
last = -1;
ans++;
auto xp = lower_bound(vll(v[x]), last);
last = xp - v[x].begin();
last = v[x][last];
} else {
last = xp - v[x].begin();
last = v[x][last];
}
}
ans *= n;
ans += last + 1;
cout << ans << endl;
} else
cout << -1 << endl;
}
|
/*
-ensure correct output format
-ensure printing required output
-reread the problem statement
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<ll, pair<ll, ll>> plll;
#define fastread() (ios_base::sync_with_stdio(false), cin.tie(NULL));
#define vll(v) v.begin(), v.end()
#define all(x) x.rbegin(), x.rend()
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))
#define F first
#define S second
#define in freopen("input.txt", "r", stdin)
#define out freopen("output.txt", "w", stdout)
#define minheap int, vector<int>, greater<int>
#define pb push_back
#define eb emplace_back
#define ischar(x) (('a' <= x && x <= 'z') || ('A' <= x && x <= 'Z'))
#define isvowel(ch) \
((ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u') || \
(ch == 'A' || ch == 'E' || ch == 'I' || ch == 'O' || ch == 'U'))
#define bug cout << "BUG" << endl;
const int Max = 2e6 + 10;
const int Mod = 1e9 + 7;
const double PI = 3.141592653589793238463;
bool compare(const pair<ll, ll> &a, const pair<ll, ll> &b) {
return (a.first > b.first);
}
ll lcm(ll a, ll b) {
if (a == 0 || b == 0)
return 0;
return a / __gcd(a, b) * b;
}
void input(ll ara[], ll n) {
for (ll i = 0; i < n; i++)
cin >> ara[i];
}
void print(ll ara[], ll n) {
for (ll i = 0; i < n; i++)
cout << ara[i] << " ";
cout << endl;
}
vector<ll> v[200];
int main() {
fastread();
ll i, j, n, m, p, a, sum = 0, k, t, b, c, d, cnt = 0, q, l, r, ans = 0;
bool flag = false;
string str, ptr;
cin >> str >> ptr;
n = str.size();
m = ptr.size();
for (i = 0; i < n; i++) {
v[str[i]].eb(i);
}
for (i = 0; i < m; i++) {
if (v[ptr[i]].size() == 0)
break;
}
if (i == m) {
ans = 0;
ll last = -1;
for (auto x : ptr) {
auto xp = upper_bound(vll(v[x]), last);
if (xp == v[x].end()) {
last = -1;
ans++;
auto xp = upper_bound(vll(v[x]), last);
last = xp - v[x].begin();
last = v[x][last];
} else {
last = xp - v[x].begin();
last = v[x][last];
}
}
ans *= n;
ans += last + 1;
cout << ans << endl;
} else
cout << -1 << endl;
}
|
[
"identifier.change",
"call.function.change"
] | 739,321
| 739,322
|
u434874161
|
cpp
|
p02937
|
#include <bits/stdc++.h>
#define INF 1000000007
#define rep(i, N) for (ll i = 0; i < N; i++)
#define rep2(i, j, k) for (ll i = j; i < k; i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define print(x) cout << x << "\n"
#define print2(x, y) cout << x << " " << y << "\n"
#define printv(vec) \
rep(lp, vec.size()) cout << vec[lp] << " "; \
print("");
#define ALL(v) v.begin(), v.end()
#define SUM(v) accumulate(ALL(v), 0)
#define MAX(v) *max_element(ALL(v))
#define MIN(v) *min_element(ALL(v))
#define SORT(v) sort(ALL(v))
#define REV(v) reverse(ALL(v))
typedef long long ll;
using namespace std;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vs = vector<string>;
const int mod = 1000000007;
class mint {
public:
ll x;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint &a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint &a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint &a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint &a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint &a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint &a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint &a) { return (*this) *= a.inv(); }
mint operator/(const mint &a) const {
mint res(*this);
return res /= a;
}
friend ostream &operator<<(ostream &os, const mint &m) {
os << m.x;
return os;
}
};
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;
}
void Main() {
string s, t;
cin >> s >> t;
vvl v(26, vl());
ll lens = s.size();
ll lent = t.size();
rep(i, lens) v[s[i] - 'a'].push_back(i);
ll ans = 0;
ll cnt = 0;
rep(i, lent) {
if (v[t[i] - 'a'].size() == 0) {
print(-1);
return;
}
}
rep(i, lent) {
auto itr = upper_bound(ALL(v[t[i] - 'a']), cnt);
if (itr == v[t[i] - 'a'].end()) {
ans += lens;
cnt = v[t[i] - 'a'][0];
} else
cnt = *itr;
// print2(ans, cnt);
}
ans += (cnt + 1);
print(ans);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
Main();
return 0;
}
|
#include <bits/stdc++.h>
#define INF 1000000007
#define rep(i, N) for (ll i = 0; i < N; i++)
#define rep2(i, j, k) for (ll i = j; i < k; i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define print(x) cout << x << "\n"
#define print2(x, y) cout << x << " " << y << "\n"
#define printv(vec) \
rep(lp, vec.size()) cout << vec[lp] << " "; \
print("");
#define ALL(v) v.begin(), v.end()
#define SUM(v) accumulate(ALL(v), 0)
#define MAX(v) *max_element(ALL(v))
#define MIN(v) *min_element(ALL(v))
#define SORT(v) sort(ALL(v))
#define REV(v) reverse(ALL(v))
typedef long long ll;
using namespace std;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vs = vector<string>;
const int mod = 1000000007;
class mint {
public:
ll x;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint &a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint &a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint &a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint &a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint &a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint &a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint &a) { return (*this) *= a.inv(); }
mint operator/(const mint &a) const {
mint res(*this);
return res /= a;
}
friend ostream &operator<<(ostream &os, const mint &m) {
os << m.x;
return os;
}
};
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;
}
void Main() {
string s, t;
cin >> s >> t;
vvl v(26, vl());
ll lens = s.size();
ll lent = t.size();
rep(i, lens) v[s[i] - 'a'].push_back(i);
ll ans = 0;
ll cnt = -1;
rep(i, lent) {
if (v[t[i] - 'a'].size() == 0) {
print(-1);
return;
}
}
rep(i, lent) {
auto itr = upper_bound(ALL(v[t[i] - 'a']), cnt);
if (itr == v[t[i] - 'a'].end()) {
ans += lens;
cnt = v[t[i] - 'a'][0];
} else
cnt = *itr;
// print2(ans, cnt);
}
ans += (cnt + 1);
print(ans);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
Main();
return 0;
}
|
[
"literal.number.change",
"variable_declaration.value.change"
] | 739,329
| 739,330
|
u885634168
|
cpp
|
p02937
|
#include <bits/stdc++.h>
#define INF 1000000007
#define rep(i, N) for (ll i = 0; i < N; i++)
#define rep2(i, j, k) for (ll i = j; i < k; i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define print(x) cout << x << "\n"
#define print2(x, y) cout << x << " " << y << "\n"
#define printv(vec) \
rep(lp, vec.size()) cout << vec[lp] << " "; \
print("");
#define ALL(v) v.begin(), v.end()
#define SUM(v) accumulate(ALL(v), 0)
#define MAX(v) *max_element(ALL(v))
#define MIN(v) *min_element(ALL(v))
#define SORT(v) sort(ALL(v))
#define REV(v) reverse(ALL(v))
typedef long long ll;
using namespace std;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vs = vector<string>;
const int mod = 1000000007;
class mint {
public:
ll x;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint &a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint &a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint &a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint &a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint &a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint &a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint &a) { return (*this) *= a.inv(); }
mint operator/(const mint &a) const {
mint res(*this);
return res /= a;
}
friend ostream &operator<<(ostream &os, const mint &m) {
os << m.x;
return os;
}
};
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;
}
void Main() {
string s, t;
cin >> s >> t;
vvl v(26, vl());
ll lens = s.size();
ll lent = t.size();
rep(i, lens) v[s[i] - 'a'].push_back(i);
ll ans = 0;
ll cnt = 0;
rep(i, lent) {
if (v[t[i] - 'a'].size() == 0) {
print(-1);
return;
}
}
rep(i, lent) {
auto itr = lower_bound(ALL(v[t[i] - 'a']), cnt);
if (itr == v[t[i] - 'a'].end()) {
ans += lens;
cnt = v[t[i] - 'a'][0];
} else
cnt = *itr;
}
ans += (cnt + 1);
print(ans);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
Main();
return 0;
}
|
#include <bits/stdc++.h>
#define INF 1000000007
#define rep(i, N) for (ll i = 0; i < N; i++)
#define rep2(i, j, k) for (ll i = j; i < k; i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define print(x) cout << x << "\n"
#define print2(x, y) cout << x << " " << y << "\n"
#define printv(vec) \
rep(lp, vec.size()) cout << vec[lp] << " "; \
print("");
#define ALL(v) v.begin(), v.end()
#define SUM(v) accumulate(ALL(v), 0)
#define MAX(v) *max_element(ALL(v))
#define MIN(v) *min_element(ALL(v))
#define SORT(v) sort(ALL(v))
#define REV(v) reverse(ALL(v))
typedef long long ll;
using namespace std;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vs = vector<string>;
const int mod = 1000000007;
class mint {
public:
ll x;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint &a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint &a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint &a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint &a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint &a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint &a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint &a) { return (*this) *= a.inv(); }
mint operator/(const mint &a) const {
mint res(*this);
return res /= a;
}
friend ostream &operator<<(ostream &os, const mint &m) {
os << m.x;
return os;
}
};
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;
}
void Main() {
string s, t;
cin >> s >> t;
vvl v(26, vl());
ll lens = s.size();
ll lent = t.size();
rep(i, lens) v[s[i] - 'a'].push_back(i);
ll ans = 0;
ll cnt = -1;
rep(i, lent) {
if (v[t[i] - 'a'].size() == 0) {
print(-1);
return;
}
}
rep(i, lent) {
auto itr = upper_bound(ALL(v[t[i] - 'a']), cnt);
if (itr == v[t[i] - 'a'].end()) {
ans += lens;
cnt = v[t[i] - 'a'][0];
} else
cnt = *itr;
// print2(ans, cnt);
}
ans += (cnt + 1);
print(ans);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
Main();
return 0;
}
|
[
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"call.function.change"
] | 739,331
| 739,330
|
u885634168
|
cpp
|
p02937
|
#include <bits/stdc++.h>
#define INF 1000000007
#define rep(i, N) for (ll i = 0; i < N; i++)
#define rep2(i, j, k) for (ll i = j; i < k; i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define print(x) cout << x << "\n"
#define print2(x, y) cout << x << " " << y << "\n"
#define printv(vec) \
rep(lp, vec.size()) cout << vec[lp] << " "; \
print("");
#define ALL(v) v.begin(), v.end()
#define SUM(v) accumulate(ALL(v), 0)
#define MAX(v) *max_element(ALL(v))
#define MIN(v) *min_element(ALL(v))
#define SORT(v) sort(ALL(v))
#define REV(v) reverse(ALL(v))
typedef long long ll;
using namespace std;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vs = vector<string>;
const int mod = 1000000007;
class mint {
public:
ll x;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint &a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint &a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint &a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint &a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint &a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint &a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint &a) { return (*this) *= a.inv(); }
mint operator/(const mint &a) const {
mint res(*this);
return res /= a;
}
friend ostream &operator<<(ostream &os, const mint &m) {
os << m.x;
return os;
}
};
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;
}
void Main() {
string s, t;
cin >> s >> t;
vvl v(26, vl());
ll lens = s.size();
ll lent = t.size();
rep(i, lens) v[s[i] - 'a'].push_back(i);
ll ans = 0;
ll cnt = 0;
rep(i, lent) {
if (v[t[i] - 'a'].size() == 0) {
print(-1);
return;
}
}
rep(i, lent) {
auto itr = lower_bound(ALL(v[t[i] - 'a']), cnt);
if (itr == v[t[i] - 'a'].end()) {
ans += lens;
cnt = v[t[i] - 'a'][0] - 1;
} else
cnt = *itr;
}
ans += (cnt + 1);
print(ans);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
Main();
return 0;
}
|
#include <bits/stdc++.h>
#define INF 1000000007
#define rep(i, N) for (ll i = 0; i < N; i++)
#define rep2(i, j, k) for (ll i = j; i < k; i++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define print(x) cout << x << "\n"
#define print2(x, y) cout << x << " " << y << "\n"
#define printv(vec) \
rep(lp, vec.size()) cout << vec[lp] << " "; \
print("");
#define ALL(v) v.begin(), v.end()
#define SUM(v) accumulate(ALL(v), 0)
#define MAX(v) *max_element(ALL(v))
#define MIN(v) *min_element(ALL(v))
#define SORT(v) sort(ALL(v))
#define REV(v) reverse(ALL(v))
typedef long long ll;
using namespace std;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vs = vector<string>;
const int mod = 1000000007;
class mint {
public:
ll x;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint &a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint &a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint &a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint &a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint &a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint &a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint &a) { return (*this) *= a.inv(); }
mint operator/(const mint &a) const {
mint res(*this);
return res /= a;
}
friend ostream &operator<<(ostream &os, const mint &m) {
os << m.x;
return os;
}
};
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;
}
void Main() {
string s, t;
cin >> s >> t;
vvl v(26, vl());
ll lens = s.size();
ll lent = t.size();
rep(i, lens) v[s[i] - 'a'].push_back(i);
ll ans = 0;
ll cnt = -1;
rep(i, lent) {
if (v[t[i] - 'a'].size() == 0) {
print(-1);
return;
}
}
rep(i, lent) {
auto itr = upper_bound(ALL(v[t[i] - 'a']), cnt);
if (itr == v[t[i] - 'a'].end()) {
ans += lens;
cnt = v[t[i] - 'a'][0];
} else
cnt = *itr;
// print2(ans, cnt);
}
ans += (cnt + 1);
print(ans);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
Main();
return 0;
}
|
[
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.remove"
] | 739,332
| 739,330
|
u885634168
|
cpp
|
p02937
|
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
int main() {
string s, t;
cin >> s >> t;
const ll mod = s.size();
vector<int> n[26];
rep(i, s.size()) {
int num = s[i] - 'a';
n[num].push_back(i);
}
rep(i, 26) {
if (n[i].size() == 0)
continue;
n[i].push_back(n[i][0] + mod);
}
ll ans = 0;
rep(i, t.size()) {
if (n[t[i] - 'a'].size() == 0) {
cout << "-1" << endl;
return 0;
}
int num = t[i] - 'a';
ll idx = ans % mod;
auto itr = upper_bound(n[num].begin(), n[num].end(), idx);
ans = (ans / mod) * mod + *itr;
// cout << num << " " << *itr << endl;
// cout << ans << endl;
}
// rep(i, 26){
// bool a = false;
// rep(j, n[i].size()){
// if(j == 0) cout << i + 1 << ";";
// cout << n[i][j] << " ";
// a = true;
// }
// if(a) cout << endl;
// }
cout << ans + 1 << endl;
}
|
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define P pair<int, int>
typedef vector<int> vec;
typedef vector<vec> mat;
int main() {
string s, t;
cin >> s >> t;
const ll mod = s.size();
vector<int> n[26];
rep(i, s.size()) {
int num = s[i] - 'a';
n[num].push_back(i);
}
rep(i, 26) {
if (n[i].size() == 0)
continue;
n[i].push_back(n[i][0] + mod);
}
ll ans = -1;
rep(i, t.size()) {
if (n[t[i] - 'a'].size() == 0) {
cout << "-1" << endl;
return 0;
}
int num = t[i] - 'a';
ll idx = ans % mod;
auto itr = upper_bound(n[num].begin(), n[num].end(), idx);
ans = (ans / mod) * mod + *itr;
// cout << num << " " << *itr << endl;
// cout << ans << endl;
}
// rep(i, 26){
// bool a = false;
// rep(j, n[i].size()){
// if(j == 0) cout << i + 1 << ";";
// cout << n[i][j] << " ";
// a = true;
// }
// if(a) cout << endl;
// }
cout << ans + 1 << endl;
}
|
[
"literal.number.change",
"variable_declaration.value.change"
] | 739,341
| 739,342
|
u416773418
|
cpp
|
p02937
|
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define P pair<int, int>
int main() {
string s, t;
cin >> s >> t;
long int num = s.size();
vector<int> a[26];
rep(i, s.size()) {
int idx = s[i] - 'a';
a[idx].push_back(i);
}
long int ans = 0;
long int sm = 0;
rep(i, t.size()) {
long int idx = t[i] - 'a';
if (a[idx].size() == 0) {
cout << -1 << endl;
return 0;
}
long int n = ans;
long int idx2 =
upper_bound(a[idx].begin(), a[idx].end(), n) - a[idx].begin();
if (idx2 >= a[idx].size()) {
ans = a[idx][0];
sm++;
} else {
ans = a[idx][idx2];
}
}
cout << sm * num + ans + 1 << endl;
}
|
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define P pair<int, int>
int main() {
string s, t;
cin >> s >> t;
long int num = s.size();
vector<int> a[26];
rep(i, s.size()) {
int idx = s[i] - 'a';
a[idx].push_back(i);
}
long int ans = -1;
long int sm = 0;
rep(i, t.size()) {
long int idx = t[i] - 'a';
if (a[idx].size() == 0) {
cout << -1 << endl;
return 0;
}
long int n = ans;
long int idx2 =
upper_bound(a[idx].begin(), a[idx].end(), n) - a[idx].begin();
if (idx2 >= a[idx].size()) {
ans = a[idx][0];
sm++;
} else {
ans = a[idx][idx2];
}
}
cout << sm * num + ans + 1 << endl;
}
|
[
"literal.number.change",
"variable_declaration.value.change"
] | 739,343
| 739,344
|
u416773418
|
cpp
|
p02937
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define fi first
#define se second
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
template <class T, class S> void cmin(T &a, const S &b) {
if (a > b)
a = b;
}
template <class T, class S> void cmax(T &a, const S &b) {
if (a < b)
a = b;
}
template <class A> void PR(A a, ll n) {
rep(i, n) {
if (i)
cout << ' ';
cout << a[i];
}
cout << "\n";
}
ld PI = 3.14159265358979323846;
int main() {
string S, T;
cin >> S >> T;
string SS = S + S;
ll N = S.size();
ll M = T.size();
vector<vector<ll>> v(26);
rep(i, SS.size()) { v[SS[i] - 'a'].push_back(i + 1); }
ll ans = 0;
ll cur = 0;
rep(i, M) {
ll c = T[i] - 'a';
auto itr = lower_bound(v[c].begin(), v[c].end(), cur);
if (itr == v[c].end()) {
cout << -1 << endl;
return 0;
}
ll pos = *itr;
ans += pos - cur;
cur += pos - cur;
if (cur > N) {
cur -= N;
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define fi first
#define se second
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
template <class T, class S> void cmin(T &a, const S &b) {
if (a > b)
a = b;
}
template <class T, class S> void cmax(T &a, const S &b) {
if (a < b)
a = b;
}
template <class A> void PR(A a, ll n) {
rep(i, n) {
if (i)
cout << ' ';
cout << a[i];
}
cout << "\n";
}
ld PI = 3.14159265358979323846;
int main() {
string S, T;
cin >> S >> T;
string SS = S + S;
ll N = S.size();
ll M = T.size();
vector<vector<ll>> v(26);
rep(i, SS.size()) { v[SS[i] - 'a'].push_back(i + 1); }
ll ans = 0;
ll cur = 0;
rep(i, M) {
ll c = T[i] - 'a';
auto itr = upper_bound(v[c].begin(), v[c].end(), cur);
if (itr == v[c].end()) {
cout << -1 << endl;
return 0;
}
ll pos = *itr;
ans += pos - cur;
cur += pos - cur;
if (cur > N) {
cur -= N;
}
}
cout << ans << endl;
}
|
[
"identifier.change",
"call.function.change"
] | 739,345
| 739,346
|
u601256797
|
cpp
|
p02937
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define fi first
#define se second
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
template <class T, class S> void cmin(T &a, const S &b) {
if (a > b)
a = b;
}
template <class T, class S> void cmax(T &a, const S &b) {
if (a < b)
a = b;
}
template <class A> void PR(A a, ll n) {
rep(i, n) {
if (i)
cout << ' ';
cout << a[i];
}
cout << "\n";
}
ld PI = 3.14159265358979323846;
int main() {
string S, T;
cin >> S >> T;
string SS = S + S;
ll N = S.size();
ll M = T.size();
vector<vector<ll>> v(26);
rep(i, SS.size()) { v[SS[i] - 'a'].push_back(i + 1); }
ll ans = 0;
ll cur = 0;
rep(i, M) {
ll c = T[i] - 'a';
auto itr = lower_bound(v[c].begin(), v[c].end(), cur);
if (itr == v[c].end()) {
cout << -1 << endl;
return 0;
}
ll pos = *itr;
ans += pos - cur;
cur += pos - cur;
if (cur >= N) {
cur -= N;
}
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define fi first
#define se second
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
template <class T, class S> void cmin(T &a, const S &b) {
if (a > b)
a = b;
}
template <class T, class S> void cmax(T &a, const S &b) {
if (a < b)
a = b;
}
template <class A> void PR(A a, ll n) {
rep(i, n) {
if (i)
cout << ' ';
cout << a[i];
}
cout << "\n";
}
ld PI = 3.14159265358979323846;
int main() {
string S, T;
cin >> S >> T;
string SS = S + S;
ll N = S.size();
ll M = T.size();
vector<vector<ll>> v(26);
rep(i, SS.size()) { v[SS[i] - 'a'].push_back(i + 1); }
ll ans = 0;
ll cur = 0;
rep(i, M) {
ll c = T[i] - 'a';
auto itr = upper_bound(v[c].begin(), v[c].end(), cur);
if (itr == v[c].end()) {
cout << -1 << endl;
return 0;
}
ll pos = *itr;
ans += pos - cur;
cur += pos - cur;
if (cur > N) {
cur -= N;
}
}
cout << ans << endl;
}
|
[
"identifier.change",
"call.function.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 739,347
| 739,346
|
u601256797
|
cpp
|
p02937
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
template <class T, class S> void cmin(T &a, const S &b) {
if (a > b)
a = b;
}
template <class T, class S> void cmax(T &a, const S &b) {
if (a < b)
a = b;
}
template <class A> void PR(A a, ll n) {
rep(i, n) {
if (i)
cout << ' ';
cout << a[i];
}
cout << "\n";
}
ld PI = 3.14159265358979323846;
int main() {
string S, T;
cin >> S >> T;
ll N = S.size();
ll M = T.size();
vector<vector<ll>> v(26);
rep(i, N) { v[S[i] - 'a'].push_back(i); }
rep(i, N) { v[S[i] - 'a'].push_back(i + N); }
ll ans = 0;
ll tmp = -1;
rep(i, M) {
ll c = T[i] - 'a';
if (v[c].size() == 0) {
cout << -1 << endl;
return 0;
}
tmp = *upper_bound(v[c].begin(), v[c].end(), tmp);
if (tmp >= N) {
tmp -= N;
ans += N;
}
}
ans += tmp;
cout << ans << endl;
}
/*
rep(i,M){
if(v[T[i] - 'a'].size() == 0){
cout << -1 << endl;
return 0;
}
tmp = v[T[i] - 'a'].front();
v[T[i] - 'a'].pop();
if(ans < tmp){
ans = tmp;
v[T[i] - 'a'].push(tmp);
}else{
bool flag = false;
if(ans-tmp < N){
rep(j,v[T[i] - 'a'].size()){
v[T[i] - 'a'].push(tmp);
tmp = v[T[i] - 'a'].front();
v[T[i] - 'a'].pop();
if(ans < tmp){
ans = tmp;
v[T[i] - 'a'].push(tmp);
flag = true;
break;
}
}
}
if(flag)continue;
ll q = (ans-tmp)/N + 1;
ans = tmp + q*N;
v[T[i] - 'a'].push(tmp);
}
}
cout << ans+1 << endl;
}*/
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
template <class T, class S> void cmin(T &a, const S &b) {
if (a > b)
a = b;
}
template <class T, class S> void cmax(T &a, const S &b) {
if (a < b)
a = b;
}
template <class A> void PR(A a, ll n) {
rep(i, n) {
if (i)
cout << ' ';
cout << a[i];
}
cout << "\n";
}
ld PI = 3.14159265358979323846;
int main() {
string S, T;
cin >> S >> T;
ll N = S.size();
ll M = T.size();
vector<vector<ll>> v(26);
rep(i, N) { v[S[i] - 'a'].push_back(i); }
rep(i, N) { v[S[i] - 'a'].push_back(i + N); }
ll ans = 0;
ll tmp = -1;
rep(i, M) {
ll c = T[i] - 'a';
if (v[c].size() == 0) {
cout << -1 << endl;
return 0;
}
tmp = *upper_bound(v[c].begin(), v[c].end(), tmp);
if (tmp >= N) {
tmp -= N;
ans += N;
}
}
ans += tmp;
cout << ans + 1 << endl;
}
/*
rep(i,M){
if(v[T[i] - 'a'].size() == 0){
cout << -1 << endl;
return 0;
}
tmp = v[T[i] - 'a'].front();
v[T[i] - 'a'].pop();
if(ans < tmp){
ans = tmp;
v[T[i] - 'a'].push(tmp);
}else{
bool flag = false;
if(ans-tmp < N){
rep(j,v[T[i] - 'a'].size()){
v[T[i] - 'a'].push(tmp);
tmp = v[T[i] - 'a'].front();
v[T[i] - 'a'].pop();
if(ans < tmp){
ans = tmp;
v[T[i] - 'a'].push(tmp);
flag = true;
break;
}
}
}
if(flag)continue;
ll q = (ans-tmp)/N + 1;
ans = tmp + q*N;
v[T[i] - 'a'].push(tmp);
}
}
cout << ans+1 << endl;
}*/
|
[
"expression.operation.binary.add"
] | 739,348
| 739,349
|
u601256797
|
cpp
|
p02937
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
template <class T, class S> void cmin(T &a, const S &b) {
if (a > b)
a = b;
}
template <class T, class S> void cmax(T &a, const S &b) {
if (a < b)
a = b;
}
template <class A> void PR(A a, ll n) {
rep(i, n) {
if (i)
cout << ' ';
cout << a[i];
}
cout << "\n";
}
ld PI = 3.14159265358979323846;
int main() {
string S, T;
cin >> S >> T;
ll N = S.size();
ll M = T.size();
vector<vector<ll>> v(26);
rep(i, N) { v[S[i] - 'a'].push_back(i); }
rep(i, N) { v[S[i] - 'a'].push_back(i + N); }
ll ans = 0;
ll tmp = 0;
rep(i, M) {
ll c = T[i] - 'a';
if (v[c].size() == 0) {
cout << -1 << endl;
return 0;
}
tmp = *upper_bound(v[c].begin(), v[c].end(), tmp);
if (tmp >= N) {
tmp -= N;
ans += N;
}
}
ans += tmp;
cout << ans << endl;
}
/*
rep(i,M){
if(v[T[i] - 'a'].size() == 0){
cout << -1 << endl;
return 0;
}
tmp = v[T[i] - 'a'].front();
v[T[i] - 'a'].pop();
if(ans < tmp){
ans = tmp;
v[T[i] - 'a'].push(tmp);
}else{
bool flag = false;
if(ans-tmp < N){
rep(j,v[T[i] - 'a'].size()){
v[T[i] - 'a'].push(tmp);
tmp = v[T[i] - 'a'].front();
v[T[i] - 'a'].pop();
if(ans < tmp){
ans = tmp;
v[T[i] - 'a'].push(tmp);
flag = true;
break;
}
}
}
if(flag)continue;
ll q = (ans-tmp)/N + 1;
ans = tmp + q*N;
v[T[i] - 'a'].push(tmp);
}
}
cout << ans+1 << endl;
}*/
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
template <class T, class S> void cmin(T &a, const S &b) {
if (a > b)
a = b;
}
template <class T, class S> void cmax(T &a, const S &b) {
if (a < b)
a = b;
}
template <class A> void PR(A a, ll n) {
rep(i, n) {
if (i)
cout << ' ';
cout << a[i];
}
cout << "\n";
}
ld PI = 3.14159265358979323846;
int main() {
string S, T;
cin >> S >> T;
ll N = S.size();
ll M = T.size();
vector<vector<ll>> v(26);
rep(i, N) { v[S[i] - 'a'].push_back(i); }
rep(i, N) { v[S[i] - 'a'].push_back(i + N); }
ll ans = 0;
ll tmp = -1;
rep(i, M) {
ll c = T[i] - 'a';
if (v[c].size() == 0) {
cout << -1 << endl;
return 0;
}
tmp = *upper_bound(v[c].begin(), v[c].end(), tmp);
if (tmp >= N) {
tmp -= N;
ans += N;
}
}
ans += tmp;
cout << ans + 1 << endl;
}
/*
rep(i,M){
if(v[T[i] - 'a'].size() == 0){
cout << -1 << endl;
return 0;
}
tmp = v[T[i] - 'a'].front();
v[T[i] - 'a'].pop();
if(ans < tmp){
ans = tmp;
v[T[i] - 'a'].push(tmp);
}else{
bool flag = false;
if(ans-tmp < N){
rep(j,v[T[i] - 'a'].size()){
v[T[i] - 'a'].push(tmp);
tmp = v[T[i] - 'a'].front();
v[T[i] - 'a'].pop();
if(ans < tmp){
ans = tmp;
v[T[i] - 'a'].push(tmp);
flag = true;
break;
}
}
}
if(flag)continue;
ll q = (ans-tmp)/N + 1;
ans = tmp + q*N;
v[T[i] - 'a'].push(tmp);
}
}
cout << ans+1 << endl;
}*/
|
[
"literal.number.change",
"variable_declaration.value.change"
] | 739,350
| 739,349
|
u601256797
|
cpp
|
p02937
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
template <class T, class S> void cmin(T &a, const S &b) {
if (a > b)
a = b;
}
template <class T, class S> void cmax(T &a, const S &b) {
if (a < b)
a = b;
}
template <class A> void PR(A a, ll n) {
rep(i, n) {
if (i)
cout << ' ';
cout << a[i];
}
cout << "\n";
}
ld PI = 3.14159265358979323846;
int main() {
string S, T;
cin >> S >> T;
ll N = S.size();
ll M = T.size();
vector<vector<ll>> v(26);
rep(i, N) { v[S[i] - 'a'].push_back(i); }
rep(i, N) { v[S[i] - 'a'].push_back(i + N); }
ll ans = 0;
ll tmp = 0;
rep(i, M) {
ll c = T[i] - 'a';
if (v[c].size() == 0) {
cout << -1 << endl;
return 0;
}
tmp = *lower_bound(v[c].begin(), v[c].end(), tmp) + 1;
if (tmp >= N) {
tmp -= N;
ans += N;
}
}
ans += tmp;
cout << ans + 1 << endl;
}
/*
rep(i,M){
if(v[T[i] - 'a'].size() == 0){
cout << -1 << endl;
return 0;
}
tmp = v[T[i] - 'a'].front();
v[T[i] - 'a'].pop();
if(ans < tmp){
ans = tmp;
v[T[i] - 'a'].push(tmp);
}else{
bool flag = false;
if(ans-tmp < N){
rep(j,v[T[i] - 'a'].size()){
v[T[i] - 'a'].push(tmp);
tmp = v[T[i] - 'a'].front();
v[T[i] - 'a'].pop();
if(ans < tmp){
ans = tmp;
v[T[i] - 'a'].push(tmp);
flag = true;
break;
}
}
}
if(flag)continue;
ll q = (ans-tmp)/N + 1;
ans = tmp + q*N;
v[T[i] - 'a'].push(tmp);
}
}
cout << ans+1 << endl;
}*/
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
template <class T, class S> void cmin(T &a, const S &b) {
if (a > b)
a = b;
}
template <class T, class S> void cmax(T &a, const S &b) {
if (a < b)
a = b;
}
template <class A> void PR(A a, ll n) {
rep(i, n) {
if (i)
cout << ' ';
cout << a[i];
}
cout << "\n";
}
ld PI = 3.14159265358979323846;
int main() {
string S, T;
cin >> S >> T;
ll N = S.size();
ll M = T.size();
vector<vector<ll>> v(26);
rep(i, N) { v[S[i] - 'a'].push_back(i); }
rep(i, N) { v[S[i] - 'a'].push_back(i + N); }
ll ans = 0;
ll tmp = -1;
rep(i, M) {
ll c = T[i] - 'a';
if (v[c].size() == 0) {
cout << -1 << endl;
return 0;
}
tmp = *upper_bound(v[c].begin(), v[c].end(), tmp);
if (tmp >= N) {
tmp -= N;
ans += N;
}
}
ans += tmp;
cout << ans + 1 << endl;
}
/*
rep(i,M){
if(v[T[i] - 'a'].size() == 0){
cout << -1 << endl;
return 0;
}
tmp = v[T[i] - 'a'].front();
v[T[i] - 'a'].pop();
if(ans < tmp){
ans = tmp;
v[T[i] - 'a'].push(tmp);
}else{
bool flag = false;
if(ans-tmp < N){
rep(j,v[T[i] - 'a'].size()){
v[T[i] - 'a'].push(tmp);
tmp = v[T[i] - 'a'].front();
v[T[i] - 'a'].pop();
if(ans < tmp){
ans = tmp;
v[T[i] - 'a'].push(tmp);
flag = true;
break;
}
}
}
if(flag)continue;
ll q = (ans-tmp)/N + 1;
ans = tmp + q*N;
v[T[i] - 'a'].push(tmp);
}
}
cout << ans+1 << endl;
}*/
|
[
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 739,351
| 739,349
|
u601256797
|
cpp
|
p02937
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
template <class T, class S> void cmin(T &a, const S &b) {
if (a > b)
a = b;
}
template <class T, class S> void cmax(T &a, const S &b) {
if (a < b)
a = b;
}
template <class A> void PR(A a, ll n) {
rep(i, n) {
if (i)
cout << ' ';
cout << a[i];
}
cout << "\n";
}
ld PI = 3.14159265358979323846;
int main() {
string S, T;
cin >> S >> T;
ll N = S.size();
ll M = T.size();
vector<vector<ll>> v(26);
rep(i, N) { v[S[i] - 'a'].push_back(i); }
rep(i, N) { v[S[i] - 'a'].push_back(i + N); }
ll ans = 0;
ll tmp = 0;
rep(i, M) {
ll c = T[i] - 'a';
if (v[c].size() == 0) {
cout << -1 << endl;
return 0;
}
tmp = *upper_bound(v[c].begin(), v[c].end(), tmp);
if (tmp >= N) {
tmp -= N;
ans += N;
}
}
ans += tmp;
cout << ans + 1 << endl;
}
/*
rep(i,M){
if(v[T[i] - 'a'].size() == 0){
cout << -1 << endl;
return 0;
}
tmp = v[T[i] - 'a'].front();
v[T[i] - 'a'].pop();
if(ans < tmp){
ans = tmp;
v[T[i] - 'a'].push(tmp);
}else{
bool flag = false;
if(ans-tmp < N){
rep(j,v[T[i] - 'a'].size()){
v[T[i] - 'a'].push(tmp);
tmp = v[T[i] - 'a'].front();
v[T[i] - 'a'].pop();
if(ans < tmp){
ans = tmp;
v[T[i] - 'a'].push(tmp);
flag = true;
break;
}
}
}
if(flag)continue;
ll q = (ans-tmp)/N + 1;
ans = tmp + q*N;
v[T[i] - 'a'].push(tmp);
}
}
cout << ans+1 << endl;
}*/
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
template <class T, class S> void cmin(T &a, const S &b) {
if (a > b)
a = b;
}
template <class T, class S> void cmax(T &a, const S &b) {
if (a < b)
a = b;
}
template <class A> void PR(A a, ll n) {
rep(i, n) {
if (i)
cout << ' ';
cout << a[i];
}
cout << "\n";
}
ld PI = 3.14159265358979323846;
int main() {
string S, T;
cin >> S >> T;
ll N = S.size();
ll M = T.size();
vector<vector<ll>> v(26);
rep(i, N) { v[S[i] - 'a'].push_back(i); }
rep(i, N) { v[S[i] - 'a'].push_back(i + N); }
ll ans = 0;
ll tmp = -1;
rep(i, M) {
ll c = T[i] - 'a';
if (v[c].size() == 0) {
cout << -1 << endl;
return 0;
}
tmp = *upper_bound(v[c].begin(), v[c].end(), tmp);
if (tmp >= N) {
tmp -= N;
ans += N;
}
}
ans += tmp;
cout << ans + 1 << endl;
}
/*
rep(i,M){
if(v[T[i] - 'a'].size() == 0){
cout << -1 << endl;
return 0;
}
tmp = v[T[i] - 'a'].front();
v[T[i] - 'a'].pop();
if(ans < tmp){
ans = tmp;
v[T[i] - 'a'].push(tmp);
}else{
bool flag = false;
if(ans-tmp < N){
rep(j,v[T[i] - 'a'].size()){
v[T[i] - 'a'].push(tmp);
tmp = v[T[i] - 'a'].front();
v[T[i] - 'a'].pop();
if(ans < tmp){
ans = tmp;
v[T[i] - 'a'].push(tmp);
flag = true;
break;
}
}
}
if(flag)continue;
ll q = (ans-tmp)/N + 1;
ans = tmp + q*N;
v[T[i] - 'a'].push(tmp);
}
}
cout << ans+1 << endl;
}*/
|
[
"literal.number.change",
"variable_declaration.value.change"
] | 739,352
| 739,349
|
u601256797
|
cpp
|
p02937
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
template <class T, class S> void cmin(T &a, const S &b) {
if (a > b)
a = b;
}
template <class T, class S> void cmax(T &a, const S &b) {
if (a < b)
a = b;
}
template <class A> void PR(A a, ll n) {
rep(i, n) {
if (i)
cout << ' ';
cout << a[i];
}
cout << "\n";
}
ld PI = 3.14159265358979323846;
int main() {
string S, T;
cin >> S >> T;
ll N = S.size();
ll M = T.size();
vector<vector<ll>> v(26);
rep(i, N) { v[S[i] - 'a'].push_back(i); }
rep(i, N) { v[S[i] - 'a'].push_back(i + N); }
ll ans = 0;
ll tmp = 0;
rep(i, M) {
ll c = T[i] - 'a';
if (v[c].size() == 0) {
cout << -1 << endl;
return 0;
}
tmp = *lower_bound(v[c].begin(), v[c].end(), tmp) + 1;
if (tmp >= N) {
tmp -= N;
ans += N;
}
}
ans += tmp;
cout << ans + 1 << endl;
}
/*
rep(i,M){
if(v[T[i] - 'a'].size() == 0){
cout << -1 << endl;
return 0;
}
tmp = v[T[i] - 'a'].front();
v[T[i] - 'a'].pop();
if(ans < tmp){
ans = tmp;
v[T[i] - 'a'].push(tmp);
}else{
bool flag = false;
if(ans-tmp < N){
rep(j,v[T[i] - 'a'].size()){
v[T[i] - 'a'].push(tmp);
tmp = v[T[i] - 'a'].front();
v[T[i] - 'a'].pop();
if(ans < tmp){
ans = tmp;
v[T[i] - 'a'].push(tmp);
flag = true;
break;
}
}
}
if(flag)continue;
ll q = (ans-tmp)/N + 1;
ans = tmp + q*N;
v[T[i] - 'a'].push(tmp);
}
}
cout << ans+1 << endl;
}*/
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
template <class T, class S> void cmin(T &a, const S &b) {
if (a > b)
a = b;
}
template <class T, class S> void cmax(T &a, const S &b) {
if (a < b)
a = b;
}
template <class A> void PR(A a, ll n) {
rep(i, n) {
if (i)
cout << ' ';
cout << a[i];
}
cout << "\n";
}
ld PI = 3.14159265358979323846;
int main() {
string S, T;
cin >> S >> T;
ll N = S.size();
ll M = T.size();
vector<vector<ll>> v(26);
rep(i, N) { v[S[i] - 'a'].push_back(i); }
rep(i, N) { v[S[i] - 'a'].push_back(i + N); }
ll ans = 0;
ll tmp = 0;
rep(i, M) {
ll c = T[i] - 'a';
if (v[c].size() == 0) {
cout << -1 << endl;
return 0;
}
tmp = *lower_bound(v[c].begin(), v[c].end(), tmp) + 1;
if (tmp >= N) {
tmp -= N;
ans += N;
}
}
ans += tmp;
cout << ans << endl;
}
/*
rep(i,M){
if(v[T[i] - 'a'].size() == 0){
cout << -1 << endl;
return 0;
}
tmp = v[T[i] - 'a'].front();
v[T[i] - 'a'].pop();
if(ans < tmp){
ans = tmp;
v[T[i] - 'a'].push(tmp);
}else{
bool flag = false;
if(ans-tmp < N){
rep(j,v[T[i] - 'a'].size()){
v[T[i] - 'a'].push(tmp);
tmp = v[T[i] - 'a'].front();
v[T[i] - 'a'].pop();
if(ans < tmp){
ans = tmp;
v[T[i] - 'a'].push(tmp);
flag = true;
break;
}
}
}
if(flag)continue;
ll q = (ans-tmp)/N + 1;
ans = tmp + q*N;
v[T[i] - 'a'].push(tmp);
}
}
cout << ans+1 << endl;
}*/
|
[
"expression.operation.binary.remove"
] | 739,351
| 739,353
|
u601256797
|
cpp
|
p02937
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
template <class T, class S> void cmin(T &a, const S &b) {
if (a > b)
a = b;
}
template <class T, class S> void cmax(T &a, const S &b) {
if (a < b)
a = b;
}
template <class A> void PR(A a, ll n) {
rep(i, n) {
if (i)
cout << ' ';
cout << a[i];
}
cout << "\n";
}
ld PI = 3.14159265358979323846;
int main() {
string S, T;
cin >> S >> T;
ll N = S.size();
ll M = T.size();
vector<vector<ll>> v(26);
rep(i, N) { v[S[i] - 'a'].push_back(i); }
rep(i, N) { v[S[i] - 'a'].push_back(i + N); }
ll ans = 0;
ll tmp = 0;
rep(i, M) {
ll c = T[i] - 'a';
if (v[c].size() == 0) {
cout << -1 << endl;
return 0;
}
tmp = *upper_bound(v[c].begin(), v[c].end(), tmp);
if (tmp >= N) {
tmp -= N;
ans += N;
}
}
ans += tmp;
cout << ans + 1 << endl;
}
/*
rep(i,M){
if(v[T[i] - 'a'].size() == 0){
cout << -1 << endl;
return 0;
}
tmp = v[T[i] - 'a'].front();
v[T[i] - 'a'].pop();
if(ans < tmp){
ans = tmp;
v[T[i] - 'a'].push(tmp);
}else{
bool flag = false;
if(ans-tmp < N){
rep(j,v[T[i] - 'a'].size()){
v[T[i] - 'a'].push(tmp);
tmp = v[T[i] - 'a'].front();
v[T[i] - 'a'].pop();
if(ans < tmp){
ans = tmp;
v[T[i] - 'a'].push(tmp);
flag = true;
break;
}
}
}
if(flag)continue;
ll q = (ans-tmp)/N + 1;
ans = tmp + q*N;
v[T[i] - 'a'].push(tmp);
}
}
cout << ans+1 << endl;
}*/
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
template <class T, class S> void cmin(T &a, const S &b) {
if (a > b)
a = b;
}
template <class T, class S> void cmax(T &a, const S &b) {
if (a < b)
a = b;
}
template <class A> void PR(A a, ll n) {
rep(i, n) {
if (i)
cout << ' ';
cout << a[i];
}
cout << "\n";
}
ld PI = 3.14159265358979323846;
int main() {
string S, T;
cin >> S >> T;
ll N = S.size();
ll M = T.size();
vector<vector<ll>> v(26);
rep(i, N) { v[S[i] - 'a'].push_back(i); }
rep(i, N) { v[S[i] - 'a'].push_back(i + N); }
ll ans = 0;
ll tmp = 0;
rep(i, M) {
ll c = T[i] - 'a';
if (v[c].size() == 0) {
cout << -1 << endl;
return 0;
}
tmp = *lower_bound(v[c].begin(), v[c].end(), tmp) + 1;
if (tmp >= N) {
tmp -= N;
ans += N;
}
}
ans += tmp;
cout << ans << endl;
}
/*
rep(i,M){
if(v[T[i] - 'a'].size() == 0){
cout << -1 << endl;
return 0;
}
tmp = v[T[i] - 'a'].front();
v[T[i] - 'a'].pop();
if(ans < tmp){
ans = tmp;
v[T[i] - 'a'].push(tmp);
}else{
bool flag = false;
if(ans-tmp < N){
rep(j,v[T[i] - 'a'].size()){
v[T[i] - 'a'].push(tmp);
tmp = v[T[i] - 'a'].front();
v[T[i] - 'a'].pop();
if(ans < tmp){
ans = tmp;
v[T[i] - 'a'].push(tmp);
flag = true;
break;
}
}
}
if(flag)continue;
ll q = (ans-tmp)/N + 1;
ans = tmp + q*N;
v[T[i] - 'a'].push(tmp);
}
}
cout << ans+1 << endl;
}*/
|
[
"assignment.value.change",
"identifier.change",
"call.function.change",
"assignment.change",
"expression.operation.binary.remove"
] | 739,352
| 739,353
|
u601256797
|
cpp
|
p02937
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double pi = 3.141592653589793;
typedef unsigned long long ull;
typedef long double ldouble;
const ll INF = 1e18;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
string s, t;
cin >> s >> t;
ll count = 0, n = s.length(), m = t.length();
vector<vector<int>> a(26);
rep(i, n) { a[s[i] - 'a'].push_back(i + 1); }
ll index = 0;
rep(i, m) {
if (a[t[i] - 'a'].size() == 0) {
cout << -1 << endl;
return 0;
} else {
// -------------- 二分探索 --------------------
// 解の存在範囲を初期化
int ti = t[i] - 'a';
// -------------- 標準ライブラリ --------------------
auto position = lower_bound(a[ti].begin(), a[ti].end(), index);
int low_idx = distance(a[ti].begin(), position);
// cout << (char) (ti + 'a') << " :" << a[ti][low_idx] << " index:" <<
// index << " low_idx:" << low_idx << endl;
if (low_idx == a[ti].size()) {
count++;
index = a[ti][0];
} else {
index = a[ti][low_idx];
}
}
}
cout << count * n + index << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const double pi = 3.141592653589793;
typedef unsigned long long ull;
typedef long double ldouble;
const ll INF = 1e18;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
string s, t;
cin >> s >> t;
ll count = 0, n = s.length(), m = t.length();
vector<vector<ll>> a(26);
rep(i, n) { a[s[i] - 'a'].push_back(i + 1); }
ll index = 0;
rep(i, m) {
if (a[t[i] - 'a'].size() == 0) {
cout << -1 << endl;
return 0;
} else {
// -------------- 二分探索 --------------------
// 解の存在範囲を初期化
ll ti = t[i] - 'a';
// -------------- 標準ライブラリ --------------------
auto position = upper_bound(a[ti].begin(), a[ti].end(), index);
ll low_idx = distance(a[ti].begin(), position);
// cout << (char) (ti + 'a') << " :" << a[ti][low_idx] << " index:" <<
// index << " low_idx:" << low_idx << endl;
if (low_idx == a[ti].size()) {
count++;
index = a[ti][0];
} else {
index = a[ti][low_idx];
}
}
}
cout << count * n + index << endl;
}
|
[
"variable_declaration.type.change",
"identifier.change",
"call.function.change"
] | 739,354
| 739,355
|
u345188429
|
cpp
|
p02937
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define dup(x, y) (((x) + (y)-1) / (y))
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const ll LINF = 1e15;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int main() {
string s, t;
cin >> s >> t;
vector<vector<int>> v(26);
int n = s.size();
s += s;
rep(i, s.size()) { v[s[i] - 'a'].push_back(i); }
int p = 0;
ll x = 0;
rep(i, t.size()) {
int k = t[i] - 'a';
if (!v[k].size()) {
cout << -1 << endl;
return 0;
}
p = v[k][lower_bound(v[k].begin(), v[k].end(), p) - v[k].begin()];
if (p >= n) {
x++;
p %= n;
}
}
cout << n * x + p + 1 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define dup(x, y) (((x) + (y)-1) / (y))
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const ll LINF = 1e15;
const int MOD = 1000000007;
const double PI = acos(-1);
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int main() {
string s, t;
cin >> s >> t;
vector<vector<int>> v(26);
int n = s.size();
s += s;
rep(i, s.size()) { v[s[i] - 'a'].push_back(i); }
int p = -1;
ll x = 0;
rep(i, t.size()) {
int k = t[i] - 'a';
if (!v[k].size()) {
cout << -1 << endl;
return 0;
}
p = v[k][upper_bound(v[k].begin(), v[k].end(), p) - v[k].begin()];
if (p >= n) {
x++;
p %= n;
}
}
cout << n * x + p + 1 << endl;
}
|
[
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change",
"identifier.change",
"call.function.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 739,360
| 739,361
|
u280175105
|
cpp
|
p02937
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++)
typedef long long ll;
template <typename T> struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(const int &x) {
to = x;
return *this;
}
operator int() const { return to; }
};
template <typename T> using Edges = vector<edge<T>>;
template <typename T> using WeightedGraph = vector<Edges<T>>;
using UnWeightedGraph = vector<vector<int>>;
template <typename T> using Matrix = vector<vector<T>>;
/////////////////////////////////////////////////////////////////////
const ll inf = 1LL << 60;
int main() {
string s, t;
cin >> s >> t;
int sl = s.size();
int tl = t.size();
vector<vector<int>> dic(26);
rep(i, sl) {
int x = s[i] - 'a';
dic[x].push_back(i + 1);
}
ll ans = 0;
ll now = 0;
rep(i, tl) {
int x = t[i] - 'a';
if (dic[x].empty()) {
cout << -1 << endl;
return 0;
}
auto itr = lower_bound(dic[x].begin(), dic[x].end(), now);
if (itr == dic[x].end()) {
ans += sl;
now = 0;
itr = lower_bound(dic[x].begin(), dic[x].end(), now);
}
now = *itr;
}
cout << ans + now << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++)
typedef long long ll;
template <typename T> struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(const int &x) {
to = x;
return *this;
}
operator int() const { return to; }
};
template <typename T> using Edges = vector<edge<T>>;
template <typename T> using WeightedGraph = vector<Edges<T>>;
using UnWeightedGraph = vector<vector<int>>;
template <typename T> using Matrix = vector<vector<T>>;
/////////////////////////////////////////////////////////////////////
const ll inf = 1LL << 60;
int main() {
string s, t;
cin >> s >> t;
int sl = s.size();
int tl = t.size();
vector<vector<int>> dic(26);
rep(i, sl) {
int x = s[i] - 'a';
dic[x].push_back(i + 1);
}
ll ans = 0;
ll now = 0;
rep(i, tl) {
int x = t[i] - 'a';
if (dic[x].empty()) {
cout << -1 << endl;
return 0;
}
auto itr = upper_bound(dic[x].begin(), dic[x].end(), now);
if (itr == dic[x].end()) {
ans += sl;
now = 0;
itr = upper_bound(dic[x].begin(), dic[x].end(), now);
}
now = *itr;
}
cout << ans + now << endl;
return 0;
}
|
[
"identifier.change",
"call.function.change",
"assignment.value.change"
] | 739,372
| 739,373
|
u305824645
|
cpp
|
p02937
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
vector<ll> C[30];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string S, T;
cin >> S >> T;
ll N = S.length();
ll M = T.length();
REP(i, N) { C[S[i] - 'a'].push_back(i); }
REP(i, 30) { C[i].push_back(INF); }
ll x = 0;
ll index = -1;
REP(i, M) {
auto &v = C[T[i] - 'a'];
if (v.size() == 1) {
cout << -1 << endl;
return 0;
}
ll nxt = lower_bound(v.begin(), v.end(), index) - v.begin();
if (v[nxt] == INF || v[nxt] < index) {
x++;
nxt = 0;
}
index = v[nxt];
}
cout << x * N + index + 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
vector<ll> C[30];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
string S, T;
cin >> S >> T;
ll N = S.length();
ll M = T.length();
REP(i, N) { C[S[i] - 'a'].push_back(i); }
REP(i, 30) { C[i].push_back(INF); }
ll x = 0;
ll index = -1;
REP(i, M) {
auto &v = C[T[i] - 'a'];
if (v.size() == 1) {
cout << -1 << endl;
return 0;
}
ll nxt = upper_bound(v.begin(), v.end(), index) - v.begin();
if (v[nxt] == INF || v[nxt] < index) {
x++;
nxt = 0;
}
index = v[nxt];
}
cout << x * N + index + 1 << endl;
return 0;
}
|
[
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 739,374
| 739,375
|
u340980616
|
cpp
|
p02937
|
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <set>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using arr = vector<ll>;
constexpr ll MOD = 1000000007;
constexpr ll INF = 1LL << 60;
constexpr int MAX = 2020;
string s, t;
set<int> st[26];
int main() {
cin >> s >> t;
int n = (int)s.size();
int m = (int)t.size();
s += s;
for (int i = 0; i < n * 2; ++i) {
st[s[i] - 'a'].insert(i);
}
ll ans = 0, pos = -1;
for (int i = 0; i < m; ++i) {
if (st[t[i] - 'a'].empty()) {
cout << -1;
return 0;
}
int next = *st[t[i] - 'a'].lower_bound(pos);
ans += next - pos;
pos = next % n;
}
cout << ans;
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <set>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using arr = vector<ll>;
constexpr ll MOD = 1000000007;
constexpr ll INF = 1LL << 60;
constexpr int MAX = 2020;
string s, t;
set<int> st[26];
int main() {
cin >> s >> t;
int n = (int)s.size();
int m = (int)t.size();
s += s;
for (int i = 0; i < n * 2; ++i) {
st[s[i] - 'a'].insert(i);
}
ll ans = 0, pos = 0;
for (int i = 0; i < m; ++i) {
if (st[t[i] - 'a'].empty()) {
cout << -1;
return 0;
}
int next = *st[t[i] - 'a'].lower_bound(pos) + 1;
ans += next - pos;
pos = next % n;
}
cout << ans;
return 0;
}
|
[
"literal.number.change",
"variable_declaration.value.change"
] | 739,388
| 739,389
|
u843175622
|
cpp
|
p02937
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPi(i, a, b) for (int i = int(a); i < int(b); i++)
#define MEMS(a, b) memset(a, b, sizeof(a))
#define mp make_pair
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;
}
const ll MOD = 1e9 + 7;
vector<int> X[30];
int main() {
string S, T;
cin >> S >> T;
ll NS, NT;
NS = S.size();
NT = T.size();
REP(i, NS) {
int c = S[i] - 'a';
X[c].push_back(i);
}
REP(i, NT) {
int c = T[i] - 'a';
if (X[c].size() == 0) {
cout << -1 << endl;
return 0;
}
}
ll ans = 0;
int pos = 0;
REP(i, NT) {
int c = T[i] - 'a';
auto iter = lower_bound(X[c].begin(), X[c].end(), pos);
if (iter == X[c].end()) {
ans += NS;
pos = X[c][0];
} else {
pos = *iter;
}
}
ans += pos + 1;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPi(i, a, b) for (int i = int(a); i < int(b); i++)
#define MEMS(a, b) memset(a, b, sizeof(a))
#define mp make_pair
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;
}
const ll MOD = 1e9 + 7;
vector<int> X[30];
int main() {
string S, T;
cin >> S >> T;
ll NS, NT;
NS = S.size();
NT = T.size();
REP(i, NS) {
int c = S[i] - 'a';
X[c].push_back(i);
}
REP(i, NT) {
int c = T[i] - 'a';
if (X[c].size() == 0) {
cout << -1 << endl;
return 0;
}
}
ll ans = 0;
int pos = -1;
REP(i, NT) {
int c = T[i] - 'a';
auto iter = upper_bound(X[c].begin(), X[c].end(), pos);
if (iter == X[c].end()) {
ans += NS;
pos = X[c][0];
} else {
pos = *iter;
}
}
ans += pos + 1;
cout << ans << endl;
return 0;
}
|
[
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"call.function.change"
] | 739,394
| 739,395
|
u666394517
|
cpp
|
p02937
|
#include <algorithm>
#include <cmath>
#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) = (m); (i) < (n); (i)++)
#define All(v) (v).begin(), (v).end()
typedef long long ll;
ll nxt[200100][27];
int main() {
string s, t;
cin >> s >> t;
ll m = s.size();
s = s + s;
rep(i, 2 * m + 1) rep(j, 27) nxt[i][j] = -1;
for (ll i = 2 * m - 1; i >= 0; i--) {
rep(j, 27) { nxt[i][j] = nxt[i + 1][j]; }
int c = s[i] - 'a';
nxt[i][c] = i;
// cout << "i:" << i << " c:" << (char)(c + 'a') << endl;
}
ll now = 0;
ll res = 1LL;
rep(i, t.size()) {
if (nxt[now][t[i] - 'a'] != -1) {
ll tmp = now;
now = nxt[now][t[i] - 'a'];
res += now - tmp;
now %= m;
// cout << t[i] << " " << res << endl;
} else {
cout << -1 << endl;
return 0;
}
}
cout << res << endl;
return 0;
}
|
#include <algorithm>
#include <cmath>
#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) = (m); (i) < (n); (i)++)
#define All(v) (v).begin(), (v).end()
typedef long long ll;
ll nxt[200100][27];
int main() {
string s, t;
cin >> s >> t;
ll m = s.size();
s = s + s;
rep(i, 2 * m + 1) rep(j, 27) nxt[i][j] = -1;
for (ll i = 2 * m - 1; i >= 0; i--) {
rep(j, 27) { nxt[i][j] = nxt[i + 1][j]; }
int c = s[i] - 'a';
nxt[i][c] = i + 1;
// cout << "i:" << i << " c:" << (char)(c + 'a') << endl;
}
ll now = 0;
ll res = 0;
rep(i, t.size()) {
if (nxt[now][t[i] - 'a'] != -1) {
ll tmp = now;
now = nxt[now][t[i] - 'a'];
res += now - tmp;
now %= m;
// cout << t[i] << " " << res << endl;
} else {
cout << -1 << endl;
return 0;
}
}
cout << res << endl;
return 0;
}
|
[
"assignment.change",
"literal.number.change",
"variable_declaration.value.change"
] | 739,401
| 739,402
|
u917282863
|
cpp
|
p02937
|
#include <algorithm>
#include <cmath>
#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) = (m); (i) < (n); (i)++)
#define All(v) (v).begin(), (v).end()
typedef long long ll;
ll nxt[200100][27];
int main() {
string s, t;
cin >> s >> t;
ll m = s.size();
s = s + s;
rep(i, 2 * m + 1) rep(j, 27) nxt[i][j] = -1;
for (int i = 2 * m - 1; i >= 0; i--) {
rep(j, 27) { nxt[i][j] = nxt[i + 1][j]; }
int c = s[i] - 'a';
nxt[i][c] = i;
// cout << "i:" << i << " c:" << (char)(c + 'a') << endl;
}
ll now = 0;
ll res = 1;
rep(i, t.size()) {
if (nxt[now][t[i] - 'a'] != -1) {
ll tmp = now;
now = nxt[now][t[i] - 'a'];
res += now - tmp;
now %= m;
// cout << t[i] << " " << res << endl;
} else {
cout << -1 << endl;
return 0;
}
}
cout << res << endl;
return 0;
}
|
#include <algorithm>
#include <cmath>
#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) = (m); (i) < (n); (i)++)
#define All(v) (v).begin(), (v).end()
typedef long long ll;
ll nxt[200100][27];
int main() {
string s, t;
cin >> s >> t;
ll m = s.size();
s = s + s;
rep(i, 2 * m + 1) rep(j, 27) nxt[i][j] = -1;
for (ll i = 2 * m - 1; i >= 0; i--) {
rep(j, 27) { nxt[i][j] = nxt[i + 1][j]; }
int c = s[i] - 'a';
nxt[i][c] = i + 1;
// cout << "i:" << i << " c:" << (char)(c + 'a') << endl;
}
ll now = 0;
ll res = 0;
rep(i, t.size()) {
if (nxt[now][t[i] - 'a'] != -1) {
ll tmp = now;
now = nxt[now][t[i] - 'a'];
res += now - tmp;
now %= m;
// cout << t[i] << " " << res << endl;
} else {
cout << -1 << endl;
return 0;
}
}
cout << res << endl;
return 0;
}
|
[
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"assignment.change",
"literal.number.change",
"variable_declaration.value.change"
] | 739,403
| 739,402
|
u917282863
|
cpp
|
p02937
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define m1(x) memset(x, -1, sizeof(x))
const ll INF = 1e18 + 1;
const ll MOD = 1e9 + 7;
const double PI = 3.141592653589793;
int main() {
string s, t;
cin >> s >> t;
set<char> se;
map<char, vector<int>> mp;
rep(i, s.size()) {
se.insert(s.at(i));
mp[s.at(i)].push_back(i);
}
int S = se.size();
rep(i, t.size()) {
se.insert(t.at(i));
int k = se.size();
if (k > S) {
cout << -1 << endl;
return 0;
}
}
ll k = s.size();
ll cnt = -1, pos = 0;
for (int i = 0; i < t.size(); i++) {
auto itr = upper_bound(all(mp[t.at(i)]), pos);
if (itr - mp[t.at(i)].begin() >= mp[t.at(i)].size()) {
cnt++;
pos = mp[t.at(i)][0];
} else {
pos = *itr;
}
}
cout << cnt * k + pos + 1 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define m1(x) memset(x, -1, sizeof(x))
const ll INF = 1e18 + 1;
const ll MOD = 1e9 + 7;
const double PI = 3.141592653589793;
int main() {
string s, t;
cin >> s >> t;
set<char> se;
map<char, vector<int>> mp;
rep(i, s.size()) {
se.insert(s.at(i));
mp[s.at(i)].push_back(i);
}
int S = se.size();
rep(i, t.size()) {
se.insert(t.at(i));
int k = se.size();
if (k > S) {
cout << -1 << endl;
return 0;
}
}
ll k = s.size();
ll cnt = 0, pos = -1;
for (int i = 0; i < t.size(); i++) {
auto itr = upper_bound(all(mp[t.at(i)]), pos);
if (itr - mp[t.at(i)].begin() >= mp[t.at(i)].size()) {
cnt++;
pos = mp[t.at(i)][0];
} else {
pos = *itr;
}
}
cout << cnt * k + pos + 1 << endl;
}
|
[
"literal.number.change",
"variable_declaration.value.change"
] | 739,410
| 739,411
|
u317379170
|
cpp
|
p02937
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define m1(x) memset(x, -1, sizeof(x))
const ll INF = 1e18 + 1;
const ll MOD = 1e9 + 7;
const double PI = 3.141592653589793;
int main() {
string s, t;
cin >> s >> t;
set<char> se;
map<char, vector<int>> mp;
rep(i, s.size()) {
se.insert(s.at(i));
mp[s.at(i)].push_back(i);
}
int S = se.size();
rep(i, t.size()) {
se.insert(t.at(i));
int k = se.size();
if (k > S) {
cout << -1 << endl;
return 0;
}
}
ll k = s.size();
ll cnt = 0, pos = 0;
for (int i = 0; i < t.size(); i++) {
auto itr = upper_bound(all(mp[t.at(i)]), pos);
if (itr - mp[t.at(i)].begin() >= mp[t.at(i)].size()) {
cnt++;
pos = mp[t.at(i)][0];
} else {
pos = *itr;
}
}
cout << cnt * k + pos + 1 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define m1(x) memset(x, -1, sizeof(x))
const ll INF = 1e18 + 1;
const ll MOD = 1e9 + 7;
const double PI = 3.141592653589793;
int main() {
string s, t;
cin >> s >> t;
set<char> se;
map<char, vector<int>> mp;
rep(i, s.size()) {
se.insert(s.at(i));
mp[s.at(i)].push_back(i);
}
int S = se.size();
rep(i, t.size()) {
se.insert(t.at(i));
int k = se.size();
if (k > S) {
cout << -1 << endl;
return 0;
}
}
ll k = s.size();
ll cnt = 0, pos = -1;
for (int i = 0; i < t.size(); i++) {
auto itr = upper_bound(all(mp[t.at(i)]), pos);
if (itr - mp[t.at(i)].begin() >= mp[t.at(i)].size()) {
cnt++;
pos = mp[t.at(i)][0];
} else {
pos = *itr;
}
}
cout << cnt * k + pos + 1 << endl;
}
|
[
"literal.number.change",
"variable_declaration.value.change"
] | 739,412
| 739,411
|
u317379170
|
cpp
|
p02937
|
//ヘッダー
#include <bits/stdc++.h>
using namespace std;
//型定義
typedef long long ll;
//定数
#define INF 1000000000000 // 10^12:極めて大きい値,∞
#define MOD 1e+9 + 7 // 10^9+7
#define MAXR 100000 // 10^5:配列の最大のrange(素数列挙などで使用)
// REPマクロ
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define REP2(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define REPD2(i, a, b) for (ll i = a; i >= (ll)(b); i--)
// vectorの扱い
#define ALL(x) (x).begin(), (x).end() // sortなどの引数省略
#define SIZE(x) ((ll)(x).size()) // size
#define MAX(x) *max_element(ALL(x)) //最大値
#define MIN(x) *min_element(ALL(x)) //最小値
//グローバル変数
//ライブラリ挿入
int main() {
string s, t;
cin >> s >> t;
int N_t = t.size();
int N_s = s.size();
vector<int> alpha_s[26];
vector<bool> bool_s(26, false);
int char_cur;
// s数え上げ
REP(i, N_s) {
char_cur = s[i] - 'a';
alpha_s[char_cur].push_back(i);
bool_s[char_cur] = true;
}
// t数え上げ
REP(i, N_t) {
char_cur = t[i] - 'a';
if (bool_s[char_cur] == false) {
cout << -1 << endl;
return 0;
}
}
int num_cur = 0;
int itr;
ll ans = 1;
REP(i, N_t) {
char_cur = t[i] - 'a';
itr = upper_bound(alpha_s[char_cur].begin(), alpha_s[char_cur].end(),
num_cur) -
alpha_s[char_cur].begin();
if (itr == alpha_s[char_cur].size()) {
ans += (N_s - (num_cur - alpha_s[char_cur][0]));
num_cur = alpha_s[char_cur][0];
} else {
ans += (alpha_s[char_cur][itr] - num_cur);
num_cur = alpha_s[char_cur][itr];
}
}
cout << ans << endl;
}
|
//ヘッダー
#include <bits/stdc++.h>
using namespace std;
//型定義
typedef long long ll;
//定数
#define INF 1000000000000 // 10^12:極めて大きい値,∞
#define MOD 1e+9 + 7 // 10^9+7
#define MAXR 100000 // 10^5:配列の最大のrange(素数列挙などで使用)
// REPマクロ
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define REP2(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define REPD2(i, a, b) for (ll i = a; i >= (ll)(b); i--)
// vectorの扱い
#define ALL(x) (x).begin(), (x).end() // sortなどの引数省略
#define SIZE(x) ((ll)(x).size()) // size
#define MAX(x) *max_element(ALL(x)) //最大値
#define MIN(x) *min_element(ALL(x)) //最小値
//グローバル変数
//ライブラリ挿入
int main() {
string s, t;
cin >> s >> t;
int N_t = t.size();
int N_s = s.size();
vector<int> alpha_s[26];
vector<bool> bool_s(26, false);
int char_cur;
// s数え上げ
REP(i, N_s) {
char_cur = s[i] - 'a';
alpha_s[char_cur].push_back(i);
bool_s[char_cur] = true;
}
// t数え上げ
REP(i, N_t) {
char_cur = t[i] - 'a';
if (bool_s[char_cur] == false) {
cout << -1 << endl;
return 0;
}
}
int num_cur = -1;
int itr;
ll ans = 0;
REP(i, N_t) {
char_cur = t[i] - 'a';
itr = upper_bound(alpha_s[char_cur].begin(), alpha_s[char_cur].end(),
num_cur) -
alpha_s[char_cur].begin();
if (itr == alpha_s[char_cur].size()) {
ans += (N_s - (num_cur - alpha_s[char_cur][0]));
num_cur = alpha_s[char_cur][0];
} else {
ans += (alpha_s[char_cur][itr] - num_cur);
num_cur = alpha_s[char_cur][itr];
}
}
cout << ans << endl;
}
|
[
"literal.number.change",
"variable_declaration.value.change"
] | 739,418
| 739,419
|
u115927976
|
cpp
|
p02937
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP0(i, n) for (int i = (n)-1; i >= 0; --i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP1(i, n) for (int i = (n); i >= 1; --i)
#define pow10(n) int(1e##n + n)
typedef long long LL;
typedef pair<int, int> P;
const int INTINF = int(1e9) + 1;
const LL LLINF = LL(1e18) + 1;
long double eps = 1.0E-14;
void solve() {
string s, t;
cin >> s >> t;
map<char, vector<int>> char_indices;
REP0(i, s.length()) { char_indices[s[i]].push_back(i); }
LL cnt = 0;
int i_in_period = 0;
int s_N = s.length();
for (auto c : t) {
if (char_indices.find(c) == char_indices.end()) {
std::cout << -1 << endl;
return;
}
// 最も近い次の文字の出てくる添字を探す
int ng = -1;
int ok = char_indices[c].size();
int mid = 0;
while (abs(ok - ng) > 1) {
mid = (ok + ng) / 2;
if (i_in_period < char_indices[c][mid])
ok = mid;
else
ng = mid;
}
if (mid == int(char_indices[c].size())) {
cnt += s_N;
i_in_period = char_indices[c][0];
} else {
i_in_period = char_indices[c][mid];
}
}
cnt += i_in_period + 1;
std::cout << cnt << endl;
}
int main(int argc, char const *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(20);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP0(i, n) for (int i = (n)-1; i >= 0; --i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP1(i, n) for (int i = (n); i >= 1; --i)
#define pow10(n) int(1e##n + n)
typedef long long LL;
typedef pair<int, int> P;
const int INTINF = int(1e9) + 1;
const LL LLINF = LL(1e18) + 1;
long double eps = 1.0E-14;
void solve() {
string s, t;
cin >> s >> t;
map<char, vector<int>> char_indices;
REP0(i, s.length()) { char_indices[s[i]].push_back(i); }
LL cnt = 0;
int i_in_period = -1;
int s_N = s.length();
for (auto c : t) {
if (char_indices.find(c) == char_indices.end()) {
std::cout << -1 << endl;
return;
}
// 最も近い次の文字の出てくる添字を探す
int ng = -1;
int ok = char_indices[c].size();
int mid = 0;
while (abs(ok - ng) > 1) {
mid = (ok + ng) / 2;
if (i_in_period < char_indices[c][mid])
ok = mid;
else
ng = mid;
}
if (ok == int(char_indices[c].size())) {
cnt += s_N;
i_in_period = char_indices[c][0];
} else {
i_in_period = char_indices[c][ok];
}
}
cnt += i_in_period + 1;
std::cout << cnt << endl;
}
int main(int argc, char const *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(20);
solve();
return 0;
}
|
[
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 739,426
| 739,425
|
u938389536
|
cpp
|
p02937
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP0(i, n) for (int i = (n)-1; i >= 0; --i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP1(i, n) for (int i = (n); i >= 1; --i)
#define pow10(n) int(1e##n + n)
typedef long long LL;
typedef pair<int, int> P;
const int INTINF = int(1e9) + 1;
const LL LLINF = LL(1e18) + 1;
long double eps = 1.0E-14;
void solve() {
string s, t;
cin >> s >> t;
map<char, vector<int>> char_indices;
REP0(i, s.length()) { char_indices[s[i]].push_back(i); }
LL cnt = 0;
int i_in_period = 0;
int s_N = s.length();
for (auto c : t) {
if (char_indices.find(c) == char_indices.end()) {
std::cout << -1 << endl;
return;
}
// 最も近い次の文字の出てくる添字を探す
int ng = -1;
int ok = char_indices[c].size();
int mid = 0;
while (abs(ok - ng) > 1) {
mid = (ok + ng) / 2;
if (i_in_period < char_indices[c][mid])
ok = mid;
else
ng = mid;
}
if (ok == int(char_indices[c].size())) {
cnt += s_N;
i_in_period = char_indices[c][0];
} else {
i_in_period = char_indices[c][mid];
}
}
cnt += i_in_period + 1;
std::cout << cnt << endl;
}
int main(int argc, char const *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(20);
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define RREP0(i, n) for (int i = (n)-1; i >= 0; --i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
#define RREP1(i, n) for (int i = (n); i >= 1; --i)
#define pow10(n) int(1e##n + n)
typedef long long LL;
typedef pair<int, int> P;
const int INTINF = int(1e9) + 1;
const LL LLINF = LL(1e18) + 1;
long double eps = 1.0E-14;
void solve() {
string s, t;
cin >> s >> t;
map<char, vector<int>> char_indices;
REP0(i, s.length()) { char_indices[s[i]].push_back(i); }
LL cnt = 0;
int i_in_period = -1;
int s_N = s.length();
for (auto c : t) {
if (char_indices.find(c) == char_indices.end()) {
std::cout << -1 << endl;
return;
}
// 最も近い次の文字の出てくる添字を探す
int ng = -1;
int ok = char_indices[c].size();
int mid = 0;
while (abs(ok - ng) > 1) {
mid = (ok + ng) / 2;
if (i_in_period < char_indices[c][mid])
ok = mid;
else
ng = mid;
}
if (ok == int(char_indices[c].size())) {
cnt += s_N;
i_in_period = char_indices[c][0];
} else {
i_in_period = char_indices[c][ok];
}
}
cnt += i_in_period + 1;
std::cout << cnt << endl;
}
int main(int argc, char const *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(20);
solve();
return 0;
}
|
[
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 739,427
| 739,425
|
u938389536
|
cpp
|
p02937
|
#include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define INT_MAX_VALUE 2147483647
#define LONG_LONG_MAX_VALUE 9223372036854775807
#define ll long long
#define ld long double
struct XX {
int x;
int i;
};
class xxGreater {
public:
bool operator()(const XX &riLeft, const XX &riRight) const {
//第2条件
if ((riLeft.x) == (riRight.x)) {
return riLeft.i >
riRight.i; //<:昇順(小さいものから順番)、>:降順(大きいものから順番)
//プライオリティキューの場合は > で、top()すると値の小さいものがとれる
}
//第1条件
return (riLeft.x) > (riRight.x);
}
};
// map<long long,long long> prime_f(long long n){
// map<long long,long long>res;
// for(int i=2;i*i<=n;i++){
// while(n%i==0){
// ++res[i];
// n/=i;
// }
// }
// if(n!=1)res[n]=1;
// return res;
//}
// int n;
////int dat[2*10000000];
////int dat2[2*10000000];
// int dat[10];
// int dat2[10];
//
// void init(int n_){
// n=1;
// while(n<n_)n*=2;
// for(int i=0;i<2*n-1;i++){
// dat[i]=0;
// dat2[i]=0;
// }
//}
//
// void initset(int k,int a){
// k+=n-1;
// dat[k]=a;
// while(k>0){
// k=(k-1)/2;
// dat[k]=dat[k*2+1]+dat[k*2+2];
// }
//}
//
////[a,b)の間を[l,r]区間で比較しアップデート
////引数のindexに注意
////nは固定。initで計算すみ
////update2(L[i],R[i]+1,0,0,n,D[i]);
// void update2(int a,int b,int k,int l,int r,int v){//v更新値、区間は0-index
// if(r<=a || b<=l)return;
// if(a<=l && r<=b){
// dat[k]+=dat2[k];
// if(r-l>1){
// dat2[k*2+1]+=dat2[k]/2;
// dat2[k*2+1]+=dat2[k]/2;
// }
// dat2[k]=v*(r-l);
// return;
// }else{
// update2(a,b,k*2+1,l,(l+r)/2,v);
// update2(a,b,k*2+2,(l+r)/2,r,v);
// return;
// }
//}
//
// int query(int a,int b,int k,int l,int r){
// if(r<=a || b<=l)return 0;
// if(a<=l && r<=b){
// dat[k]+=dat2[k];
// if(r-l>1){
// dat2[k*2+1]+=dat2[k]/2;
// dat2[k*2+1]+=dat2[k]/2;
// }
// dat2[k]=0;
// return dat[k];
// }
// else{
// int vl=query(a,b,k*2+1,l,(l+r)/2);
// int vr=query(a,b,k*2+2,(l+r)/2,r);
// return vl+vr;
// }
//}
// void printb(unsigned int v) {
// unsigned int mask = (int)1 << (sizeof(v) * CHAR_BIT - 1);
// do putchar(mask & v ? '1' : '0');
// while (mask >>= 1);
//}
#ifdef DEBUG
#else
#endif
vector<ll> alpha[26];
int main(int argc, const char *argv[]) {
// scanf("%s",S);
// scanf("%d",&N);
// scanf("%lld %lld",&target1,&target2);
// sscanf(tmp.c_str(),"%dd%d%d",&time[i], &dice[i], &z[i]);
// getline(cin, target);
// ifstream ifs("a.txt");//テスト用
// ifs >> a;
//ここから
//入力高速化
ios::sync_with_stdio(false);
cin.tie(0);
string S, T;
cin >> S >> T;
for (int i = 0; i < S.size(); i++) {
alpha[S[i] - 'a'].push_back(i + 1);
}
ll ind = 0;
ll cnt = 0;
for (int i = 0; i < T.size(); i++) {
if (alpha[T[i] - 'a'].size() == 0) {
cout << -1 << endl;
return 0;
}
auto it =
lower_bound(alpha[T[i] - 'a'].begin(), alpha[T[i] - 'a'].end(), ind);
if (it == alpha[T[i] - 'a'].end()) {
it = lower_bound(alpha[T[i] - 'a'].begin(), alpha[T[i] - 'a'].end(), 0);
ind = *it;
cnt++;
} else {
ind = *it;
}
}
cout << S.size() * cnt + ind << endl;
//ここまで
// cout << " " << "ans" << endl;
// printf("%.0f\n",ans);//小数点以下表示なし
// printf("%.7f\n",p);
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define INT_MAX_VALUE 2147483647
#define LONG_LONG_MAX_VALUE 9223372036854775807
#define ll long long
#define ld long double
struct XX {
int x;
int i;
};
class xxGreater {
public:
bool operator()(const XX &riLeft, const XX &riRight) const {
//第2条件
if ((riLeft.x) == (riRight.x)) {
return riLeft.i >
riRight.i; //<:昇順(小さいものから順番)、>:降順(大きいものから順番)
//プライオリティキューの場合は > で、top()すると値の小さいものがとれる
}
//第1条件
return (riLeft.x) > (riRight.x);
}
};
// map<long long,long long> prime_f(long long n){
// map<long long,long long>res;
// for(int i=2;i*i<=n;i++){
// while(n%i==0){
// ++res[i];
// n/=i;
// }
// }
// if(n!=1)res[n]=1;
// return res;
//}
// int n;
////int dat[2*10000000];
////int dat2[2*10000000];
// int dat[10];
// int dat2[10];
//
// void init(int n_){
// n=1;
// while(n<n_)n*=2;
// for(int i=0;i<2*n-1;i++){
// dat[i]=0;
// dat2[i]=0;
// }
//}
//
// void initset(int k,int a){
// k+=n-1;
// dat[k]=a;
// while(k>0){
// k=(k-1)/2;
// dat[k]=dat[k*2+1]+dat[k*2+2];
// }
//}
//
////[a,b)の間を[l,r]区間で比較しアップデート
////引数のindexに注意
////nは固定。initで計算すみ
////update2(L[i],R[i]+1,0,0,n,D[i]);
// void update2(int a,int b,int k,int l,int r,int v){//v更新値、区間は0-index
// if(r<=a || b<=l)return;
// if(a<=l && r<=b){
// dat[k]+=dat2[k];
// if(r-l>1){
// dat2[k*2+1]+=dat2[k]/2;
// dat2[k*2+1]+=dat2[k]/2;
// }
// dat2[k]=v*(r-l);
// return;
// }else{
// update2(a,b,k*2+1,l,(l+r)/2,v);
// update2(a,b,k*2+2,(l+r)/2,r,v);
// return;
// }
//}
//
// int query(int a,int b,int k,int l,int r){
// if(r<=a || b<=l)return 0;
// if(a<=l && r<=b){
// dat[k]+=dat2[k];
// if(r-l>1){
// dat2[k*2+1]+=dat2[k]/2;
// dat2[k*2+1]+=dat2[k]/2;
// }
// dat2[k]=0;
// return dat[k];
// }
// else{
// int vl=query(a,b,k*2+1,l,(l+r)/2);
// int vr=query(a,b,k*2+2,(l+r)/2,r);
// return vl+vr;
// }
//}
// void printb(unsigned int v) {
// unsigned int mask = (int)1 << (sizeof(v) * CHAR_BIT - 1);
// do putchar(mask & v ? '1' : '0');
// while (mask >>= 1);
//}
#ifdef DEBUG
#else
#endif
vector<ll> alpha[26];
int main(int argc, const char *argv[]) {
// scanf("%s",S);
// scanf("%d",&N);
// scanf("%lld %lld",&target1,&target2);
// sscanf(tmp.c_str(),"%dd%d%d",&time[i], &dice[i], &z[i]);
// getline(cin, target);
// ifstream ifs("a.txt");//テスト用
// ifs >> a;
//ここから
//入力高速化
ios::sync_with_stdio(false);
cin.tie(0);
string S, T;
cin >> S >> T;
for (int i = 0; i < S.size(); i++) {
alpha[S[i] - 'a'].push_back(i + 1);
}
ll ind = 0;
ll cnt = 0;
for (int i = 0; i < T.size(); i++) {
if (alpha[T[i] - 'a'].size() == 0) {
cout << -1 << endl;
return 0;
}
auto it =
upper_bound(alpha[T[i] - 'a'].begin(), alpha[T[i] - 'a'].end(), ind);
if (it == alpha[T[i] - 'a'].end()) {
it = lower_bound(alpha[T[i] - 'a'].begin(), alpha[T[i] - 'a'].end(), 0);
ind = *it;
cnt++;
} else {
ind = *it;
}
}
cout << S.size() * cnt + ind << endl;
//ここまで
// cout << " " << "ans" << endl;
// printf("%.0f\n",ans);//小数点以下表示なし
// printf("%.7f\n",p);
return 0;
}
|
[
"identifier.change",
"call.function.change"
] | 739,428
| 739,429
|
u649310245
|
cpp
|
p02937
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Map = map<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
ll INF = 1LL << 60;
ll MOD = 1000000007;
int main() {
string s;
cin >> s;
string t;
cin >> t;
ll u = s.size();
ll v = t.size();
map<char, vl> M;
for (ll i = 0; i < u; i++) {
M[s[i]].emplace_back(i);
;
}
ll round = 0;
ll mark = 1;
for (ll i = 0; i < v; i++) {
char T = t[i];
if (M[T].empty()) {
cout << -1 << endl;
return 0;
} else if (upper_bound(M[T].begin(), M[T].end(), mark) != M[T].end())
mark = *upper_bound(M[T].begin(), M[T].end(), mark);
else {
round++;
mark = M[T][0];
};
}
cout << round * u + mark + 1LL << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Map = map<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
int main() {
string s;
cin >> s;
string t;
cin >> t;
ll u = s.size();
ll v = t.size();
map<char, vl> M;
for (ll i = 0; i < u; i++) {
M[s[i]].emplace_back(i);
;
}
ll round = 0;
ll mark = -1;
for (ll i = 0; i < v; i++) {
char T = t[i];
if (M[T].empty()) {
cout << -1 << endl;
return 0;
} else if (upper_bound(M[T].begin(), M[T].end(), mark) != M[T].end())
mark = *upper_bound(M[T].begin(), M[T].end(), mark);
else {
round++;
mark = M[T][0];
};
}
cout << round * u + mark + 1LL << endl;
return 0;
}
|
[
"expression.operation.unary.arithmetic.add"
] | 739,432
| 739,433
|
u575802441
|
cpp
|
p02937
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Map = map<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
ll INF = 1LL << 60;
ll MOD = 1000000007;
int main() {
string s;
cin >> s;
string t;
cin >> t;
ll u = s.size();
ll v = t.size();
map<char, vl> M;
for (ll i = 0; i < u; i++) {
M[s[i]].emplace_back(i);
;
}
ll round = 0;
ll mark = 1;
for (ll i = 0; i < v; i++) {
char T = t[i];
if (M[T].empty()) {
cout << -1 << endl;
return 0;
} else if (upper_bound(M[T].begin(), M[T].end(), mark) != M[T].end())
mark = *upper_bound(M[T].begin(), M[T].end(), mark);
else {
round++;
mark = M[T][0];
};
}
cout << round * u + mark + 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Map = map<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
const ll INF = 1LL << 60;
const ll MOD = 1000000007;
int main() {
string s;
cin >> s;
string t;
cin >> t;
ll u = s.size();
ll v = t.size();
map<char, vl> M;
for (ll i = 0; i < u; i++) {
M[s[i]].emplace_back(i);
;
}
ll round = 0;
ll mark = -1;
for (ll i = 0; i < v; i++) {
char T = t[i];
if (M[T].empty()) {
cout << -1 << endl;
return 0;
} else if (upper_bound(M[T].begin(), M[T].end(), mark) != M[T].end())
mark = *upper_bound(M[T].begin(), M[T].end(), mark);
else {
round++;
mark = M[T][0];
};
}
cout << round * u + mark + 1LL << endl;
return 0;
}
|
[
"expression.operation.unary.arithmetic.add",
"literal.number.type.widen.change"
] | 739,434
| 739,433
|
u575802441
|
cpp
|
p02937
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(a) (a).begin(), (a).end()
typedef vector<int> vi;
const int INF = 1LL << 58;
const int MOD = 1000000007;
const int MAX_N = 200100;
signed main() {
// 以降 cin の入力元が 'input.txt' になる
// std::ifstream in("input.txt");
// std::cin.rdbuf(in.rdbuf());
string s, t;
map<char, vi> mp;
cin >> s >> t;
REP(i, s.size()) {
mp[s.at(i)].emplace_back(i + 1);
mp[s.at(i)].emplace_back((i + 1) + s.size());
}
REP(i, t.size()) {
if (!mp.count(t[i])) {
cout << -1 << endl;
return 0;
}
}
for (auto i = mp.begin(); i == mp.end(); i++) {
sort(ALL(i->second));
}
int ans = 0;
int tmp = 0;
REP(i, t.size()) {
char c = t[i];
auto left = lower_bound(mp[c].begin(), mp[c].end(), tmp);
ans += (*left - tmp);
tmp = *left;
tmp %= s.size();
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(a) (a).begin(), (a).end()
typedef vector<int> vi;
const int INF = 1LL << 58;
const int MOD = 1000000007;
const int MAX_N = 200100;
signed main() {
// 以降 cin の入力元が 'input.txt' になる
// std::ifstream in("input.txt");
// std::cin.rdbuf(in.rdbuf());
string s, t;
map<char, vi> mp;
cin >> s >> t;
REP(i, s.size()) {
mp[s.at(i)].emplace_back(i + 1);
mp[s.at(i)].emplace_back((i + 1) + s.size());
}
REP(i, t.size()) {
if (!mp.count(t[i])) {
cout << -1 << endl;
return 0;
}
}
for (auto i = mp.begin(); i != mp.end(); i++) {
sort(ALL(i->second));
}
int ans = 0;
int tmp = 0;
REP(i, t.size()) {
char c = t[i];
auto left = lower_bound(mp[c].begin(), mp[c].end(), tmp + 1);
ans += (*left - tmp);
tmp = *left;
tmp %= s.size();
}
cout << ans << endl;
return 0;
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 739,437
| 739,436
|
u913836622
|
cpp
|
p02937
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
vector<long> base(26, -1);
vector<vector<long>> data(s.size() + 1, vector<long>(26, -1));
for (int i = s.size(); i >= 0; i--) {
for (int j = 0; j < 26; j++)
data.at(i).at(j) = base.at(j);
if (i != 0)
base.at(s.at(i - 1) - 'a') = i;
}
for (int i = s.size(); i >= 0; i--) {
for (int j = 0; j < 26; j++) {
if (data.at(i).at(j) == -1)
data.at(i).at(j) = base.at(j);
}
}
long ans = 0, pl = 0;
for (int i = 0; i < t.size(); i++) {
if (data.at(pl).at(t.at(i) - 'a') != -1) {
if (data.at(pl).at(t.at(i) - 'a') < pl) {
ans += s.size();
}
pl = data.at(pl).at(t.at(i) - 'a');
} else {
cout << -1 << endl;
return 0;
}
}
cout << ans + pl << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
vector<long> base(26, -1);
vector<vector<long>> data(s.size() + 1, vector<long>(26, -1));
for (int i = s.size(); i >= 0; i--) {
for (int j = 0; j < 26; j++)
data.at(i).at(j) = base.at(j);
if (i != 0)
base.at(s.at(i - 1) - 'a') = i;
}
for (int i = s.size(); i >= 0; i--) {
for (int j = 0; j < 26; j++) {
if (data.at(i).at(j) == -1)
data.at(i).at(j) = base.at(j);
}
}
long ans = 0, pl = 0;
for (int i = 0; i < t.size(); i++) {
if (data.at(pl).at(t.at(i) - 'a') != -1) {
if (data.at(pl).at(t.at(i) - 'a') <= pl) {
ans += s.size();
}
pl = data.at(pl).at(t.at(i) - 'a');
} else {
cout << -1 << endl;
return 0;
}
}
cout << ans + pl << endl;
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 739,439
| 739,440
|
u239087789
|
cpp
|
p02937
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
#define int long long
#define double long double
#define rep(s, i, n) for (int i = s; i < n; i++)
#define c(n) cout << n << endl;
#define ic(n) \
int n; \
cin >> n;
#define sc(s) \
string s; \
cin >> s;
#define mod 1000000007
#define inf 1000000000000000007
#define f first
#define s second
#define mini(c, a, b) *min_element(c + a, c + b)
#define maxi(c, a, b) *max_element(c + a, c + b)
#define pi 3.141592653589793238462643383279
#define e_ 2.718281828459045235360287471352
#define P pair<int, int>
#define upp(a, n, x) upper_bound(a, a + n, x) - a;
#define low(a, n, x) lower_bound(a, a + n, x) - a;
#define UF UnionFind
// printf("%.12Lf\n",);
int keta(int x) {
rep(0, i, 30) {
if (x < 10) {
return i + 1;
}
x = x / 10;
}
}
int gcd(int x, int y) {
int aa = x, bb = y;
rep(0, i, 1000) {
aa = aa % bb;
if (aa == 0) {
return bb;
}
bb = bb % aa;
if (bb == 0) {
return aa;
}
}
}
int lcm(int x, int y) {
int aa = x, bb = y;
rep(0, i, 1000) {
aa = aa % bb;
if (aa == 0) {
return x / bb * y;
}
bb = bb % aa;
if (bb == 0) {
return x / aa * y;
}
}
}
bool p(int x) {
if (x == 1)
return false;
rep(2, i, sqrt(x) + 1) {
if (x % i == 0 && x != i) {
return false;
}
}
return true;
}
int max(int a, int b) {
if (a >= b)
return a;
else
return b;
}
string maxst(string s, string t) {
int n = s.size();
int m = t.size();
if (n > m)
return s;
else if (n < m)
return t;
else {
rep(0, i, n) {
if (s[i] > t[i])
return s;
if (s[i] < t[i])
return t;
}
return s;
}
}
int min(int a, int b) {
if (a >= b)
return b;
else
return a;
}
int n2[41];
int nis[41];
int nia[41];
int mody[41];
int nn;
int com(int n, int y) {
int ni = 1;
for (int i = 0; i < 41; i++) {
n2[i] = ni;
ni *= 2;
}
int bunsi = 1, bunbo = 1;
rep(0, i, y) bunsi = (bunsi * (n - i)) % mod;
rep(0, i, y) bunbo = (bunbo * (i + 1)) % mod;
mody[0] = bunbo;
rep(1, i, 41) {
bunbo = (bunbo * bunbo) % mod;
mody[i] = bunbo;
}
rep(0, i, 41) nis[i] = 0;
nn = mod - 2;
for (int i = 40; i >= 0; i -= 1) {
if (nn > n2[i]) {
nis[i]++;
nn -= n2[i];
}
}
nis[0]++;
rep(0, i, 41) {
if (nis[i] == 1) {
bunsi = (bunsi * mody[i]) % mod;
}
}
return bunsi;
}
int gyakugen(int n, int y) {
int ni = 1;
for (int i = 0; i < 41; i++) {
n2[i] = ni;
ni *= 2;
}
mody[0] = y;
rep(1, i, 41) {
y = (y * y) % mod;
mody[i] = y;
}
rep(0, i, 41) nis[i] = 0;
nn = mod - 2;
for (int i = 40; i >= 0; i -= 1) {
if (nn > n2[i]) {
nis[i]++;
nn -= n2[i];
}
}
nis[0]++;
rep(0, i, 41) {
if (nis[i] == 1) {
n = (n * mody[i]) % mod;
}
}
return n;
}
int yakuwa(int n) {
int sum = 0;
rep(1, i, sqrt(n + 1)) {
if (n % i == 0)
sum += i + n / i;
if (i * i == n)
sum -= i;
}
return sum;
}
bool integer(double n) {
if (n == long(n))
return true;
else
return false;
}
int poow(int y, int n) {
if (n == 0)
return 1;
n -= 1;
int ni = 1;
for (int i = 0; i < 41; i++) {
n2[i] = ni;
ni *= 2;
}
int yy = y;
mody[0] = yy;
rep(1, i, 41) {
yy = (yy * yy) % mod;
mody[i] = yy;
}
rep(0, i, 41) nis[i] = 0;
nn = n;
for (int i = 40; i >= 0; i -= 1) {
if (nn >= n2[i]) {
nis[i]++;
nn -= n2[i];
}
}
rep(0, i, 41) {
if (nis[i] == 1) {
y = (y * mody[i]) % mod;
}
}
return y;
}
int minpow(int x, int y) {
int sum = 1;
rep(0, i, y) sum *= x;
return sum;
}
int ketawa(int x, int sinsuu) {
int sum = 0;
rep(0, i, 100) sum += (x % poow(sinsuu, i + 1)) / (poow(sinsuu, i));
return sum;
}
int sankaku(int a) { return a * (a + 1) / 2; }
int same(int a[1111111], int n) {
int ans = 0;
rep(0, i, n) {
if (a[i] == a[i + 1]) {
int j = i;
while (a[j + 1] == a[i] && j <= n - 2)
j++;
ans += sankaku(j - i);
i = j;
}
}
return ans;
}
bool search(int x) {
int n;
int a[n];
int l = 0, r = n;
while (r - l >= 1) {
int i = (l + r) / 2;
if (a[i] == x)
return true;
else if (a[i] < x)
l = i + 1;
else
r = i;
}
return false;
}
/*using Graph=vector<vector<int>>;
int oya[114514];
int depth[114514];
void dfs(const Graph &G, int v, int p, int d) {
depth[v] = d;
oya[v]=p;
for (auto nv : G[v]) {
if (nv == p) continue; // nv が親 p だったらダメ
dfs(G, nv, v, d+1); // d を 1 増やして子ノードへ
}
}*/
/*int H=10,W=10;
char field[10][10];
char memo[10][10];
void dfs(int h, int w) {
memo[h][w] = 'x';
// 八方向を探索
for (int dh = -1; dh <= 1; ++dh) {
for (int dw = -1; dw <= 1; ++dw) {
if(abs(0-dh)+abs(0-dw)==2)continue;
int nh = h + dh, nw = w + dw;
// 場外アウトしたり、0 だったりはスルー
if (nh < 0 || nh >= H || nw < 0 || nw >= W) continue;
if (memo[nh][nw] == 'x') continue;
// 再帰的に探索
dfs(nh, nw);
}
}
}*/
int XOR(int a, int b) {
int ni = 1;
rep(0, i, 41) {
n2[i] = ni;
ni *= 2;
}
rep(0, i, 41) nis[i] = 0;
for (int i = 40; i >= 0; i -= 1) {
if (a >= n2[i]) {
nis[i]++;
a -= n2[i];
}
if (b >= n2[i]) {
nis[i]++;
b -= n2[i];
}
}
int sum = 0;
rep(0, i, 41) sum += (nis[i] % 2 * n2[i]);
return sum;
}
// int ma[1024577][21];
// for(int bit=0;bit<(1<<n);bit++)rep(0,i,n)if(bit&(1<<i))ma[bit][i]=1;
struct UnionFind {
vector<int> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
UnionFind(int N) : par(N) { //最初は全てが根であるとして初期化
for (int i = 0; i < N; i++)
par[i] = i;
}
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の根が同じ(=同じ木にある)時はそのまま
par[rx] =
ry; // xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
}
bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
vector<int> a[26];
signed main() {
sc(s) sc(t) int m = s.size();
int n = t.size();
rep(0, i, m) a[s[i] - 'a'].push_back(i);
rep(0, i, 26) sort(a[i].begin(), a[i].end());
int ans = 0;
int cnt = 0;
rep(0, i, n) {
int k = t[i] - 'a';
if (a[k].size() == 0) {
c(-1) return 0;
} else {
if (a[k][a[k].size() - 1] <= ans) {
cnt++;
ans = a[k][0];
} else {
int l = upper_bound(a[k].begin(), a[k].end(), ans) - a[k].begin();
ans = a[k][l];
}
}
}
c(cnt * m + ans + 1)
}
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
#define int long long
#define double long double
#define rep(s, i, n) for (int i = s; i < n; i++)
#define c(n) cout << n << endl;
#define ic(n) \
int n; \
cin >> n;
#define sc(s) \
string s; \
cin >> s;
#define mod 1000000007
#define inf 1000000000000000007
#define f first
#define s second
#define mini(c, a, b) *min_element(c + a, c + b)
#define maxi(c, a, b) *max_element(c + a, c + b)
#define pi 3.141592653589793238462643383279
#define e_ 2.718281828459045235360287471352
#define P pair<int, int>
#define upp(a, n, x) upper_bound(a, a + n, x) - a;
#define low(a, n, x) lower_bound(a, a + n, x) - a;
#define UF UnionFind
// printf("%.12Lf\n",);
int keta(int x) {
rep(0, i, 30) {
if (x < 10) {
return i + 1;
}
x = x / 10;
}
}
int gcd(int x, int y) {
int aa = x, bb = y;
rep(0, i, 1000) {
aa = aa % bb;
if (aa == 0) {
return bb;
}
bb = bb % aa;
if (bb == 0) {
return aa;
}
}
}
int lcm(int x, int y) {
int aa = x, bb = y;
rep(0, i, 1000) {
aa = aa % bb;
if (aa == 0) {
return x / bb * y;
}
bb = bb % aa;
if (bb == 0) {
return x / aa * y;
}
}
}
bool p(int x) {
if (x == 1)
return false;
rep(2, i, sqrt(x) + 1) {
if (x % i == 0 && x != i) {
return false;
}
}
return true;
}
int max(int a, int b) {
if (a >= b)
return a;
else
return b;
}
string maxst(string s, string t) {
int n = s.size();
int m = t.size();
if (n > m)
return s;
else if (n < m)
return t;
else {
rep(0, i, n) {
if (s[i] > t[i])
return s;
if (s[i] < t[i])
return t;
}
return s;
}
}
int min(int a, int b) {
if (a >= b)
return b;
else
return a;
}
int n2[41];
int nis[41];
int nia[41];
int mody[41];
int nn;
int com(int n, int y) {
int ni = 1;
for (int i = 0; i < 41; i++) {
n2[i] = ni;
ni *= 2;
}
int bunsi = 1, bunbo = 1;
rep(0, i, y) bunsi = (bunsi * (n - i)) % mod;
rep(0, i, y) bunbo = (bunbo * (i + 1)) % mod;
mody[0] = bunbo;
rep(1, i, 41) {
bunbo = (bunbo * bunbo) % mod;
mody[i] = bunbo;
}
rep(0, i, 41) nis[i] = 0;
nn = mod - 2;
for (int i = 40; i >= 0; i -= 1) {
if (nn > n2[i]) {
nis[i]++;
nn -= n2[i];
}
}
nis[0]++;
rep(0, i, 41) {
if (nis[i] == 1) {
bunsi = (bunsi * mody[i]) % mod;
}
}
return bunsi;
}
int gyakugen(int n, int y) {
int ni = 1;
for (int i = 0; i < 41; i++) {
n2[i] = ni;
ni *= 2;
}
mody[0] = y;
rep(1, i, 41) {
y = (y * y) % mod;
mody[i] = y;
}
rep(0, i, 41) nis[i] = 0;
nn = mod - 2;
for (int i = 40; i >= 0; i -= 1) {
if (nn > n2[i]) {
nis[i]++;
nn -= n2[i];
}
}
nis[0]++;
rep(0, i, 41) {
if (nis[i] == 1) {
n = (n * mody[i]) % mod;
}
}
return n;
}
int yakuwa(int n) {
int sum = 0;
rep(1, i, sqrt(n + 1)) {
if (n % i == 0)
sum += i + n / i;
if (i * i == n)
sum -= i;
}
return sum;
}
bool integer(double n) {
if (n == long(n))
return true;
else
return false;
}
int poow(int y, int n) {
if (n == 0)
return 1;
n -= 1;
int ni = 1;
for (int i = 0; i < 41; i++) {
n2[i] = ni;
ni *= 2;
}
int yy = y;
mody[0] = yy;
rep(1, i, 41) {
yy = (yy * yy) % mod;
mody[i] = yy;
}
rep(0, i, 41) nis[i] = 0;
nn = n;
for (int i = 40; i >= 0; i -= 1) {
if (nn >= n2[i]) {
nis[i]++;
nn -= n2[i];
}
}
rep(0, i, 41) {
if (nis[i] == 1) {
y = (y * mody[i]) % mod;
}
}
return y;
}
int minpow(int x, int y) {
int sum = 1;
rep(0, i, y) sum *= x;
return sum;
}
int ketawa(int x, int sinsuu) {
int sum = 0;
rep(0, i, 100) sum += (x % poow(sinsuu, i + 1)) / (poow(sinsuu, i));
return sum;
}
int sankaku(int a) { return a * (a + 1) / 2; }
int same(int a[1111111], int n) {
int ans = 0;
rep(0, i, n) {
if (a[i] == a[i + 1]) {
int j = i;
while (a[j + 1] == a[i] && j <= n - 2)
j++;
ans += sankaku(j - i);
i = j;
}
}
return ans;
}
bool search(int x) {
int n;
int a[n];
int l = 0, r = n;
while (r - l >= 1) {
int i = (l + r) / 2;
if (a[i] == x)
return true;
else if (a[i] < x)
l = i + 1;
else
r = i;
}
return false;
}
/*using Graph=vector<vector<int>>;
int oya[114514];
int depth[114514];
void dfs(const Graph &G, int v, int p, int d) {
depth[v] = d;
oya[v]=p;
for (auto nv : G[v]) {
if (nv == p) continue; // nv が親 p だったらダメ
dfs(G, nv, v, d+1); // d を 1 増やして子ノードへ
}
}*/
/*int H=10,W=10;
char field[10][10];
char memo[10][10];
void dfs(int h, int w) {
memo[h][w] = 'x';
// 八方向を探索
for (int dh = -1; dh <= 1; ++dh) {
for (int dw = -1; dw <= 1; ++dw) {
if(abs(0-dh)+abs(0-dw)==2)continue;
int nh = h + dh, nw = w + dw;
// 場外アウトしたり、0 だったりはスルー
if (nh < 0 || nh >= H || nw < 0 || nw >= W) continue;
if (memo[nh][nw] == 'x') continue;
// 再帰的に探索
dfs(nh, nw);
}
}
}*/
int XOR(int a, int b) {
int ni = 1;
rep(0, i, 41) {
n2[i] = ni;
ni *= 2;
}
rep(0, i, 41) nis[i] = 0;
for (int i = 40; i >= 0; i -= 1) {
if (a >= n2[i]) {
nis[i]++;
a -= n2[i];
}
if (b >= n2[i]) {
nis[i]++;
b -= n2[i];
}
}
int sum = 0;
rep(0, i, 41) sum += (nis[i] % 2 * n2[i]);
return sum;
}
// int ma[1024577][21];
// for(int bit=0;bit<(1<<n);bit++)rep(0,i,n)if(bit&(1<<i))ma[bit][i]=1;
struct UnionFind {
vector<int> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
UnionFind(int N) : par(N) { //最初は全てが根であるとして初期化
for (int i = 0; i < N; i++)
par[i] = i;
}
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の根が同じ(=同じ木にある)時はそのまま
par[rx] =
ry; // xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
}
bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
vector<int> a[26];
signed main() {
sc(s) sc(t) int m = s.size();
int n = t.size();
rep(0, i, m) a[s[i] - 'a'].push_back(i);
rep(0, i, 26) sort(a[i].begin(), a[i].end());
int ans = -1;
int cnt = 0;
rep(0, i, n) {
int k = t[i] - 'a';
if (a[k].size() == 0) {
c(-1) return 0;
} else {
if (a[k][a[k].size() - 1] <= ans) {
cnt++;
ans = a[k][0];
} else {
int l = upper_bound(a[k].begin(), a[k].end(), ans) - a[k].begin();
ans = a[k][l];
}
}
}
c(cnt * m + ans + 1)
}
|
[
"literal.number.change",
"variable_declaration.value.change"
] | 739,449
| 739,450
|
u942393279
|
cpp
|
p02937
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
#define int long long
#define double long double
#define rep(s, i, n) for (int i = s; i < n; i++)
#define c(n) cout << n << endl;
#define ic(n) \
int n; \
cin >> n;
#define sc(s) \
string s; \
cin >> s;
#define mod 1000000007
#define inf 1000000000000000007
#define f first
#define s second
#define mini(c, a, b) *min_element(c + a, c + b)
#define maxi(c, a, b) *max_element(c + a, c + b)
#define pi 3.141592653589793238462643383279
#define e_ 2.718281828459045235360287471352
#define P pair<int, int>
#define upp(a, n, x) upper_bound(a, a + n, x) - a;
#define low(a, n, x) lower_bound(a, a + n, x) - a;
#define UF UnionFind
// printf("%.12Lf\n",);
int keta(int x) {
rep(0, i, 30) {
if (x < 10) {
return i + 1;
}
x = x / 10;
}
}
int gcd(int x, int y) {
int aa = x, bb = y;
rep(0, i, 1000) {
aa = aa % bb;
if (aa == 0) {
return bb;
}
bb = bb % aa;
if (bb == 0) {
return aa;
}
}
}
int lcm(int x, int y) {
int aa = x, bb = y;
rep(0, i, 1000) {
aa = aa % bb;
if (aa == 0) {
return x / bb * y;
}
bb = bb % aa;
if (bb == 0) {
return x / aa * y;
}
}
}
bool p(int x) {
if (x == 1)
return false;
rep(2, i, sqrt(x) + 1) {
if (x % i == 0 && x != i) {
return false;
}
}
return true;
}
int max(int a, int b) {
if (a >= b)
return a;
else
return b;
}
string maxst(string s, string t) {
int n = s.size();
int m = t.size();
if (n > m)
return s;
else if (n < m)
return t;
else {
rep(0, i, n) {
if (s[i] > t[i])
return s;
if (s[i] < t[i])
return t;
}
return s;
}
}
int min(int a, int b) {
if (a >= b)
return b;
else
return a;
}
int n2[41];
int nis[41];
int nia[41];
int mody[41];
int nn;
int com(int n, int y) {
int ni = 1;
for (int i = 0; i < 41; i++) {
n2[i] = ni;
ni *= 2;
}
int bunsi = 1, bunbo = 1;
rep(0, i, y) bunsi = (bunsi * (n - i)) % mod;
rep(0, i, y) bunbo = (bunbo * (i + 1)) % mod;
mody[0] = bunbo;
rep(1, i, 41) {
bunbo = (bunbo * bunbo) % mod;
mody[i] = bunbo;
}
rep(0, i, 41) nis[i] = 0;
nn = mod - 2;
for (int i = 40; i >= 0; i -= 1) {
if (nn > n2[i]) {
nis[i]++;
nn -= n2[i];
}
}
nis[0]++;
rep(0, i, 41) {
if (nis[i] == 1) {
bunsi = (bunsi * mody[i]) % mod;
}
}
return bunsi;
}
int gyakugen(int n, int y) {
int ni = 1;
for (int i = 0; i < 41; i++) {
n2[i] = ni;
ni *= 2;
}
mody[0] = y;
rep(1, i, 41) {
y = (y * y) % mod;
mody[i] = y;
}
rep(0, i, 41) nis[i] = 0;
nn = mod - 2;
for (int i = 40; i >= 0; i -= 1) {
if (nn > n2[i]) {
nis[i]++;
nn -= n2[i];
}
}
nis[0]++;
rep(0, i, 41) {
if (nis[i] == 1) {
n = (n * mody[i]) % mod;
}
}
return n;
}
int yakuwa(int n) {
int sum = 0;
rep(1, i, sqrt(n + 1)) {
if (n % i == 0)
sum += i + n / i;
if (i * i == n)
sum -= i;
}
return sum;
}
bool integer(double n) {
if (n == long(n))
return true;
else
return false;
}
int poow(int y, int n) {
if (n == 0)
return 1;
n -= 1;
int ni = 1;
for (int i = 0; i < 41; i++) {
n2[i] = ni;
ni *= 2;
}
int yy = y;
mody[0] = yy;
rep(1, i, 41) {
yy = (yy * yy) % mod;
mody[i] = yy;
}
rep(0, i, 41) nis[i] = 0;
nn = n;
for (int i = 40; i >= 0; i -= 1) {
if (nn >= n2[i]) {
nis[i]++;
nn -= n2[i];
}
}
rep(0, i, 41) {
if (nis[i] == 1) {
y = (y * mody[i]) % mod;
}
}
return y;
}
int minpow(int x, int y) {
int sum = 1;
rep(0, i, y) sum *= x;
return sum;
}
int ketawa(int x, int sinsuu) {
int sum = 0;
rep(0, i, 100) sum += (x % poow(sinsuu, i + 1)) / (poow(sinsuu, i));
return sum;
}
int sankaku(int a) { return a * (a + 1) / 2; }
int same(int a[1111111], int n) {
int ans = 0;
rep(0, i, n) {
if (a[i] == a[i + 1]) {
int j = i;
while (a[j + 1] == a[i] && j <= n - 2)
j++;
ans += sankaku(j - i);
i = j;
}
}
return ans;
}
bool search(int x) {
int n;
int a[n];
int l = 0, r = n;
while (r - l >= 1) {
int i = (l + r) / 2;
if (a[i] == x)
return true;
else if (a[i] < x)
l = i + 1;
else
r = i;
}
return false;
}
/*using Graph=vector<vector<int>>;
int oya[114514];
int depth[114514];
void dfs(const Graph &G, int v, int p, int d) {
depth[v] = d;
oya[v]=p;
for (auto nv : G[v]) {
if (nv == p) continue; // nv が親 p だったらダメ
dfs(G, nv, v, d+1); // d を 1 増やして子ノードへ
}
}*/
/*int H=10,W=10;
char field[10][10];
char memo[10][10];
void dfs(int h, int w) {
memo[h][w] = 'x';
// 八方向を探索
for (int dh = -1; dh <= 1; ++dh) {
for (int dw = -1; dw <= 1; ++dw) {
if(abs(0-dh)+abs(0-dw)==2)continue;
int nh = h + dh, nw = w + dw;
// 場外アウトしたり、0 だったりはスルー
if (nh < 0 || nh >= H || nw < 0 || nw >= W) continue;
if (memo[nh][nw] == 'x') continue;
// 再帰的に探索
dfs(nh, nw);
}
}
}*/
int XOR(int a, int b) {
int ni = 1;
rep(0, i, 41) {
n2[i] = ni;
ni *= 2;
}
rep(0, i, 41) nis[i] = 0;
for (int i = 40; i >= 0; i -= 1) {
if (a >= n2[i]) {
nis[i]++;
a -= n2[i];
}
if (b >= n2[i]) {
nis[i]++;
b -= n2[i];
}
}
int sum = 0;
rep(0, i, 41) sum += (nis[i] % 2 * n2[i]);
return sum;
}
// int ma[1024577][21];
// for(int bit=0;bit<(1<<n);bit++)rep(0,i,n)if(bit&(1<<i))ma[bit][i]=1;
struct UnionFind {
vector<int> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
UnionFind(int N) : par(N) { //最初は全てが根であるとして初期化
for (int i = 0; i < N; i++)
par[i] = i;
}
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の根が同じ(=同じ木にある)時はそのまま
par[rx] =
ry; // xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
}
bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
vector<int> a[26];
signed main() {
sc(s) sc(t) int m = s.size();
int n = t.size();
rep(0, i, m) a[s[i] - 'a'].push_back(i);
rep(0, i, m) sort(a[i].begin(), a[i].end());
int ans = 0;
int cnt = 0;
rep(0, i, n) {
int k = t[i] - 'a';
if (a[k].size() == 0) {
c(-1) return 0;
} else {
if (a[k][a[k].size() - 1] <= ans) {
cnt++;
ans = a[k][0];
} else {
int l = upper_bound(a[k].begin(), a[k].end(), ans) - a[k].begin();
ans = a[k][l];
}
}
}
c(cnt * m + ans + 1)
}
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <vector>
using namespace std;
#define int long long
#define double long double
#define rep(s, i, n) for (int i = s; i < n; i++)
#define c(n) cout << n << endl;
#define ic(n) \
int n; \
cin >> n;
#define sc(s) \
string s; \
cin >> s;
#define mod 1000000007
#define inf 1000000000000000007
#define f first
#define s second
#define mini(c, a, b) *min_element(c + a, c + b)
#define maxi(c, a, b) *max_element(c + a, c + b)
#define pi 3.141592653589793238462643383279
#define e_ 2.718281828459045235360287471352
#define P pair<int, int>
#define upp(a, n, x) upper_bound(a, a + n, x) - a;
#define low(a, n, x) lower_bound(a, a + n, x) - a;
#define UF UnionFind
// printf("%.12Lf\n",);
int keta(int x) {
rep(0, i, 30) {
if (x < 10) {
return i + 1;
}
x = x / 10;
}
}
int gcd(int x, int y) {
int aa = x, bb = y;
rep(0, i, 1000) {
aa = aa % bb;
if (aa == 0) {
return bb;
}
bb = bb % aa;
if (bb == 0) {
return aa;
}
}
}
int lcm(int x, int y) {
int aa = x, bb = y;
rep(0, i, 1000) {
aa = aa % bb;
if (aa == 0) {
return x / bb * y;
}
bb = bb % aa;
if (bb == 0) {
return x / aa * y;
}
}
}
bool p(int x) {
if (x == 1)
return false;
rep(2, i, sqrt(x) + 1) {
if (x % i == 0 && x != i) {
return false;
}
}
return true;
}
int max(int a, int b) {
if (a >= b)
return a;
else
return b;
}
string maxst(string s, string t) {
int n = s.size();
int m = t.size();
if (n > m)
return s;
else if (n < m)
return t;
else {
rep(0, i, n) {
if (s[i] > t[i])
return s;
if (s[i] < t[i])
return t;
}
return s;
}
}
int min(int a, int b) {
if (a >= b)
return b;
else
return a;
}
int n2[41];
int nis[41];
int nia[41];
int mody[41];
int nn;
int com(int n, int y) {
int ni = 1;
for (int i = 0; i < 41; i++) {
n2[i] = ni;
ni *= 2;
}
int bunsi = 1, bunbo = 1;
rep(0, i, y) bunsi = (bunsi * (n - i)) % mod;
rep(0, i, y) bunbo = (bunbo * (i + 1)) % mod;
mody[0] = bunbo;
rep(1, i, 41) {
bunbo = (bunbo * bunbo) % mod;
mody[i] = bunbo;
}
rep(0, i, 41) nis[i] = 0;
nn = mod - 2;
for (int i = 40; i >= 0; i -= 1) {
if (nn > n2[i]) {
nis[i]++;
nn -= n2[i];
}
}
nis[0]++;
rep(0, i, 41) {
if (nis[i] == 1) {
bunsi = (bunsi * mody[i]) % mod;
}
}
return bunsi;
}
int gyakugen(int n, int y) {
int ni = 1;
for (int i = 0; i < 41; i++) {
n2[i] = ni;
ni *= 2;
}
mody[0] = y;
rep(1, i, 41) {
y = (y * y) % mod;
mody[i] = y;
}
rep(0, i, 41) nis[i] = 0;
nn = mod - 2;
for (int i = 40; i >= 0; i -= 1) {
if (nn > n2[i]) {
nis[i]++;
nn -= n2[i];
}
}
nis[0]++;
rep(0, i, 41) {
if (nis[i] == 1) {
n = (n * mody[i]) % mod;
}
}
return n;
}
int yakuwa(int n) {
int sum = 0;
rep(1, i, sqrt(n + 1)) {
if (n % i == 0)
sum += i + n / i;
if (i * i == n)
sum -= i;
}
return sum;
}
bool integer(double n) {
if (n == long(n))
return true;
else
return false;
}
int poow(int y, int n) {
if (n == 0)
return 1;
n -= 1;
int ni = 1;
for (int i = 0; i < 41; i++) {
n2[i] = ni;
ni *= 2;
}
int yy = y;
mody[0] = yy;
rep(1, i, 41) {
yy = (yy * yy) % mod;
mody[i] = yy;
}
rep(0, i, 41) nis[i] = 0;
nn = n;
for (int i = 40; i >= 0; i -= 1) {
if (nn >= n2[i]) {
nis[i]++;
nn -= n2[i];
}
}
rep(0, i, 41) {
if (nis[i] == 1) {
y = (y * mody[i]) % mod;
}
}
return y;
}
int minpow(int x, int y) {
int sum = 1;
rep(0, i, y) sum *= x;
return sum;
}
int ketawa(int x, int sinsuu) {
int sum = 0;
rep(0, i, 100) sum += (x % poow(sinsuu, i + 1)) / (poow(sinsuu, i));
return sum;
}
int sankaku(int a) { return a * (a + 1) / 2; }
int same(int a[1111111], int n) {
int ans = 0;
rep(0, i, n) {
if (a[i] == a[i + 1]) {
int j = i;
while (a[j + 1] == a[i] && j <= n - 2)
j++;
ans += sankaku(j - i);
i = j;
}
}
return ans;
}
bool search(int x) {
int n;
int a[n];
int l = 0, r = n;
while (r - l >= 1) {
int i = (l + r) / 2;
if (a[i] == x)
return true;
else if (a[i] < x)
l = i + 1;
else
r = i;
}
return false;
}
/*using Graph=vector<vector<int>>;
int oya[114514];
int depth[114514];
void dfs(const Graph &G, int v, int p, int d) {
depth[v] = d;
oya[v]=p;
for (auto nv : G[v]) {
if (nv == p) continue; // nv が親 p だったらダメ
dfs(G, nv, v, d+1); // d を 1 増やして子ノードへ
}
}*/
/*int H=10,W=10;
char field[10][10];
char memo[10][10];
void dfs(int h, int w) {
memo[h][w] = 'x';
// 八方向を探索
for (int dh = -1; dh <= 1; ++dh) {
for (int dw = -1; dw <= 1; ++dw) {
if(abs(0-dh)+abs(0-dw)==2)continue;
int nh = h + dh, nw = w + dw;
// 場外アウトしたり、0 だったりはスルー
if (nh < 0 || nh >= H || nw < 0 || nw >= W) continue;
if (memo[nh][nw] == 'x') continue;
// 再帰的に探索
dfs(nh, nw);
}
}
}*/
int XOR(int a, int b) {
int ni = 1;
rep(0, i, 41) {
n2[i] = ni;
ni *= 2;
}
rep(0, i, 41) nis[i] = 0;
for (int i = 40; i >= 0; i -= 1) {
if (a >= n2[i]) {
nis[i]++;
a -= n2[i];
}
if (b >= n2[i]) {
nis[i]++;
b -= n2[i];
}
}
int sum = 0;
rep(0, i, 41) sum += (nis[i] % 2 * n2[i]);
return sum;
}
// int ma[1024577][21];
// for(int bit=0;bit<(1<<n);bit++)rep(0,i,n)if(bit&(1<<i))ma[bit][i]=1;
struct UnionFind {
vector<int> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2
UnionFind(int N) : par(N) { //最初は全てが根であるとして初期化
for (int i = 0; i < N; i++)
par[i] = i;
}
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の根が同じ(=同じ木にある)時はそのまま
par[rx] =
ry; // xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける
}
bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
vector<int> a[26];
signed main() {
sc(s) sc(t) int m = s.size();
int n = t.size();
rep(0, i, m) a[s[i] - 'a'].push_back(i);
rep(0, i, 26) sort(a[i].begin(), a[i].end());
int ans = -1;
int cnt = 0;
rep(0, i, n) {
int k = t[i] - 'a';
if (a[k].size() == 0) {
c(-1) return 0;
} else {
if (a[k][a[k].size() - 1] <= ans) {
cnt++;
ans = a[k][0];
} else {
int l = upper_bound(a[k].begin(), a[k].end(), ans) - a[k].begin();
ans = a[k][l];
}
}
}
c(cnt * m + ans + 1)
}
|
[
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"literal.number.change",
"variable_declaration.value.change"
] | 739,451
| 739,450
|
u942393279
|
cpp
|
p02937
|
#include <bits/stdc++.h>
#define ll long long
#define double long double
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = 1; i <= (n); i++)
#define mod (ll)(1e9 + 7)
#define inf (ll)(3e18 + 7)
#define pi (double)acos(-1)
#define P pair<int, int>
#define PiP pair<int, pair<int, int>>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
using namespace std;
int main() {
string s, t;
cin >> s >> t;
ll ans = 0, n = s.size(), m = t.size();
map<char, ll> mps;
vector<set<int>> st(26);
rep(i, n) {
mps[s[i]]++;
st[s[i] - 'a'].insert(i + 1);
}
bool ok = true;
rep(i, t.size()) if (!mps[t[i]]) ok = false;
if (ok) {
rep(i, m) {
auto it1 = st[t[i] - 'a'].lower_bound(ans % n);
if (it1 == st[t[i] - 'a'].end()) {
ans += n - (ans % n);
auto it2 = st[t[i] - 'a'].begin();
ans += *it2;
} else {
ans += *it1 - (ans % n);
}
}
}
cout << (ok ? ans : -1) << endl;
}
|
#include <bits/stdc++.h>
#define ll long long
#define double long double
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = 1; i <= (n); i++)
#define mod (ll)(1e9 + 7)
#define inf (ll)(3e18 + 7)
#define pi (double)acos(-1)
#define P pair<int, int>
#define PiP pair<int, pair<int, int>>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
using namespace std;
int main() {
string s, t;
cin >> s >> t;
ll ans = 0, n = s.size(), m = t.size();
map<char, ll> mps;
vector<set<int>> st(26);
rep(i, n) {
mps[s[i]]++;
st[s[i] - 'a'].insert(i + 1);
}
bool ok = true;
rep(i, t.size()) if (!mps[t[i]]) ok = false;
if (ok) {
rep(i, m) {
auto it1 = st[t[i] - 'a'].upper_bound(ans % n);
if (it1 == st[t[i] - 'a'].end()) {
ans += n - (ans % n);
auto it2 = st[t[i] - 'a'].begin();
ans += *it2;
} else {
ans += *it1 - (ans % n);
}
}
}
cout << (ok ? ans : -1) << endl;
}
|
[
"call.function.change"
] | 739,452
| 739,453
|
u441250130
|
cpp
|
p02937
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
vector<vector<int>> g;
vector<int> o;
map<int, int> ad;
vector<ll> c;
int main() {
string s, t;
cin >> s >> t;
vector<vector<ll>> a(26, vector<ll>(0));
rep(i, s.size()) { a.at(s.at(i) - 'a').push_back(i); }
rep(i, 26) a.at(i).push_back(1000000);
ll k = -1;
ll km = 0;
ll ans = 0;
string test = "";
test += s.at(0);
rep(i, t.size()) {
if (a.at(t.at(i) - 'a').at(0) == 1000000) {
cout << -1 << endl;
return 0;
}
}
rep(i, t.size()) {
km = k;
ll l =
lower_bound(a.at(t.at(i) - 'a').begin(), a.at(t.at(i) - 'a').end(), k) -
a.at(t.at(i) - 'a').begin();
if (a.at(t.at(i) - 'a').at(l) != 1000000) {
k = a.at(t.at(i) - 'a').at(l);
ans += k - km;
// test += s.substr(km, k);
} else {
k = 0;
ll l = lower_bound(a.at(t.at(i) - 'a').begin(), a.at(t.at(i) - 'a').end(),
k) -
a.at(t.at(i) - 'a').begin();
k = a.at(t.at(i) - 'a').at(l);
ans += s.size() - (km + 1);
ans += k + 1;
// test += s.substr(km);
// test += s.substr(0, k);
}
// cout << ans << endl;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
vector<vector<int>> g;
vector<int> o;
map<int, int> ad;
vector<ll> c;
int main() {
string s, t;
cin >> s >> t;
vector<vector<ll>> a(26, vector<ll>(0));
rep(i, s.size()) { a.at(s.at(i) - 'a').push_back(i); }
rep(i, 26) a.at(i).push_back(1000000);
ll k = -1;
ll km = 0;
ll ans = 0;
string test = "";
test += s.at(0);
rep(i, t.size()) {
if (a.at(t.at(i) - 'a').at(0) == 1000000) {
cout << -1 << endl;
return 0;
}
}
rep(i, t.size()) {
km = k;
k++;
ll l =
lower_bound(a.at(t.at(i) - 'a').begin(), a.at(t.at(i) - 'a').end(), k) -
a.at(t.at(i) - 'a').begin();
if (a.at(t.at(i) - 'a').at(l) != 1000000) {
k = a.at(t.at(i) - 'a').at(l);
ans += k - km;
// test += s.substr(km, k);
} else {
k = 0;
ll l = lower_bound(a.at(t.at(i) - 'a').begin(), a.at(t.at(i) - 'a').end(),
k) -
a.at(t.at(i) - 'a').begin();
k = a.at(t.at(i) - 'a').at(l);
ans += s.size() - (km + 1);
ans += k + 1;
// test += s.substr(km);
// test += s.substr(0, k);
}
// cout << ans << endl;
}
cout << ans << endl;
return 0;
}
|
[
"expression.unary.arithmetic.add"
] | 739,454
| 739,455
|
u945901686
|
cpp
|
p02937
|
#include <algorithm>
#include <cassert>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 2e18;
const ll MOD = 1e9 + 7;
string s, t;
unordered_map<char, set<ll>> mp;
int main() {
cin >> s >> t;
for (ll i = 0; i < s.length(); i++) {
mp[s[i]].insert(i);
}
ll ans = 0;
ll pre = -1;
for (ll i = 0; i < t.length(); i++) {
set<ll> &st = mp[t[i]];
if (st.size() == 0) {
cout << -1;
return 0;
}
auto it = st.lower_bound(pre);
if (it == st.end()) {
ans += (s.length() - pre) + (*st.begin());
pre = (*st.begin());
} else {
ans += *it - pre;
pre = *it;
}
}
cout << ans << endl;
return 0;
}
|
#include <algorithm>
#include <cassert>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 2e18;
const ll MOD = 1e9 + 7;
string s, t;
unordered_map<char, set<ll>> mp;
int main() {
cin >> s >> t;
for (ll i = 0; i < s.length(); i++) {
mp[s[i]].insert(i);
}
ll ans = 0;
ll pre = -1;
for (ll i = 0; i < t.length(); i++) {
set<ll> &st = mp[t[i]];
if (st.size() == 0) {
cout << -1;
return 0;
}
auto it = st.upper_bound(pre);
if (it == st.end()) {
ans += (s.length() - pre) + (*st.begin());
pre = (*st.begin());
} else {
ans += *it - pre;
pre = *it;
}
}
cout << ans << endl;
return 0;
}
|
[
"call.function.change"
] | 739,460
| 739,461
|
u114234520
|
cpp
|
p02937
|
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)n; ++i)
#define REPN(i, m, n) for (ll i = m; i < (ll)n; ++i)
#define INF (ll)1e15
#define MOD (1000 * 1000 * 1000 + 7)
#define Ceil(x, n) (((((x)) + ((n)-1)) / n))
#define CeilN(x, n) (((((x)) + ((n)-1)) / n) * n)
#define FloorN(x, n) ((x) - (x) % (n))
#define IsOdd(x) (((x)&0x01UL) == 0x01UL)
#define IsEven(x) (!IsOdd((x)))
#define M_PI 3.14159265358979323846
typedef pair<ll, ll> P;
/*-----------------------------------------------------------------------------
処理
-----------------------------------------------------------------------------*/
// メイン
int main() {
string s, t;
cin >> s >> t;
set<ll> word[26];
REP(i, s.size()) {
int idx = s[i] - 'a';
word[idx].insert(i);
}
ll ans = 0;
ll tLen = t.size();
for (ll tCnt = 0;;) {
ll nowIdx = -1;
for (; tCnt < tLen; tCnt++) {
auto &wordOne = word[t[tCnt] - 'a'];
auto idx = wordOne.lower_bound(nowIdx);
if (idx == wordOne.end()) {
break;
}
nowIdx = *idx;
}
if (nowIdx == -1) {
ans = -1;
break;
}
if (tCnt == tLen) {
ans += nowIdx + 1;
break;
}
ans += s.size();
}
cout << ans << endl;
return 0;
}
|
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)n; ++i)
#define REPN(i, m, n) for (ll i = m; i < (ll)n; ++i)
#define INF (ll)1e15
#define MOD (1000 * 1000 * 1000 + 7)
#define Ceil(x, n) (((((x)) + ((n)-1)) / n))
#define CeilN(x, n) (((((x)) + ((n)-1)) / n) * n)
#define FloorN(x, n) ((x) - (x) % (n))
#define IsOdd(x) (((x)&0x01UL) == 0x01UL)
#define IsEven(x) (!IsOdd((x)))
#define M_PI 3.14159265358979323846
typedef pair<ll, ll> P;
/*-----------------------------------------------------------------------------
処理
-----------------------------------------------------------------------------*/
// メイン
int main() {
string s, t;
cin >> s >> t;
set<ll> word[26];
REP(i, s.size()) {
int idx = s[i] - 'a';
word[idx].insert(i);
}
ll ans = 0;
ll tLen = t.size();
for (ll tCnt = 0;;) {
ll nowIdx = -1;
for (; tCnt < tLen; tCnt++) {
auto &wordOne = word[t[tCnt] - 'a'];
auto idx = wordOne.lower_bound(nowIdx);
if (idx == wordOne.end()) {
break;
}
nowIdx = *idx + 1;
}
if (nowIdx == -1) {
ans = -1;
break;
}
if (tCnt == tLen) {
ans += nowIdx;
break;
}
ans += s.size();
}
cout << ans << endl;
return 0;
}
|
[
"assignment.change",
"expression.operation.binary.remove"
] | 739,464
| 739,465
|
u796408111
|
cpp
|
p02937
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
#define pq priority_queue
using vi = vector<int>; // intの1次元の型に vi という別名をつける
using vvi = vector<vi>; // intの2次元の型に vvi という別名をつける
using vvvi = vector<vvi>;
using ll = long long; // long longをllだけにした
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using mii = map<int, int>;
using pqls = priority_queue<long long>;
using pqlg = priority_queue<long long, vector<long long>, greater<long long>>;
using mll = map<long long, long long>;
using pll = pair<long long, long long>;
using sll = set<long long>;
long long divup(long long a, long long b);
long long kaijou(long long i);
long long P(long long n, long long k);
long long C(long long n, long long k);
long long GCD(long long a, long long b);
long long LCM(long long a, long long b);
bool prime(long long N);
double distance(vector<long long> p, vector<long long> q, long long n);
void press(vector<long long> &v);
void ranking(vector<long long> &v);
void erase(vector<long long> &v, long long i);
void unique(vector<long long> &v);
void printv(vector<long long> v);
vector<ll> keta(ll x);
long long modpow(long long a, long long n, long long mod);
long long modinv(long long a, long long mod);
// 20200416
vector<long long> inputv(long long n);
// 20200417
vector<long long> yakusuu(int n);
map<long long, long long> soinsuu(long long n);
vector<vector<long long>> maze(long long i, long long j, vector<string> &s);
// 20200423
vector<long long> eratos(long long n);
set<long long> eraset(long long n);
//////////////////////////////////////////////////////
//端数繰りあがり割り算(検証済)
// a÷bの端数繰り上げ
// b!=0のデバグはしてないので分母に0を入れないように
//負数対応
long long divup(long long a, long long b) {
long long x = abs(a);
long long y = abs(b);
long long z = (x + y - 1) / y;
if ((a < 0 && b > 0) || (a > 0 && b < 0))
return -z;
else if (a == 0)
return 0;
else
return z;
}
//階乗
//検証済み
long long kaijou(long long i) {
if (i == 0)
return 1;
long long j = 1;
for (long long k = 1; k <= i; k++) {
j *= k;
}
return j;
}
//順列nPk(完成)
// n個の異なる要素から、取り出す順序を区別してk個取り出す場合の数
// n<kなら0を返す
//敢えて負数時のデバグはしてない
long long P(long long n, long long k) {
if (n < k)
return 0;
long long y = 1;
for (long long i = 0; i < k; i++) {
y *= (n - i);
}
return y;
}
//組み合わせnCk(検証済み)
// P,kaijouと併用
long long C(long long n, long long k) {
if (n < k)
return 0;
return P(n, k) / kaijou(k);
}
// nHk
//区別しないn個の要素を、区別するk個のグループに分ける
// 0個のグループがあっ
//て良い
// C必須
//最大公約数GCD,最小公倍数LCM
// LCMを使うときはGCDをセットで
//検証済み
long long GCD(long long a, long long b) {
if (a < b)
swap(a, b);
long long d = a % b;
if (d == 0) {
return b;
}
return GCD(b, d);
}
long long LCM(long long a, long long b) { return (a / GCD(a, b)) * b; }
//素数判定
//素数ならばtrue、素数以外の整数にはfalse
//負数は全てfalse
//検証済み
bool prime(long long N) {
if (N == 1) {
return false;
}
if (N < 0)
return false;
long long p = sqrt(N);
for (long long i = 2; i <= p; i++) {
if (N % i == 0) {
return false;
}
}
return true;
}
//ユークリッド距離
//検証済み
//位置ベクトル1,位置ベクトル2,ベクトルの次元(2または3が一般的)
double distance(vector<long long> p, vector<long long> q, long long n) {
double x = 0;
for (long long i = 0; i < n; i++) {
x += pow((p.at(i) - q.at(i)), 2);
}
return sqrt(x);
}
//配列圧縮(検証済)
//{1,36,1,3,8,-2,-92}を
//{2, 5,2,3,4, 1, 0}にする
void press(vector<long long> &v) {
long long n = v.size();
vector<long long> w(n);
map<long long, long long> m;
for (auto &p : v) {
m[p] = 0;
}
long long i = 0;
for (auto &p : m) {
p.second = i;
i++;
}
for (long long i = 0; i < n; i++) {
w.at(i) = m[v.at(i)];
}
v = w;
return;
}
//配列のi番目の要素がj番目に小さいとき、j番目の数がiであるベクトルを返す関数
//配列の要素が全て異なるときにしか正常に動作しない
//配列の要素に同じものが含まれても見かけ上動作はするが意味のない値を戻し、
//エラーも起きないので注意
//検証済
//{2,4,1,6,0,3,8,9,5}を
//{4,2,0,5,1,8,3,6,7}にして返す
//"rank"という名前にするとSTLの関数(配列の次元を返す関数)になるので注意
void ranking(vector<long long> &v) {
long long n = v.size();
map<long long, long long> m;
long long i;
for (i = 0; i < n; i++) {
m[v.at(i)] = i;
}
vector<long long> w(n);
i = 0;
for (auto &p : m) {
v.at(i) = p.second;
i++;
}
return;
}
//部分削除(未検証)
//ベクトルのi番目(i=0,1,2,...,n-1)の要素を削除し、
//以降の要素を全て前に1ずらして参照返し
//ベクトル長は1小さくなって返る
// i>n-1の時は変化しない
void erase(vector<long long> &v, long long i) {
long long n = v.size();
if (i > n - 1)
return;
for (long long j = i; j < n - 1; j++) {
v.at(j) = v.at(j + 1);
}
v.pop_back();
return;
}
//重複削除(未完成)
//引数ベクトルに同一要素が複数あるとき、先頭を残し他は削除
//参照返し
//ベクトル長も変化する
// O(logn)くらい
void unique(vector<long long> &v) {
long long n = v.size();
set<long long> s;
long long i = 0;
while (i < n) {
if (s.count(v.at(i))) {
erase(v, i);
n--;
} else {
s.insert(v.at(i));
i++;
}
}
return;
}
//ベクトルの出力(検証済)
// debug用にvectorの中身を出力する
void printv(vector<long long> v) {
cout << "{ ";
for (auto &p : v) {
cout << p << ",";
}
cout << "}" << endl;
}
// 10進法でn桁の整数xに対して、大きい方の位から、その位の1桁の数字を
//収納した長さnのベクトルを返す
// 0に対しては{0}を返す
//検証済み
vector<ll> keta(ll x) {
if (x == 0)
return {0};
ll n = log10(x) + 1; // xの桁数
vll w(n, 0);
for (ll i = 0; i < n; i++) {
ll p;
p = x % 10;
x = x / 10;
w[n - 1 - i] = p;
}
return w;
}
// 20200415
// a^n mod を計算する
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// a^{-1} mod を計算する
// modとaが互いに素のときのみ有効(数学的に逆元が一意に定まるのがそのときのみ)
long long modinv(long long a, long long mod) { return modpow(a, mod - 2, mod); }
//整数n個の入力を受け取ってベクトルに突っ込んで返す
//チェック済み
vector<long long> inputv(long long n) {
vector<long long> v(n);
for (long long i = 0; i < n; i++) {
cin >> v[i];
}
return v;
}
vector<long long> yakusuu(long long n) // nの約数を列挙
{
vector<long long> ret;
for (long long i = 1; i <= sqrt(n); ++i) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) {
ret.push_back(n / i);
}
}
}
sort(ret.begin(), ret.end());
return ret;
}
map<long long, long long> soinsuu(long long n) {
map<long long, long long> m;
long long p = sqrt(n);
while (n % 2 == 0) {
n /= 2;
if (m.count(2)) {
m[2]++;
} else {
m[2] = 1;
}
}
for (long long i = 3; i * i <= n; i += 2) {
while (n % i == 0) {
n /= i;
if (m.count(i)) {
m[i]++;
} else {
m[i] = 1;
}
}
}
if (n != 1)
m[n] = 1;
return m;
}
//スタートが(i,j)の迷路の全ての地点までの距離を幅優先探索で解く
//スタートから何マス離れているか(辿り着けない場合は-1)を入れたベクトルを返す
//壁からスタートしても正常に動作するので注意(この関数の外で処理が必要)
//検証済み 一応O(地図の広さ)くらい
vector<vector<long long>> maze(ll i, ll j, vector<string> &s) {
ll h = s.size();
ll w = s[0].size();
queue<vector<long long>> q;
vector<vector<long long>> dis(h, vll(w, -1));
q.push({i, j});
dis[i][j] = 0;
while (!q.empty()) {
auto v = q.front();
q.pop();
if (v[0] > 0 && s[v[0] - 1][v[1]] == '.' && dis[v[0] - 1][v[1]] == -1) {
dis[v[0] - 1][v[1]] = dis[v[0]][v[1]] + 1;
q.push({v[0] - 1, v[1]});
}
if (v[1] > 0 && s[v[0]][v[1] - 1] == '.' && dis[v[0]][v[1] - 1] == -1) {
dis[v[0]][v[1] - 1] = dis[v[0]][v[1]] + 1;
q.push({v[0], v[1] - 1});
}
if (v[0] < h - 1 && s[v[0] + 1][v[1]] == '.' && dis[v[0] + 1][v[1]] == -1) {
dis[v[0] + 1][v[1]] = dis[v[0]][v[1]] + 1;
q.push({v[0] + 1, v[1]});
}
if (v[1] < w - 1 && s[v[0]][v[1] + 1] == '.' && dis[v[0]][v[1] + 1] == -1) {
dis[v[0]][v[1] + 1] = dis[v[0]][v[1]] + 1;
q.push({v[0], v[1] + 1});
}
}
return dis; //スタートから何マス離れているか(辿り着けない場合は-1)
}
//エラトステネスのふるいによりn以下の素数を全てベクトルに入れて返す
// vector<long long> eratos(long long n){
// }
//二項係数の剰余を求める
//引数は剰余の形ではなくもとの数そのものである
//未検証(検証サンプルがない)
long long modC(long long n, long long k, long long mod) {
if (n < k)
return 0;
long long p = 1, q = 1;
for (long long i = 0; i < k; i++) {
p = p * (n - i) % mod;
q = q * (i + 1) % mod;
}
return p * modinv(q, mod) % mod;
}
// 20200418
// 整数のとき限定の普通のPOW関数
//標準機能のpow(a,n)は整数だとバグるのでこちらを使う
long long POW(long long a, long long n) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a;
a = a * a;
n >>= 1;
}
return res;
}
// 20200423
//エラトステネスのふるいによりn以下の素数を全てベクトルに入れて返す
vector<long long> eratos(long long n) {
if (n < 2)
return {};
vll v(n - 1);
rep(i, n - 1) {
v[i] = i + 2; // 2からnまで
}
ll i = 0;
while (i < n - 1) {
ll p = v[i];
for (ll j = i + 1; j < n - 1; j++) {
if (v[j] % p == 0) {
v.erase(v.begin() + j);
n--;
}
}
i++;
}
v.resize(n - 1);
return v;
}
// n以下の素数を全て詰めたset
set<long long> eraset(long long n) {
set<long long> s;
vll v = eratos(n);
for (auto &t : v) {
s.insert(t);
}
return s;
}
// cout<<fixed<<setprecision(10);
//////////////////////////////////////////////////
const ll mod = 1e9 + 7;
int main() {
string s, t;
cin >> s >> t;
ll n = s.size();
ll m = t.size();
vll a(n), b(m);
rep(i, n) a[i] = s[i] - 'a';
rep(i, m) b[i] = t[i] - 'a';
ll cnt = 0;
vvll v(26, vll(0));
rep(i, n) { v.at(a[i]).push_back(i); }
// rep(i,26) printv(v[i]);
ll l = 0;
rep(i, m) {
ll x = v.at(b[i]).size();
if (x == 0) {
cout << -1 << endl;
return 0;
}
ll k = upper_bound(v.at(b[i]).begin(), v.at(b[i]).end(), l) -
v.at(b[i]).begin();
if (k == x) {
k = 0;
cnt++;
}
l = v.at(b[i]).at(k);
// cout<<i<<" "<<l<<endl;
}
// cout<<cnt<<endl;
cout << cnt * n + l + 1 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
#define pq priority_queue
using vi = vector<int>; // intの1次元の型に vi という別名をつける
using vvi = vector<vi>; // intの2次元の型に vvi という別名をつける
using vvvi = vector<vvi>;
using ll = long long; // long longをllだけにした
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vb = vector<bool>;
using vvb = vector<vb>;
using mii = map<int, int>;
using pqls = priority_queue<long long>;
using pqlg = priority_queue<long long, vector<long long>, greater<long long>>;
using mll = map<long long, long long>;
using pll = pair<long long, long long>;
using sll = set<long long>;
long long divup(long long a, long long b);
long long kaijou(long long i);
long long P(long long n, long long k);
long long C(long long n, long long k);
long long GCD(long long a, long long b);
long long LCM(long long a, long long b);
bool prime(long long N);
double distance(vector<long long> p, vector<long long> q, long long n);
void press(vector<long long> &v);
void ranking(vector<long long> &v);
void erase(vector<long long> &v, long long i);
void unique(vector<long long> &v);
void printv(vector<long long> v);
vector<ll> keta(ll x);
long long modpow(long long a, long long n, long long mod);
long long modinv(long long a, long long mod);
// 20200416
vector<long long> inputv(long long n);
// 20200417
vector<long long> yakusuu(int n);
map<long long, long long> soinsuu(long long n);
vector<vector<long long>> maze(long long i, long long j, vector<string> &s);
// 20200423
vector<long long> eratos(long long n);
set<long long> eraset(long long n);
//////////////////////////////////////////////////////
//端数繰りあがり割り算(検証済)
// a÷bの端数繰り上げ
// b!=0のデバグはしてないので分母に0を入れないように
//負数対応
long long divup(long long a, long long b) {
long long x = abs(a);
long long y = abs(b);
long long z = (x + y - 1) / y;
if ((a < 0 && b > 0) || (a > 0 && b < 0))
return -z;
else if (a == 0)
return 0;
else
return z;
}
//階乗
//検証済み
long long kaijou(long long i) {
if (i == 0)
return 1;
long long j = 1;
for (long long k = 1; k <= i; k++) {
j *= k;
}
return j;
}
//順列nPk(完成)
// n個の異なる要素から、取り出す順序を区別してk個取り出す場合の数
// n<kなら0を返す
//敢えて負数時のデバグはしてない
long long P(long long n, long long k) {
if (n < k)
return 0;
long long y = 1;
for (long long i = 0; i < k; i++) {
y *= (n - i);
}
return y;
}
//組み合わせnCk(検証済み)
// P,kaijouと併用
long long C(long long n, long long k) {
if (n < k)
return 0;
return P(n, k) / kaijou(k);
}
// nHk
//区別しないn個の要素を、区別するk個のグループに分ける
// 0個のグループがあっ
//て良い
// C必須
//最大公約数GCD,最小公倍数LCM
// LCMを使うときはGCDをセットで
//検証済み
long long GCD(long long a, long long b) {
if (a < b)
swap(a, b);
long long d = a % b;
if (d == 0) {
return b;
}
return GCD(b, d);
}
long long LCM(long long a, long long b) { return (a / GCD(a, b)) * b; }
//素数判定
//素数ならばtrue、素数以外の整数にはfalse
//負数は全てfalse
//検証済み
bool prime(long long N) {
if (N == 1) {
return false;
}
if (N < 0)
return false;
long long p = sqrt(N);
for (long long i = 2; i <= p; i++) {
if (N % i == 0) {
return false;
}
}
return true;
}
//ユークリッド距離
//検証済み
//位置ベクトル1,位置ベクトル2,ベクトルの次元(2または3が一般的)
double distance(vector<long long> p, vector<long long> q, long long n) {
double x = 0;
for (long long i = 0; i < n; i++) {
x += pow((p.at(i) - q.at(i)), 2);
}
return sqrt(x);
}
//配列圧縮(検証済)
//{1,36,1,3,8,-2,-92}を
//{2, 5,2,3,4, 1, 0}にする
void press(vector<long long> &v) {
long long n = v.size();
vector<long long> w(n);
map<long long, long long> m;
for (auto &p : v) {
m[p] = 0;
}
long long i = 0;
for (auto &p : m) {
p.second = i;
i++;
}
for (long long i = 0; i < n; i++) {
w.at(i) = m[v.at(i)];
}
v = w;
return;
}
//配列のi番目の要素がj番目に小さいとき、j番目の数がiであるベクトルを返す関数
//配列の要素が全て異なるときにしか正常に動作しない
//配列の要素に同じものが含まれても見かけ上動作はするが意味のない値を戻し、
//エラーも起きないので注意
//検証済
//{2,4,1,6,0,3,8,9,5}を
//{4,2,0,5,1,8,3,6,7}にして返す
//"rank"という名前にするとSTLの関数(配列の次元を返す関数)になるので注意
void ranking(vector<long long> &v) {
long long n = v.size();
map<long long, long long> m;
long long i;
for (i = 0; i < n; i++) {
m[v.at(i)] = i;
}
vector<long long> w(n);
i = 0;
for (auto &p : m) {
v.at(i) = p.second;
i++;
}
return;
}
//部分削除(未検証)
//ベクトルのi番目(i=0,1,2,...,n-1)の要素を削除し、
//以降の要素を全て前に1ずらして参照返し
//ベクトル長は1小さくなって返る
// i>n-1の時は変化しない
void erase(vector<long long> &v, long long i) {
long long n = v.size();
if (i > n - 1)
return;
for (long long j = i; j < n - 1; j++) {
v.at(j) = v.at(j + 1);
}
v.pop_back();
return;
}
//重複削除(未完成)
//引数ベクトルに同一要素が複数あるとき、先頭を残し他は削除
//参照返し
//ベクトル長も変化する
// O(logn)くらい
void unique(vector<long long> &v) {
long long n = v.size();
set<long long> s;
long long i = 0;
while (i < n) {
if (s.count(v.at(i))) {
erase(v, i);
n--;
} else {
s.insert(v.at(i));
i++;
}
}
return;
}
//ベクトルの出力(検証済)
// debug用にvectorの中身を出力する
void printv(vector<long long> v) {
cout << "{ ";
for (auto &p : v) {
cout << p << ",";
}
cout << "}" << endl;
}
// 10進法でn桁の整数xに対して、大きい方の位から、その位の1桁の数字を
//収納した長さnのベクトルを返す
// 0に対しては{0}を返す
//検証済み
vector<ll> keta(ll x) {
if (x == 0)
return {0};
ll n = log10(x) + 1; // xの桁数
vll w(n, 0);
for (ll i = 0; i < n; i++) {
ll p;
p = x % 10;
x = x / 10;
w[n - 1 - i] = p;
}
return w;
}
// 20200415
// a^n mod を計算する
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// a^{-1} mod を計算する
// modとaが互いに素のときのみ有効(数学的に逆元が一意に定まるのがそのときのみ)
long long modinv(long long a, long long mod) { return modpow(a, mod - 2, mod); }
//整数n個の入力を受け取ってベクトルに突っ込んで返す
//チェック済み
vector<long long> inputv(long long n) {
vector<long long> v(n);
for (long long i = 0; i < n; i++) {
cin >> v[i];
}
return v;
}
vector<long long> yakusuu(long long n) // nの約数を列挙
{
vector<long long> ret;
for (long long i = 1; i <= sqrt(n); ++i) {
if (n % i == 0) {
ret.push_back(i);
if (i * i != n) {
ret.push_back(n / i);
}
}
}
sort(ret.begin(), ret.end());
return ret;
}
map<long long, long long> soinsuu(long long n) {
map<long long, long long> m;
long long p = sqrt(n);
while (n % 2 == 0) {
n /= 2;
if (m.count(2)) {
m[2]++;
} else {
m[2] = 1;
}
}
for (long long i = 3; i * i <= n; i += 2) {
while (n % i == 0) {
n /= i;
if (m.count(i)) {
m[i]++;
} else {
m[i] = 1;
}
}
}
if (n != 1)
m[n] = 1;
return m;
}
//スタートが(i,j)の迷路の全ての地点までの距離を幅優先探索で解く
//スタートから何マス離れているか(辿り着けない場合は-1)を入れたベクトルを返す
//壁からスタートしても正常に動作するので注意(この関数の外で処理が必要)
//検証済み 一応O(地図の広さ)くらい
vector<vector<long long>> maze(ll i, ll j, vector<string> &s) {
ll h = s.size();
ll w = s[0].size();
queue<vector<long long>> q;
vector<vector<long long>> dis(h, vll(w, -1));
q.push({i, j});
dis[i][j] = 0;
while (!q.empty()) {
auto v = q.front();
q.pop();
if (v[0] > 0 && s[v[0] - 1][v[1]] == '.' && dis[v[0] - 1][v[1]] == -1) {
dis[v[0] - 1][v[1]] = dis[v[0]][v[1]] + 1;
q.push({v[0] - 1, v[1]});
}
if (v[1] > 0 && s[v[0]][v[1] - 1] == '.' && dis[v[0]][v[1] - 1] == -1) {
dis[v[0]][v[1] - 1] = dis[v[0]][v[1]] + 1;
q.push({v[0], v[1] - 1});
}
if (v[0] < h - 1 && s[v[0] + 1][v[1]] == '.' && dis[v[0] + 1][v[1]] == -1) {
dis[v[0] + 1][v[1]] = dis[v[0]][v[1]] + 1;
q.push({v[0] + 1, v[1]});
}
if (v[1] < w - 1 && s[v[0]][v[1] + 1] == '.' && dis[v[0]][v[1] + 1] == -1) {
dis[v[0]][v[1] + 1] = dis[v[0]][v[1]] + 1;
q.push({v[0], v[1] + 1});
}
}
return dis; //スタートから何マス離れているか(辿り着けない場合は-1)
}
//エラトステネスのふるいによりn以下の素数を全てベクトルに入れて返す
// vector<long long> eratos(long long n){
// }
//二項係数の剰余を求める
//引数は剰余の形ではなくもとの数そのものである
//未検証(検証サンプルがない)
long long modC(long long n, long long k, long long mod) {
if (n < k)
return 0;
long long p = 1, q = 1;
for (long long i = 0; i < k; i++) {
p = p * (n - i) % mod;
q = q * (i + 1) % mod;
}
return p * modinv(q, mod) % mod;
}
// 20200418
// 整数のとき限定の普通のPOW関数
//標準機能のpow(a,n)は整数だとバグるのでこちらを使う
long long POW(long long a, long long n) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a;
a = a * a;
n >>= 1;
}
return res;
}
// 20200423
//エラトステネスのふるいによりn以下の素数を全てベクトルに入れて返す
vector<long long> eratos(long long n) {
if (n < 2)
return {};
vll v(n - 1);
rep(i, n - 1) {
v[i] = i + 2; // 2からnまで
}
ll i = 0;
while (i < n - 1) {
ll p = v[i];
for (ll j = i + 1; j < n - 1; j++) {
if (v[j] % p == 0) {
v.erase(v.begin() + j);
n--;
}
}
i++;
}
v.resize(n - 1);
return v;
}
// n以下の素数を全て詰めたset
set<long long> eraset(long long n) {
set<long long> s;
vll v = eratos(n);
for (auto &t : v) {
s.insert(t);
}
return s;
}
// cout<<fixed<<setprecision(10);
//////////////////////////////////////////////////
const ll mod = 1e9 + 7;
int main() {
string s, t;
cin >> s >> t;
ll n = s.size();
ll m = t.size();
vll a(n), b(m);
rep(i, n) a[i] = s[i] - 'a';
rep(i, m) b[i] = t[i] - 'a';
ll cnt = 0;
vvll v(26, vll(0));
rep(i, n) { v.at(a[i]).push_back(i); }
// rep(i,26) printv(v[i]);
ll l = -1;
rep(i, m) {
ll x = v.at(b[i]).size();
if (x == 0) {
cout << -1 << endl;
return 0;
}
ll k = upper_bound(v.at(b[i]).begin(), v.at(b[i]).end(), l) -
v.at(b[i]).begin();
if (k == x) {
k = 0;
cnt++;
}
l = v.at(b[i]).at(k);
// cout<<i<<" "<<l<<endl;
}
// cout<<cnt<<endl;
cout << cnt * n + l + 1 << endl;
}
|
[
"literal.number.change",
"variable_declaration.value.change"
] | 739,468
| 739,469
|
u513211419
|
cpp
|
p02937
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
vector<vector<int>> chr(26);
for (int i = 0; i < s.size(); i++)
chr[s[i] - 'a'].push_back(i);
long long x = 0;
int p = -1;
for (int i = 0; i < t.size(); i++) {
if (chr[t[i] - 'a'].size() == 0) {
cout << "-1" << endl;
return 0;
}
if (p > chr[t[i] - 'a'].back()) {
x += chr[t[i] - 'a'][0] + s.size() - p;
p = chr[t[i] - 'a'][0];
} else {
x += *upper_bound(chr[t[i] - 'a'].begin(), chr[t[i] - 'a'].end(), p) - p;
p = *upper_bound(chr[t[i] - 'a'].begin(), chr[t[i] - 'a'].end(), p);
}
}
cout << x << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
cin >> s >> t;
vector<vector<int>> chr(26);
for (int i = 0; i < s.size(); i++)
chr[s[i] - 'a'].push_back(i);
long long x = 0;
int p = -1;
for (int i = 0; i < t.size(); i++) {
if (chr[t[i] - 'a'].size() == 0) {
cout << "-1" << endl;
return 0;
}
if (p >= chr[t[i] - 'a'].back()) {
x += chr[t[i] - 'a'][0] + s.size() - p;
p = chr[t[i] - 'a'][0];
} else {
x += *upper_bound(chr[t[i] - 'a'].begin(), chr[t[i] - 'a'].end(), p) - p;
p = *upper_bound(chr[t[i] - 'a'].begin(), chr[t[i] - 'a'].end(), p);
}
}
cout << x << endl;
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 739,470
| 739,471
|
u507850687
|
cpp
|
p02937
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define erep(i, a, n) for (int i = a; i <= n; i++)
typedef long long ll;
#define int long long
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vector<string>
#define vdouble vector<double>
#define vll vector<ll>:
#define vbool vector<bool>
#define INF 1101010101010101010
#define MOD 1000000007
#define P = pair<int, int>;
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;
}
signed main() {
string s, t;
cin >> s >> t;
int n = s.size();
int m = t.size();
vvint is(26);
rep(i, 0, n) is[s[i] - 'a'].push_back(i);
rep(i, 0, n) is[s[i] - 'a'].push_back(i + n);
int ans = 0;
int p = 0;
rep(i, 0, m) {
int c = t[i] - 'a';
if (is[c].size() == 0) {
cout << -1 << endl;
return 0;
}
p = *upper_bound(is[c].begin(), is[c].end(), p);
if (p >= n) {
p -= n;
ans += n;
}
// cout << ans << endl;
}
ans += p + 1;
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define erep(i, a, n) for (int i = a; i <= n; i++)
typedef long long ll;
#define int long long
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vector<string>
#define vdouble vector<double>
#define vll vector<ll>:
#define vbool vector<bool>
#define INF 1101010101010101010
#define MOD 1000000007
#define P = pair<int, int>;
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;
}
signed main() {
string s, t;
cin >> s >> t;
int n = s.size();
int m = t.size();
vvint is(26);
rep(i, 0, n) is[s[i] - 'a'].push_back(i);
rep(i, 0, n) is[s[i] - 'a'].push_back(i + n);
int ans = 0;
int p = 0;
rep(i, 0, m) {
int c = t[i] - 'a';
if (is[c].size() == 0) {
cout << -1 << endl;
return 0;
}
p = *lower_bound(is[c].begin(), is[c].end(), p) + 1;
if (p >= n) {
p -= n;
ans += n;
}
// cout << ans << endl;
}
ans += p;
cout << ans << endl;
}
|
[
"assignment.value.change",
"identifier.change",
"call.function.change",
"assignment.change",
"expression.operation.binary.remove"
] | 739,474
| 739,475
|
u613960672
|
cpp
|
p02937
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<long long> c[26];
int main() {
string s, t;
cin >> s >> t;
int n = s.size();
s = s + s;
for (int i = 0; i < s.size(); i++) {
c[s[i] - 'a'].push_back(i);
}
for (int i = 0; i < t.size(); i++) {
if (c[t[i] - 'a'].empty()) {
cout << -1 << endl;
return 0;
}
}
long long sum = c[t[0] - 'a'][0] + 1;
long long now = c[t[0] - 'a'][0];
for (int i = 1; i < t.size(); i++) {
long long hoge =
*lower_bound(c[t[i] - 'a'].begin(), c[t[i] - 'a'].end(), now);
sum += hoge - now;
(now = hoge) %= n;
}
cout << sum << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
vector<long long> c[26];
int main() {
string s, t;
cin >> s >> t;
int n = s.size();
s = s + s;
for (int i = 0; i < s.size(); i++) {
c[s[i] - 'a'].push_back(i);
}
for (int i = 0; i < t.size(); i++) {
if (c[t[i] - 'a'].empty()) {
cout << -1 << endl;
return 0;
}
}
long long sum = c[t[0] - 'a'][0] + 1;
long long now = c[t[0] - 'a'][0];
for (int i = 1; i < t.size(); i++) {
long long hoge =
*upper_bound(c[t[i] - 'a'].begin(), c[t[i] - 'a'].end(), now);
sum += hoge - now;
(now = hoge) %= n;
}
cout << sum << endl;
return 0;
}
|
[
"identifier.change",
"call.function.change"
] | 739,483
| 739,484
|
u587366956
|
cpp
|
p02937
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
long long int ans = 0, now = 0;
cin >> s;
cin >> t;
vector<vector<long long int>> num(26);
for (int i = 0; i < s.size(); i++) {
num[s[i] - 'a'].push_back(i);
}
if (num[t[0] - 'a'].size() == 0) {
cout << -1 << endl;
return 0;
} else {
now = num[t[0] - 'a'][0];
}
for (int i = 1; i < t.size(); i++) {
if (num[t[i] - 'a'].size() == 0) {
cout << -1 << endl;
return 0;
}
if (num[t[i] - 'a'].back() < now) {
now = num[t[i] - 'a'][0];
ans += s.size();
} else {
auto itr =
upper_bound(num[t[i] - 'a'].begin(), num[t[i] - 'a'].end(), now);
now = *itr;
}
}
cout << ans + now + 1 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
long long int ans = 0, now = 0;
cin >> s;
cin >> t;
vector<vector<long long int>> num(26);
for (int i = 0; i < s.size(); i++) {
num[s[i] - 'a'].push_back(i);
}
if (num[t[0] - 'a'].size() == 0) {
cout << -1 << endl;
return 0;
} else {
now = num[t[0] - 'a'][0];
}
for (int i = 1; i < t.size(); i++) {
if (num[t[i] - 'a'].size() == 0) {
cout << -1 << endl;
return 0;
}
if (num[t[i] - 'a'].back() < now + 1) {
now = num[t[i] - 'a'][0];
ans += s.size();
} else {
auto itr =
upper_bound(num[t[i] - 'a'].begin(), num[t[i] - 'a'].end(), now);
now = *itr;
}
}
cout << ans + now + 1 << endl;
}
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 739,489
| 739,490
|
u926416331
|
cpp
|
p02937
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
long long int ans = 0, now = 0;
cin >> s;
cin >> t;
vector<vector<long long int>> num(26);
for (int i = 0; i < s.size(); i++) {
num[s[i] - 'a'].push_back(i);
}
if (num[t[0] - 'a'].size() == 0) {
cout << -1 << endl;
return 0;
} else {
now = num[t[0] - 'a'][0];
}
for (int i = 1; i < t.size(); i++) {
if (num[t[i] - 'a'].size() == 0) {
cout << -1 << endl;
return 0;
}
if (num[t[i] - 'a'].back() < now) {
now = num[t[i] - 'a'].back();
ans += s.size();
} else {
auto itr =
upper_bound(num[t[i] - 'a'].begin(), num[t[i] - 'a'].end(), now);
now = *itr;
}
}
cout << ans + now + 1 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s, t;
long long int ans = 0, now = 0;
cin >> s;
cin >> t;
vector<vector<long long int>> num(26);
for (int i = 0; i < s.size(); i++) {
num[s[i] - 'a'].push_back(i);
}
if (num[t[0] - 'a'].size() == 0) {
cout << -1 << endl;
return 0;
} else {
now = num[t[0] - 'a'][0];
}
for (int i = 1; i < t.size(); i++) {
if (num[t[i] - 'a'].size() == 0) {
cout << -1 << endl;
return 0;
}
if (num[t[i] - 'a'].back() < now + 1) {
now = num[t[i] - 'a'][0];
ans += s.size();
} else {
auto itr =
upper_bound(num[t[i] - 'a'].begin(), num[t[i] - 'a'].end(), now);
now = *itr;
}
}
cout << ans + now + 1 << endl;
}
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"call.arguments.change"
] | 739,491
| 739,490
|
u926416331
|
cpp
|
p02937
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
long long a = 0;
string s, t;
cin >> s >> t;
s += s;
vector<vector<int>> m(26), v(26, vector<int>((int)s.size(), -1));
rep(i, s.size()) m[s[i] - 'a'].push_back(i);
rep(i, 26) {
if (m[i].size() == 0)
continue;
else
rep(j, (int)s.size() / 2) v[i][j] =
m[i][upper_bound(m[i].begin(), m[i].end(), j) - m[i].begin()] - j;
}
rep(i, t.size()) {
if (m[t[i] - 'a'].size() == 0) {
a = -1;
break;
} else if (i == 0 && s[0] == t[i])
continue;
else
a += v[t[i] - 'a'][a % ((int)s.size() / 2)];
}
cout << a + 1 << "\n";
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
long long a = 0;
string s, t;
cin >> s >> t;
s += s;
vector<vector<int>> m(26), v(26, vector<int>((int)s.size(), -1));
rep(i, s.size()) m[s[i] - 'a'].push_back(i);
rep(i, 26) {
if (m[i].size() == 0)
continue;
else
rep(j, (int)s.size() / 2) v[i][j] =
m[i][upper_bound(m[i].begin(), m[i].end(), j) - m[i].begin()] - j;
}
rep(i, t.size()) {
if (m[t[i] - 'a'].size() == 0) {
a = -2;
break;
} else if (i == 0 && s[0] == t[i])
continue;
else
a += v[t[i] - 'a'][a % ((int)s.size() / 2)];
}
cout << a + 1 << "\n";
return 0;
}
|
[
"literal.number.change",
"assignment.value.change"
] | 739,492
| 739,493
|
u757584836
|
cpp
|
p02937
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
long long a = 1;
string s, t;
cin >> s >> t;
s += s;
vector<vector<int>> m(26), v(26, vector<int>((int)s.size(), -1));
rep(i, s.size()) m[s[i] - 'a'].push_back(i);
rep(i, 26) {
if (m[i].size() == 0)
continue;
else
rep(j, (int)s.size() / 2) v[i][j] =
m[i][upper_bound(m[i].begin(), m[i].end(), j) - m[i].begin()] - j;
}
rep(i, t.size()) {
if (m[t[i] - 'a'].size() == 0) {
a = -1;
break;
} else if (i == 0 && s[0] == t[i])
continue;
else
a += v[t[i] - 'a'][a % ((int)s.size() / 2)];
}
cout << a << "\n";
return 0;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
int main() {
long long a = 0;
string s, t;
cin >> s >> t;
s += s;
vector<vector<int>> m(26), v(26, vector<int>((int)s.size(), -1));
rep(i, s.size()) m[s[i] - 'a'].push_back(i);
rep(i, 26) {
if (m[i].size() == 0)
continue;
else
rep(j, (int)s.size() / 2) v[i][j] =
m[i][upper_bound(m[i].begin(), m[i].end(), j) - m[i].begin()] - j;
}
rep(i, t.size()) {
if (m[t[i] - 'a'].size() == 0) {
a = -2;
break;
} else if (i == 0 && s[0] == t[i])
continue;
else
a += v[t[i] - 'a'][a % ((int)s.size() / 2)];
}
cout << a + 1 << "\n";
return 0;
}
|
[
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change"
] | 739,494
| 739,493
|
u757584836
|
cpp
|
p02937
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
#define FOR(i, a, n) for (int(i) = (a); (i) < (n); ++(i))
#define eFOR(i, a, n) for (int(i) = (a); (i) <= (n); ++(i))
#define rFOR(i, a, n) for (int(i) = (n)-1; (i) >= (a); --(i))
#define erFOR(i, a, n) for (int(i) = (n); (i) >= (a); --(i))
#define SORT(i) sort((i).begin(), (i).end())
#define rSORT(i, a) sort((i).begin(), (i).end(), (a))
#define all(i) (i).begin(), (i).end()
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 60;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
const long double pi = acos(-1);
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
inline void init() {
cin.tie(nullptr);
cout.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
template <class T> inline istream &operator>>(istream &input, vector<T> &v) {
for (auto &elemnt : v)
input >> elemnt;
return input;
}
int main() {
init();
string s, t;
cin >> s >> t;
int n = s.length(), m = t.length();
vector<VI> where(26);
FOR(i, 0, n) where[s[i] - 'a'].push_back(i);
int now = 0;
ll ans = 0;
FOR(i, 0, m) {
if (where[t[i] - 'a'].empty()) {
cout << "-1\n";
return 0;
}
auto itr = upper_bound(all(where[t[i] - 'a']), now);
if (itr == where[t[i] - 'a'].end()) {
ans += n;
itr = where[t[i] - 'a'].begin();
}
now = *itr;
}
cout << ans + now + 1 << "\n";
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
#define FOR(i, a, n) for (int(i) = (a); (i) < (n); ++(i))
#define eFOR(i, a, n) for (int(i) = (a); (i) <= (n); ++(i))
#define rFOR(i, a, n) for (int(i) = (n)-1; (i) >= (a); --(i))
#define erFOR(i, a, n) for (int(i) = (n); (i) >= (a); --(i))
#define SORT(i) sort((i).begin(), (i).end())
#define rSORT(i, a) sort((i).begin(), (i).end(), (a))
#define all(i) (i).begin(), (i).end()
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 60;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
const long double pi = acos(-1);
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
inline void init() {
cin.tie(nullptr);
cout.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
template <class T> inline istream &operator>>(istream &input, vector<T> &v) {
for (auto &elemnt : v)
input >> elemnt;
return input;
}
int main() {
init();
string s, t;
cin >> s >> t;
int n = s.length(), m = t.length();
vector<VI> where(26);
FOR(i, 0, n) where[s[i] - 'a'].push_back(i);
int now = -1;
ll ans = 0;
FOR(i, 0, m) {
if (where[t[i] - 'a'].empty()) {
cout << "-1\n";
return 0;
}
auto itr = upper_bound(all(where[t[i] - 'a']), now);
if (itr == where[t[i] - 'a'].end()) {
ans += n;
itr = where[t[i] - 'a'].begin();
}
now = *itr;
}
cout << ans + now + 1 << "\n";
}
|
[
"literal.number.change",
"variable_declaration.value.change"
] | 739,495
| 739,496
|
u863044225
|
cpp
|
p02937
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void) {
string s, t;
cin >> s >> t;
vector<vector<int>> pos(26);
for (int i = 0; i < s.size(); i++)
pos[s[i] - 'a'].push_back(i);
for (int i = 0; i < s.size(); i++)
pos[s[i] - 'a'].push_back(i + s.size());
ll ans = 0;
int p = 0;
for (int i = 0; i < t.size(); i++) {
int c = t[i] - 'a';
auto itr = upper_bound(pos[c].begin(), pos[c].end(), p);
if (itr == pos[c].end()) {
cout << -1 << endl;
return 0;
}
int npos = *itr;
if (npos >= s.size()) {
ans += s.size();
p = npos - s.size();
} else {
p = npos;
}
}
cout << ans + p + 1 << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main(void) {
string s, t;
cin >> s >> t;
vector<vector<int>> pos(26);
for (int i = 0; i < s.size(); i++)
pos[s[i] - 'a'].push_back(i);
for (int i = 0; i < s.size(); i++)
pos[s[i] - 'a'].push_back(i + s.size());
ll ans = 0;
int p = -1;
for (int i = 0; i < t.size(); i++) {
int c = t[i] - 'a';
auto itr = upper_bound(pos[c].begin(), pos[c].end(), p);
if (itr == pos[c].end()) {
cout << -1 << endl;
return 0;
}
int npos = *itr;
if (npos >= s.size()) {
ans += s.size();
p = npos - s.size();
} else {
p = npos;
}
}
cout << ans + p + 1 << endl;
}
|
[
"literal.number.change",
"variable_declaration.value.change"
] | 739,497
| 739,498
|
u180257813
|
cpp
|
p02937
|
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define DIV 1000000007
using namespace std;
using ll = long long;
int main(void) {
string s, t;
cin >> s >> t;
vector<vector<int>> alp(26);
for (int i = 0; i < s.size(); i++) {
alp[s[i] - 'a'].push_back(i + 1);
}
ll now = 0;
ll con = 0;
bool flag = true;
for (int i = 0; i < t.size(); i++) {
if (alp[t[i] - 'a'].empty()) {
flag = false;
break;
;
}
auto id = lower_bound(alp[t[i] - 'a'].begin(), alp[t[i] - 'a'].end(), now);
if (id == alp[t[i] - 'a'].end()) {
con++;
now = alp[t[i] - 'a'][0];
} else {
now = *id;
}
}
if (flag)
cout << con * (ll)s.size() + now << endl;
else
cout << -1 << endl;
}
|
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define DIV 1000000007
using namespace std;
using ll = long long;
int main(void) {
string s, t;
cin >> s >> t;
vector<vector<int>> alp(26);
for (int i = 0; i < s.size(); i++) {
alp[s[i] - 'a'].push_back(i + 1);
}
ll now = 0;
ll con = 0;
bool flag = true;
for (int i = 0; i < t.size(); i++) {
if (alp[t[i] - 'a'].empty()) {
flag = false;
break;
;
}
auto id = upper_bound(alp[t[i] - 'a'].begin(), alp[t[i] - 'a'].end(), now);
if (id == alp[t[i] - 'a'].end()) {
con++;
now = alp[t[i] - 'a'][0];
} else {
now = *id;
}
}
if (flag) {
cout << con * (ll)s.size() + now << endl;
} else
cout << -1 << endl;
}
|
[
"identifier.change",
"call.function.change"
] | 739,503
| 739,504
|
u105100688
|
cpp
|
p02937
|
#include <bits/stdc++.h>
#define REP(i, m, n) for (int(i) = (m); (i) < (n); ++i)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
using namespace std;
using Graph = vector<vector<int>>;
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;
typedef pair<ll, ll> P;
const int INF = 1e9 + 7;
const ll LINF = 1LL << 60;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
string s, t;
cin >> s >> t;
int n = s.length();
vector<vector<int>> a(26);
rep(i, n) {
int idx = s[i] - 'a';
a[idx].push_back(i);
}
ll res = 0;
int j = -1;
rep(i, t.length()) {
int idx = t[i] - 'a';
if (a[idx].size() == 0) {
cout << -1 << endl;
return 0;
}
int u = upper_bound(a[idx].begin(), a[idx].end(), j) - a[idx].begin();
if (u = a[idx].size()) {
j = a[idx][0];
res += n;
} else {
j = a[idx][u];
}
}
cout << res + j + 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i, m, n) for (int(i) = (m); (i) < (n); ++i)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
using namespace std;
using Graph = vector<vector<int>>;
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;
typedef pair<ll, ll> P;
const int INF = 1e9 + 7;
const ll LINF = 1LL << 60;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
string s, t;
cin >> s >> t;
int n = s.length();
vector<vector<int>> a(26);
rep(i, n) {
int idx = s[i] - 'a';
a[idx].push_back(i);
}
ll res = 0;
int j = -1;
rep(i, t.length()) {
int idx = t[i] - 'a';
if (a[idx].size() == 0) {
cout << -1 << endl;
return 0;
}
int u = upper_bound(a[idx].begin(), a[idx].end(), j) - a[idx].begin();
if (u == a[idx].size()) {
j = a[idx][0];
res += n;
} else {
j = a[idx][u];
}
}
cout << res + j + 1 << endl;
return 0;
}
|
[
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 739,508
| 739,509
|
u468440139
|
cpp
|
p02937
|
#include <bits/stdc++.h>
#define REP(i, m, n) for (int(i) = (m); (i) < (n); ++i)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
using namespace std;
using Graph = vector<vector<int>>;
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;
typedef pair<ll, ll> P;
const int INF = 1e9 + 7;
const ll LINF = 1LL << 60;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
string s, t;
cin >> s >> t;
int n = s.length();
vector<vector<int>> a(26);
rep(i, n) {
int idx = s[i] - 'a';
a[idx].push_back(i);
}
int res = 0;
int j = 0;
rep(i, t.length()) {
int idx = t[i] - 'a';
if (a[idx].size() == 0) {
cout << -1 << endl;
return 0;
}
int u = lower_bound(a[idx].begin(), a[idx].end(), j) - a[idx].begin();
if (u == a[idx].size()) {
j = a[idx][0];
res += n;
} else {
j = a[idx][u];
}
}
cout << res + j + 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i, m, n) for (int(i) = (m); (i) < (n); ++i)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
using namespace std;
using Graph = vector<vector<int>>;
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;
typedef pair<ll, ll> P;
const int INF = 1e9 + 7;
const ll LINF = 1LL << 60;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
string s, t;
cin >> s >> t;
int n = s.length();
vector<vector<int>> a(26);
rep(i, n) {
int idx = s[i] - 'a';
a[idx].push_back(i);
}
ll res = 0;
int j = -1;
rep(i, t.length()) {
int idx = t[i] - 'a';
if (a[idx].size() == 0) {
cout << -1 << endl;
return 0;
}
int u = upper_bound(a[idx].begin(), a[idx].end(), j) - a[idx].begin();
if (u == a[idx].size()) {
j = a[idx][0];
res += n;
} else {
j = a[idx][u];
}
}
cout << res + j + 1 << endl;
return 0;
}
|
[
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 739,510
| 739,509
|
u468440139
|
cpp
|
p02937
|
#include <bits/stdc++.h>
#define REP(i, m, n) for (int(i) = (m); (i) < (n); ++i)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
using namespace std;
using Graph = vector<vector<int>>;
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;
typedef pair<ll, ll> P;
const int INF = 1e9 + 7;
const ll LINF = 1LL << 60;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
string s, t;
cin >> s >> t;
int n = s.length();
vector<vector<int>> a(26);
rep(i, n) {
int idx = s[i] - 'a';
a[idx].push_back(i);
}
int res = 0;
int j = 0;
rep(i, t.length()) {
int idx = t[i] - 'a';
if (a[idx].size() == 0) {
cout << -1 << endl;
return 0;
}
int u = upper_bound(a[idx].begin(), a[idx].end(), j) - a[idx].begin();
if (u == a[idx].size()) {
j = a[idx][0];
res += n;
} else {
j = a[idx][u];
}
}
cout << res + j + 1 << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define REP(i, m, n) for (int(i) = (m); (i) < (n); ++i)
#define rep(i, n) REP(i, 0, n)
#define all(x) (x).begin(), (x).end()
using namespace std;
using Graph = vector<vector<int>>;
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;
typedef pair<ll, ll> P;
const int INF = 1e9 + 7;
const ll LINF = 1LL << 60;
int main() {
cin.tie(0);
ios_base::sync_with_stdio(0);
string s, t;
cin >> s >> t;
int n = s.length();
vector<vector<int>> a(26);
rep(i, n) {
int idx = s[i] - 'a';
a[idx].push_back(i);
}
ll res = 0;
int j = -1;
rep(i, t.length()) {
int idx = t[i] - 'a';
if (a[idx].size() == 0) {
cout << -1 << endl;
return 0;
}
int u = upper_bound(a[idx].begin(), a[idx].end(), j) - a[idx].begin();
if (u == a[idx].size()) {
j = a[idx][0];
res += n;
} else {
j = a[idx][u];
}
}
cout << res + j + 1 << endl;
return 0;
}
|
[
"variable_declaration.type.change",
"literal.number.change",
"variable_declaration.value.change"
] | 739,511
| 739,509
|
u468440139
|
cpp
|
p02937
|
#include <algorithm>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
ll i, n, q, a, b, ans = 0, now;
char s[100010], t[100010];
vector<ll> vec[26];
scanf("%s%s", s, t);
for (i = 0; s[i]; ++i)
vec[s[i] - 'a'].push_back(i);
n = i;
for (i = 0; t[i]; ++i) {
t[i] -= 'a';
if (!vec[t[i]].size()) {
printf("-1");
return 0;
}
now = lower_bound(vec[t[i]].begin(), vec[t[i]].end(), ans % n) -
vec[t[i]].begin();
if (now != vec[t[i]].size())
ans = ans / n * n + vec[t[i]][now];
else
ans = (ans / n + 1) * n + vec[t[i]][0];
}
printf("%lld", ans + 1);
return 0;
}
|
#include <algorithm>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long ll;
int main(void) {
ll i, n, q, a, b, ans = -1, now;
char s[100010], t[100010];
vector<ll> vec[26];
scanf("%s%s", s, t);
for (i = 0; s[i]; ++i)
vec[s[i] - 'a'].push_back(i);
n = i;
for (i = 0; t[i]; ++i) {
t[i] -= 'a';
if (!vec[t[i]].size()) {
printf("-1");
return 0;
}
now = upper_bound(vec[t[i]].begin(), vec[t[i]].end(), ans % n) -
vec[t[i]].begin();
if (now != vec[t[i]].size())
ans = ans / n * n + vec[t[i]][now];
else
ans = (ans / n + 1) * n + vec[t[i]][0];
}
printf("%lld", ans + 1);
return 0;
}
|
[
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 739,512
| 739,513
|
u440920318
|
cpp
|
p02937
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define exrep(i, a, b) for (ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 1000000007;
const ll INF = 1e16;
int main() {
string s, t;
cin >> s >> t;
ll n = s.size();
ll m = t.size();
vvl v(26);
rep(i, n) { v[s[i] - 'a'].pb(i + 1); }
rep(i, n) { v[s[i] - 'a'].pb(i + 1 + n); }
ll p = 0;
ll ans = 0;
rep(i, m) {
ll c = t[i] - 'a';
if (v[c].size() == 0) {
out(-1);
re0;
}
p = *lower_bound(all(v[c]), p);
if (p >= n) {
p -= n;
ans += n;
}
}
ans += p;
out(ans);
re0;
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define exrep(i, a, b) for (ll i = a; i <= b; i++)
#define out(x) cout << x << endl
#define exout(x) printf("%.10f\n", x)
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define pb push_back
#define re0 return 0
const ll mod = 1000000007;
const ll INF = 1e16;
int main() {
string s, t;
cin >> s >> t;
ll n = s.size();
ll m = t.size();
vvl v(26);
rep(i, n) { v[s[i] - 'a'].pb(i); }
rep(i, n) { v[s[i] - 'a'].pb(i + n); }
ll p = 0;
ll ans = 0;
rep(i, m) {
ll c = t[i] - 'a';
if (v[c].size() == 0) {
out(-1);
re0;
}
p = *lower_bound(all(v[c]), p) + 1;
if (p >= n) {
p -= n;
ans += n;
}
}
ans += p;
out(ans);
re0;
}
|
[
"expression.operation.binary.remove",
"assignment.change"
] | 739,514
| 739,515
|
u828388155
|
cpp
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.