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 |
|---|---|---|---|---|---|---|---|
p02935
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
priority_queue<double, vector<double>, greater<double>> pt;
double a, b, sum = 0;
for (int i = 0; i < n; i++) {
scanf("%lf", &a);
pt.push(a);
}
while (!pt.empty()) {
a = pt.top();
pt.pop();
b = pt.top();
pt.pop();
sum = (a + b) / 2.0;
pt.push(sum);
}
printf("%lf\n", sum);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
priority_queue<double, vector<double>, greater<double>> pt;
double a, b, sum = 0;
for (int i = 0; i < n; i++) {
scanf("%lf", &a);
pt.push(a);
}
while (pt.size() > 1) {
a = pt.top();
pt.pop();
b = pt.top();
pt.pop();
sum = (a + b) / 2.0;
pt.push(sum);
}
printf("%lf\n", sum);
return 0;
}
|
[
"expression.operation.unary.logical.remove",
"control_flow.loop.condition.change",
"call.function.change"
] | 737,798
| 737,799
|
u654104650
|
cpp
|
p02935
|
#include <bits/stdc++.h>
using namespace std;
int main() {
double n;
cin >> n;
priority_queue<double, vector<double>, greater<double>> pt;
double a, b, sum = 0;
for (int i = 0; i < n; i++) {
scanf("%lf", &a);
pt.push(a);
}
while (!pt.empty()) {
a = pt.top();
pt.pop();
b = pt.top();
pt.pop();
sum = (a + b) / 2.0;
pt.push(sum);
}
printf("%lf\n", sum);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
priority_queue<double, vector<double>, greater<double>> pt;
double a, b, sum = 0;
for (int i = 0; i < n; i++) {
scanf("%lf", &a);
pt.push(a);
}
while (pt.size() > 1) {
a = pt.top();
pt.pop();
b = pt.top();
pt.pop();
sum = (a + b) / 2.0;
pt.push(sum);
}
printf("%lf\n", sum);
return 0;
}
|
[
"variable_declaration.type.primitive.change",
"expression.operation.unary.logical.remove",
"control_flow.loop.condition.change",
"call.function.change"
] | 737,800
| 737,799
|
u654104650
|
cpp
|
p02935
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
for (int i = 0; i < n - 1; i++) {
int temp = (a[i] + a[i + 1]) / 2;
a[i + 1] = temp;
}
cout << a[n - 1];
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
double a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
for (int i = 0; i < n - 1; i++) {
double temp = (a[i] + a[i + 1]) / 2;
a[i + 1] = temp;
}
cout << a[n - 1];
}
|
[
"variable_declaration.type.primitive.change"
] | 737,807
| 737,808
|
u676312981
|
cpp
|
p02935
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
// reverse(vec.begin(),vec.end());
double t = 0.0;
for (int i = 0; i < N - 1; i++) {
t = vec.at(i) + vec.at(i + 1);
t = t / 2;
vec.at(i + 1) = t;
}
cout << vec.at(N - 1) << endl;
}
|
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
int N;
cin >> N;
vector<double> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
// reverse(vec.begin(),vec.end());
double t = 0.0;
for (int i = 0; i < N - 1; i++) {
t = vec.at(i) + vec.at(i + 1);
t = t / 2;
vec.at(i + 1) = t;
}
cout << vec.at(N - 1) << endl;
}
|
[
"variable_declaration.type.primitive.change"
] | 737,813
| 737,814
|
u281055657
|
cpp
|
p02935
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
float a = (arr[1] + arr[0]) / 2;
for (int i = 2; i < n; i++) {
a = (a + arr[i]) / 2;
}
cout << a;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
float arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
float a = (arr[1] + arr[0]) / 2;
for (int i = 2; i < n; i++) {
a = (a + arr[i]) / 2;
}
cout << a;
return 0;
}
|
[
"variable_declaration.type.primitive.change"
] | 737,822
| 737,823
|
u917909548
|
cpp
|
p02935
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
float k = 0;
for (int i = 0; i < n - 1; i++) {
k = (arr[i] + arr[i + 1]) / 2.0;
arr[i + 1] = k;
}
cout << k << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
float arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
float k = 0;
for (int i = 0; i < n - 1; i++) {
k = (arr[i] + arr[i + 1]) / 2;
arr[i + 1] = k;
}
cout << k << endl;
}
|
[
"variable_declaration.type.primitive.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 737,824
| 737,825
|
u213391030
|
cpp
|
p02935
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
int k = 0;
for (int i = 0; i < n - 1; i++) {
k = (arr[i] + arr[i + 1]) / 2;
arr[i + 1] = k;
}
cout << k << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
float arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
sort(arr, arr + n);
float k = 0;
for (int i = 0; i < n - 1; i++) {
k = (arr[i] + arr[i + 1]) / 2;
arr[i + 1] = k;
}
cout << k << endl;
}
|
[
"variable_declaration.type.primitive.change"
] | 737,826
| 737,825
|
u213391030
|
cpp
|
p02935
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
float k;
priority_queue<float, vector<int>, greater<int>> a;
for (int i = 0; i < n; i++) {
cin >> k;
a.push(k);
}
while (a.size() != 1) {
float x = a.top();
a.pop();
float y = a.top();
a.pop();
float z = (x + y) / 2;
a.push(z);
}
cout << a.top() << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
float k;
priority_queue<float, vector<float>, greater<float>> a;
for (int i = 0; i < n; i++) {
cin >> k;
a.push(k);
}
while (a.size() != 1) {
float x = a.top();
a.pop();
float y = a.top();
a.pop();
float z = (x + y) / 2;
a.push(z);
}
cout << a.top() << endl;
}
|
[
"variable_declaration.type.primitive.change"
] | 737,830
| 737,831
|
u243126309
|
cpp
|
p02935
|
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
int N;
cin >> N;
vector<float> v;
float a;
for (int i = 0; i < N; i++) {
cin >> a;
v.push_back(a);
}
sort(v.begin(), v.end());
float V = v[0];
for (int i = 1; i < N - 1; i++) {
V = (V + v[i]) / 2;
}
cout << V << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(int argc, char const *argv[]) {
int N;
cin >> N;
vector<float> v;
float a;
for (int i = 0; i < N; i++) {
cin >> a;
v.push_back(a);
}
sort(v.begin(), v.end());
float V = v[0];
for (int i = 1; i < N; i++) {
V = (V + v[i]) / 2;
}
cout << V << endl;
return 0;
}
|
[
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 737,843
| 737,844
|
u383455755
|
cpp
|
p02935
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, i = 0, t;
cin >> N;
double v[N];
for (i = 0; i < N; i++) {
cin >> t;
v[i] = t;
}
sort(v, v + N);
double temp = (v[0] + v[1]) / 2.0;
if (N > 2) {
for (i = 2; i < N; i++) {
temp = (temp + v[2]) / 2.0;
}
}
cout << temp << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, i = 0, t;
cin >> N;
double v[N];
for (i = 0; i < N; i++) {
cin >> t;
v[i] = t;
}
sort(v, v + N);
double temp = (v[0] + v[1]) / 2.0;
if (N > 2) {
for (i = 2; i < N; i++) {
temp = (temp + v[i]) / 2.0;
}
}
cout << temp << endl;
}
|
[
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 737,847
| 737,848
|
u682526550
|
cpp
|
p02935
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int a[1100];
int main() {
int n;
int x;
double ans = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
sort(a + 1, a + 1 + n);
if (n == 2)
ans = 1.0 * (a[1] + a[2]) / 2;
else {
ans = (a[1] + a[2]) / 2;
for (int i = 3; i <= n; i++)
ans = (ans + a[i]) / 2;
}
cout << ans << '\n';
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int a[110];
int main() {
int n;
int x;
double ans = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
sort(a + 1, a + 1 + n);
if (n == 2)
ans = 1.0 * (a[1] + a[2]) / 2;
else {
ans = 1.0 * (a[1] + a[2]) / 2;
for (int i = 3; i <= n; i++)
ans = (ans + a[i]) / 2;
}
cout << ans << '\n';
return 0;
}
|
[
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.change"
] | 737,849
| 737,850
|
u628984480
|
cpp
|
p02935
|
#include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; i < (n); ++(i))
typedef long long ll;
const ll MOD = 1e9 + 7;
const int MAX_N = 50;
int main() {
int N;
std::priority_queue<int> pq;
std::cin >> N;
rep(i, N) {
int v;
std::cin >> v;
pq.push(-v);
}
double ans = 0.0;
rep(i, N - 1) {
int v1 = -pq.top();
pq.pop();
int v2 = -pq.top();
pq.pop();
ans = 0.5 * (v1 + v2);
pq.push(-ans);
}
std::cout << std::fixed;
std::cout << std::setprecision(10) << ans << '\n';
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; i < (n); ++(i))
typedef long long ll;
const ll MOD = 1e9 + 7;
const int MAX_N = 50;
int main() {
int N;
std::priority_queue<double> pq;
std::cin >> N;
rep(i, N) {
double v;
std::cin >> v;
pq.push(-v);
}
double ans = 0.0;
rep(i, N - 1) {
double v1 = -pq.top();
pq.pop();
double v2 = -pq.top();
pq.pop();
ans = 0.5 * (v1 + v2);
pq.push(-ans);
}
std::cout << std::fixed;
std::cout << std::setprecision(10) << ans << '\n';
}
|
[
"variable_declaration.type.primitive.change"
] | 737,853
| 737,854
|
u600759947
|
cpp
|
p02935
|
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define rep(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define anin(a) printf("%d\n", a);
#define ando(a) printf("%lf\n", a);
int asc(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int main(void) {
int n;
scanf("%d", &n);
double v[n], ans(0.);
rep(i, 0, n) { scanf("%lf", &v[i]); }
qsort(v, n, sizeof(double), asc);
rep(i, 0, n - 1) {
if (i == 0)
ans = (v[i] + v[i + 1]) / 2.;
else
ans = (ans + v[i + 1]) / 2.;
}
ando(ans);
return 0;
}
|
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define rep(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define anin(a) printf("%d\n", a);
#define ando(a) printf("%lf\n", a);
int asc(const void *a, const void *b) { return *(double *)a - *(double *)b; }
int main(void) {
int n;
scanf("%d", &n);
double v[n], ans(0.);
rep(i, 0, n) { scanf("%lf", &v[i]); }
qsort(v, n, sizeof(double), asc);
rep(i, 0, n - 1) {
if (i == 0)
ans = (v[i] + v[i + 1]) / 2.;
else
ans = (ans + v[i + 1]) / 2.;
}
ando(ans);
return 0;
}
|
[
"variable_declaration.type.primitive.change"
] | 737,855
| 737,856
|
u456658814
|
cpp
|
p02935
|
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define rep(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define anin(a) printf("%d\n", a);
#define ando(a) printf("%lf\n", a);
int asc(const void *a, const void *b) { return *(int *)a - *(int *)b; }
int main(void) {
int n;
scanf("%d", &n);
double v[n], ans(0.);
rep(i, 0, n) { scanf("%lf", &v[i]); }
qsort(v, n, sizeof(int), asc);
rep(i, 0, n - 1) {
if (i == 0)
ans = (v[0] + v[1]) / 2.;
else
ans = (ans + v[i + 1]) / 2.;
}
ando(ans);
return 0;
}
|
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define rep(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define anin(a) printf("%d\n", a);
#define ando(a) printf("%lf\n", a);
int asc(const void *a, const void *b) { return *(double *)a - *(double *)b; }
int main(void) {
int n;
scanf("%d", &n);
double v[n], ans(0.);
rep(i, 0, n) { scanf("%lf", &v[i]); }
qsort(v, n, sizeof(double), asc);
rep(i, 0, n - 1) {
if (i == 0)
ans = (v[i] + v[i + 1]) / 2.;
else
ans = (ans + v[i + 1]) / 2.;
}
ando(ans);
return 0;
}
|
[
"variable_declaration.type.primitive.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.change"
] | 737,857
| 737,856
|
u456658814
|
cpp
|
p02935
|
#include <stdio.h>
#include <stdlib.h>
int desc(const void *a, const void *b) {
double x;
int k;
x = *(double *)b - *(double *)a;
k = x > 0 ? -1 : 1;
return k;
}
int main(void) {
int i, n;
double v[1001];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%le", &v[i]);
}
qsort(v, n, sizeof(double), desc);
for (i = n - 1; i > 0; i--) {
v[i - 1] = (v[i - 1] + v[i]) / (double)2;
qsort(v, i, sizeof(double), desc);
}
printf("%le\n", v[0]);
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
int desc(const void *a, const void *b) {
double x;
int k;
x = *(double *)b - *(double *)a;
k = x > 0 ? +1 : -1;
return k;
}
int main(void) {
int i, n;
double v[1001];
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf("%lf", &v[i]);
}
qsort(v, n, sizeof(double), desc);
for (i = n - 1; i > 0; i--) {
v[i - 1] = (v[i - 1] + v[i]) / (double)2;
qsort(v, i, sizeof(double), desc);
}
printf("%lf\n", v[0]);
return 0;
}
|
[
"misc.opposites",
"literal.number.change",
"expression.operator.arithmetic.change",
"expression.operation.unary.arithmetic.add",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 737,865
| 737,866
|
u391667116
|
cpp
|
p02935
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
typedef pair<ll, ll> P;
const int MAX = 55;
const int INF = 1e9;
const int MOD = 1e9 + 7;
int N;
int main() {
cin >> N;
vector<double> v(N);
rep(i, N) cin >> v[i];
while (1 < v.size()) {
sort(v.begin(), v.end());
int a, b;
a = v[0];
b = v[1];
v.erase(v.begin(), v.begin() + 2);
v.push_back((double)(a + b) / 2.0);
}
cout << v[0] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
typedef pair<ll, ll> P;
const int MAX = 55;
const int INF = 1e9;
const int MOD = 1e9 + 7;
int N;
int main() {
cin >> N;
vector<double> v(N);
rep(i, N) cin >> v[i];
while (1 < v.size()) {
sort(v.begin(), v.end());
double a, b;
a = v[0];
b = v[1];
v.erase(v.begin(), v.begin() + 2);
v.push_back((a + b) / 2.0);
}
cout << v[0] << endl;
}
|
[
"variable_declaration.type.primitive.change"
] | 737,877
| 737,878
|
u992875223
|
cpp
|
p02935
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
sort(A.begin(), A.end());
int p = A.at(0);
for (int i = 0; i < N; i++) {
p = (p + A.at(i)) / 2;
}
cout << p << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
sort(A.begin(), A.end());
double p = A.at(0);
for (int i = 0; i < N; i++) {
p = (p + A.at(i)) / 2;
}
cout << p << endl;
}
|
[
"variable_declaration.type.primitive.change"
] | 737,882
| 737,883
|
u204437779
|
cpp
|
p02935
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int i, n, b;
vector<double> v;
cin >> n;
for (i = 0; i < n; i++) {
cin >> b;
v.push_back(b);
}
sort(v.begin(), v.end());
for (i = 0; i < n - 1; i++) {
v[i + 1] = (v[i] + v[i + 1]) / 2.0;
}
cout << (v[i] + v[i + 1]) / 2.0;
}
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int i, n, b;
vector<double> v;
cin >> n;
for (i = 0; i < n; i++) {
cin >> b;
v.push_back(b);
}
sort(v.begin(), v.end());
for (i = 0; i < n - 2; i++) {
v[i + 1] = (v[i] + v[i + 1]) / 2.0;
}
cout << (v[i] + v[i + 1]) / 2.0;
}
|
[
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 737,884
| 737,885
|
u610897920
|
cpp
|
p02935
|
#include <bits/stdc++.h>
using namespace std;
int N;
vector<int> v;
int solve();
// int buf(vector<int> vs);
int main() {
cin >> N;
v = vector<int>(N);
for (int i = 0; i < N; i++) {
cin >> v.at(i);
}
solve();
}
int solve() {
for (int i = 0; i < N - 1; i++) {
// buf(v);
sort(v.begin(), v.end());
v.push_back((v.at(0) + v.at(1)) / 2);
v.erase(v.begin() + 0);
if (v.size() > 1) {
v.erase(v.begin() + 0);
}
}
// cout << v.size() <<endl;
cout << v.at(0) << endl;
return 0;
}
//
// int buf(vector<int> vs){
// for(int i =0; i< vs.size(); i++){
// cout << v.at(i)<< " ";
// }
// cout << endl;
// return 0;
// }
|
#include <bits/stdc++.h>
using namespace std;
int N;
vector<double> v;
int solve();
// int buf(vector<int> vs);
int main() {
cin >> N;
v = vector<double>(N);
for (int i = 0; i < N; i++) {
cin >> v.at(i);
}
solve();
}
int solve() {
for (int i = 0; i < N - 1; i++) {
// buf(v);
sort(v.begin(), v.end());
v.push_back((v.at(0) + v.at(1)) / 2.0);
v.erase(v.begin() + 0);
if (v.size() > 1) {
v.erase(v.begin() + 0);
}
}
// cout << v.size() <<endl;
cout << v.at(0) << endl;
return 0;
}
//
// int buf(vector<int> vs){
// for(int i =0; i< vs.size(); i++){
// cout << v.at(i)<< " ";
// }
// cout << endl;
// return 0;
// }
|
[
"variable_declaration.type.primitive.change",
"assignment.value.change",
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 737,886
| 737,887
|
u526476325
|
cpp
|
p02935
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 100000000;
int in() {
int a;
cin >> a;
return a;
} // int型関数の受け取り
void forin(int *x, int y) {
for (int i = 0; i < y; i++) {
cin >> x[i];
}
} //(x,y) int型配列x[y]の受け取り
int intpow(int x, int y) {
double a = x, b = y;
return pow(a, b);
} //(x,y) xをy乗
int intfabs(int x) {
double a = x;
return fabs(a);
} //(x) xの絶対値
int fact(int x) {
if (x == 1)
return 1;
return x * fact(x - 1);
} //(x) x!
int fib(int x) {
if (x <= 2)
return x;
int a[x];
a[0] = 1;
a[1] = 2;
for (int i = 2; i < x; i++) {
a[i] = a[i - 1] + a[i - 2];
}
return a[x - 1];
} //(x) フィボナッチ数列のx番目
int div1(ll x) { return x % 1000000007; }
main() {
int n = in();
vector<int> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
sort(v.begin(), v.end());
double pl = (v[0] + v[1]) / 2;
for (int i = 2; i < n; i++)
pl = (pl + v[i]) / 2;
cout << pl << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 100000000;
int in() {
int a;
cin >> a;
return a;
} // int型関数の受け取り
void forin(int *x, int y) {
for (int i = 0; i < y; i++) {
cin >> x[i];
}
} //(x,y) int型配列x[y]の受け取り
int intpow(int x, int y) {
double a = x, b = y;
return pow(a, b);
} //(x,y) xをy乗
int intfabs(int x) {
double a = x;
return fabs(a);
} //(x) xの絶対値
int fact(int x) {
if (x == 1)
return 1;
return x * fact(x - 1);
} //(x) x!
int fib(int x) {
if (x <= 2)
return x;
int a[x];
a[0] = 1;
a[1] = 2;
for (int i = 2; i < x; i++) {
a[i] = a[i - 1] + a[i - 2];
}
return a[x - 1];
} //(x) フィボナッチ数列のx番目
int div1(ll x) { return x % 1000000007; }
main() {
int n = in();
vector<double> v(n);
for (int i = 0; i < n; i++)
cin >> v[i];
sort(v.begin(), v.end());
double pl = (v[0] + v[1]) / 2;
for (int i = 2; i < n; i++)
pl = (pl + v[i]) / 2;
cout << pl << endl;
}
|
[
"variable_declaration.type.primitive.change"
] | 737,891
| 737,892
|
u160321725
|
cpp
|
p02935
|
#include <bits/stdc++.h>
using namespace std;
int a[1000];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
sort(a, a + n);
double num = (a[0] + a[1]) / 2;
for (int i = 2; i < n; i++) {
num += a[i];
num /= 2;
}
cout << num << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int a[1000];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
sort(a, a + n);
double num = (a[0] + a[1]) * 1.0 / 2;
for (int i = 2; i < n; i++) {
num += a[i];
num /= 2;
}
cout << num << endl;
return 0;
}
|
[
"assignment.change"
] | 737,930
| 737,931
|
u333991119
|
cpp
|
p02935
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<double> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a.begin(), a.end());
for (int i = 0; i < n; i++) {
a[i] = (a[i] + a[i - 1]) / 2;
}
cout << a.back() << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<double> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a.begin(), a.end());
for (int i = 1; i < n; i++) {
a[i] = (a[i] + a[i - 1]) / 2;
}
cout << a.back() << endl;
}
|
[
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 737,934
| 737,935
|
u196798307
|
cpp
|
p02935
|
#include <bits/stdc++.h>
using namespace std;
#define rkc \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long long ll;
#define fl(i, a, b) for (ll i = a; i < b; i++)
#define rfl(i, a, b) for (ll i = a; i > b; i--)
#define pb push_back
#define mp make_pair
#define test \
ll t; \
cin >> t; \
while (t--)
#define lld long double
#define vpp vector<pair<ll, ll>>
#define ff first
#define ss second
const ll M = 1e9 + 7;
const double pi = 3.141592653589793238463;
ll modularExponentiation(ll x, ll n, ll M) {
ll result = 1;
while (n > 0) {
if (n % 2 == 1)
result = (result * x) % M;
x = (x * x) % M;
n = n / 2;
}
return result;
}
int main() {
rkc;
ll n;
cin >> n;
ll a[n];
fl(i, 0, n) cin >> a[i];
sort(a, a + n);
fl(i, 0, n - 1) a[i + 1] = (lld)((a[i] + a[i + 1]) / 2);
cout << a[n - 1];
}
|
#include <bits/stdc++.h>
using namespace std;
#define rkc \
ios_base::sync_with_stdio(0); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long long ll;
#define fl(i, a, b) for (ll i = a; i < b; i++)
#define rfl(i, a, b) for (ll i = a; i > b; i--)
#define pb push_back
#define mp make_pair
#define test \
ll t; \
cin >> t; \
while (t--)
#define lld long double
#define vpp vector<pair<ll, ll>>
#define ff first
#define ss second
const ll M = 1e9 + 7;
const double pi = 3.141592653589793238463;
ll modularExponentiation(ll x, ll n, ll M) {
ll result = 1;
while (n > 0) {
if (n % 2 == 1)
result = (result * x) % M;
x = (x * x) % M;
n = n / 2;
}
return result;
}
int main() {
rkc;
ll n;
cin >> n;
lld a[n];
fl(i, 0, n) cin >> a[i];
sort(a, a + n);
fl(i, 0, n - 1) a[i + 1] = (lld)((a[i] + a[i + 1]) / 2);
cout << a[n - 1];
}
|
[
"variable_declaration.type.change"
] | 737,945
| 737,946
|
u364018936
|
cpp
|
p02935
|
#include <algorithm>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
int N;
double A[50];
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
sort(A, A + N);
double ans = (A[0] + A[1]) / 2.0;
for (int i = 2; i < N; i++) {
ans = (ans + A[2]) / 2.0;
}
cout << setprecision(10) << ans << endl;
return 0;
}
|
#include <algorithm>
#include <iomanip>
#include <iostream>
using namespace std;
int main() {
int N;
double A[50];
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
sort(A, A + N);
double ans = (A[0] + A[1]) / 2.0;
for (int i = 2; i < N; i++) {
ans = (ans + A[i]) / 2.0;
}
cout << setprecision(10) << ans << endl;
return 0;
}
|
[
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 737,949
| 737,950
|
u107077805
|
cpp
|
p02935
|
// ★★ ASHWINI SHARMA ★★
#include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define fr(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define frr(i, a, b) for (int i = (a), _b = (b); i >= _b; i--)
#define rep(i, n) for (int i = 0, _n = (n); i < _n; i++)
#define repr(i, n) for (long long i = (n)-1; i >= 0; i--)
#define foreach(it, ar) \
for (typeof(ar.begin()) it = ar.begin(); it != ar.end(); it++)
#define debug(x) cout << #x << ": " << x << endl
#define ull unsigned long long int
#define ll long long int
#define ld double
#define ui unsigned int
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define PI 3.1415926535897932385
#define INF 1e18
#define EPS 1e-7
#define MAXN 1000000005
#define MOD 1000000007
// ★★ ASHWINI SHARMA ★★
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
ll exp(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int main() {
#ifdef sharma
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fastio;
int n;
cin >> n;
double x[n];
double sum;
rep(i, n) {
cin >> x[i];
// sum = sum+x[i]
}
sort(x, x + n);
sum = (x[0] + x[1]) / 2;
fr(i, 2, n - 1) { sum = (sum + x[i]) / 2; }
printf("%0.1f", sum);
return 0;
}
|
// ★★ ASHWINI SHARMA ★★
#include <bits/stdc++.h>
using namespace std;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define fr(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define frr(i, a, b) for (int i = (a), _b = (b); i >= _b; i--)
#define rep(i, n) for (int i = 0, _n = (n); i < _n; i++)
#define repr(i, n) for (long long i = (n)-1; i >= 0; i--)
#define foreach(it, ar) \
for (typeof(ar.begin()) it = ar.begin(); it != ar.end(); it++)
#define debug(x) cout << #x << ": " << x << endl
#define ull unsigned long long int
#define ll long long int
#define ld double
#define ui unsigned int
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define PI 3.1415926535897932385
#define INF 1e18
#define EPS 1e-7
#define MAXN 1000000005
#define MOD 1000000007
// ★★ ASHWINI SHARMA ★★
ll gcd(ll a, ll b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
ll exp(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int main() {
#ifdef sharma
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
fastio;
int n;
cin >> n;
double x[n];
double sum;
rep(i, n) {
cin >> x[i];
// sum = sum+x[i]
}
sort(x, x + n);
sum = (x[0] + x[1]) / 2.0;
fr(i, 2, n - 1) { sum = (sum + x[i]) / 2.0; }
printf("%0.5f", sum);
return 0;
}
|
[
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 737,960
| 737,961
|
u909051929
|
cpp
|
p02935
|
// k_k_dubey_
#include <bits/stdc++.h>
#define mod 1000000007
#define ll long long
#define inf 999999999999
#define mx 200005
#define gcd __gcd
#define pb push_back
#define mk make_pair
#define bs binary_search
#define pq priority_queue
#define ub upper_bound
#define lb lower_bound
#define endl "\n"
#define vl vector<ll>
#define vs vector<string>
#define non __builtin_popcount
#define ml map<ll, ll>
#define ms map<string, ll>
using namespace std;
bool isp[mx];
void sv() {
ll i, j;
memset(isp, true, sizeof(isp));
isp[1] = false;
for (i = 2; i * i < mx; i++) {
if (isp[i]) {
for (j = i * i; j < mx; j += i)
isp[j] = false;
}
}
}
ll powr(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1)
res = (res * a) % mod;
a = (a * a) % mod;
b >>= 1;
}
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
// sv();
ll n, a[mx], i, j;
cin >> n;
double an = 0.0;
for (i = 0; i < n; i++) {
cin >> a[i];
// an+= (1.0/a[i]);
}
sort(a, a + n);
ll tmp = a[0];
for (i = 1; i < n; i++) {
tmp = (tmp + a[i]) / 2.0;
}
cout << tmp;
return 0;
}
|
// k_k_dubey_
#include <bits/stdc++.h>
#define mod 1000000007
#define ll long long
#define inf 999999999999
#define mx 200005
#define gcd __gcd
#define pb push_back
#define mk make_pair
#define bs binary_search
#define pq priority_queue
#define ub upper_bound
#define lb lower_bound
#define endl "\n"
#define vl vector<ll>
#define vs vector<string>
#define non __builtin_popcount
#define ml map<ll, ll>
#define ms map<string, ll>
using namespace std;
bool isp[mx];
void sv() {
ll i, j;
memset(isp, true, sizeof(isp));
isp[1] = false;
for (i = 2; i * i < mx; i++) {
if (isp[i]) {
for (j = i * i; j < mx; j += i)
isp[j] = false;
}
}
}
ll powr(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1)
res = (res * a) % mod;
a = (a * a) % mod;
b >>= 1;
}
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
// sv();
ll n, a[mx], i, j;
cin >> n;
double an = 0.0;
for (i = 0; i < n; i++) {
cin >> a[i];
// an+= (1.0/a[i]);
}
sort(a, a + n);
double tmp = a[0];
for (i = 1; i < n; i++) {
tmp = (tmp + a[i]) / 2.0;
}
cout << tmp;
return 0;
}
|
[
"variable_declaration.type.change"
] | 737,964
| 737,965
|
u720296041
|
cpp
|
p02935
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mm 1000000007
#define pb push_back
// nestedcode
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, i;
cin >> n;
ll a[n + 5];
double ans = 0;
for (i = 0; i < n; i++) {
cin >> a[i];
// cout<<ans<<endl;
}
sort(a, a + n);
ans = (a[0] + a[1]) / 2;
for (i = 2; i < n; i++) {
ans = (ans + a[i]) / 2;
}
cout << fixed << setprecision(8) << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define mm 1000000007
#define pb push_back
// nestedcode
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, i;
cin >> n;
ll a[n + 5];
double ans = 0;
for (i = 0; i < n; i++) {
cin >> a[i];
// cout<<ans<<endl;
}
sort(a, a + n);
ans = ((double)a[0] + a[1]) / 2;
for (i = 2; i < n; i++) {
ans = ((double)ans + a[i]) / 2;
}
cout << fixed << setprecision(8) << ans;
}
|
[
"type_conversion.add"
] | 737,968
| 737,969
|
u995107278
|
cpp
|
p02935
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
vector<int> v;
double answer = 0;
cin >> N;
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
v.push_back(tmp);
}
sort(v.begin(), v.end());
answer += (v[0] + v[1]) / 2;
for (int i = 2; i < N; i++) {
answer = (answer + v[i]) / 2;
}
cout << answer << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
vector<int> v;
double answer = 0;
cin >> N;
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
v.push_back(tmp);
}
sort(v.begin(), v.end());
answer += (double)(v[0] + v[1]) / 2;
for (int i = 2; i < N; i++) {
answer = (double)(answer + v[i]) / 2;
}
cout << answer << endl;
return 0;
}
|
[
"type_conversion.add"
] | 737,972
| 737,973
|
u016092854
|
cpp
|
p02935
|
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> v(n);
REP(i, n) cin >> v.at(i);
sort(v.begin(), v.end());
int ans = v.at(0);
for (int i = 1; i < v.size(); i++) {
ans = (ans + v.at(i)) / 2;
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<long double> v(n);
REP(i, n) cin >> v.at(i);
sort(v.begin(), v.end());
long double ans = v.at(0);
for (int i = 1; i < v.size(); i++) {
ans = (ans + v.at(i)) / 2;
}
cout << ans << endl;
}
|
[
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 737,974
| 737,975
|
u539914590
|
cpp
|
p02935
|
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define ll long long int
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOREACH(x, a) for (auto &(x) : (a))
#define ALL(a) (a).begin(), (a).end()
#define OUT(x) out << (x) << endl;
#define M0(x) memset(x, 0, sizeof(x))
#define MINF(x) memset(x, 0x3f, sizeof(x))
#define MMINUS(a) memset(a, 0xff, sizeof(a))
#define ten(n) ((int)1e##n)
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
const double EPS = 1.0 / LINF;
const char ENDL = '\n'; // for JetBrains IDE only supports yen
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;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
using namespace std;
int N;
priority_queue<double, vector<double>, greater<double>> pq;
int main() {
cin >> N;
REP(i, N) {
int tmp;
cin >> tmp;
pq.push(tmp);
}
while (pq.size() > 1) {
int x = pq.top();
pq.pop();
int y = pq.top();
pq.pop();
pq.push((x + y) / 2.0);
}
cout << pq.top() << endl;
}
|
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define ll long long int
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOREACH(x, a) for (auto &(x) : (a))
#define ALL(a) (a).begin(), (a).end()
#define OUT(x) out << (x) << endl;
#define M0(x) memset(x, 0, sizeof(x))
#define MINF(x) memset(x, 0x3f, sizeof(x))
#define MMINUS(a) memset(a, 0xff, sizeof(a))
#define ten(n) ((int)1e##n)
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
const double EPS = 1.0 / LINF;
const char ENDL = '\n'; // for JetBrains IDE only supports yen
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;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
using namespace std;
int N;
priority_queue<double, vector<double>, greater<double>> pq;
int main() {
cin >> N;
REP(i, N) {
int tmp;
cin >> tmp;
pq.push(tmp);
}
while (pq.size() > 1) {
double x = pq.top();
pq.pop();
double y = pq.top();
pq.pop();
pq.push((x + y) / 2.0);
}
cout << pq.top() << endl;
}
|
[
"variable_declaration.type.primitive.change"
] | 737,976
| 737,977
|
u585670083
|
cpp
|
p02935
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll solve() {
ll N;
cin >> N;
vector<ll> V(N);
for (int i = 0; i < N; i++) {
cin >> V[i];
}
sort(V.begin(), V.end());
double a = V[0];
for (int i = 1; i < N; i++) {
a = (a + V[i]) / 2;
}
return a;
}
int main() {
cout.precision(15);
auto ans = solve();
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
double solve() {
ll N;
cin >> N;
vector<ll> V(N);
for (int i = 0; i < N; i++) {
cin >> V[i];
}
sort(V.begin(), V.end());
double a = V[0];
for (int i = 1; i < N; i++) {
a = (a + V[i]) / 2;
}
return a;
}
int main() {
cout.precision(15);
auto ans = solve();
cout << ans << "\n";
return 0;
}
|
[] | 737,984
| 737,985
|
u930841425
|
cpp
|
p02935
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int niz[100];
int main() {
ios_base::sync_with_stdio(false);
cout.precision(10);
cout << fixed;
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> niz[i];
}
sort(niz + 1, niz + 1 + n);
ld res = 0;
for (int i = 1; i <= n; i++) {
res = (res + niz[i]) / 2;
}
cout << res;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int niz[100];
int main() {
ios_base::sync_with_stdio(false);
cout.precision(10);
cout << fixed;
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> niz[i];
}
sort(niz + 1, niz + 1 + n);
ld res = niz[1];
for (int i = 2; i <= n; i++) {
res = (res + niz[i]) / 2;
}
cout << res;
return 0;
}
|
[
"identifier.replace.add",
"literal.replace.remove",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 737,988
| 737,989
|
u320923811
|
cpp
|
p02935
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long int N;
cin >> N;
vector<int> v(N);
for (int i = 0; i < N; ++i) {
cin >> v[i];
}
sort(v.begin(), v.end());
long int answer = v[0];
for (int i = 1; i < N; ++i) {
answer = (answer + v[i]) / 2;
}
cout << answer << endl;
}
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
long int N;
cin >> N;
vector<int> v(N);
for (int i = 0; i < N; ++i) {
cin >> v[i];
}
sort(v.begin(), v.end());
double answer = v[0];
for (int i = 1; i < N; ++i) {
answer = (answer + v[i]) / 2;
}
cout << answer << endl;
}
|
[
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 738,002
| 738,003
|
u077117247
|
cpp
|
p02935
|
/* Don’t Quit
When things go wrong as they sometimes will;
When the road you’re trudging seems all uphill;
When the funds are low, and the debts are high;
And you want to smile, but you have to sigh;
When care is pressing you down a bit
Rest if you must, but don’t you quit.
*/
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
#define int long long
const int MOD = 1e9 + 7;
const int N = 1e5 + 10;
int gcd(int n, int m) {
if (n == 0)
return m;
else
return gcd(m % n, n);
}
double a[N];
int32_t main() {
IOS;
int n;
cin >> n;
priority_queue<double, vector<double>, greater<double>> pq;
for (int i = 1; i <= n; i++) {
cin >> a[i];
pq.push(a[i]);
}
while (pq.size() > 1) {
int k = pq.top();
pq.pop();
double k1 = pq.top();
pq.pop();
pq.push((k1 + k) / 2.0);
}
cout << fixed << setprecision(12) << pq.top() << endl;
}
|
/* Don’t Quit
When things go wrong as they sometimes will;
When the road you’re trudging seems all uphill;
When the funds are low, and the debts are high;
And you want to smile, but you have to sigh;
When care is pressing you down a bit
Rest if you must, but don’t you quit.
*/
#include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0)
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
#define int long long
const int MOD = 1e9 + 7;
const int N = 1e5 + 10;
int gcd(int n, int m) {
if (n == 0)
return m;
else
return gcd(m % n, n);
}
double a[N];
int32_t main() {
IOS;
int n;
cin >> n;
priority_queue<double, vector<double>, greater<double>> pq;
for (int i = 1; i <= n; i++) {
cin >> a[i];
pq.push(a[i]);
}
while (pq.size() > 1) {
double k = pq.top();
pq.pop();
double k1 = pq.top();
pq.pop();
pq.push((k1 + k) / 2.0);
}
cout << fixed << setprecision(12) << pq.top() << endl;
}
|
[
"variable_declaration.type.primitive.change"
] | 738,008
| 738,009
|
u035131936
|
cpp
|
p02935
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, N) repi(i, 0, (N))
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define all(v) (v).begin(), (v).end()
#define ios() \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define fi first
#define se second
#define t
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using P = pair<int, int>;
constexpr long long MOD = 1e9 + 7;
constexpr long long INF = 1LL << 60;
// UP = 0;RIGHT = 1; DOWN = 2; LEFT =3;
const int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
template <class T = int> bool chmin(T &a, T b) {
bool f = a > b;
a = f ? b : a;
return f;
}
template <class T = int> bool chmax(T &a, T b) {
bool f = a < b;
a = f ? b : a;
return f;
}
template <class T> istream &operator>>(istream &is, vector<T> &st) {
for (size_t i = 0; i < st.size(); ++i)
is >> st[i];
return is;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &st) {
for (size_t i = 0; i < st.size(); ++i) {
if (i == st.size() - 1)
os << st[i];
else
os << st[i] << " ";
}
return os;
}
template <class T> istream &operator>>(istream &is, vector<vector<T>> &st) {
for (size_t i = 0; i < st.size(); ++i)
is >> st[i];
return is;
}
template <class T>
ostream &operator<<(ostream &os, const vector<vector<T>> &st) {
for (size_t i = 0; i < st.size(); ++i) {
os << st[i];
if (i != st.size() - 1)
os << endl;
}
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) {
return s << "(" << p.first << ", " << p.second << ")";
}
signed main() {
ios();
int N;
cin >> N;
vi v(N);
cin >> v;
sort(all(v));
double ans = 0;
rep(i, N - 1) { ans = (ans + v[i + 1]) / 2.0; }
cout << fixed << setprecision(7) << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, N) repi(i, 0, (N))
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define all(v) (v).begin(), (v).end()
#define ios() \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define fi first
#define se second
#define t
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using P = pair<int, int>;
constexpr long long MOD = 1e9 + 7;
constexpr long long INF = 1LL << 60;
// UP = 0;RIGHT = 1; DOWN = 2; LEFT =3;
const int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0};
template <class T = int> bool chmin(T &a, T b) {
bool f = a > b;
a = f ? b : a;
return f;
}
template <class T = int> bool chmax(T &a, T b) {
bool f = a < b;
a = f ? b : a;
return f;
}
template <class T> istream &operator>>(istream &is, vector<T> &st) {
for (size_t i = 0; i < st.size(); ++i)
is >> st[i];
return is;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &st) {
for (size_t i = 0; i < st.size(); ++i) {
if (i == st.size() - 1)
os << st[i];
else
os << st[i] << " ";
}
return os;
}
template <class T> istream &operator>>(istream &is, vector<vector<T>> &st) {
for (size_t i = 0; i < st.size(); ++i)
is >> st[i];
return is;
}
template <class T>
ostream &operator<<(ostream &os, const vector<vector<T>> &st) {
for (size_t i = 0; i < st.size(); ++i) {
os << st[i];
if (i != st.size() - 1)
os << endl;
}
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) {
return s << "(" << p.first << ", " << p.second << ")";
}
signed main() {
ios();
int N;
cin >> N;
vi v(N);
cin >> v;
sort(all(v));
double ans = v[0];
rep(i, N - 1) { ans = (ans + v[i + 1]) / 2.0; }
cout << fixed << setprecision(7) << ans << endl;
}
|
[] | 738,010
| 738,011
|
u904833081
|
cpp
|
p02935
|
#include <bits/stdc++.h>
using namespace std;
#define PAIN___ \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ll long long int
#define fi first
#define se second
#define pb push_back
#define pii pair<ll, ll>
#define mp make_pair
#define vec vector<ll>
#define vecp vector<pii>
#define forl(i, q1, n, q2) for (ll i = q1; i < q2; i++)
#define null NULL
#define mm 100005
#define sqr(i) i *i;
/* string with spaces getline(cin,s);*/
/*
integer to string ll n=0; ostringstream o1; string s;
o1<<n; s=o1.str();
*/
int main() {
ll t;
t = 1;
while (t--) {
ll n;
cin >> n;
ll a[n], b[n];
forl(i, 0, n, n) cin >> a[i];
sort(a, a + n);
ll ans = a[0];
forl(i, 1, n, n) { ans = (a[i] + ans) / 2; }
cout << ans << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
#define PAIN___ \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ll long long int
#define fi first
#define se second
#define pb push_back
#define pii pair<ll, ll>
#define mp make_pair
#define vec vector<ll>
#define vecp vector<pii>
#define forl(i, q1, n, q2) for (ll i = q1; i < q2; i++)
#define null NULL
#define mm 100005
#define sqr(i) i *i;
/* string with spaces getline(cin,s);*/
/*
integer to string ll n=0; ostringstream o1; string s;
o1<<n; s=o1.str();
*/
int main() {
ll t;
t = 1;
while (t--) {
ll n;
cin >> n;
ll a[n], b[n];
forl(i, 0, n, n) cin >> a[i];
sort(a, a + n);
double ans = a[0];
forl(i, 1, n, n) { ans = (a[i] + ans) / 2; }
cout << ans << endl;
}
}
|
[
"variable_declaration.type.change"
] | 738,014
| 738,015
|
u866981537
|
cpp
|
p02935
|
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
v.push_back(a);
}
if (n == 2) {
double a = v[0] + v[1];
a /= 2;
cout << a << endl;
return 0;
}
sort(v.rbegin(), v.rend());
double ans = v[2];
for (int i = 1; i >= 0; i--) {
ans += v[i];
ans /= 2;
}
cout << ans << endl;
}
|
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
v.push_back(a);
}
if (n == 2) {
double a = v[0] + v[1];
a /= 2;
cout << a << endl;
return 0;
}
sort(v.rbegin(), v.rend());
double ans = v[n - 1];
for (int i = n - 2; i >= 0; i--) {
ans += v[i];
ans /= 2;
}
cout << ans << endl;
}
|
[
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.loop.for.initializer.change"
] | 738,020
| 738,021
|
u115819033
|
cpp
|
p02935
|
/*
Author: ankrypt
*/
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define ll long long int
#define u64 unsigned long long int
ll N;
ll arr[55];
ll A, B;
int main() {
scanf("%lld", &N);
for (int i = 0; i < N; i++) {
scanf("%lld", &arr[i]);
}
sort(arr, arr + N);
int flag = 0;
double sum = 0;
for (int i = 1; i < N; i++) {
if (i == 1) {
A = arr[0];
} else {
A = sum;
}
B = arr[i];
// cout << A << " " << B << " " << sum << " ";
sum = (A + B) / 2.0;
// cout << sum << " \n";
}
printf("%0.12lf\n", sum);
return 0;
}
/*
Powered by Buggy Plugin
*/
|
/*
Author: ankrypt
*/
#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define ll long long int
#define u64 unsigned long long int
ll N;
ll arr[55];
double A, B;
int main() {
scanf("%lld", &N);
for (int i = 0; i < N; i++) {
scanf("%lld", &arr[i]);
}
sort(arr, arr + N);
int flag = 0;
double sum = 0;
for (int i = 1; i < N; i++) {
if (i == 1) {
A = arr[0];
} else {
// cout << " ues";
// cout << sum << " ";
A = sum;
}
B = arr[i];
// cout << A << " " << B << " " << sum << " " <<i<<" \n";
sum = (A + B) / 2.0;
// cout << sum << " \n";
}
printf("%0.12lf\n", sum);
return 0;
}
/*
Powered by Buggy Plugin
*/
|
[
"variable_declaration.type.change"
] | 738,022
| 738,023
|
u428267713
|
cpp
|
p02935
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
int v[n];
for (int i = 0; i < n; i++)
cin >> v[i];
sort(v, v + n);
double ans;
ans = v[0];
for (int i = 1; i < n; i++) {
ans += (ans + v[i]) / 2;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
int v[n];
for (int i = 0; i < n; i++)
cin >> v[i];
sort(v, v + n);
double ans;
ans = v[0];
for (int i = 1; i < n; i++) {
ans = (ans + v[i]) / 2;
}
cout << ans << endl;
return 0;
}
|
[
"assignment.value.change"
] | 738,030
| 738,031
|
u812475404
|
cpp
|
p02935
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, n;
double ans = 0;
cin >> n;
int ara[n];
for (i = 0; i < n; i++) {
cin >> ara[i];
}
sort(ara, ara + n);
ans = (ara[0] + ara[1]) / 2;
if (n > 2) {
for (i = 2; i < n; i++) {
ans = (ans + ara[i]) / 2;
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, n;
double ans = 0;
cin >> n;
double ara[n];
for (i = 0; i < n; i++) {
cin >> ara[i];
}
sort(ara, ara + n);
ans = (ara[0] + ara[1]) / 2;
if (n > 2) {
for (i = 2; i < n; i++) {
ans = (ans + ara[i]) / 2;
}
}
cout << ans << endl;
return 0;
}
|
[
"variable_declaration.type.primitive.change"
] | 738,038
| 738,039
|
u808454282
|
cpp
|
p02935
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <random>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<int> v(n);
rep(i, n) cin >> v[i];
sort(v.begin(), v.end());
double ans = v[0];
for (int i = 1; i < n; i++)
ans += (double)(ans + v[i]) / 2;
cout << setprecision(12) << ans << endl;
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <random>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<int> v(n);
rep(i, n) cin >> v[i];
sort(v.begin(), v.end());
double ans = v[0];
for (int i = 1; i < n; i++)
ans = (double)(ans + v[i]) / 2;
cout << setprecision(12) << ans << endl;
return 0;
}
|
[
"assignment.value.change"
] | 738,045
| 738,046
|
u654115954
|
cpp
|
p02935
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> vect(n, 0);
for (int i = 0; i < n; i++) {
cin >> vect[i];
}
sort(vect.begin(), vect.end());
double sum = 0;
long long int j = 2;
sum = vect[0] + vect[1];
for (int i = 2; i < n; i++) {
sum += j * vect[i];
}
double k = pow(2, n - 1);
cout << setprecision(10) << sum / k << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
vector<long long> vect(n, 0);
for (int i = 0; i < n; i++) {
cin >> vect[i];
}
sort(vect.begin(), vect.end());
double sum = 0;
long long int j = 2;
sum = vect[0] + vect[1];
for (int i = 2; i < n; i++) {
sum += j * vect[i];
j *= 2;
}
double k = pow(2, n - 1);
cout << setprecision(10) << sum / k << endl;
return 0;
}
|
[
"assignment.add"
] | 738,060
| 738,061
|
u190066528
|
cpp
|
p02935
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned int;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using tuplis = pair<ll, pll>;
using tuplis2 = pair<pll, ll>;
template <class T> using pq = priority_queue<T, vector<T>, greater<T>>;
const ll LINF = 0x1fffffffffffffff;
const ll MINF = 0x7fffffffffff;
const int INF = 0x3fffffff;
const ll MOD = 1000000007;
const ll MODD = 998244353;
const ld DINF = numeric_limits<ld>::infinity();
const ld EPS = 1e-9;
const vector<ll> four{0, 1, 0, -1, 0};
#define _overload4(_1, _2, _3, _4, name, ...) name
#define _overload3(_1, _2, _3, name, ...) name
#define _rep1(n) for (ll i = 0; i < n; ++i)
#define _rep2(i, n) for (ll i = 0; i < n; ++i)
#define _rep3(i, a, b) for (ll i = a; i < b; ++i)
#define _rep4(i, a, b, c) for (ll i = a; i < b; i += c)
#define rep(...) \
_overload4(__VA_ARGS__, _rep4, _rep3, _rep2, _rep1)(__VA_ARGS__)
#define _rrep1(n) for (ll i = (n)-1; i >= 0; i--)
#define _rrep2(i, n) for (ll i = (n)-1; i >= 0; i--)
#define _rrep3(i, a, b) for (ll i = (b)-1; i >= a; i--)
#define _rrep4(i, a, b, c) for (ll i = a + (b - a - 1) / c * c; i >= a; i -= c)
#define rrep(...) \
_overload4(__VA_ARGS__, _rrep4, _rrep3, _rrep2, _rrep1)(__VA_ARGS__)
#define each(i, a) for (auto &i : a)
#define sum(...) accumulate(range(__VA_ARGS__), 0LL)
#define dsum(...) accumulate(range(__VA_ARGS__), double(0))
#define _range(i) (i).begin(), (i).end()
#define _range2(i, k) (i).begin(), (i).begin() + k
#define _range3(i, a, b) (i).begin() + a, (i).begin() + b
#define range(...) \
_overload3(__VA_ARGS__, _range3, _range2, _range)(__VA_ARGS__)
#define _rrange(i) (i).rbegin(), (i).rend()
#define _rrange2(i, k) (i).rbegin(), (i).rbegin() + k
#define _rrange3(i, a, b) (i).rbegin() + a, (i).rbegin() + b
#define rrange(...) \
_overload3(__VA_ARGS__, _rrange3, _rrange2, _rrange)(__VA_ARGS__)
#define elif else if
#define unless(a) if (!(a))
#define mp make_pair
#define mt make_tuple
#define INT(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define ULL(...) \
ull __VA_ARGS__; \
in(__VA_ARGS__)
#define STR(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define CHR(...) \
char __VA_ARGS__; \
in(__VA_ARGS__)
#define DBL(...) \
double __VA_ARGS__; \
in(__VA_ARGS__)
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define VEC(type, name, size) \
vector<type> name(size); \
in(name)
#define vv(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define VV(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__)); \
in(name)
#define vvv(type, name, h, w, ...) \
vector<vector<vector<type>>> name( \
h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
inline constexpr ll gcd(ll a, ll b) {
if (!a || !b)
return 0;
while (b) {
ll c = b;
b = a % b;
a = c;
}
return a;
}
inline constexpr ll lcm(ll a, ll b) {
if (!a || !b)
return 0;
return a * b / gcd(a, b);
}
template <class T> inline constexpr T min(vector<T> &v) {
return *min_element(range(v));
}
inline char min(string &v) { return *min_element(range(v)); }
template <class T> inline constexpr T max(vector<T> &v) {
return *max_element(range(v));
}
inline char max(string &v) { return *max_element(range(v)); }
inline constexpr ll intpow(ll a, ll b) {
ll ans = 1;
for (ll i = 1; b; i *= 2) {
if (b & i) {
b ^= i;
ans *= a;
}
a *= a;
}
return ans;
}
template <typename T> inline constexpr bool chmin(T &mn, const T &cnt) {
if (mn > cnt) {
mn = cnt;
return 1;
} else
return 0;
}
template <typename T> inline constexpr bool chmax(T &mx, const T &cnt) {
if (mx < cnt) {
mx = cnt;
return 1;
} else
return 0;
}
template <class T> unordered_map<T, ll> press(vector<T> &a) {
auto b = a;
sort(range(b));
b.erase(unique(range(b)), b.end());
unordered_map<T, ll> ans;
rep(b.size()) ans[b[i]] = i;
each(i, a) i = ans[i];
return ans;
}
template <class T> map<T, ll> press_map(vector<T> &a) {
auto b = a;
sort(range(b));
b.erase(unique(range(b)), b.end());
map<T, ll> ans;
rep(b.size()) ans[b[i]] = i;
each(i, a) i = ans[i];
return ans;
}
inline int scan() { return getchar(); }
inline void scan(int &a) { scanf("%d", &a); }
inline void scan(unsigned &a) { scanf("%u", &a); }
inline void scan(long &a) { scanf("%ld", &a); }
inline void scan(long long &a) { scanf("%lld", &a); }
inline void scan(unsigned long long &a) { scanf("%llu", &a); }
inline void scan(char &a) { cin >> a; }
inline void scan(float &a) { scanf("%f", &a); }
inline void scan(double &a) { scanf("%lf", &a); }
inline void scan(long double &a) { scanf("%Lf", &a); }
inline void scan(vector<bool> &vec) {
for (unsigned i = 0; i < vec.size(); i++) {
int a;
scan(a);
vec[i] = a;
}
}
inline void scan(string &a) { cin >> a; }
template <class T> inline void scan(vector<T> &vec);
template <class T, size_t size> inline void scan(array<T, size> &vec);
template <class T, class L> inline void scan(pair<T, L> &p);
template <class T, size_t size> inline void scan(T (&vec)[size]);
template <class T> inline void scan(vector<T> &vec) {
for (auto &i : vec)
scan(i);
}
template <class T, size_t size> inline void scan(array<T, size> &vec) {
for (auto &i : vec)
scan(i);
}
template <class T, class L> inline void scan(pair<T, L> &p) {
scan(p.first);
scan(p.second);
}
template <class T, size_t size> inline void scan(T (&vec)[size]) {
for (auto &i : vec)
scan(i);
}
template <class T> inline void scan(T &a) { cin >> a; }
inline void in() {}
template <class Head, class... Tail> inline void in(Head &head, Tail &...tail) {
scan(head);
in(tail...);
}
inline void print() { putchar(' '); }
inline void print(const bool &a) { printf("%d", a); }
inline void print(const int &a) { printf("%d", a); }
inline void print(const unsigned &a) { printf("%u", a); }
inline void print(const long &a) { printf("%ld", a); }
inline void print(const long long &a) { printf("%lld", a); }
inline void print(const unsigned long long &a) { printf("%llu", a); }
inline void print(const char &a) { printf("%c", a); }
inline void print(const char a[]) { printf("%s", a); }
inline void print(const float &a) { printf("%.10f", a); }
inline void print(const double &a) { printf("%.10f", a); }
inline void print(const long double &a) { printf("%.10Lf", a); }
template <class T> void print(const vector<T> &vec);
template <class T, size_t size> void print(const array<T, size> &vec);
template <class T, class L> void print(const pair<T, L> &p);
template <class T, size_t size> inline void print(const T (&vec)[size]);
template <class T> void print(const vector<T> &vec) {
if (vec.empty())
return;
print(vec[0]);
for (auto i = vec.begin(); ++i != vec.end();) {
putchar(' ');
print(*i);
}
}
template <class T, size_t size> void print(const array<T, size> &vec) {
print(vec[0]);
for (auto i = vec.begin(); ++i != vec.end();) {
putchar(' ');
print(*i);
}
}
template <class T, class L> void print(const pair<T, L> &p) {
print(p.first);
putchar(' ');
print(p.second);
}
template <class T, size_t size> inline void print(const T (&vec)[size]) {
print(vec[0]);
for (auto i = vec; ++i != end(vec);) {
putchar(' ');
print(*i);
}
}
template <class T> inline void print(const T &a) { cout << a; }
inline int out() {
putchar('\n');
return 0;
}
template <class T> inline int out(const T &t) {
print(t);
putchar('\n');
return 0;
}
template <class Head, class... Tail>
inline int out(const Head &head, const Tail &...tail) {
print(head);
putchar(' ');
out(tail...);
return 0;
}
template <class T> inline void err(T t) { cerr << t << '\n'; }
inline void err() { cerr << '\n'; }
inline int first(const bool &i) { return out(i ? "first" : "second"); }
inline int yes(const bool &i) { return out(i ? "yes" : "no"); }
inline int Yes(const bool &i) { return out(i ? "Yes" : "No"); }
inline int YES(const bool &i) { return out(i ? "YES" : "NO"); }
inline int Yay(const bool &i) { return out(i ? "Yay!" : ":("); }
inline int Possible(const bool &i) {
return out(i ? "Possible" : "Impossible");
}
inline int POSSIBLE(const bool &i) {
return out(i ? "POSSIBLE" : "IMPOSSIBLE");
}
inline void Case(ll i) { printf("Case #%lld: ", i); }
signed main() {
LL(n);
VEC(double, a, n);
sort(range(a));
ll ans = a.front();
rep(i, 1, n) ans = (ans + a[i]) / 2;
out(ans);
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned int;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using tuplis = pair<ll, pll>;
using tuplis2 = pair<pll, ll>;
template <class T> using pq = priority_queue<T, vector<T>, greater<T>>;
const ll LINF = 0x1fffffffffffffff;
const ll MINF = 0x7fffffffffff;
const int INF = 0x3fffffff;
const ll MOD = 1000000007;
const ll MODD = 998244353;
const ld DINF = numeric_limits<ld>::infinity();
const ld EPS = 1e-9;
const vector<ll> four{0, 1, 0, -1, 0};
#define _overload4(_1, _2, _3, _4, name, ...) name
#define _overload3(_1, _2, _3, name, ...) name
#define _rep1(n) for (ll i = 0; i < n; ++i)
#define _rep2(i, n) for (ll i = 0; i < n; ++i)
#define _rep3(i, a, b) for (ll i = a; i < b; ++i)
#define _rep4(i, a, b, c) for (ll i = a; i < b; i += c)
#define rep(...) \
_overload4(__VA_ARGS__, _rep4, _rep3, _rep2, _rep1)(__VA_ARGS__)
#define _rrep1(n) for (ll i = (n)-1; i >= 0; i--)
#define _rrep2(i, n) for (ll i = (n)-1; i >= 0; i--)
#define _rrep3(i, a, b) for (ll i = (b)-1; i >= a; i--)
#define _rrep4(i, a, b, c) for (ll i = a + (b - a - 1) / c * c; i >= a; i -= c)
#define rrep(...) \
_overload4(__VA_ARGS__, _rrep4, _rrep3, _rrep2, _rrep1)(__VA_ARGS__)
#define each(i, a) for (auto &i : a)
#define sum(...) accumulate(range(__VA_ARGS__), 0LL)
#define dsum(...) accumulate(range(__VA_ARGS__), double(0))
#define _range(i) (i).begin(), (i).end()
#define _range2(i, k) (i).begin(), (i).begin() + k
#define _range3(i, a, b) (i).begin() + a, (i).begin() + b
#define range(...) \
_overload3(__VA_ARGS__, _range3, _range2, _range)(__VA_ARGS__)
#define _rrange(i) (i).rbegin(), (i).rend()
#define _rrange2(i, k) (i).rbegin(), (i).rbegin() + k
#define _rrange3(i, a, b) (i).rbegin() + a, (i).rbegin() + b
#define rrange(...) \
_overload3(__VA_ARGS__, _rrange3, _rrange2, _rrange)(__VA_ARGS__)
#define elif else if
#define unless(a) if (!(a))
#define mp make_pair
#define mt make_tuple
#define INT(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define LL(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define ULL(...) \
ull __VA_ARGS__; \
in(__VA_ARGS__)
#define STR(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define CHR(...) \
char __VA_ARGS__; \
in(__VA_ARGS__)
#define DBL(...) \
double __VA_ARGS__; \
in(__VA_ARGS__)
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define VEC(type, name, size) \
vector<type> name(size); \
in(name)
#define vv(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define VV(type, name, h, ...) \
vector<vector<type>> name(h, vector<type>(__VA_ARGS__)); \
in(name)
#define vvv(type, name, h, w, ...) \
vector<vector<vector<type>>> name( \
h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
inline constexpr ll gcd(ll a, ll b) {
if (!a || !b)
return 0;
while (b) {
ll c = b;
b = a % b;
a = c;
}
return a;
}
inline constexpr ll lcm(ll a, ll b) {
if (!a || !b)
return 0;
return a * b / gcd(a, b);
}
template <class T> inline constexpr T min(vector<T> &v) {
return *min_element(range(v));
}
inline char min(string &v) { return *min_element(range(v)); }
template <class T> inline constexpr T max(vector<T> &v) {
return *max_element(range(v));
}
inline char max(string &v) { return *max_element(range(v)); }
inline constexpr ll intpow(ll a, ll b) {
ll ans = 1;
for (ll i = 1; b; i *= 2) {
if (b & i) {
b ^= i;
ans *= a;
}
a *= a;
}
return ans;
}
template <typename T> inline constexpr bool chmin(T &mn, const T &cnt) {
if (mn > cnt) {
mn = cnt;
return 1;
} else
return 0;
}
template <typename T> inline constexpr bool chmax(T &mx, const T &cnt) {
if (mx < cnt) {
mx = cnt;
return 1;
} else
return 0;
}
template <class T> unordered_map<T, ll> press(vector<T> &a) {
auto b = a;
sort(range(b));
b.erase(unique(range(b)), b.end());
unordered_map<T, ll> ans;
rep(b.size()) ans[b[i]] = i;
each(i, a) i = ans[i];
return ans;
}
template <class T> map<T, ll> press_map(vector<T> &a) {
auto b = a;
sort(range(b));
b.erase(unique(range(b)), b.end());
map<T, ll> ans;
rep(b.size()) ans[b[i]] = i;
each(i, a) i = ans[i];
return ans;
}
inline int scan() { return getchar(); }
inline void scan(int &a) { scanf("%d", &a); }
inline void scan(unsigned &a) { scanf("%u", &a); }
inline void scan(long &a) { scanf("%ld", &a); }
inline void scan(long long &a) { scanf("%lld", &a); }
inline void scan(unsigned long long &a) { scanf("%llu", &a); }
inline void scan(char &a) { cin >> a; }
inline void scan(float &a) { scanf("%f", &a); }
inline void scan(double &a) { scanf("%lf", &a); }
inline void scan(long double &a) { scanf("%Lf", &a); }
inline void scan(vector<bool> &vec) {
for (unsigned i = 0; i < vec.size(); i++) {
int a;
scan(a);
vec[i] = a;
}
}
inline void scan(string &a) { cin >> a; }
template <class T> inline void scan(vector<T> &vec);
template <class T, size_t size> inline void scan(array<T, size> &vec);
template <class T, class L> inline void scan(pair<T, L> &p);
template <class T, size_t size> inline void scan(T (&vec)[size]);
template <class T> inline void scan(vector<T> &vec) {
for (auto &i : vec)
scan(i);
}
template <class T, size_t size> inline void scan(array<T, size> &vec) {
for (auto &i : vec)
scan(i);
}
template <class T, class L> inline void scan(pair<T, L> &p) {
scan(p.first);
scan(p.second);
}
template <class T, size_t size> inline void scan(T (&vec)[size]) {
for (auto &i : vec)
scan(i);
}
template <class T> inline void scan(T &a) { cin >> a; }
inline void in() {}
template <class Head, class... Tail> inline void in(Head &head, Tail &...tail) {
scan(head);
in(tail...);
}
inline void print() { putchar(' '); }
inline void print(const bool &a) { printf("%d", a); }
inline void print(const int &a) { printf("%d", a); }
inline void print(const unsigned &a) { printf("%u", a); }
inline void print(const long &a) { printf("%ld", a); }
inline void print(const long long &a) { printf("%lld", a); }
inline void print(const unsigned long long &a) { printf("%llu", a); }
inline void print(const char &a) { printf("%c", a); }
inline void print(const char a[]) { printf("%s", a); }
inline void print(const float &a) { printf("%.10f", a); }
inline void print(const double &a) { printf("%.10f", a); }
inline void print(const long double &a) { printf("%.10Lf", a); }
template <class T> void print(const vector<T> &vec);
template <class T, size_t size> void print(const array<T, size> &vec);
template <class T, class L> void print(const pair<T, L> &p);
template <class T, size_t size> inline void print(const T (&vec)[size]);
template <class T> void print(const vector<T> &vec) {
if (vec.empty())
return;
print(vec[0]);
for (auto i = vec.begin(); ++i != vec.end();) {
putchar(' ');
print(*i);
}
}
template <class T, size_t size> void print(const array<T, size> &vec) {
print(vec[0]);
for (auto i = vec.begin(); ++i != vec.end();) {
putchar(' ');
print(*i);
}
}
template <class T, class L> void print(const pair<T, L> &p) {
print(p.first);
putchar(' ');
print(p.second);
}
template <class T, size_t size> inline void print(const T (&vec)[size]) {
print(vec[0]);
for (auto i = vec; ++i != end(vec);) {
putchar(' ');
print(*i);
}
}
template <class T> inline void print(const T &a) { cout << a; }
inline int out() {
putchar('\n');
return 0;
}
template <class T> inline int out(const T &t) {
print(t);
putchar('\n');
return 0;
}
template <class Head, class... Tail>
inline int out(const Head &head, const Tail &...tail) {
print(head);
putchar(' ');
out(tail...);
return 0;
}
template <class T> inline void err(T t) { cerr << t << '\n'; }
inline void err() { cerr << '\n'; }
inline int first(const bool &i) { return out(i ? "first" : "second"); }
inline int yes(const bool &i) { return out(i ? "yes" : "no"); }
inline int Yes(const bool &i) { return out(i ? "Yes" : "No"); }
inline int YES(const bool &i) { return out(i ? "YES" : "NO"); }
inline int Yay(const bool &i) { return out(i ? "Yay!" : ":("); }
inline int Possible(const bool &i) {
return out(i ? "Possible" : "Impossible");
}
inline int POSSIBLE(const bool &i) {
return out(i ? "POSSIBLE" : "IMPOSSIBLE");
}
inline void Case(ll i) { printf("Case #%lld: ", i); }
signed main() {
LL(n);
VEC(double, a, n);
sort(range(a));
double ans = a.front();
rep(i, 1, n) ans = (ans + a[i]) / 2;
out(ans);
}
|
[
"variable_declaration.type.change"
] | 738,062
| 738,063
|
u874644572
|
cpp
|
p02935
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
priority_queue<float, vector<float>, greater<float>> q;
for (int i = 0; i < n; i++) {
float y;
cin >> y;
q.push(y);
}
while (q.size() != 1) {
float x = q.top();
q.pop();
float y = q.top();
q.pop();
float z = (float)(x + y) / 2;
q.push(z);
}
cout << q.top() << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
priority_queue<float, vector<float>, greater<float>> q;
for (int i = 0; i < n; i++) {
float y;
cin >> y;
q.push(y);
}
while (q.size() != 1) {
float x = q.top();
q.pop();
float y = q.top();
q.pop();
float z = (float)(x + y) / 2;
q.push(z);
}
cout << q.top() << endl;
return 0;
}
|
[] | 738,064
| 738,065
|
u179077505
|
cpp
|
p02935
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> x;
cin >> n;
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
x.push_back(temp);
}
sort(x.begin(), x.end());
float val = (x[0] + x[1]) / 2.0f;
x.erase(x.begin(), x.begin() + 1);
while (x.size() == 0) {
sort(x.begin(), x.end());
val = (val + x[0]) / 2.0f;
x.erase(x.begin());
}
cout << val << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> x;
cin >> n;
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
x.push_back(temp);
}
sort(x.begin(), x.end());
float val = (x[0] + x[1]) / 2.0f;
x.erase(x.begin(), x.begin() + 2);
while (x.size() != 0) {
sort(x.begin(), x.end());
val = (val + x[0]) / 2.0f;
x.erase(x.begin());
}
cout << val << endl;
return 0;
}
|
[
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 738,067
| 738,068
|
u355286859
|
cpp
|
p02935
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, j = 0;
float total;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
for (int i = 0; i < N - 1; i++) {
j++;
if (i == 0) {
total = (vec.at(0) + vec.at(1)) / 2;
} else {
total = (total + vec.at(j)) / 2;
}
}
cout << total << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, j = 0;
float total;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
for (int i = 0; i < N - 1; i++) {
j++;
if (i == 0) {
total = (vec.at(0) + vec.at(1)) / 2.0;
} else {
total = (total + vec.at(j)) / 2.0;
}
}
cout << total << endl;
}
|
[
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 738,071
| 738,072
|
u361557064
|
cpp
|
p02935
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, j = 0;
double total;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
for (int i = 0; i < N - 1; i++) {
j++;
if (i == 0) {
total = (vec.at(0) + vec.at(1)) / 2;
} else {
total = (total + vec.at(j)) / 2;
}
}
cout << total << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, j = 0;
float total;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
for (int i = 0; i < N - 1; i++) {
j++;
if (i == 0) {
total = (vec.at(0) + vec.at(1)) / 2.0;
} else {
total = (total + vec.at(j)) / 2.0;
}
}
cout << total << endl;
}
|
[
"variable_declaration.type.primitive.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 738,073
| 738,072
|
u361557064
|
cpp
|
p02935
|
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
// ~~~~~~~ Aashutosh Rathi~~~~~~
// ~~~~~~~~aashutoshrathi~~~~~~~~~~~
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
// Use memcpy while copying matrix :D
// o_O Never do calculation in if block -_-
// Use __builtin_popcount(z) to get set bit count of z
#include <bits/stdc++.h> // Apne aap me sab kuch hai isme
#include <stdio.h>
using namespace std; // Kyuki yahi mai-baap hai
#define mod(x) x % 1000000007
#define MIN(n1, n2) ((n1) > (n2) ? (n2) : (n1))
#define MAX(n1, n2) ((n1) > (n2) ? (n1) : (n2))
#define MID(s, e) (s + (e - s) / 2)
#define fast \
fin; \
fout; \
fio;
#define fin cin.tie(NULL)
#define fout cout.tie(NULL)
#define fio ios::sync_with_stdio(false)
typedef pair<long, long> lpairs;
typedef long long ll;
int main() {
fast ll n;
cin >> n;
ll a[n];
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
ll res = a[0];
for (ll i = 1; i < n; i++) {
res = (res + a[i]) / 2;
}
cout << res << endl;
return 0;
}
|
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
// ~~~~~~~ Aashutosh Rathi~~~~~~
// ~~~~~~~~aashutoshrathi~~~~~~~~~~~
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
// Use memcpy while copying matrix :D
// o_O Never do calculation in if block -_-
// Use __builtin_popcount(z) to get set bit count of z
#include <bits/stdc++.h> // Apne aap me sab kuch hai isme
#include <stdio.h>
using namespace std; // Kyuki yahi mai-baap hai
#define mod(x) x % 1000000007
#define MIN(n1, n2) ((n1) > (n2) ? (n2) : (n1))
#define MAX(n1, n2) ((n1) > (n2) ? (n1) : (n2))
#define MID(s, e) (s + (e - s) / 2)
#define fast \
fin; \
fout; \
fio;
#define fin cin.tie(NULL)
#define fout cout.tie(NULL)
#define fio ios::sync_with_stdio(false)
typedef pair<long, long> lpairs;
typedef long long ll;
int main() {
fast ll n;
cin >> n;
ll a[n];
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
long double res = a[0];
for (ll i = 1; i < n; i++) {
res = (res + a[i]) / 2.0;
}
cout << res << endl;
return 0;
}
|
[
"variable_declaration.type.widen.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 738,074
| 738,075
|
u958403713
|
cpp
|
p02935
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define fs first
#define sc second
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
double s;
int main() {
int n;
cin >> n;
vector<double> v(n);
rep(i, n) cin >> v[i];
sort(v.begin(), v.end());
if (n == 2) {
cout << (v[0] + v[1]) / 2.0 << endl;
return 0;
} else if (n == 3) {
cout << (((v[0] + v[1]) / 2.0) + v[2]) / 2.0 << endl;
return 0;
} else {
s = (((v[0] + v[1]) / 2.0) + v[2]) / 2.0;
for (int i = 3; i < n - 1; i++) {
s = (s + v[i]) / 2.0;
}
}
cout << s << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define fs first
#define sc second
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
double s;
int main() {
int n;
cin >> n;
vector<double> v(n);
rep(i, n) cin >> v[i];
sort(v.begin(), v.end());
if (n == 2) {
cout << (v[0] + v[1]) / 2.0 << endl;
return 0;
} else if (n == 3) {
cout << (((v[0] + v[1]) / 2.0) + v[2]) / 2.0 << endl;
return 0;
} else {
s = (((v[0] + v[1]) / 2.0) + v[2]) / 2.0;
for (int i = 3; i < n; i++) {
s = (s + v[i]) / 2.0;
}
}
cout << s << endl;
}
|
[
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 738,076
| 738,077
|
u703214333
|
cpp
|
p02935
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<float> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
for (int i = 0; i < N - 1; i++) {
vec.at(i) = vec.at(i) / 2 + vec.at(i + 1) / 2;
}
cout << vec.at(N - 1) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<float> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
for (int i = 0; i < N - 1; i++) {
vec.at(i + 1) = vec.at(i) / 2 + vec.at(i + 1) / 2;
}
cout << vec.at(N - 1) << endl;
}
|
[
"assignment.change"
] | 738,083
| 738,084
|
u890758760
|
cpp
|
p02935
|
#include <bits/stdc++.h>
using namespace std;
int main() {
//定義
int n;
// Nをインプット
cin >> n;
// n個のベクター
vector<int> vec;
//ベクターに標準入力を入れる
int a;
for (int i = 0; i < n; ++i) {
cin >> a;
vec.push_back(a);
}
//ソートしたーい
sort(vec.begin(), vec.end()); //ソート実行
int answer;
answer = (vec[0] + vec[1]) / 2;
for (int i = 2; i < n; ++i) {
answer = (answer + vec[i]) / 2;
}
cout << answer << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
//定義
int n;
// Nをインプット
cin >> n;
// n個のベクター
vector<double> vec;
//ベクターに標準入力を入れる
int a;
for (int i = 0; i < n; ++i) {
cin >> a;
vec.push_back(a);
}
//ソートしたーい
sort(vec.begin(), vec.end()); //ソート実行
double answer;
answer = (vec[0] + vec[1]) / 2;
for (int i = 2; i < n; ++i) {
answer = (answer + vec[i]) / 2;
}
cout << answer << endl;
return 0;
}
|
[
"variable_declaration.type.primitive.change"
] | 738,088
| 738,089
|
u602325778
|
cpp
|
p02935
|
#include <bits/stdc++.h>
#include <iostream>
int main(void) {
int N;
std::cin >> N;
std::vector<double> v(N);
for (int i = 0; i < N; i++) {
std::cin >> v[i];
}
for (int i = 0; i < N - 1; i++) {
double val;
std::sort(v.begin(), v.end());
v.push_back((v[i] + v[i + 1]) / 2.0);
v.erase(v.begin());
v.erase(v.begin());
// for (auto x: v)
// std::cout << x << " ";
// std::cout << std::endl;
}
// std::cout << v.size() << std::endl;
std::cout << v[0] << std::endl;
return 0;
}
|
#include <bits/stdc++.h>
#include <iostream>
int main(void) {
int N;
std::cin >> N;
std::vector<double> v(N);
for (int i = 0; i < N; i++) {
std::cin >> v[i];
}
for (int i = 0; i < N - 1; i++) {
double val;
std::sort(v.begin(), v.end());
// for (auto x: v)
// std::cout << x << " ";
// std::cout << std::endl;
v.push_back((v[0] + v[1]) / 2.0);
v.erase(v.begin());
v.erase(v.begin());
}
// std::cout << v.size() << std::endl;
std::cout << v[0] << std::endl;
return 0;
}
|
[
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 738,090
| 738,091
|
u122994151
|
cpp
|
p02935
|
#include <bits/stdc++.h>
using namespace std;
#include <algorithm>
#include <iostream>
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0]))
namespace {
void printElems(const int *begin, const int *end) {
for (const int *p = begin; p != end; ++p) {
std::cout << *p << std::ends;
}
std::cout << std::endl;
}
} // namespace
int main() {
// 3個の入力を受け取れるように 3要素の配列 {0, 0, 0} で初期化
int n;
cin >> n;
int vec[n];
for (int i = 0; i < n; i++) {
// atを使って1つずつ入力
cin >> vec[i];
}
std::sort(vec, vec + SIZE_OF_ARRAY(vec));
int start = vec[0];
int value = start;
for (int i = 1; i < n; i++) {
value = (vec[i] + value) / 2;
}
cout << value << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#include <algorithm>
#include <iostream>
#define SIZE_OF_ARRAY(array) (sizeof(array) / sizeof(array[0]))
namespace {
void printElems(const int *begin, const int *end) {
for (const int *p = begin; p != end; ++p) {
std::cout << *p << std::ends;
}
std::cout << std::endl;
}
} // namespace
int main() {
// 3個の入力を受け取れるように 3要素の配列 {0, 0, 0} で初期化
int n;
cin >> n;
int vec[n];
for (int i = 0; i < n; i++) {
// atを使って1つずつ入力
cin >> vec[i];
}
std::sort(vec, vec + SIZE_OF_ARRAY(vec));
double start = vec[0];
double value = start;
for (int i = 1; i < n; i++) {
value = (vec[i] + value) / 2;
}
cout << value << endl;
}
|
[
"variable_declaration.type.primitive.change"
] | 738,092
| 738,093
|
u337373905
|
cpp
|
p02935
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v;
long double value = 0;
int input;
for (int i = 0; i < n; i++) {
cin >> input;
v.push_back(input);
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
if (n > 2) {
value += v[n - 1] * pow(0.5, n);
for (int i = 1; i < n - 1; i++) {
value += v[i] * pow(0.5, i + 1);
}
} else {
value += v[1] * 0.5;
}
value += v[0] * 0.5;
cout << value;
}
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v;
long double value = 0;
int input;
for (int i = 0; i < n; i++) {
cin >> input;
v.push_back(input);
}
sort(v.begin(), v.end());
reverse(v.begin(), v.end());
if (n > 2) {
value += v[n - 1] * pow(0.5, n - 1);
for (int i = 1; i < n - 1; i++) {
value += v[i] * pow(0.5, i + 1);
}
} else {
value += v[1] * 0.5;
}
value += v[0] * 0.5;
cout << value;
}
|
[
"assignment.change"
] | 738,096
| 738,097
|
u492321750
|
cpp
|
p02935
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
double numArr[n];
int index = 0;
while (n != index) {
int input;
cin >> input;
numArr[index] = input;
index += 1;
}
sort(numArr, numArr + n);
for (int i = 0; i < n - 1; ++i) {
double first = numArr[i] + numArr[i + 1];
numArr[i + 1] = first / 2;
}
cout << numArr[n];
return 0;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
double numArr[n];
int index = 0;
while (n != index) {
int input;
cin >> input;
numArr[index] = input;
index += 1;
}
sort(numArr, numArr + n);
for (int i = 0; i < n - 1; ++i) {
double first = numArr[i] + numArr[i + 1];
numArr[i + 1] = first / 2;
}
cout << numArr[n - 1];
return 0;
}
|
[
"expression.operation.binary.add"
] | 738,103
| 738,104
|
u780842141
|
cpp
|
p02935
|
/*
#include "stdafx.h"
#include<algorithm>
#include<cmath>
#include<complex>
#include<iostream>
#include<queue>
#include<stack>
#include<vector>
*/
#include <bits/stdc++.h>
#define X real()
#define Y imag()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define ff first
#define ss second
#define FastF \
freopen("in.txt", "r", stdin); \
freopen("out.txt", "w", stdout)
#define Fast \
cin.tie(0); \
cout.tie(0); \
ios_base::sync_with_stdio(0)
using ll = long long;
using namespace std;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vi::iterator vii;
typedef vector<ll> vl;
typedef vl::iterator vli;
typedef long double C;
typedef complex<C> P;
const int INF = 1e9 + 5;
const ll INFF = 1e18 + 5;
const int M = 1e9 + 7;
const double pi = acos(-1);
int main() {
// FastF;
Fast;
int n;
cin >> n;
priority_queue<double> pq;
vi a(n);
for (int &x : a) {
cin >> x;
pq.push(-x);
}
for (int i = 1; i <= n - 1; ++i) {
int u, v;
u = pq.top();
pq.pop();
v = pq.top();
pq.pop();
u = -u;
v = -v;
pq.push(-(u + v) / 2.00);
}
double x = -pq.top();
pq.pop();
printf("%.6lf", x);
return 0;
}
|
/*
#include "stdafx.h"
#include<algorithm>
#include<cmath>
#include<complex>
#include<iostream>
#include<queue>
#include<stack>
#include<vector>
*/
#include <bits/stdc++.h>
#define X real()
#define Y imag()
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define ff first
#define ss second
#define FastF \
freopen("in.txt", "r", stdin); \
freopen("out.txt", "w", stdout)
#define Fast \
cin.tie(0); \
cout.tie(0); \
ios_base::sync_with_stdio(0)
using ll = long long;
using namespace std;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vi::iterator vii;
typedef vector<ll> vl;
typedef vl::iterator vli;
typedef long double C;
typedef complex<C> P;
const int INF = 1e9 + 5;
const ll INFF = 1e18 + 5;
const int M = 1e9 + 7;
const double pi = acos(-1);
int main() {
// FastF;
Fast;
int n;
cin >> n;
priority_queue<double> pq;
vi a(n);
for (int &x : a) {
cin >> x;
pq.push(-x);
}
for (int i = 1; i <= n - 1; ++i) {
double u, v;
u = pq.top();
pq.pop();
v = pq.top();
pq.pop();
u = -u;
v = -v;
pq.push(-(u + v) / 2.00);
}
double x = -pq.top();
pq.pop();
printf("%.6lf", x);
return 0;
}
|
[
"variable_declaration.type.primitive.change"
] | 738,105
| 738,106
|
u292633934
|
cpp
|
p02935
|
#include <algorithm>
#include <iostream>
using namespace std;
double a[110], res = 0;
int main() {
int i, n;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
res = a[0];
for (i = 1; i < n; i++) {
res += (res + a[i]) / 2;
}
cout << res << endl;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
double a[110], res = 0;
int main() {
int i, n;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
res = a[0];
for (i = 0; i < n; i++) {
res = (res + a[i]) / 2;
}
cout << res << endl;
}
|
[
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 738,109
| 738,110
|
u621509943
|
cpp
|
p02936
|
/*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define Rep(i, n) for (ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
ll fac[MAX], finv[MAX], inv[MAX];
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;
}
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll Len(ll n) {
ll s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
ll Sint(ll n) {
ll m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for (ll i = s - 1; i >= 0; i--)
m += n / ((ll)pow(10, i)) - (n / ((ll)pow(10, i + 1))) * 10;
return m;
}
ll Svec(vector<ll> v) {
ll n = 0;
for (ll i = 0; i < v.size(); i++)
n += v[i];
return n;
}
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
ll Factorial(ll n) {
ll m = 1;
while (n >= 1)
m *= n, n--;
return m;
}
void runlength(string s, vector<pair<char, ll>> &p) {
ll x = 1;
if (s.size() == 1) {
p.push_back(pair<char, ll>(s[0], 1));
}
for (ll i = 0; i < s.size() - 1; i++) {
if (s[i] == s[i + 1]) {
x++;
if (i == s.size() - 2) {
p.push_back(pair<char, ll>(s[i], x));
}
} else {
p.push_back(pair<char, ll>(s[i], x));
x = 1;
if (i == s.size() - 2) {
p.push_back(pair<char, ll>(s[s.size() - 1], x));
}
}
}
}
ll COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
const int MAX_N = 100010;
vector<bool> sieve_of_eratosthenes() {
vector<bool> isPrime(MAX_N + 1, true);
for (int i = 2; i <= MAX_N; i++) {
if (isPrime[i]) {
for (int j = 2 * i; j <= MAX_N; j += i) {
isPrime[j] = false;
}
}
}
return isPrime;
}
vector<pint> prime_factorize(ll n) {
vector<pint> ans;
for (ll p = 2; p <= sqrt(n); p++) {
if (n % p != 0)
continue;
ll cnt = 0;
while (n % p == 0) {
n /= p;
cnt++;
}
ans.push_back(make_pair(p, cnt));
}
if (n != 1)
ans.push_back(make_pair(n, 1));
return ans;
}
ll value[200010];
vector<ll> g[200010];
ll ans[200010];
void dfs(ll tmp, ll pre, ll sum) {
sum += value[tmp];
ans[tmp] = sum;
for (auto c : g[tmp]) {
if (c == pre)
continue;
dfs(c, tmp, sum);
}
}
/*↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓*/
int main() {
IOS;
ll n, q;
cin >> n >> q;
rep(i, n - 1) {
ll a, b;
cin >> a >> b;
a--;
b--;
g[a].push_back(b);
g[b].push_back(a);
}
rep(i, 200010) value[i] = 0;
rep(i, q) {
ll a, b;
cin >> a >> b;
a--;
value[a] = b;
}
dfs(0, -1, 0);
rep(i, n) { cout << ans[i] << ' '; }
cout << endl;
}
|
/*Function Template*/
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pint;
const int MAX = 510000;
const int MOD = 1000000007;
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define Rep(i, n) for (ll i = 1; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
ll fac[MAX], finv[MAX], inv[MAX];
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;
}
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll Len(ll n) {
ll s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
ll Sint(ll n) {
ll m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for (ll i = s - 1; i >= 0; i--)
m += n / ((ll)pow(10, i)) - (n / ((ll)pow(10, i + 1))) * 10;
return m;
}
ll Svec(vector<ll> v) {
ll n = 0;
for (ll i = 0; i < v.size(); i++)
n += v[i];
return n;
}
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
ll Factorial(ll n) {
ll m = 1;
while (n >= 1)
m *= n, n--;
return m;
}
void runlength(string s, vector<pair<char, ll>> &p) {
ll x = 1;
if (s.size() == 1) {
p.push_back(pair<char, ll>(s[0], 1));
}
for (ll i = 0; i < s.size() - 1; i++) {
if (s[i] == s[i + 1]) {
x++;
if (i == s.size() - 2) {
p.push_back(pair<char, ll>(s[i], x));
}
} else {
p.push_back(pair<char, ll>(s[i], x));
x = 1;
if (i == s.size() - 2) {
p.push_back(pair<char, ll>(s[s.size() - 1], x));
}
}
}
}
ll COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
const int MAX_N = 100010;
vector<bool> sieve_of_eratosthenes() {
vector<bool> isPrime(MAX_N + 1, true);
for (int i = 2; i <= MAX_N; i++) {
if (isPrime[i]) {
for (int j = 2 * i; j <= MAX_N; j += i) {
isPrime[j] = false;
}
}
}
return isPrime;
}
vector<pint> prime_factorize(ll n) {
vector<pint> ans;
for (ll p = 2; p <= sqrt(n); p++) {
if (n % p != 0)
continue;
ll cnt = 0;
while (n % p == 0) {
n /= p;
cnt++;
}
ans.push_back(make_pair(p, cnt));
}
if (n != 1)
ans.push_back(make_pair(n, 1));
return ans;
}
ll value[200010];
vector<ll> g[200010];
ll ans[200010];
void dfs(ll tmp, ll pre, ll sum) {
sum += value[tmp];
ans[tmp] = sum;
for (auto c : g[tmp]) {
if (c == pre)
continue;
dfs(c, tmp, sum);
}
}
/*↓↓↓↓↓↓↓↓↓↓↓↓↓↓↓*/
int main() {
IOS;
ll n, q;
cin >> n >> q;
rep(i, n - 1) {
ll a, b;
cin >> a >> b;
a--;
b--;
g[a].push_back(b);
g[b].push_back(a);
}
rep(i, 200010) value[i] = 0;
rep(i, q) {
ll a, b;
cin >> a >> b;
a--;
value[a] += b;
}
dfs(0, -1, 0);
rep(i, n) { cout << ans[i] << ' '; }
cout << endl;
}
|
[
"assignment.value.change"
] | 738,152
| 738,153
|
u264265458
|
cpp
|
p02936
|
#include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define COUT(x) cout << (x) << "\n"
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define REP(i, n) for (int i = 0; i < n; i++)
#define YES(x) cout << (x ? "YES" : "NO") << "\n"
#define Yes(x) cout << (x ? "Yes" : "No") << "\n"
#define dump(x) cout << #x << " = " << (x) << "\n"
#define endl "\n"
using G = vector<vector<int>>;
using M = map<int, int>;
using P = pair<int, int>;
using PQ = priority_queue<int>;
using PQG = priority_queue<int, vector<int>, greater<int>>;
using V = vector<int>;
using ll = long long;
using edge = struct {
int to;
int cost;
};
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 int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
vector<int> ans;
G g(200005);
void dfs(int v, int p = -1) {
for (int u : g[v]) {
if (u == p)
continue;
ans[u] = ans[v];
dfs(u, v);
}
}
int main() {
IOS;
int n, q;
cin >> n >> q;
REP(i, n - 1) {
int a, b;
cin >> a >> b;
a--;
b--;
g[a].push_back(b);
g[b].push_back(a);
}
ans.resize(n);
REP(i, q) {
int p, x;
cin >> p >> x;
p--;
ans[p] += x;
}
dfs(0);
REP(i, n) {
if (i > 0)
cout << " ";
cout << ans[i];
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ALL(x) (x).begin(), (x).end()
#define COUT(x) cout << (x) << "\n"
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define REP(i, n) for (int i = 0; i < n; i++)
#define YES(x) cout << (x ? "YES" : "NO") << "\n"
#define Yes(x) cout << (x ? "Yes" : "No") << "\n"
#define dump(x) cout << #x << " = " << (x) << "\n"
#define endl "\n"
using G = vector<vector<int>>;
using M = map<int, int>;
using P = pair<int, int>;
using PQ = priority_queue<int>;
using PQG = priority_queue<int, vector<int>, greater<int>>;
using V = vector<int>;
using ll = long long;
using edge = struct {
int to;
int cost;
};
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 int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
vector<int> ans;
G g(200005);
void dfs(int v, int p = -1) {
for (int u : g[v]) {
if (u == p)
continue;
ans[u] += ans[v];
dfs(u, v);
}
}
int main() {
IOS;
int n, q;
cin >> n >> q;
REP(i, n - 1) {
int a, b;
cin >> a >> b;
a--;
b--;
g[a].push_back(b);
g[b].push_back(a);
}
ans.resize(n);
REP(i, q) {
int p, x;
cin >> p >> x;
p--;
ans[p] += x;
}
dfs(0);
REP(i, n) {
if (i > 0)
cout << " ";
cout << ans[i];
}
cout << endl;
return 0;
}
|
[
"assignment.value.change"
] | 738,154
| 738,155
|
u303884911
|
cpp
|
p02936
|
#include <stdint.h>
#include <stdlib.h>
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
using default_counter_t = int64_t;
// macro
#define let auto const &
#define overload4(a, b, c, d, name, ...) name
#define rep1(n) \
for (default_counter_t i = 0, end_i = default_counter_t(n); i < end_i; ++i)
#define rep2(i, n) \
for (default_counter_t i = 0, end_##i = default_counter_t(n); i < end_##i; \
++i)
#define rep3(i, a, b) \
for (default_counter_t i = default_counter_t(a), \
end_##i = default_counter_t(b); \
i < end_##i; ++i)
#define rep4(i, a, b, c) \
for (default_counter_t i = default_counter_t(a), \
end_##i = default_counter_t(b); \
i < end_##i; i += default_counter_t(c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(n) \
for (default_counter_t i = default_counter_t(n) - 1; i >= 0; --i)
#define rrep2(i, n) \
for (default_counter_t i = default_counter_t(n) - 1; i >= 0; --i)
#define rrep3(i, a, b) \
for (default_counter_t i = default_counter_t(b) - 1, \
begin_##i = default_counter_t(a); \
i >= begin_##i; --i)
#define rrep4(i, a, b, c) \
for (default_counter_t \
i = (default_counter_t(b) - default_counter_t(a) - 1) / \
default_counter_t(c) * default_counter_t(c) + \
default_counter_t(a), \
begin_##i = default_counter_t(a); \
i >= begin_##i; i -= default_counter_t(c))
#define rrep(...) \
overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define ALL(f, c, ...) \
(([&](decltype((c)) cccc) { \
return (f)(std::begin(cccc), std::end(cccc), ##__VA_ARGS__); \
})(c))
// function
template <class C> constexpr C &Sort(C &a) {
std::sort(std::begin(a), std::end(a));
return a;
}
template <class C> constexpr auto &Min(C const &a) {
return *std::min_element(std::begin(a), std::end(a));
}
template <class C> constexpr auto &Max(C const &a) {
return *std::max_element(std::begin(a), std::end(a));
}
template <class C> constexpr auto Total(C const &c) {
return std::accumulate(std::begin(c), std::end(c), C(0));
}
template <typename T> auto CumSum(std::vector<T> const &v) {
std::vector<T> a(v.size() + 1, T(0));
for (std::size_t i = 0; i < a.size() - size_t(1); ++i)
a[i + 1] = a[i] + v[i];
return a;
}
template <typename T> constexpr bool ChMax(T &a, T const &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> constexpr bool ChMin(T &a, T const &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
void In(void) { return; }
template <typename First, typename... Rest>
void In(First &first, Rest &...rest) {
cin >> first;
In(rest...);
return;
}
template <class T, typename I> void VectorIn(vector<T> &v, const I n) {
v.resize(size_t(n));
rep(i, v.size()) cin >> v[i];
}
void Out(void) {
cout << "\n";
return;
}
template <typename First, typename... Rest>
void Out(First first, Rest... rest) {
cout << first << " ";
Out(rest...);
return;
}
constexpr auto yes(const bool c) { return c ? "yes" : "no"; }
constexpr auto Yes(const bool c) { return c ? "Yes" : "No"; }
constexpr auto YES(const bool c) { return c ? "YES" : "NO"; }
// http://koturn.hatenablog.com/entry/2018/08/01/010000
template <typename T, typename U>
inline std::vector<U> MakeNdVector(T n, U val) noexcept {
static_assert(std::is_integral<T>::value,
"[MakeNdVector] The 1st argument must be an integer");
return std::vector<U>(std::forward<T>(n), std::forward<U>(val));
}
template <typename T, typename... Args>
inline decltype(auto) MakeNdVector(T n, Args &&...args) noexcept {
static_assert(std::is_integral<T>::value,
"[MakeNdVector] The 1st argument must be an integer");
return std::vector<decltype(MakeNdVector(std::forward<Args>(args)...))>(
std::forward<T>(n), MakeNdVector(std::forward<Args>(args)...));
}
template <typename T, std::size_t N,
typename std::enable_if<(N > 0), std::nullptr_t>::type = nullptr>
struct NdvectorImpl {
using type = std::vector<typename NdvectorImpl<T, N - 1>::type>;
}; // struct ndvector_impl
template <typename T> struct NdvectorImpl<T, 1> {
using type = std::vector<T>;
}; // struct ndvector_impl
template <typename T, std::size_t N>
using NdVector = typename NdvectorImpl<T, N>::type;
#ifdef USE_STACK_TRACE_LOGGER
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Weverything"
#include <glog/logging.h>
#pragma clang diagnostic pop
#endif //__clang__
#endif // USE_STACK_TRACE_LOGGER
vector<vector<int>> g;
vector<int64_t> cnt;
vector<int> visit;
void Dfs(const int v, const int64_t s) {
visit[v] = true;
cnt[v] += s;
for (const auto u : g[v]) {
if (!visit[u])
Dfs(u, cnt[v]);
}
}
signed main(int argc, char *argv[]) {
(void)argc;
#ifdef USE_STACK_TRACE_LOGGER
google::InitGoogleLogging(argv[0]);
google::InstallFailureSignalHandler();
#else
(void)argv;
#endif // USE_STACK_TRACE_LOGGER
int64_t N, Q;
In(N, Q);
g.resize(N);
cnt.resize(N, 0);
visit.resize(N, false);
rep(i, N - 1) {
int64_t a = 0, b = 0;
In(a, b);
a--;
b--;
g[a].emplace_back(b);
g[b].emplace_back(a);
}
rep(i, Q) {
int64_t p, x;
In(p, x);
p--;
cnt[p] = x;
}
Dfs(0, 0);
rep(i, N) { cout << cnt[i] << " "; }
cout << endl;
return EXIT_SUCCESS;
}
|
#include <stdint.h>
#include <stdlib.h>
#include <algorithm>
#include <iostream>
#include <numeric>
#include <vector>
using namespace std;
using default_counter_t = int64_t;
// macro
#define let auto const &
#define overload4(a, b, c, d, name, ...) name
#define rep1(n) \
for (default_counter_t i = 0, end_i = default_counter_t(n); i < end_i; ++i)
#define rep2(i, n) \
for (default_counter_t i = 0, end_##i = default_counter_t(n); i < end_##i; \
++i)
#define rep3(i, a, b) \
for (default_counter_t i = default_counter_t(a), \
end_##i = default_counter_t(b); \
i < end_##i; ++i)
#define rep4(i, a, b, c) \
for (default_counter_t i = default_counter_t(a), \
end_##i = default_counter_t(b); \
i < end_##i; i += default_counter_t(c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(n) \
for (default_counter_t i = default_counter_t(n) - 1; i >= 0; --i)
#define rrep2(i, n) \
for (default_counter_t i = default_counter_t(n) - 1; i >= 0; --i)
#define rrep3(i, a, b) \
for (default_counter_t i = default_counter_t(b) - 1, \
begin_##i = default_counter_t(a); \
i >= begin_##i; --i)
#define rrep4(i, a, b, c) \
for (default_counter_t \
i = (default_counter_t(b) - default_counter_t(a) - 1) / \
default_counter_t(c) * default_counter_t(c) + \
default_counter_t(a), \
begin_##i = default_counter_t(a); \
i >= begin_##i; i -= default_counter_t(c))
#define rrep(...) \
overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define ALL(f, c, ...) \
(([&](decltype((c)) cccc) { \
return (f)(std::begin(cccc), std::end(cccc), ##__VA_ARGS__); \
})(c))
// function
template <class C> constexpr C &Sort(C &a) {
std::sort(std::begin(a), std::end(a));
return a;
}
template <class C> constexpr auto &Min(C const &a) {
return *std::min_element(std::begin(a), std::end(a));
}
template <class C> constexpr auto &Max(C const &a) {
return *std::max_element(std::begin(a), std::end(a));
}
template <class C> constexpr auto Total(C const &c) {
return std::accumulate(std::begin(c), std::end(c), C(0));
}
template <typename T> auto CumSum(std::vector<T> const &v) {
std::vector<T> a(v.size() + 1, T(0));
for (std::size_t i = 0; i < a.size() - size_t(1); ++i)
a[i + 1] = a[i] + v[i];
return a;
}
template <typename T> constexpr bool ChMax(T &a, T const &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> constexpr bool ChMin(T &a, T const &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
void In(void) { return; }
template <typename First, typename... Rest>
void In(First &first, Rest &...rest) {
cin >> first;
In(rest...);
return;
}
template <class T, typename I> void VectorIn(vector<T> &v, const I n) {
v.resize(size_t(n));
rep(i, v.size()) cin >> v[i];
}
void Out(void) {
cout << "\n";
return;
}
template <typename First, typename... Rest>
void Out(First first, Rest... rest) {
cout << first << " ";
Out(rest...);
return;
}
constexpr auto yes(const bool c) { return c ? "yes" : "no"; }
constexpr auto Yes(const bool c) { return c ? "Yes" : "No"; }
constexpr auto YES(const bool c) { return c ? "YES" : "NO"; }
// http://koturn.hatenablog.com/entry/2018/08/01/010000
template <typename T, typename U>
inline std::vector<U> MakeNdVector(T n, U val) noexcept {
static_assert(std::is_integral<T>::value,
"[MakeNdVector] The 1st argument must be an integer");
return std::vector<U>(std::forward<T>(n), std::forward<U>(val));
}
template <typename T, typename... Args>
inline decltype(auto) MakeNdVector(T n, Args &&...args) noexcept {
static_assert(std::is_integral<T>::value,
"[MakeNdVector] The 1st argument must be an integer");
return std::vector<decltype(MakeNdVector(std::forward<Args>(args)...))>(
std::forward<T>(n), MakeNdVector(std::forward<Args>(args)...));
}
template <typename T, std::size_t N,
typename std::enable_if<(N > 0), std::nullptr_t>::type = nullptr>
struct NdvectorImpl {
using type = std::vector<typename NdvectorImpl<T, N - 1>::type>;
}; // struct ndvector_impl
template <typename T> struct NdvectorImpl<T, 1> {
using type = std::vector<T>;
}; // struct ndvector_impl
template <typename T, std::size_t N>
using NdVector = typename NdvectorImpl<T, N>::type;
#ifdef USE_STACK_TRACE_LOGGER
#ifdef __clang__
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Weverything"
#include <glog/logging.h>
#pragma clang diagnostic pop
#endif //__clang__
#endif // USE_STACK_TRACE_LOGGER
vector<vector<int>> g;
vector<int64_t> cnt;
vector<int> visit;
void Dfs(const int v, const int64_t s) {
visit[v] = true;
cnt[v] += s;
for (const auto u : g[v]) {
if (!visit[u])
Dfs(u, cnt[v]);
}
}
signed main(int argc, char *argv[]) {
(void)argc;
#ifdef USE_STACK_TRACE_LOGGER
google::InitGoogleLogging(argv[0]);
google::InstallFailureSignalHandler();
#else
(void)argv;
#endif // USE_STACK_TRACE_LOGGER
int64_t N, Q;
In(N, Q);
g.resize(N);
cnt.resize(N, 0);
visit.resize(N, false);
rep(i, N - 1) {
int64_t a = 0, b = 0;
In(a, b);
a--;
b--;
g[a].emplace_back(b);
g[b].emplace_back(a);
}
rep(i, Q) {
int64_t p, x;
In(p, x);
p--;
cnt[p] += x;
}
Dfs(0, 0);
rep(i, N) { cout << cnt[i] << " "; }
cout << endl;
return EXIT_SUCCESS;
}
|
[
"assignment.value.change"
] | 738,156
| 738,157
|
u653699618
|
cpp
|
p02936
|
#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 I_MAX 2147483647
#define LL_MAX 9223372036854775807
#define ll long long
#define ld long double
struct XX {
ll a;
ll b;
};
class xxGreater {
public:
bool operator()(const XX &riLeft, const XX &riRight) const {
//第2条件
if ((riLeft.a) == (riRight.a)) {
return riLeft.b >
riRight.b; //<:昇順(小さいものから順番)、>:降順(大きいものから順番)
//プライオリティキューの場合は > で、top()すると値の小さいものがとれる
}
//第1条件
return (riLeft.b) > (riRight.b);
}
};
// 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
vector<int> G[200001];
ll cnt[200001];
#else
vector<int> G[200001];
ll cnt[200001];
#endif
map<int, ll> p;
bool used[200001];
void dfs(int s, ll point) {
if (used[s]) {
return;
}
used[s] = true;
cnt[s] += point;
for (int i = 0; i < G[s].size(); i++) {
ll tmp = p[G[s][i]];
dfs(G[s][i], point + tmp);
}
}
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("01"); //テスト用
// ifs >> a;
//ここから
//入力高速化
ios::sync_with_stdio(false);
cin.tie(0);
int N, Q;
ifs >> N >> Q;
for (int i = 0; i < N - 1; i++) {
int t1, t2;
ifs >> t1 >> t2;
G[t1].push_back(t2);
G[t2].push_back(t1);
}
for (int i = 0; i < Q; i++) {
int t1;
ll t2;
ifs >> t1 >> t2;
p[t1] += t2;
}
dfs(1, p[1]);
for (int i = 1; i <= N; i++) {
cout << cnt[i] << " ";
}
cout << endl;
//ここまで
// cout << "ans" << 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 I_MAX 2147483647
#define LL_MAX 9223372036854775807
#define ll long long
#define ld long double
struct XX {
ll a;
ll b;
};
class xxGreater {
public:
bool operator()(const XX &riLeft, const XX &riRight) const {
//第2条件
if ((riLeft.a) == (riRight.a)) {
return riLeft.b >
riRight.b; //<:昇順(小さいものから順番)、>:降順(大きいものから順番)
//プライオリティキューの場合は > で、top()すると値の小さいものがとれる
}
//第1条件
return (riLeft.b) > (riRight.b);
}
};
// 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
vector<int> G[200001];
ll cnt[200001];
#else
vector<int> G[200001];
ll cnt[200001];
#endif
map<int, ll> p;
bool used[200001];
void dfs(int s, ll point) {
if (used[s]) {
return;
}
used[s] = true;
cnt[s] += point;
for (int i = 0; i < G[s].size(); i++) {
ll tmp = p[G[s][i]];
dfs(G[s][i], point + tmp);
}
}
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("01"); //テスト用
// ifs >> a;
//ここから
//入力高速化
ios::sync_with_stdio(false);
cin.tie(0);
int N, Q;
cin >> N >> Q;
for (int i = 0; i < N - 1; i++) {
int t1, t2;
cin >> t1 >> t2;
G[t1].push_back(t2);
G[t2].push_back(t1);
}
for (int i = 0; i < Q; i++) {
int t1;
ll t2;
cin >> t1 >> t2;
p[t1] += t2;
}
dfs(1, p[1]);
for (int i = 1; i <= N; i++) {
cout << cnt[i] << " ";
}
cout << endl;
//ここまで
// cout << "ans" << endl;
// cout << " " << "ans" << endl;
// printf("%.0f\n",ans);//小数点以下表示なし
// printf("%.7f\n",p);
return 0;
}
|
[
"identifier.change",
"expression.operation.binary.change"
] | 738,170
| 738,171
|
u649310245
|
cpp
|
p02936
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using pint = pair<int, int>;
void dfs(const vector<vector<int>> &G, vector<bool> &seen, int v, ll sum,
vector<ll> &values) {
seen[v] = true;
values[v] += sum;
for (auto next_v : G[v]) {
if (seen[next_v])
continue;
dfs(G, seen, next_v, values[v], values);
}
}
int main() {
int n, q;
cin >> n >> q;
vector<vector<int>> graph(n + 1);
for (int i = 1; i < n; ++i) {
int a, b;
cin >> a >> b;
graph[a].emplace_back(b);
graph[b].emplace_back(a);
}
vector<ll> values(n + 1, 0);
vector<bool> seen(n + 1, false);
for (int i = 0; i < q; ++i) {
int p, x;
cin >> p >> x;
values[p] += x;
}
dfs(graph, seen, 1, 0, values);
for (int i = 1; i < n; ++i)
cout << values[i] << " ";
cout << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = int64_t;
using pint = pair<int, int>;
void dfs(const vector<vector<int>> &G, vector<bool> &seen, int v, ll sum,
vector<ll> &values) {
seen[v] = true;
values[v] += sum;
for (auto next_v : G[v]) {
if (seen[next_v])
continue;
dfs(G, seen, next_v, values[v], values);
}
}
int main() {
int n, q;
cin >> n >> q;
vector<vector<int>> graph(n + 1);
for (int i = 1; i < n; ++i) {
int a, b;
cin >> a >> b;
graph[a].emplace_back(b);
graph[b].emplace_back(a);
}
vector<ll> values(n + 1, 0);
vector<bool> seen(n + 1, false);
for (int i = 0; i < q; ++i) {
int p, x;
cin >> p >> x;
values[p] += x;
}
dfs(graph, seen, 1, 0, values);
for (int i = 1; i <= n; ++i)
cout << values[i] << " ";
cout << endl;
}
|
[
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 738,204
| 738,205
|
u698741861
|
cpp
|
p02936
|
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int, int>;
int main() {
int N, Q;
cin >> N >> Q;
vector<P> A(N - 1);
vector<vector<int>> C(N, vector<int>());
REP(i, N - 1) {
cin >> A[i].first >> A[i].second;
A[i].first--;
A[i].second--;
C.at(A[i].first).push_back(A[i].second);
C.at(A[i].second).push_back(A[i].first);
}
vector<P> B(Q);
REP(i, Q) {
cin >> B[i].first >> B[i].second;
B[i].first--;
}
vector<int> cnt(N, 0);
REP(i, Q) { cnt[B[i].first] += B[i].second; }
queue<int> que;
vector<int> dist(N, -1);
dist[0] = 0;
que.push(0);
while (!que.empty()) {
int v = que.front();
que.pop();
for (auto nv : C[v]) {
if (dist[nv] == -1)
continue;
dist[nv] = dist[v] + 1;
cnt[nv] += cnt[v];
que.push(nv);
}
}
REP(i, N) {
if (i != N - 1) {
cout << cnt[i] << " ";
} else {
cout << cnt[i];
}
}
cout << endl;
}
|
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int, int>;
int main() {
int N, Q;
cin >> N >> Q;
vector<P> A(N - 1);
vector<vector<int>> C(N, vector<int>());
REP(i, N - 1) {
cin >> A[i].first >> A[i].second;
A[i].first--;
A[i].second--;
C.at(A[i].first).push_back(A[i].second);
C.at(A[i].second).push_back(A[i].first);
}
vector<P> B(Q);
REP(i, Q) {
cin >> B[i].first >> B[i].second;
B[i].first--;
}
vector<int> cnt(N, 0);
REP(i, Q) { cnt[B[i].first] += B[i].second; }
queue<int> que;
vector<int> dist(N, -1);
dist[0] = 0;
que.push(0);
while (!que.empty()) {
int v = que.front();
que.pop();
for (auto nv : C[v]) {
if (dist[nv] != -1)
continue;
dist[nv] = dist[v] + 1;
cnt[nv] += cnt[v];
que.push(nv);
}
}
REP(i, N) {
if (i != N - 1) {
cout << cnt[i] << " ";
} else {
cout << cnt[i];
}
}
cout << endl;
}
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 738,240
| 738,241
|
u135626132
|
cpp
|
p02936
|
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < (n); ++i)
void dfs(int s, vector<vector<int>> &g, vector<int> &ans, int pre = -1) {
for (auto u : g[s]) {
if (u == pre)
continue;
ans[u] += ans[s];
dfs(u, g, ans, s);
}
return;
}
int main() {
int n, q;
cin >> n >> q;
vector<vector<int>> g(n);
rep(i, n - 1) {
int a, b;
cin >> a >> b;
--a, --b;
g[a].push_back(b);
g[b].push_back(a);
}
vector<int> ans(n, 0);
rep(i, q) {
int p, x;
cin >> p >> x;
--p;
ans[p] = x;
}
// rep(i, n) cout << ans[i] << " ";
// cout << endl;
dfs(0, g, ans);
rep(i, n) {
if (i >= 1)
cout << " ";
cout << ans[i];
}
cout << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < (n); ++i)
void dfs(int s, vector<vector<int>> &g, vector<int> &ans, int pre = -1) {
for (auto u : g[s]) {
if (u == pre)
continue;
ans[u] += ans[s];
dfs(u, g, ans, s);
}
return;
}
int main() {
int n, q;
cin >> n >> q;
vector<vector<int>> g(n);
rep(i, n - 1) {
int a, b;
cin >> a >> b;
--a, --b;
g[a].push_back(b);
g[b].push_back(a);
}
vector<int> ans(n, 0);
rep(i, q) {
int p, x;
cin >> p >> x;
--p;
ans[p] += x;
}
// rep(i, n) cout << ans[i] << " ";
// cout << endl;
dfs(0, g, ans);
rep(i, n) {
if (i >= 1)
cout << " ";
cout << ans[i];
}
cout << endl;
return 0;
}
|
[
"assignment.value.change"
] | 738,244
| 738,245
|
u596311864
|
cpp
|
p02936
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
#define L(ID) ((ID * 2) + 1)
#define R(ID) ((ID * 2) + 2)
#define M(L, R) ((L + R) / 2)
#define forr(start, end) for (int i = start; i < end; i++)
#define gap ' '
const int MAXN = 2 * 1e5 + 5;
ll largest(ll a, ll b) { return (a < b) ? b : a; }
ll smallest(ll a, ll b) {
if (a < b)
return a;
return b;
}
std::vector<int> a[MAXN];
int c[MAXN];
void dfs(int on, int par) {
for (auto to : a[on]) {
if (to == par)
continue;
c[to] += c[on];
dfs(to, on);
}
}
int main() {
int n, q;
cin >> n >> q;
for (int i = 1; i < n; ++i) {
int u, v;
cin >> u >> v;
--u, --v;
a[u].push_back(v);
a[v].push_back(u);
}
while (q--) {
int p, x;
cin >> p >> x;
--p;
c[p] += x;
}
dfs(0, 0);
for (int i = 0; i < n - 1; ++i) {
cout << c[i] << gap;
}
cout << endl;
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
#define L(ID) ((ID * 2) + 1)
#define R(ID) ((ID * 2) + 2)
#define M(L, R) ((L + R) / 2)
#define forr(start, end) for (int i = start; i < end; i++)
#define gap ' '
const int MAXN = 2 * 1e5 + 5;
ll largest(ll a, ll b) { return (a < b) ? b : a; }
ll smallest(ll a, ll b) {
if (a < b)
return a;
return b;
}
std::vector<int> a[MAXN];
int c[MAXN];
void dfs(int on, int par) {
for (auto to : a[on]) {
if (to == par)
continue;
c[to] += c[on];
dfs(to, on);
}
}
int main() {
int n, q;
cin >> n >> q;
for (int i = 1; i < n; ++i) {
int u, v;
cin >> u >> v;
--u, --v;
a[u].push_back(v);
a[v].push_back(u);
}
while (q--) {
int p, x;
cin >> p >> x;
--p;
c[p] += x;
}
dfs(0, 0);
for (int i = 0; i < n; ++i) {
cout << c[i] << gap;
}
cout << endl;
return 0;
}
|
[
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 738,248
| 738,249
|
u577511087
|
cpp
|
p02936
|
#include "bits/stdc++.h"
using namespace std;
////////////// Prewritten code follows. Look down for solution. ////////////////
#define fs first
#define sc second
#define pb push_back
#define mp(a, b) make_pair(a, b)
#define len(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define fastio \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long long ll;
typedef pair<ll, ll> pll;
template <typename T> const T INF = (is_same<T, int>::value ? 1e9 : 1e18);
template <typename T> inline T mod(T n, T mod) {
T res = n % mod;
if (res < 0)
res += mod;
return res;
}
////////////////////////// Solution starts below. //////////////////////////////
const int N = 2e5 + 5;
vi adj[N];
ll cnt[N];
bitset<N> vis;
void dfs(int v) {
vis[v] = 1;
for (int u : adj[v]) {
if (!vis[u]) {
cnt[u] += cnt[v];
dfs(u);
}
}
}
int main() {
fastio;
int n, q;
cin >> n >> q;
for (int i = 0; i < n - 1; i++) {
int a, b;
cin >> a >> b;
adj[a].pb(b);
adj[b].pb(a);
}
for (int j = 0; j < q; j++) {
int v, p;
cin >> v >> p;
cnt[v] = 1LL * p;
}
dfs(1);
for (int i = 1; i <= n; i++) {
cout << cnt[i] << ' ';
}
cout << '\n';
return 0;
}
|
#include "bits/stdc++.h"
using namespace std;
////////////// Prewritten code follows. Look down for solution. ////////////////
#define fs first
#define sc second
#define pb push_back
#define mp(a, b) make_pair(a, b)
#define len(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define fastio \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef long long ll;
typedef pair<ll, ll> pll;
template <typename T> const T INF = (is_same<T, int>::value ? 1e9 : 1e18);
template <typename T> inline T mod(T n, T mod) {
T res = n % mod;
if (res < 0)
res += mod;
return res;
}
////////////////////////// Solution starts below. //////////////////////////////
const int N = 2e5 + 5;
vi adj[N];
ll cnt[N];
bitset<N> vis;
void dfs(int v) {
vis[v] = 1;
for (int u : adj[v]) {
if (!vis[u]) {
cnt[u] += cnt[v];
dfs(u);
}
}
}
int main() {
fastio;
int n, q;
cin >> n >> q;
for (int i = 0; i < n - 1; i++) {
int a, b;
cin >> a >> b;
adj[a].pb(b);
adj[b].pb(a);
}
for (int j = 0; j < q; j++) {
int v, p;
cin >> v >> p;
cnt[v] += 1LL * p;
}
dfs(1);
for (int i = 1; i <= n; i++) {
cout << cnt[i] << ' ';
}
cout << '\n';
return 0;
}
|
[
"assignment.value.change"
] | 738,254
| 738,255
|
u567661286
|
cpp
|
p02936
|
#include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, q;
cin >> n >> q;
vector<vector<int>> r(n + 1);
vector<int> r2(n + 1, n + 1);
int a, b;
rep(i, n - 1) {
cin >> a >> b;
r[a].push_back(b);
r[b].push_back(q);
}
vector<int> ans(n + 1, 0);
int p, x;
rep(i, q) {
cin >> p >> x;
ans[p] += x;
}
queue<int> qu;
qu.push(1);
vector<int> tu(n + 1, -1);
int now;
tu[1] = 0;
int l;
while (qu.size() != 0) {
now = qu.front();
qu.pop();
l = r[now].size();
rep(i, l) {
if (tu[r[now][i]] == 0) {
continue;
}
qu.push(r[now][i]);
ans[r[now][i]] += ans[now];
tu[r[now][i]] = 0;
}
}
rep(i, n) { printf("%d ", ans[i + 1]); }
return 0;
}
|
#include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, q;
cin >> n >> q;
vector<vector<int>> r(n + 1);
vector<int> r2(n + 1, n + 1);
int a, b;
rep(i, n - 1) {
cin >> a >> b;
r[a].push_back(b);
r[b].push_back(a);
}
vector<int> ans(n + 1, 0);
int p, x;
rep(i, q) {
cin >> p >> x;
ans[p] += x;
}
queue<int> qu;
qu.push(1);
vector<int> tu(n + 1, -1);
int now;
tu[1] = 0;
int l;
while (qu.size() != 0) {
now = qu.front();
qu.pop();
l = r[now].size();
rep(i, l) {
if (tu[r[now][i]] == 0) {
continue;
}
qu.push(r[now][i]);
ans[r[now][i]] += ans[now];
tu[r[now][i]] = 0;
}
}
rep(i, n) { printf("%d ", ans[i + 1]); }
return 0;
}
|
[
"identifier.change",
"call.arguments.change"
] | 738,262
| 738,263
|
u992471673
|
cpp
|
p02936
|
#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<ll> ans;
vector<vector<int>> node;
void score(int now, int parent = -1) {
rep(i, node[now].size()) {
if (node[now][i] == parent)
continue;
ans[node[now][i]] = ans[now];
score(node[now][i], now);
}
}
void solve() {
int n, q;
cin >> n >> q;
ans.resize(n);
node.resize(n);
rep(i, n - 1) {
int a, b;
cin >> a >> b;
a--;
b--;
node[a].push_back(b);
node[b].push_back(a);
}
rep(i, q) {
int p, x;
cin >> p >> x;
p--;
ans[p] += x;
}
score(0);
rep(i, n) {
if (i == 0) {
cout << ans[i];
} else {
cout << " " << ans[i];
}
}
cout << endl;
}
int main() {
solve();
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<ll> ans;
vector<vector<int>> node;
void score(int now, int parent = -1) {
rep(i, node[now].size()) {
if (node[now][i] == parent)
continue;
ans[node[now][i]] += ans[now];
score(node[now][i], now);
}
}
void solve() {
int n, q;
cin >> n >> q;
ans.resize(n);
node.resize(n);
rep(i, n - 1) {
int a, b;
cin >> a >> b;
a--;
b--;
node[a].push_back(b);
node[b].push_back(a);
}
rep(i, q) {
int p, x;
cin >> p >> x;
p--;
ans[p] += x;
}
score(0);
rep(i, n) {
if (i == 0) {
cout << ans[i];
} else {
cout << " " << ans[i];
}
}
cout << endl;
}
int main() {
solve();
return 0;
}
|
[
"assignment.value.change"
] | 738,266
| 738,267
|
u796269639
|
cpp
|
p02936
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < (int)b; i++)
#define all(v) v.begin(), v.end()
const int MOD = 1e9 + 7;
const int INF = 1e9;
//'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
vector<int> g[200005];
int ans[200005];
void dfs(int now, int from) {
for (int to : g[now]) {
if (to == from)
continue;
ans[to] += ans[now];
dfs(to, now);
}
}
int main() {
int n, q;
cin >> n >> q;
rep(i, 0, n - 1) {
int a, b;
cin >> a >> b;
a--;
b--;
g[a].push_back(b);
g[b].push_back(a);
}
rep(i, 0, q) {
int p, x;
cin >> p >> x;
p--;
ans[p] += x;
}
dfs(-1, 0);
rep(i, 0, n) cout << ans[i] << " ";
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < (int)b; i++)
#define all(v) v.begin(), v.end()
const int MOD = 1e9 + 7;
const int INF = 1e9;
//'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
vector<int> g[200005];
int ans[200005];
void dfs(int now, int from) {
for (int to : g[now]) {
if (to == from)
continue;
ans[to] += ans[now];
dfs(to, now);
}
}
int main() {
int n, q;
cin >> n >> q;
rep(i, 0, n - 1) {
int a, b;
cin >> a >> b;
a--;
b--;
g[a].push_back(b);
g[b].push_back(a);
}
rep(i, 0, q) {
int p, x;
cin >> p >> x;
p--;
ans[p] += x;
}
dfs(0, -1);
rep(i, 0, n) cout << ans[i] << " ";
cout << endl;
return 0;
}
|
[
"call.arguments.add",
"call.arguments.change"
] | 738,292
| 738,293
|
u214304095
|
cpp
|
p02936
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = n; i > -1; --i)
#define ALL(a) (a).begin(), (a).end()
#define FILL(a, n, x) \
; \
REP(i, (n)) { (a)[i] = (x); }
#define CINA(a, n) \
; \
REP(i, (n)) { cin >> (a)[i]; }
#define FILL2(a, n, m, x) \
; \
REP(i, (n)) { \
REP(j, (m)) { (a)[i][j] = (x); } \
}
#define CINA2(a, n, m) \
; \
REP(i, (n)) { \
REP(j, (m)) { cin >> (a)[i][j]; } \
}
#define Liny "Yes\n"
#define Linn "No\n"
#define LINY "YES\n"
#define LINN "NO\n"
#define umap unordered_map
// cout << setfill('0') << right << setw(4) << 12; // "0012"
int keta(ll x) {
if (x < 10) {
return 1;
} else {
return keta(x / 10) + 1;
}
}
int keta_wa(ll x) {
if (x < 10) {
return x;
} else {
return keta_wa(x / 10) + x % 10;
}
}
int ctoi(char c) { return ((c >= '0' && c <= '9') ? c - '0' : 0); }
int __stoi(string s) { return atoi(s.c_str()); }
ll sum(ll a[], ll N) { return accumulate(a, a + N, 0LL); }
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
return b ? gcd(b, a % b) : a;
}
ll lcm(ll a, ll b) {
if (a < b) {
swap(a, b);
}
return a / gcd(a, b) * b;
}
template <class T> void chmax(T &a, T b) {
if (a < b) {
a = b;
}
}
template <class T> void chmin(T &a, T b) {
if (a > b) {
a = b;
}
}
const ll MOD = 1e9 + 7;
int main() {
ll N, Q;
cin >> N >> Q;
ll value[N + 1];
FILL(value, N + 1, 0LL);
queue<ll> edge[N + 1];
bool use[N + 1];
FILL(value, N + 1, false);
REP(count, N - 1) {
ll a, b;
cin >> a >> b;
edge[a].push(b);
edge[b].push(a);
}
REP(count, Q) {
ll p, x;
cin >> p >> x;
value[p] += x;
}
queue<ll> que;
que.push(1);
use[1] = true;
while (!que.empty()) {
ll cur = que.front();
que.pop();
while (!edge[cur].empty()) {
ll next = edge[cur].front();
edge[cur].pop();
if (use[next] == false) {
value[next] += value[cur];
use[next] = true;
que.push(next);
}
}
}
for (int i = 1; i <= N; ++i) {
if (i < N) {
printf("%Ld ", value[i]);
} else {
printf("%Ld\n", value[i]);
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = n; i > -1; --i)
#define ALL(a) (a).begin(), (a).end()
#define FILL(a, n, x) \
; \
REP(i, (n)) { (a)[i] = (x); }
#define CINA(a, n) \
; \
REP(i, (n)) { cin >> (a)[i]; }
#define FILL2(a, n, m, x) \
; \
REP(i, (n)) { \
REP(j, (m)) { (a)[i][j] = (x); } \
}
#define CINA2(a, n, m) \
; \
REP(i, (n)) { \
REP(j, (m)) { cin >> (a)[i][j]; } \
}
#define Liny "Yes\n"
#define Linn "No\n"
#define LINY "YES\n"
#define LINN "NO\n"
#define umap unordered_map
// cout << setfill('0') << right << setw(4) << 12; // "0012"
int keta(ll x) {
if (x < 10) {
return 1;
} else {
return keta(x / 10) + 1;
}
}
int keta_wa(ll x) {
if (x < 10) {
return x;
} else {
return keta_wa(x / 10) + x % 10;
}
}
int ctoi(char c) { return ((c >= '0' && c <= '9') ? c - '0' : 0); }
int __stoi(string s) { return atoi(s.c_str()); }
ll sum(ll a[], ll N) { return accumulate(a, a + N, 0LL); }
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
return b ? gcd(b, a % b) : a;
}
ll lcm(ll a, ll b) {
if (a < b) {
swap(a, b);
}
return a / gcd(a, b) * b;
}
template <class T> void chmax(T &a, T b) {
if (a < b) {
a = b;
}
}
template <class T> void chmin(T &a, T b) {
if (a > b) {
a = b;
}
}
const ll MOD = 1e9 + 7;
int main() {
ll N, Q;
cin >> N >> Q;
ll value[N + 1];
FILL(value, N + 1, 0LL);
queue<ll> edge[N + 1];
bool use[N + 1];
FILL(use, N + 1, false);
REP(count, N - 1) {
ll a, b;
cin >> a >> b;
edge[a].push(b);
edge[b].push(a);
}
REP(count, Q) {
ll p, x;
cin >> p >> x;
value[p] += x;
}
queue<ll> que;
que.push(1);
use[1] = true;
while (!que.empty()) {
ll cur = que.front();
que.pop();
while (!edge[cur].empty()) {
ll next = edge[cur].front();
edge[cur].pop();
if (use[next] == false) {
value[next] += value[cur];
use[next] = true;
que.push(next);
}
}
}
for (int i = 1; i <= N; ++i) {
if (i < N) {
printf("%Ld ", value[i]);
} else {
printf("%Ld\n", value[i]);
}
}
}
|
[
"identifier.change",
"call.arguments.change"
] | 738,336
| 738,337
|
u168017191
|
cpp
|
p02936
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = n; i > -1; --i)
#define ALL(a) (a).begin(), (a).end()
#define FILL(a, n, x) \
; \
REP(i, (n)) { (a)[i] = (x); }
#define CINA(a, n) \
; \
REP(i, (n)) { cin >> (a)[i]; }
#define FILL2(a, n, m, x) \
; \
REP(i, (n)) { \
REP(j, (m)) { (a)[i][j] = (x); } \
}
#define CINA2(a, n, m) \
; \
REP(i, (n)) { \
REP(j, (m)) { cin >> (a)[i][j]; } \
}
#define Liny "Yes\n"
#define Linn "No\n"
#define LINY "YES\n"
#define LINN "NO\n"
#define umap unordered_map
// cout << setfill('0') << right << setw(4) << 12; // "0012"
int keta(ll x) {
if (x < 10) {
return 1;
} else {
return keta(x / 10) + 1;
}
}
int keta_wa(ll x) {
if (x < 10) {
return x;
} else {
return keta_wa(x / 10) + x % 10;
}
}
int ctoi(char c) { return ((c >= '0' && c <= '9') ? c - '0' : 0); }
int __stoi(string s) { return atoi(s.c_str()); }
ll sum(ll a[], ll N) { return accumulate(a, a + N, 0LL); }
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
return b ? gcd(b, a % b) : a;
}
ll lcm(ll a, ll b) {
if (a < b) {
swap(a, b);
}
return a / gcd(a, b) * b;
}
template <class T> void chmax(T &a, T b) {
if (a < b) {
a = b;
}
}
template <class T> void chmin(T &a, T b) {
if (a > b) {
a = b;
}
}
const ll MOD = 1e9 + 7;
int main() {
ll N, Q;
cin >> N >> Q;
ll value[N + 1];
FILL(value, N + 1, 0LL);
queue<ll> edge[N + 1];
bool use[N + 1];
FILL(value, N + 1, false);
REP(count, N - 1) {
ll a, b;
cin >> a >> b;
edge[a].push(b);
edge[b].push(a);
}
REP(count, Q) {
ll p, x;
cin >> p >> x;
value[p] += x;
}
queue<ll> que;
que.push(1);
use[1] = true;
while (!que.empty()) {
ll cur = que.front();
que.pop();
while (!edge[cur].empty()) {
ll next = edge[cur].front();
edge[cur].pop();
if (use[next] == false) {
value[next] += value[cur];
use[next] = true;
que.push(next);
}
}
}
for (int i = 1; i <= N; ++i) {
if (i < N) {
printf("%Ld ", value[i]);
} else {
printf("%d\n", value[i]);
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPR(i, n) for (int i = n; i > -1; --i)
#define ALL(a) (a).begin(), (a).end()
#define FILL(a, n, x) \
; \
REP(i, (n)) { (a)[i] = (x); }
#define CINA(a, n) \
; \
REP(i, (n)) { cin >> (a)[i]; }
#define FILL2(a, n, m, x) \
; \
REP(i, (n)) { \
REP(j, (m)) { (a)[i][j] = (x); } \
}
#define CINA2(a, n, m) \
; \
REP(i, (n)) { \
REP(j, (m)) { cin >> (a)[i][j]; } \
}
#define Liny "Yes\n"
#define Linn "No\n"
#define LINY "YES\n"
#define LINN "NO\n"
#define umap unordered_map
// cout << setfill('0') << right << setw(4) << 12; // "0012"
int keta(ll x) {
if (x < 10) {
return 1;
} else {
return keta(x / 10) + 1;
}
}
int keta_wa(ll x) {
if (x < 10) {
return x;
} else {
return keta_wa(x / 10) + x % 10;
}
}
int ctoi(char c) { return ((c >= '0' && c <= '9') ? c - '0' : 0); }
int __stoi(string s) { return atoi(s.c_str()); }
ll sum(ll a[], ll N) { return accumulate(a, a + N, 0LL); }
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
return b ? gcd(b, a % b) : a;
}
ll lcm(ll a, ll b) {
if (a < b) {
swap(a, b);
}
return a / gcd(a, b) * b;
}
template <class T> void chmax(T &a, T b) {
if (a < b) {
a = b;
}
}
template <class T> void chmin(T &a, T b) {
if (a > b) {
a = b;
}
}
const ll MOD = 1e9 + 7;
int main() {
ll N, Q;
cin >> N >> Q;
ll value[N + 1];
FILL(value, N + 1, 0LL);
queue<ll> edge[N + 1];
bool use[N + 1];
FILL(use, N + 1, false);
REP(count, N - 1) {
ll a, b;
cin >> a >> b;
edge[a].push(b);
edge[b].push(a);
}
REP(count, Q) {
ll p, x;
cin >> p >> x;
value[p] += x;
}
queue<ll> que;
que.push(1);
use[1] = true;
while (!que.empty()) {
ll cur = que.front();
que.pop();
while (!edge[cur].empty()) {
ll next = edge[cur].front();
edge[cur].pop();
if (use[next] == false) {
value[next] += value[cur];
use[next] = true;
que.push(next);
}
}
}
for (int i = 1; i <= N; ++i) {
if (i < N) {
printf("%Ld ", value[i]);
} else {
printf("%Ld\n", value[i]);
}
}
}
|
[
"identifier.change",
"call.arguments.change",
"literal.string.change",
"io.output.change"
] | 738,338
| 738,337
|
u168017191
|
cpp
|
p02936
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, q;
cin >> n >> q;
vector<int> g[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);
}
int c[n]{};
for (int i = 0; i < q; i++) {
int a, b;
cin >> a >> b;
a--;
c[a] += b;
}
queue<int> qu;
qu.push(0);
int vis[n]{};
while (!qu.empty()) {
int a = qu.front();
qu.pop();
vis[a] = 1;
for (int b : g[a])
if (!vis[b]) {
c[b] += c[a];
qu.push(b);
}
}
for (int i = 0; i < n; i++) {
if (i != 0)
cout << ' ';
cout << i;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, q;
cin >> n >> q;
vector<int> g[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);
}
int c[n]{};
for (int i = 0; i < q; i++) {
int a, b;
cin >> a >> b;
a--;
c[a] += b;
}
queue<int> qu;
qu.push(0);
int vis[n]{};
while (!qu.empty()) {
int a = qu.front();
qu.pop();
vis[a] = 1;
for (int b : g[a])
if (!vis[b]) {
c[b] += c[a];
qu.push(b);
}
}
for (int i = 0; i < n; i++) {
if (i != 0)
cout << ' ';
cout << c[i];
}
return 0;
}
|
[] | 738,352
| 738,353
|
u804999113
|
cpp
|
p02936
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, q;
cin >> n >> q;
vector<int> g[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);
}
int c[n]{};
for (int i = 0; i < q; i++) {
int a, b;
cin >> a >> b;
a--;
c[a] += b;
}
queue<int> qu;
qu.push(0);
int vis[n]{};
while (!qu.empty()) {
int a = qu.front();
qu.pop();
vis[a] = 1;
for (int b : g[a])
if (!vis[b]) {
b += c[a];
qu.push(b);
}
}
for (int i = 0; i < n; i++) {
if (i != 0)
cout << ' ';
cout << i;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, q;
cin >> n >> q;
vector<int> g[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);
}
int c[n]{};
for (int i = 0; i < q; i++) {
int a, b;
cin >> a >> b;
a--;
c[a] += b;
}
queue<int> qu;
qu.push(0);
int vis[n]{};
while (!qu.empty()) {
int a = qu.front();
qu.pop();
vis[a] = 1;
for (int b : g[a])
if (!vis[b]) {
c[b] += c[a];
qu.push(b);
}
}
for (int i = 0; i < n; i++) {
if (i != 0)
cout << ' ';
cout << c[i];
}
return 0;
}
|
[] | 738,354
| 738,353
|
u804999113
|
cpp
|
p02936
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll MOD = 1000000007;
const ll INF = 1000000000000000000L;
#ifdef __DEBUG
/**
* For DEBUG
* https://github.com/ta7uw/cpp-pyprint
*/
#include "cpp-pyprint/pyprint.h"
#endif
bool visited[200005];
ll ans[200005];
void dfs(Graph &graph, int v, vector<ll> &counter, ll plus) {
visited[v] = true;
ans[v] += counter[v] + plus;
for (int u : graph[v]) {
if (!visited[u]) {
dfs(graph, u, counter, plus + counter[v]);
}
}
}
void Main() {
int N, Q;
cin >> N >> Q;
Graph graph(N);
rep(i, N - 1) {
int a, b;
cin >> a >> b;
a--;
b--;
graph[a].push_back(b);
graph[b].push_back(a);
}
vector<ll> counter(Q, 0);
rep(q, Q) {
int p, x;
cin >> p >> x;
p--;
counter[p] += x;
}
dfs(graph, 0, counter, 0);
rep(i, N) { cout << ans[i] << ' '; }
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll MOD = 1000000007;
const ll INF = 1000000000000000000L;
#ifdef __DEBUG
/**
* For DEBUG
* https://github.com/ta7uw/cpp-pyprint
*/
#include "cpp-pyprint/pyprint.h"
#endif
bool visited[200005];
ll ans[200005];
void dfs(Graph &graph, int v, vector<ll> &counter, ll plus) {
visited[v] = true;
ans[v] += counter[v] + plus;
for (int u : graph[v]) {
if (!visited[u]) {
dfs(graph, u, counter, plus + counter[v]);
}
}
}
void Main() {
int N, Q;
cin >> N >> Q;
Graph graph(N);
rep(i, N - 1) {
int a, b;
cin >> a >> b;
a--;
b--;
graph[a].push_back(b);
graph[b].push_back(a);
}
vector<ll> counter(N, 0);
rep(q, Q) {
int p, x;
cin >> p >> x;
p--;
counter[p] += x;
}
dfs(graph, 0, counter, 0);
rep(i, N) { cout << ans[i] << ' '; }
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
return 0;
}
|
[
"identifier.change",
"call.arguments.change"
] | 738,355
| 738,356
|
u427344224
|
cpp
|
p02936
|
// https://ei1333.github.io/luzhiled/
// http://beet-aizu.hatenablog.com/entry/2017/01/04/113233
// http://www.prefield.com/algorithm/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vd = vector<ld>;
using vs = vector<string>;
using vb = vector<bool>;
using vvl = vector<vector<ll>>;
using vvd = vector<vector<ld>>;
using vvs = vector<vector<string>>;
using vvb = vector<vector<bool>>;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
template <class T> using vc = vector<T>;
template <class T> using vvc = vector<vector<T>>;
using Graph = vector<vector<ll>>;
const ll INF = 1LL << 60;
void init() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
const ll tl = 1'000'000'007;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REREP(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, a, n) for (ll i = a; i < n; i++)
#define REFOR(i, n, a) for (ll i = n; i >= a; i--)
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) //被り削除
#define debug cout << "line : " << __LINE__ << " debug" << endl;
#define ini(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define inl(...) \
long long __VA_ARGS__; \
in(__VA_ARGS__)
#define ind(...) \
long double __VA_ARGS__; \
in(__VA_ARGS__)
#define ins(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define inc(...) \
char __VA_ARGS__; \
in(__VA_ARGS__)
void in() {}
template <typename T, class... U> void in(T &t, U &...u) {
cin >> t;
in(u...);
}
void out() { cout << endl; }
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);
}
#define in1(A) REP(i, A.size()) in(A[i]);
#define in2(A, B) REP(i, A.size()) in(A[i], B[i]);
#define in3(s, t, u) \
REP(i, sz(s)) { in(s[i], t[i], u[i]); }
#define in4(s, t, u, v) \
REP(i, sz(s)) { in(s[i], t[i], u[i], v[i]); }
#define each(x, v) for (auto &x : v)
#define all(v) (v).begin(), (v).end()
#define sz(v) ((int)(v).size())
struct Point {
ld x, y;
};
ld dist(Point a, Point b) {
return sqrt(abs(a.x - b.x) * abs(a.x - b.x) +
abs(a.y - b.y) * abs(a.y - b.y));
} // ２点間の距離
ll gcd(ll a, ll b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll fact(ll n) {
if (n < 2)
return 1;
return (n * fact(n - 1)) % tl;
} //階乗
inline ll updiv(ll a, ll b) { return (a + b - 1) / b; } //切り上げ
template <typename T, typename U> ll ceil(T a, U b) { return (a + b - 1) / b; }
template <class A, class B> inline bool chmax(A &a, const B &b) {
return b > a && (a = b, true);
}
template <class A, class B> inline bool chmin(A &a, const B &b) {
return b < a && (a = b, true);
}
//-------------------------------------------------------------------------------------------------
vl ans;
vl cost;
Graph g;
void dfs(ll now, ll pre, ll c) {
ans[now] += c;
out(now);
each(next, g[now]) {
if (next == pre)
continue;
dfs(next, now, cost[next] + c);
}
return;
}
int main() {
init();
inl(n, q);
ans.resize(n + 1);
cost.resize(n + 1);
g.resize(n + 1);
REP(i, n - 1) {
inl(a, b);
g[a].pb(b);
g[b].pb(a);
}
REP(i, q) {
inl(p, x);
cost[p] += x;
}
dfs(1, -1, cost[1]);
REP(i, n) { cout << ans[i + 1] << ((i == n - 1) ? "\n" : " "); }
}
|
// https://ei1333.github.io/luzhiled/
// http://beet-aizu.hatenablog.com/entry/2017/01/04/113233
// http://www.prefield.com/algorithm/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vd = vector<ld>;
using vs = vector<string>;
using vb = vector<bool>;
using vvl = vector<vector<ll>>;
using vvd = vector<vector<ld>>;
using vvs = vector<vector<string>>;
using vvb = vector<vector<bool>>;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
template <class T> using vc = vector<T>;
template <class T> using vvc = vector<vector<T>>;
using Graph = vector<vector<ll>>;
const ll INF = 1LL << 60;
void init() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
const ll tl = 1'000'000'007;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REREP(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, a, n) for (ll i = a; i < n; i++)
#define REFOR(i, n, a) for (ll i = n; i >= a; i--)
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) //被り削除
#define debug cout << "line : " << __LINE__ << " debug" << endl;
#define ini(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define inl(...) \
long long __VA_ARGS__; \
in(__VA_ARGS__)
#define ind(...) \
long double __VA_ARGS__; \
in(__VA_ARGS__)
#define ins(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define inc(...) \
char __VA_ARGS__; \
in(__VA_ARGS__)
void in() {}
template <typename T, class... U> void in(T &t, U &...u) {
cin >> t;
in(u...);
}
void out() { cout << endl; }
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);
}
#define in1(A) REP(i, A.size()) in(A[i]);
#define in2(A, B) REP(i, A.size()) in(A[i], B[i]);
#define in3(s, t, u) \
REP(i, sz(s)) { in(s[i], t[i], u[i]); }
#define in4(s, t, u, v) \
REP(i, sz(s)) { in(s[i], t[i], u[i], v[i]); }
#define each(x, v) for (auto &x : v)
#define all(v) (v).begin(), (v).end()
#define sz(v) ((int)(v).size())
struct Point {
ld x, y;
};
ld dist(Point a, Point b) {
return sqrt(abs(a.x - b.x) * abs(a.x - b.x) +
abs(a.y - b.y) * abs(a.y - b.y));
} // ２点間の距離
ll gcd(ll a, ll b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll fact(ll n) {
if (n < 2)
return 1;
return (n * fact(n - 1)) % tl;
} //階乗
inline ll updiv(ll a, ll b) { return (a + b - 1) / b; } //切り上げ
template <typename T, typename U> ll ceil(T a, U b) { return (a + b - 1) / b; }
template <class A, class B> inline bool chmax(A &a, const B &b) {
return b > a && (a = b, true);
}
template <class A, class B> inline bool chmin(A &a, const B &b) {
return b < a && (a = b, true);
}
//-------------------------------------------------------------------------------------------------
vl ans;
vl cost;
Graph g;
void dfs(ll now, ll pre, ll c) {
ans[now] += c;
// out(now);
each(next, g[now]) {
if (next == pre)
continue;
dfs(next, now, cost[next] + c);
}
return;
}
int main() {
init();
inl(n, q);
ans.resize(n + 1);
cost.resize(n + 1);
g.resize(n + 1);
REP(i, n - 1) {
inl(a, b);
g[a].pb(b);
g[b].pb(a);
}
REP(i, q) {
inl(p, x);
cost[p] += x;
}
dfs(1, -1, cost[1]);
REP(i, n) { cout << ans[i + 1] << ((i == n - 1) ? "\n" : " "); }
}
|
[
"call.remove"
] | 738,386
| 738,387
|
u852839243
|
cpp
|
p02936
|
// https://ei1333.github.io/luzhiled/
// http://beet-aizu.hatenablog.com/entry/2017/01/04/113233
// http://www.prefield.com/algorithm/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vd = vector<ld>;
using vs = vector<string>;
using vb = vector<bool>;
using vvl = vector<vector<ll>>;
using vvd = vector<vector<ld>>;
using vvs = vector<vector<string>>;
using vvb = vector<vector<bool>>;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
template <class T> using vc = vector<T>;
template <class T> using vvc = vector<vector<T>>;
using Graph = vector<vector<ll>>;
const ll INF = 1LL << 60;
void init() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
const ll tl = 1'000'000'007;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REREP(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, a, n) for (ll i = a; i < n; i++)
#define REFOR(i, n, a) for (ll i = n; i >= a; i--)
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) //被り削除
#define debug cout << "line : " << __LINE__ << " debug" << endl;
#define ini(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define inl(...) \
long long __VA_ARGS__; \
in(__VA_ARGS__)
#define ind(...) \
long double __VA_ARGS__; \
in(__VA_ARGS__)
#define ins(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define inc(...) \
char __VA_ARGS__; \
in(__VA_ARGS__)
void in() {}
template <typename T, class... U> void in(T &t, U &...u) {
cin >> t;
in(u...);
}
void out() { cout << endl; }
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);
}
#define in1(A) REP(i, A.size()) in(A[i]);
#define in2(A, B) REP(i, A.size()) in(A[i], B[i]);
#define in3(s, t, u) \
REP(i, sz(s)) { in(s[i], t[i], u[i]); }
#define in4(s, t, u, v) \
REP(i, sz(s)) { in(s[i], t[i], u[i], v[i]); }
#define each(x, v) for (auto &x : v)
#define all(v) (v).begin(), (v).end()
#define sz(v) ((int)(v).size())
struct Point {
ld x, y;
};
ld dist(Point a, Point b) {
return sqrt(abs(a.x - b.x) * abs(a.x - b.x) +
abs(a.y - b.y) * abs(a.y - b.y));
} // ２点間の距離
ll gcd(ll a, ll b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll fact(ll n) {
if (n < 2)
return 1;
return (n * fact(n - 1)) % tl;
} //階乗
inline ll updiv(ll a, ll b) { return (a + b - 1) / b; } //切り上げ
template <typename T, typename U> ll ceil(T a, U b) { return (a + b - 1) / b; }
template <class A, class B> inline bool chmax(A &a, const B &b) {
return b > a && (a = b, true);
}
template <class A, class B> inline bool chmin(A &a, const B &b) {
return b < a && (a = b, true);
}
//-------------------------------------------------------------------------------------------------
vl ans;
vl cost;
Graph g;
void dfs(ll now, ll pre, ll c) {
ans[now] += c;
out(now);
each(next, g[now]) {
if (next == pre)
continue;
dfs(next, now, cost[next] + c);
}
return;
}
int main() {
init();
inl(n, q);
ans.resize(n + 1);
cost.resize(n + 1);
g.resize(n + 1);
REP(i, n - 1) {
inl(a, b);
g[a].pb(b);
g[b].pb(a);
}
REP(i, q) {
inl(p, x);
cost[p] = x;
}
dfs(1, -1, cost[1]);
REP(i, n) { cout << ans[i + 1] << ((i == n - 1) ? "\n" : " "); }
}
|
// https://ei1333.github.io/luzhiled/
// http://beet-aizu.hatenablog.com/entry/2017/01/04/113233
// http://www.prefield.com/algorithm/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vd = vector<ld>;
using vs = vector<string>;
using vb = vector<bool>;
using vvl = vector<vector<ll>>;
using vvd = vector<vector<ld>>;
using vvs = vector<vector<string>>;
using vvb = vector<vector<bool>>;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
template <class T> using vc = vector<T>;
template <class T> using vvc = vector<vector<T>>;
using Graph = vector<vector<ll>>;
const ll INF = 1LL << 60;
void init() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
const ll tl = 1'000'000'007;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REREP(i, n) for (ll i = n; i >= 0; i--)
#define FOR(i, a, n) for (ll i = a; i < n; i++)
#define REFOR(i, n, a) for (ll i = n; i >= a; i--)
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) //被り削除
#define debug cout << "line : " << __LINE__ << " debug" << endl;
#define ini(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define inl(...) \
long long __VA_ARGS__; \
in(__VA_ARGS__)
#define ind(...) \
long double __VA_ARGS__; \
in(__VA_ARGS__)
#define ins(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
#define inc(...) \
char __VA_ARGS__; \
in(__VA_ARGS__)
void in() {}
template <typename T, class... U> void in(T &t, U &...u) {
cin >> t;
in(u...);
}
void out() { cout << endl; }
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);
}
#define in1(A) REP(i, A.size()) in(A[i]);
#define in2(A, B) REP(i, A.size()) in(A[i], B[i]);
#define in3(s, t, u) \
REP(i, sz(s)) { in(s[i], t[i], u[i]); }
#define in4(s, t, u, v) \
REP(i, sz(s)) { in(s[i], t[i], u[i], v[i]); }
#define each(x, v) for (auto &x : v)
#define all(v) (v).begin(), (v).end()
#define sz(v) ((int)(v).size())
struct Point {
ld x, y;
};
ld dist(Point a, Point b) {
return sqrt(abs(a.x - b.x) * abs(a.x - b.x) +
abs(a.y - b.y) * abs(a.y - b.y));
} // ２点間の距離
ll gcd(ll a, ll b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll fact(ll n) {
if (n < 2)
return 1;
return (n * fact(n - 1)) % tl;
} //階乗
inline ll updiv(ll a, ll b) { return (a + b - 1) / b; } //切り上げ
template <typename T, typename U> ll ceil(T a, U b) { return (a + b - 1) / b; }
template <class A, class B> inline bool chmax(A &a, const B &b) {
return b > a && (a = b, true);
}
template <class A, class B> inline bool chmin(A &a, const B &b) {
return b < a && (a = b, true);
}
//-------------------------------------------------------------------------------------------------
vl ans;
vl cost;
Graph g;
void dfs(ll now, ll pre, ll c) {
ans[now] += c;
// out(now);
each(next, g[now]) {
if (next == pre)
continue;
dfs(next, now, cost[next] + c);
}
return;
}
int main() {
init();
inl(n, q);
ans.resize(n + 1);
cost.resize(n + 1);
g.resize(n + 1);
REP(i, n - 1) {
inl(a, b);
g[a].pb(b);
g[b].pb(a);
}
REP(i, q) {
inl(p, x);
cost[p] += x;
}
dfs(1, -1, cost[1]);
REP(i, n) { cout << ans[i + 1] << ((i == n - 1) ? "\n" : " "); }
}
|
[
"call.remove",
"assignment.value.change"
] | 738,388
| 738,387
|
u852839243
|
cpp
|
p02936
|
#include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define REPV(iter, v) \
for (auto(iter) = (v).begin(); (iter) != (v).end(); ++(iter))
#define ALL(v) (v).begin(), (v).end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main() {
ll N, Q;
cin >> N >> Q;
vector<ll> g[N];
REP(i, N - 1) {
ll a, b;
cin >> a >> b;
a--;
b--;
g[a].push_back(b);
g[b].push_back(a);
}
vector<ll> p(Q), x(Q);
REP(i, Q) {
cin >> p[i] >> x[i];
p[i]--;
}
vector<ll> count(N, 0);
REP(i, N) { count[p[i]] += x[i]; }
queue<ll> q;
vector<bool> visited(N, false);
q.push(0);
while (!q.empty()) {
ll now = q.front();
q.pop();
visited[now] = true;
REPV(iter, g[now]) {
if (!visited[*iter]) {
q.push(*iter);
count[*iter] += count[now];
}
}
}
REP(i, N) cout << count[i] << " ";
}
|
#include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define REPV(iter, v) \
for (auto(iter) = (v).begin(); (iter) != (v).end(); ++(iter))
#define ALL(v) (v).begin(), (v).end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main() {
ll N, Q;
cin >> N >> Q;
vector<ll> g[N];
REP(i, N - 1) {
ll a, b;
cin >> a >> b;
a--;
b--;
g[a].push_back(b);
g[b].push_back(a);
}
vector<ll> p(Q), x(Q);
REP(i, Q) {
cin >> p[i] >> x[i];
p[i]--;
}
vector<ll> count(N, 0);
REP(i, Q) { count[p[i]] += x[i]; }
queue<ll> q;
vector<bool> visited(N, false);
q.push(0);
while (!q.empty()) {
ll now = q.front();
q.pop();
visited[now] = true;
REPV(iter, g[now]) {
if (!visited[*iter]) {
q.push(*iter);
count[*iter] += count[now];
}
}
}
REP(i, N) cout << count[i] << " ";
}
|
[] | 738,392
| 738,393
|
u188706971
|
cpp
|
p02936
|
#include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
#define int long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
#define MEM_SIZE 10000
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()
// int DP[MEM_SIZE][MEM_SIZE] = {0};
// int GMEM[MEM_SIZE][MEM_SIZE] = {0};
template <typename T> void DEBUG(T e) {
if (DEBUG_OUT == false)
return;
std::cout << e << " ";
}
template <typename T> void DEBUG(const std::vector<T> &v) {
if (DEBUG_OUT == false)
return;
for (const auto &e : v) {
std::cout << e << " ";
}
std::cout << std::endl;
}
template <typename T> void DEBUG(const std::vector<std::vector<T>> &vv) {
if (DEBUG_OUT == false)
return;
for (const auto &v : vv) {
DEBUG(v);
}
}
template <class T, class... Ts> void DEBUG(T d, Ts... e) {
if (DEBUG_OUT == false)
return;
DEBUG(d);
DEBUG(e...);
}
template <class T> void corner(bool flg, T hoge) {
if (flg) {
cout << hoge << endl;
exit(0);
}
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
void DFS(int V, vector<vector<int>> &GRAPH, vector<int> &used, int pV,
vector<int> &counter) {
// if(used[V] == 1)return;
used[V] = 1;
counter[V] = pV + counter[V];
// DEBUG(V);
for (int i = 0; i < GRAPH[V].size(); i++) {
if (used[GRAPH[V][i]] == 0) {
DFS(GRAPH[V][i], GRAPH, used, counter[V], counter);
}
}
return;
}
void solve(void) {
int N, Q;
cin >> N >> Q;
vector<vector<int>> GRAPH(N);
for (int i = 0; i < N - 1; i++) {
int A, B;
cin >> A >> B;
A--;
B--;
GRAPH[A].push_back(B);
GRAPH[B].push_back(A);
}
vector<int> used(N, 0);
vector<int> counter(N, 0);
for (int q = 0; q < Q; q++) {
int p, x;
cin >> p >> x;
p--;
counter[p] = x;
}
DFS(0, GRAPH, used, 0LL, counter);
for (int i = 0; i < N; i++) {
if (i != 0)
cout << char(32);
cout << counter[i];
}
cout << endl;
return;
}
int32_t main(int32_t argc, const char *argv[]) {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout << std::fixed;
std::cout << std::setprecision(9);
solve();
return 0;
}
|
#include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
#define int long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
#define MEM_SIZE 10000
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()
// int DP[MEM_SIZE][MEM_SIZE] = {0};
// int GMEM[MEM_SIZE][MEM_SIZE] = {0};
template <typename T> void DEBUG(T e) {
if (DEBUG_OUT == false)
return;
std::cout << e << " ";
}
template <typename T> void DEBUG(const std::vector<T> &v) {
if (DEBUG_OUT == false)
return;
for (const auto &e : v) {
std::cout << e << " ";
}
std::cout << std::endl;
}
template <typename T> void DEBUG(const std::vector<std::vector<T>> &vv) {
if (DEBUG_OUT == false)
return;
for (const auto &v : vv) {
DEBUG(v);
}
}
template <class T, class... Ts> void DEBUG(T d, Ts... e) {
if (DEBUG_OUT == false)
return;
DEBUG(d);
DEBUG(e...);
}
template <class T> void corner(bool flg, T hoge) {
if (flg) {
cout << hoge << endl;
exit(0);
}
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
void DFS(int V, vector<vector<int>> &GRAPH, vector<int> &used, int pV,
vector<int> &counter) {
// if(used[V] == 1)return;
used[V] = 1;
counter[V] = pV + counter[V];
// DEBUG(V);
for (int i = 0; i < GRAPH[V].size(); i++) {
if (used[GRAPH[V][i]] == 0) {
DFS(GRAPH[V][i], GRAPH, used, counter[V], counter);
}
}
return;
}
void solve(void) {
int N, Q;
cin >> N >> Q;
vector<vector<int>> GRAPH(N);
for (int i = 0; i < N - 1; i++) {
int A, B;
cin >> A >> B;
A--;
B--;
GRAPH[A].push_back(B);
GRAPH[B].push_back(A);
}
vector<int> used(N, 0);
vector<int> counter(N, 0);
for (int q = 0; q < Q; q++) {
int p, x;
cin >> p >> x;
p--;
counter[p] += x;
}
DFS(0, GRAPH, used, 0LL, counter);
for (int i = 0; i < N; i++) {
if (i != 0)
cout << char(32);
cout << counter[i];
}
cout << endl;
return;
}
int32_t main(int32_t argc, const char *argv[]) {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout << std::fixed;
std::cout << std::setprecision(9);
solve();
return 0;
}
|
[
"assignment.value.change"
] | 738,410
| 738,411
|
u221285045
|
cpp
|
p02936
|
#include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
#define int long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
#define MEM_SIZE 10000
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()
// int DP[MEM_SIZE][MEM_SIZE] = {0};
// int GMEM[MEM_SIZE][MEM_SIZE] = {0};
template <typename T> void DEBUG(T e) {
if (DEBUG_OUT == false)
return;
std::cout << e << std::endl;
}
template <typename T> void DEBUG(const std::vector<T> &v) {
if (DEBUG_OUT == false)
return;
for (const auto &e : v) {
std::cout << e << " ";
}
std::cout << std::endl;
}
template <typename T> void DEBUG(const std::vector<std::vector<T>> &vv) {
if (DEBUG_OUT == false)
return;
for (const auto &v : vv) {
DEBUG(v);
}
}
template <class T, class X> void DEBUG(X d, T e) {
if (DEBUG_OUT == false)
return;
std::cout << d << " ";
DEBUG(e);
};
template <class T> void corner(bool flg, T hoge) {
if (flg) {
cout << hoge << endl;
exit(0);
}
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
void DFS(int V, int SUM, vector<vector<int>> &GRAPH, vector<int> &used,
vector<int> &COUNTER, vector<int> &ANS) {
// if(used[V] == 1)return;
used[V] = 1;
SUM += COUNTER[V];
ANS[V] = SUM;
DEBUG(V);
for (int i = 0; i < GRAPH[V].size(); i++) {
if (used[GRAPH[V][i]] == 0) {
DFS(GRAPH[V][i], SUM, GRAPH, used, COUNTER, ANS);
}
}
return;
}
void solve(void) {
int N, Q;
cin >> N >> Q;
vector<int> COUNTER(N, 0);
vector<vector<int>> GRAPH(N);
for (int i = 0; i < N - 1; i++) {
int A, B;
cin >> A >> B;
A--;
B--;
GRAPH[A].push_back(B);
GRAPH[B].push_back(A);
}
for (int i = 0; i < Q; i++) {
int A, B;
cin >> A >> B;
A--;
COUNTER[A] += B;
}
vector<int> used(N, 0);
vector<int> ANS(N, 0);
DFS(0, 0, GRAPH, used, COUNTER, ANS);
for (int i = 0; i < ANS.size(); i++) {
if (i != 0)
cout << " ";
cout << ANS[i];
}
cout << endl;
return;
}
int32_t main(int32_t argc, const char *argv[]) {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout << std::fixed;
std::cout << std::setprecision(9);
solve();
return 0;
}
|
#include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
#define int long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
#define MEM_SIZE 10000
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()
// int DP[MEM_SIZE][MEM_SIZE] = {0};
// int GMEM[MEM_SIZE][MEM_SIZE] = {0};
template <typename T> void DEBUG(T e) {
if (DEBUG_OUT == false)
return;
std::cout << e << std::endl;
}
template <typename T> void DEBUG(const std::vector<T> &v) {
if (DEBUG_OUT == false)
return;
for (const auto &e : v) {
std::cout << e << " ";
}
std::cout << std::endl;
}
template <typename T> void DEBUG(const std::vector<std::vector<T>> &vv) {
if (DEBUG_OUT == false)
return;
for (const auto &v : vv) {
DEBUG(v);
}
}
template <class T, class X> void DEBUG(X d, T e) {
if (DEBUG_OUT == false)
return;
std::cout << d << " ";
DEBUG(e);
};
template <class T> void corner(bool flg, T hoge) {
if (flg) {
cout << hoge << endl;
exit(0);
}
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
void DFS(int V, int SUM, vector<vector<int>> &GRAPH, vector<int> &used,
vector<int> &COUNTER, vector<int> &ANS) {
// if(used[V] == 1)return;
used[V] = 1;
SUM += COUNTER[V];
ANS[V] = SUM;
// DEBUG(V);
for (int i = 0; i < GRAPH[V].size(); i++) {
if (used[GRAPH[V][i]] == 0) {
DFS(GRAPH[V][i], SUM, GRAPH, used, COUNTER, ANS);
}
}
return;
}
void solve(void) {
int N, Q;
cin >> N >> Q;
vector<int> COUNTER(N, 0);
vector<vector<int>> GRAPH(N);
for (int i = 0; i < N - 1; i++) {
int A, B;
cin >> A >> B;
A--;
B--;
GRAPH[A].push_back(B);
GRAPH[B].push_back(A);
}
for (int i = 0; i < Q; i++) {
int A, B;
cin >> A >> B;
A--;
COUNTER[A] += B;
}
vector<int> used(N, 0);
vector<int> ANS(N, 0);
DFS(0, 0, GRAPH, used, COUNTER, ANS);
for (int i = 0; i < ANS.size(); i++) {
if (i != 0)
cout << " ";
cout << ANS[i];
}
cout << endl;
return;
}
int32_t main(int32_t argc, const char *argv[]) {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout << std::fixed;
std::cout << std::setprecision(9);
solve();
return 0;
}
|
[
"call.remove"
] | 738,412
| 738,413
|
u221285045
|
cpp
|
p02936
|
#include <bits/stdc++.h>
using namespace std;
vector<int> graph[100000];
vector<int> counter(100000, 0);
vector<int> ans(100000, 0);
void dfs(int n, int c) {
ans[n] = c + counter[n];
for (auto t : graph[n]) {
dfs(t, ans[n]);
}
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N, Q;
cin >> N >> Q;
for (int i = 0; i < N - 1; i++) {
int a, b;
cin >> a >> b;
a--, b--;
graph[a].push_back(b);
}
for (int i = 0; i < Q; i++) {
int p, x;
cin >> p >> x;
p--;
counter[p] += x;
}
set<int> in;
for (int i = 0; i < N; i++)
in.insert(i);
for (int i = 0; i < N; i++) {
for (auto ee : graph[i]) {
in.erase(ee);
}
}
for (int i = 0; i < N; i++) {
if (in.count(i))
continue;
dfs(i, 0);
}
for (int i = 0; i < N; i++) {
cout << ans[i] << ' ';
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<int> graph[200000];
vector<int> counter(200000, 0);
vector<int> ans(200000, 0);
void dfs(int n, int c) {
ans[n] = c + counter[n];
for (auto t : graph[n]) {
dfs(t, ans[n]);
}
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N, Q;
cin >> N >> Q;
for (int i = 0; i < N - 1; i++) {
int a, b;
cin >> a >> b;
a--, b--;
graph[a].push_back(b);
}
for (int i = 0; i < Q; i++) {
int p, x;
cin >> p >> x;
p--;
counter[p] += x;
}
set<int> in;
for (int i = 0; i < N; i++)
in.insert(i);
for (int i = 0; i < N; i++) {
for (auto ee : graph[i]) {
in.erase(ee);
}
}
for (int i = 0; i < N; i++) {
if (in.count(i) == 0)
continue;
dfs(i, 0);
}
for (int i = 0; i < N; i++) {
cout << ans[i] << ' ';
}
cout << endl;
return 0;
}
|
[
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.arguments.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 738,418
| 738,417
|
u500092662
|
cpp
|
p02936
|
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define pii pair<int, int>
#define ll long long
#define el '\n'
using namespace std;
const int N = 2e5 + 10;
int ans[N];
vector<int> adl[N];
int n, q;
int lazy[N];
void dfs(int node, int p) {
ans[node] = lazy[node];
for (auto child : adl[node]) {
if (child == p)
continue;
lazy[child] += lazy[node];
dfs(child, node);
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> q;
for (int i = 1; i <= n; i++) {
int a, b;
cin >> a >> b;
adl[a].pb(b);
adl[b].pb(a);
}
while (q--) {
int node, val;
cin >> node >> val;
lazy[node] += val;
}
dfs(1, 1);
for (int i = 1; i <= n; i++) {
cout << ans[i] << " ";
}
cout << el;
return 0;
}
|
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define pii pair<int, int>
#define ll long long
#define el '\n'
using namespace std;
const int N = 2e5 + 10;
int ans[N];
vector<int> adl[N];
int n, q;
int lazy[N];
void dfs(int node, int p) {
ans[node] = lazy[node];
for (auto child : adl[node]) {
if (child == p)
continue;
lazy[child] += lazy[node];
dfs(child, node);
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n >> q;
for (int i = 1; i < n; i++) {
int a, b;
cin >> a >> b;
adl[a].pb(b);
adl[b].pb(a);
}
while (q--) {
int node, val;
cin >> node >> val;
lazy[node] += val;
}
dfs(1, 1);
for (int i = 1; i <= n; i++) {
cout << ans[i] << " ";
}
cout << el;
return 0;
}
|
[
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 738,485
| 738,486
|
u287988203
|
cpp
|
p02936
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
struct node {
int point;
int qPoint;
bool kita;
vector<int> next;
};
void dfs(vector<node> &tree, int now, int ngo) {
if (tree[now].kita)
return;
tree[now].kita = 1;
tree[now].point = tree[now].qPoint + ngo;
for (int i = 0; i < tree[now].next.size(); ++i) {
dfs(tree, tree[now].next[i], ngo + tree[now].qPoint);
}
}
int main() {
int n, q;
cin >> n >> q;
vector<node> tree(n, {0, 0, 0, {}});
for (int i = 0; i < n - 1; ++i) {
int a, b;
cin >> a;
cin >> b;
tree[a - 1].next.push_back(b - 1);
tree[b - 1].next.push_back(a - 1);
}
for (int i = 0; i < q; ++i) {
int p, x;
cin >> p;
cin >> x;
tree[p - 1].qPoint = x;
}
dfs(tree, 0, 0);
for (int i = 0; i < tree.size(); ++i)
cout << tree[i].point << " ";
}
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
struct node {
int point;
int qPoint;
bool kita;
vector<int> next;
};
void dfs(vector<node> &tree, int now, int ngo) {
if (tree[now].kita)
return;
tree[now].kita = 1;
tree[now].point = tree[now].qPoint + ngo;
for (int i = 0; i < tree[now].next.size(); ++i) {
dfs(tree, tree[now].next[i], ngo + tree[now].qPoint);
}
}
int main() {
int n, q;
cin >> n >> q;
vector<node> tree(n, {0, 0, 0, {}});
for (int i = 0; i < n - 1; ++i) {
int a, b;
cin >> a;
cin >> b;
tree[a - 1].next.push_back(b - 1);
tree[b - 1].next.push_back(a - 1);
}
for (int i = 0; i < q; ++i) {
int p, x;
cin >> p;
cin >> x;
tree[p - 1].qPoint += x;
}
dfs(tree, 0, 0);
for (int i = 0; i < tree.size(); ++i)
cout << tree[i].point << " ";
}
|
[
"assignment.value.change"
] | 738,512
| 738,513
|
u386131832
|
cpp
|
p02936
|
#include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
inline int readInt() {
int x;
scanf("%d", &x);
return x;
}
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a) * (a))
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
// repetition
//------------------------------------------
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define MOD 1000000007
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
struct Edge {
int to, from;
ll cost;
Edge(int from, int to, ll cost) : from(from), to(to), cost(cost) {}
};
typedef vector<vector<Edge>> AdjList;
AdjList graph;
vector<vector<int>> G(200010);
ll ans[200010];
ll plusl[200010];
void dfs(int v, ll x, int prev) {
ans[v] = x;
for (int i = 0; i < G[v].size(); ++i) {
int u = G[v][i];
if (u == prev)
continue;
dfs(u, x + plusl[u], u);
}
}
int main() {
// cin.tie(0);
// ios::sync_with_stdio(false);
// cout << fixed << setprecision(10);
int N, Q;
cin >> N >> Q;
REP(i, N - 1) {
ll a, b;
cin >> a >> b;
a--;
b--;
G[a].push_back(b);
G[b].push_back(a);
}
set<ll> st;
REP(i, Q) {
ll p, x;
cin >> p >> x;
p--;
st.insert(p);
plusl[p] += x;
}
dfs(0, plusl[0], -1);
REP(i, N) {
if (i)
cout << " ";
cout << ans[i];
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
inline int readInt() {
int x;
scanf("%d", &x);
return x;
}
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a) * (a))
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
// repetition
//------------------------------------------
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define MOD 1000000007
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
struct Edge {
int to, from;
ll cost;
Edge(int from, int to, ll cost) : from(from), to(to), cost(cost) {}
};
typedef vector<vector<Edge>> AdjList;
AdjList graph;
vector<vector<int>> G(200010);
ll ans[200010];
ll plusl[200010];
void dfs(int v, ll x, int prev) {
ans[v] = x;
for (int i = 0; i < G[v].size(); ++i) {
int u = G[v][i];
if (u == prev)
continue;
dfs(u, x + plusl[u], v);
}
}
int main() {
// cin.tie(0);
// ios::sync_with_stdio(false);
// cout << fixed << setprecision(10);
int N, Q;
cin >> N >> Q;
REP(i, N - 1) {
ll a, b;
cin >> a >> b;
a--;
b--;
G[a].push_back(b);
G[b].push_back(a);
}
set<ll> st;
REP(i, Q) {
ll p, x;
cin >> p >> x;
p--;
st.insert(p);
plusl[p] += x;
}
dfs(0, plusl[0], -1);
REP(i, N) {
if (i)
cout << " ";
cout << ans[i];
}
cout << endl;
return 0;
}
|
[
"identifier.change",
"call.arguments.change"
] | 738,522
| 738,523
|
u181719868
|
cpp
|
p02936
|
#include <iostream>
#include <vector>
using Tree = std::vector<std::vector<uint32_t>>;
Tree V;
std::vector<uint32_t> values;
void Run(uint32_t i, uint32_t f, uint32_t sum) {
auto c = values[i];
values[i] += sum;
for (const auto &e : V[i]) {
if (e != f) {
Run(e, i, sum + c);
}
}
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
uint32_t N, Q;
std::cin >> N >> Q;
V.resize(N);
values.resize(N);
for (uint32_t i = 0; i < N - 1; i++) {
uint32_t ti, ni;
std::cin >> ti >> ni;
V[ti - 1].push_back(ni - 1);
V[ni - 1].push_back(ti - 1);
}
for (uint32_t i = 0; i < Q; i++) {
uint32_t ti, ac;
std::cin >> ti >> ac;
values[ti - 1] = ac;
}
Run(0, -1, 0);
std::cout << values[0];
for (uint32_t i = 1; i < N; i++) {
std::cout << " " << values[i];
}
std::cout << std::endl;
return 0;
}
|
#include <iostream>
#include <vector>
using Tree = std::vector<std::vector<uint32_t>>;
Tree V;
std::vector<uint32_t> values;
void Run(uint32_t i, uint32_t f, uint32_t sum) {
auto c = values[i];
values[i] += sum;
for (const auto &e : V[i]) {
if (e != f) {
Run(e, i, sum + c);
}
}
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
uint32_t N, Q;
std::cin >> N >> Q;
V.resize(N);
values.resize(N);
for (uint32_t i = 0; i < N - 1; i++) {
uint32_t ti, ni;
std::cin >> ti >> ni;
V[ti - 1].push_back(ni - 1);
V[ni - 1].push_back(ti - 1);
}
for (uint32_t i = 0; i < Q; i++) {
uint32_t ti, ac;
std::cin >> ti >> ac;
values[ti - 1] += ac;
}
Run(0, -1, 0);
std::cout << values[0];
for (uint32_t i = 1; i < N; i++) {
std::cout << " " << values[i];
}
std::cout << std::endl;
return 0;
}
|
[
"assignment.value.change"
] | 738,533
| 738,534
|
u686041468
|
cpp
|
p02936
|
// bismillahir rahmanir rahim //Author:Fayed Anik
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
// using namespace __gnu_pbds;
/*
template <typename T> using ordered_set =
tree<T, null_type, less<T>, /// greater<T> for sorting decreasingly
rb_tree_tag, tree_order_statistics_node_update>;
*/
#define ll long long
#define lf double
#define pb(x) push_back(x)
#define ull unsigned long long
#define sfl(a) scanf("%lld", &a)
#define sf(a) scanf("%d", &a)
#define pf(a) printf("%d\n", a)
#define pfl(a) printf("%lld\n", a)
#define FOR(x, n) for (ll x = 1; x <= n; ++x)
#define pii pair<ll, ll>
#define mp(a, b) make_pair(a, b)
#define mod 1000000007
#define INF 2e18
#define f1 first
#define f2 second
#define all(v) v.begin(), v.end()
#define PI acos(-1)
#define printminusone printf("-1\n")
#define bug printf("bug")
#define FILEIN freopen("in.txt", "r", stdin)
#define FILEOUT freopen("out.txt", "w", stdout)
// ll SET(ll mask,ll pos){ return mask = (mask | (1ll<<pos)); }
// ll RESET(ll mask,ll pos){ return mask = mask & ~(1ll<<pos); }
// bool CHECK(ll mask,ll pos) { return (bool) (mask & (1ll<<pos)); }
// priority_queue <ll, vector<ll>, greater<ll> > pq;
#define N 200005
vector<ll> edge[200005];
ll tim[N], tot[N], tree[4 * N], lazy[4 * N], t = 1, ans[N];
void dfs(ll u, ll par) {
tim[u] = t;
t++;
for (auto v : edge[u]) {
if (v != par) {
dfs(v, u);
tot[u] += (1 + tot[v]);
}
}
}
void pushup(ll nd, ll b, ll e) {
if (b != e) {
lazy[2 * nd] += lazy[nd];
lazy[2 * nd + 1] += lazy[nd];
} else {
tree[nd] += lazy[nd];
}
lazy[nd] = 0;
}
void update(ll nd, ll b, ll e, ll i, ll j, ll val) {
if (lazy[nd]) {
pushup(nd, b, e);
}
if (i > e or j < b)
return;
if (b >= i and e <= j) {
lazy[nd] = val;
return;
}
ll mid = (b + e) / 2;
update(2 * nd, b, mid, i, j, val);
update(2 * nd + 1, mid + 1, e, i, j, val);
tree[nd] = tree[2 * nd] + tree[2 * nd + 1];
}
ll get(ll nd, ll b, ll e, ll i) {
if (lazy[nd]) {
pushup(nd, b, e);
}
if (i > e or i < b)
return 0;
if (i == e and i == b)
return tree[nd];
ll mid = (b + e) / 2;
return get(2 * nd, b, mid, i) + get(2 * nd + 1, mid + 1, e, i);
}
int main() {
ll n, q, u, v;
sfl(n), sfl(q);
for (ll i = 1; i < n; i++) {
sfl(u), sfl(v);
edge[u].pb(v);
edge[v].pb(u);
}
dfs(1, 1);
FOR(cs, q) {
sfl(u), sfl(v);
update(1, 1, n, tim[u], tim[u] + tot[u], v);
}
for (ll i = 1; i <= n; i++) {
ans[tim[i]] = get(1, 1, n, tim[i]);
// printf("%lld ",get(1,1,n,i));
}
for (ll i = 1; i <= n; i++) {
printf("%lld ", ans[i]);
}
return 0;
}
|
// bismillahir rahmanir rahim //Author:Fayed Anik
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
// using namespace __gnu_pbds;
/*
template <typename T> using ordered_set =
tree<T, null_type, less<T>, /// greater<T> for sorting decreasingly
rb_tree_tag, tree_order_statistics_node_update>;
*/
#define ll long long
#define lf double
#define pb(x) push_back(x)
#define ull unsigned long long
#define sfl(a) scanf("%lld", &a)
#define sf(a) scanf("%d", &a)
#define pf(a) printf("%d\n", a)
#define pfl(a) printf("%lld\n", a)
#define FOR(x, n) for (ll x = 1; x <= n; ++x)
#define pii pair<ll, ll>
#define mp(a, b) make_pair(a, b)
#define mod 1000000007
#define INF 2e18
#define f1 first
#define f2 second
#define all(v) v.begin(), v.end()
#define PI acos(-1)
#define printminusone printf("-1\n")
#define bug printf("bug")
#define FILEIN freopen("in.txt", "r", stdin)
#define FILEOUT freopen("out.txt", "w", stdout)
// ll SET(ll mask,ll pos){ return mask = (mask | (1ll<<pos)); }
// ll RESET(ll mask,ll pos){ return mask = mask & ~(1ll<<pos); }
// bool CHECK(ll mask,ll pos) { return (bool) (mask & (1ll<<pos)); }
// priority_queue <ll, vector<ll>, greater<ll> > pq;
#define N 200005
vector<ll> edge[200005];
ll tim[N], tot[N], tree[4 * N], lazy[4 * N], t = 1, ans[N];
void dfs(ll u, ll par) {
tim[u] = t;
t++;
for (auto v : edge[u]) {
if (v != par) {
dfs(v, u);
tot[u] += (1 + tot[v]);
}
}
}
void pushup(ll nd, ll b, ll e) {
if (b != e) {
lazy[2 * nd] += lazy[nd];
lazy[2 * nd + 1] += lazy[nd];
} else {
tree[nd] += lazy[nd];
}
lazy[nd] = 0;
}
void update(ll nd, ll b, ll e, ll i, ll j, ll val) {
if (lazy[nd]) {
pushup(nd, b, e);
}
if (i > e or j < b)
return;
if (b >= i and e <= j) {
lazy[nd] = val;
return;
}
ll mid = (b + e) / 2;
update(2 * nd, b, mid, i, j, val);
update(2 * nd + 1, mid + 1, e, i, j, val);
tree[nd] = tree[2 * nd] + tree[2 * nd + 1];
}
ll get(ll nd, ll b, ll e, ll i) {
if (lazy[nd]) {
pushup(nd, b, e);
}
if (i > e or i < b)
return 0;
if (i == e and i == b)
return tree[nd];
ll mid = (b + e) / 2;
return get(2 * nd, b, mid, i) + get(2 * nd + 1, mid + 1, e, i);
}
int main() {
ll n, q, u, v;
sfl(n), sfl(q);
for (ll i = 1; i < n; i++) {
sfl(u), sfl(v);
edge[u].pb(v);
edge[v].pb(u);
}
dfs(1, 1);
FOR(cs, q) {
sfl(u), sfl(v);
update(1, 1, n, tim[u], tim[u] + tot[u], v);
}
for (ll i = 1; i <= n; i++) {
ans[i] = get(1, 1, n, tim[i]);
// printf("%lld ",get(1,1,n,i));
}
for (ll i = 1; i <= n; i++) {
printf("%lld ", ans[i]);
}
return 0;
}
|
[] | 738,550
| 738,551
|
u769965655
|
cpp
|
p02936
|
// bismillahir rahmanir rahim //Author:Fayed Anik
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
// using namespace __gnu_pbds;
/*
template <typename T> using ordered_set =
tree<T, null_type, less<T>, /// greater<T> for sorting decreasingly
rb_tree_tag, tree_order_statistics_node_update>;
*/
#define ll long long
#define lf double
#define pb(x) push_back(x)
#define ull unsigned long long
#define sfl(a) scanf("%lld", &a)
#define sf(a) scanf("%d", &a)
#define pf(a) printf("%d\n", a)
#define pfl(a) printf("%lld\n", a)
#define FOR(x, n) for (ll x = 1; x <= n; ++x)
#define pii pair<ll, ll>
#define mp(a, b) make_pair(a, b)
#define mod 1000000007
#define INF 2e18
#define f1 first
#define f2 second
#define all(v) v.begin(), v.end()
#define PI acos(-1)
#define printminusone printf("-1\n")
#define bug printf("bug")
#define FILEIN freopen("in.txt", "r", stdin)
#define FILEOUT freopen("out.txt", "w", stdout)
// ll SET(ll mask,ll pos){ return mask = (mask | (1ll<<pos)); }
// ll RESET(ll mask,ll pos){ return mask = mask & ~(1ll<<pos); }
// bool CHECK(ll mask,ll pos) { return (bool) (mask & (1ll<<pos)); }
// priority_queue <ll, vector<ll>, greater<ll> > pq;
#define N 200005
vector<ll> edge[200005];
ll tim[N], tot[N], tree[4 * N], lazy[4 * N], t = 1, ans[N];
void dfs(ll u, ll par) {
tim[u] = t;
t++;
for (auto v : edge[u]) {
if (v != par) {
dfs(v, u);
tot[u] += (1 + tot[v]);
}
}
}
void pushup(ll nd, ll b, ll e) {
if (b != e) {
lazy[2 * nd] += lazy[nd];
lazy[2 * nd + 1] += lazy[nd];
} else {
tree[nd] += lazy[nd];
}
lazy[nd] = 0;
}
void update(ll nd, ll b, ll e, ll i, ll j, ll val) {
if (lazy[nd]) {
pushup(nd, b, e);
}
if (i > e or j < b)
return;
if (b >= i and e <= j) {
lazy[nd] = val;
return;
}
ll mid = (b + e) / 2;
update(2 * nd, b, mid, i, j, val);
update(2 * nd + 1, mid + 1, e, i, j, val);
tree[nd] = tree[2 * nd] + tree[2 * nd + 1];
}
ll get(ll nd, ll b, ll e, ll i) {
if (lazy[nd]) {
pushup(nd, b, e);
}
if (i > e or i < b)
return 0;
if (i == e and i == b)
return tree[nd];
ll mid = (b + e) / 2;
return get(2 * nd, b, mid, i) + get(2 * nd + 1, mid + 1, e, i);
}
int main() {
ll n, q, u, v;
sfl(n), sfl(q);
for (ll i = 1; i < n; i++) {
sfl(u), sfl(v);
edge[u].pb(v);
edge[v].pb(u);
}
dfs(1, 1);
FOR(cs, q) {
sfl(u), sfl(v);
update(1, 1, n, tim[u], tim[u] + tot[u], v);
}
for (ll i = 1; i <= n; i++) {
ans[tim[i]] = get(1, 1, n, i);
// printf("%lld ",get(1,1,n,i));
}
for (ll i = 1; i <= n; i++) {
printf("%lld ", ans[i]);
}
return 0;
}
|
// bismillahir rahmanir rahim //Author:Fayed Anik
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
// using namespace __gnu_pbds;
/*
template <typename T> using ordered_set =
tree<T, null_type, less<T>, /// greater<T> for sorting decreasingly
rb_tree_tag, tree_order_statistics_node_update>;
*/
#define ll long long
#define lf double
#define pb(x) push_back(x)
#define ull unsigned long long
#define sfl(a) scanf("%lld", &a)
#define sf(a) scanf("%d", &a)
#define pf(a) printf("%d\n", a)
#define pfl(a) printf("%lld\n", a)
#define FOR(x, n) for (ll x = 1; x <= n; ++x)
#define pii pair<ll, ll>
#define mp(a, b) make_pair(a, b)
#define mod 1000000007
#define INF 2e18
#define f1 first
#define f2 second
#define all(v) v.begin(), v.end()
#define PI acos(-1)
#define printminusone printf("-1\n")
#define bug printf("bug")
#define FILEIN freopen("in.txt", "r", stdin)
#define FILEOUT freopen("out.txt", "w", stdout)
// ll SET(ll mask,ll pos){ return mask = (mask | (1ll<<pos)); }
// ll RESET(ll mask,ll pos){ return mask = mask & ~(1ll<<pos); }
// bool CHECK(ll mask,ll pos) { return (bool) (mask & (1ll<<pos)); }
// priority_queue <ll, vector<ll>, greater<ll> > pq;
#define N 200005
vector<ll> edge[200005];
ll tim[N], tot[N], tree[4 * N], lazy[4 * N], t = 1, ans[N];
void dfs(ll u, ll par) {
tim[u] = t;
t++;
for (auto v : edge[u]) {
if (v != par) {
dfs(v, u);
tot[u] += (1 + tot[v]);
}
}
}
void pushup(ll nd, ll b, ll e) {
if (b != e) {
lazy[2 * nd] += lazy[nd];
lazy[2 * nd + 1] += lazy[nd];
} else {
tree[nd] += lazy[nd];
}
lazy[nd] = 0;
}
void update(ll nd, ll b, ll e, ll i, ll j, ll val) {
if (lazy[nd]) {
pushup(nd, b, e);
}
if (i > e or j < b)
return;
if (b >= i and e <= j) {
lazy[nd] = val;
return;
}
ll mid = (b + e) / 2;
update(2 * nd, b, mid, i, j, val);
update(2 * nd + 1, mid + 1, e, i, j, val);
tree[nd] = tree[2 * nd] + tree[2 * nd + 1];
}
ll get(ll nd, ll b, ll e, ll i) {
if (lazy[nd]) {
pushup(nd, b, e);
}
if (i > e or i < b)
return 0;
if (i == e and i == b)
return tree[nd];
ll mid = (b + e) / 2;
return get(2 * nd, b, mid, i) + get(2 * nd + 1, mid + 1, e, i);
}
int main() {
ll n, q, u, v;
sfl(n), sfl(q);
for (ll i = 1; i < n; i++) {
sfl(u), sfl(v);
edge[u].pb(v);
edge[v].pb(u);
}
dfs(1, 1);
FOR(cs, q) {
sfl(u), sfl(v);
update(1, 1, n, tim[u], tim[u] + tot[u], v);
}
for (ll i = 1; i <= n; i++) {
ans[i] = get(1, 1, n, tim[i]);
// printf("%lld ",get(1,1,n,i));
}
for (ll i = 1; i <= n; i++) {
printf("%lld ", ans[i]);
}
return 0;
}
|
[
"call.arguments.change"
] | 738,552
| 738,551
|
u769965655
|
cpp
|
p02936
|
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define debug(x) cerr << #x << " " << x << '\n'
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pli = pair<ll, int>;
const int INF = 0x3f3f3f3f, N = 2e5 + 5;
const ll LINF = 1e18 + 5;
int n, q;
ll val[N];
vector<int> G[N];
int in[N], out[N], num[N], id;
void dfs(int u, int fa) {
in[u] = ++id;
num[id] = u;
for (auto v : G[u]) {
if (v == fa)
continue;
dfs(v, u);
}
out[u] = id;
}
void upd(int rt, int x) {
val[in[rt]] += x;
val[out[rt] + 1] -= x;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> q;
for (int i = 1; i < n; i++) {
int u, v;
cin >> u >> v;
G[u].pb(v);
G[v].pb(u);
}
dfs(1, 0);
while (q--) {
int p, x;
cin >> p >> x;
upd(p, x);
}
for (int i = 1; i <= n; i++)
val[i] += val[i - 1];
for (int i = 1; i <= n; i++)
cout << val[num[i]] << " \n"[i == n];
return 0;
}
|
#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define debug(x) cerr << #x << " " << x << '\n'
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pli = pair<ll, int>;
const int INF = 0x3f3f3f3f, N = 2e5 + 5;
const ll LINF = 1e18 + 5;
int n, q;
ll val[N];
vector<int> G[N];
int in[N], out[N], num[N], id;
void dfs(int u, int fa) {
in[u] = ++id;
num[id] = u;
for (auto v : G[u]) {
if (v == fa)
continue;
dfs(v, u);
}
out[u] = id;
}
void upd(int rt, int x) {
val[in[rt]] += x;
val[out[rt] + 1] -= x;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cin >> n >> q;
for (int i = 1; i < n; i++) {
int u, v;
cin >> u >> v;
G[u].pb(v);
G[v].pb(u);
}
dfs(1, 0);
while (q--) {
int p, x;
cin >> p >> x;
upd(p, x);
}
for (int i = 1; i <= n; i++)
val[i] += val[i - 1];
for (int i = 1; i <= n; i++)
cout << val[in[i]] << " \n"[i == n];
return 0;
}
|
[
"identifier.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 738,556
| 738,557
|
u047655753
|
cpp
|
p02936
|
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define Rep(i, r, n) for (ll i = r; i < n; i++)
#define debug(x) cout << #x << " = " << (x) << endl;
#define pb push_back
#define MOD 1000000007
//#define MOD 998244353
// define MOD 1000000007000000
#define INF 1000000000000
#define EPS 0.00000000001
typedef long long ll;
int n;
vector<vector<ll>> graph(n);
vector<ll> cost(n, 0);
vector<bool> check(n);
void dfs(ll now) {
check[now] = true;
for (ll next : graph[now]) {
if (check[next]) {
continue;
}
cost[next] += cost[now];
dfs(next);
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
//---------------------------------------------
int n, q;
cin >> n >> q;
int a, b;
graph.resize(n);
cost.resize(n);
check.resize(n);
rep(i, n - 1) {
cin >> a >> b;
a--;
b--;
graph[a].pb(b);
graph[b].pb(a);
}
int p, x;
rep(i, q) {
cin >> p >> x;
p--;
cost[p] += x;
}
rep(i, n) { cout << cost[i] << " "; }
cout << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define Rep(i, r, n) for (ll i = r; i < n; i++)
#define debug(x) cout << #x << " = " << (x) << endl;
#define pb push_back
#define MOD 1000000007
//#define MOD 998244353
// define MOD 1000000007000000
#define INF 1000000000000
#define EPS 0.00000000001
typedef long long ll;
int n;
vector<vector<ll>> graph(n);
vector<ll> cost(n, 0);
vector<bool> check(n);
void dfs(ll now) {
check[now] = true;
for (ll next : graph[now]) {
if (check[next]) {
continue;
}
cost[next] += cost[now];
dfs(next);
}
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
//---------------------------------------------
int n, q;
cin >> n >> q;
int a, b;
graph.resize(n);
cost.resize(n);
check.resize(n);
rep(i, n - 1) {
cin >> a >> b;
a--;
b--;
graph[a].pb(b);
graph[b].pb(a);
}
int p, x;
rep(i, q) {
cin >> p >> x;
p--;
cost[p] += x;
}
dfs(0);
rep(i, n) { cout << cost[i] << " "; }
cout << endl;
}
|
[
"call.add"
] | 738,570
| 738,571
|
u521723672
|
cpp
|
p02936
|
#include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int V; //頂点数
int t[200010]; //親
vector<int> e[200010]; // iから出る辺
int d[200010];
int c[200010];
bool c_end[200010];
void count(int s) {
if (!c_end[s]) {
if (s == 1) {
c[1] = d[1];
c_end[1] = true;
} else {
if (!c_end[t[s]]) {
count(t[s]);
} else {
c[s] = d[s] + c[t[s]];
c_end[s] = true;
}
}
}
}
int main() {
int n, Q;
cin >> n >> Q;
V = n;
//辺情報の導入
for (int i = 0; i < V - 1; i++) {
int a, b;
cin >> a >> b;
e[a].push_back(b);
e[b].push_back(a);
}
//木の構成
for (int i = 1; i <= n; i++) {
t[i] = i; //初期情報の確率
}
queue<int> q;
q.push(1);
while (!q.empty()) {
int from;
from = q.front();
q.pop();
while (!e[from].empty()) {
int to;
to = e[from].back();
e[from].pop_back();
if (to != t[from]) {
t[to] = from;
q.push(to);
}
}
}
for (int i = 0; i < Q; i++) {
int a, b;
cin >> a >> b;
d[a] = d[a] + b;
}
for (int i = 1; i <= n; i++) {
c_end[i] = false;
}
for (int i = 1; i <= n; i++) {
count(i);
}
for (int i = 1; i <= n - 1; i++) {
cout << c[i] << ' ';
}
cout << c[n] << endl;
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
int V; //頂点数
int t[200010]; //親
vector<int> e[200010]; // iから出る辺
int d[200010];
int c[200010];
bool c_end[200010];
void count(int s) {
if (!c_end[s]) {
if (s == 1) {
c[1] = d[1];
c_end[1] = true;
} else {
if (!c_end[t[s]]) {
count(t[s]);
}
c[s] = d[s] + c[t[s]];
c_end[s] = true;
}
}
}
int main() {
int n, Q;
cin >> n >> Q;
V = n;
//辺情報の導入
for (int i = 0; i < V - 1; i++) {
int a, b;
cin >> a >> b;
e[a].push_back(b);
e[b].push_back(a);
}
//木の構成
for (int i = 1; i <= n; i++) {
t[i] = i; //初期情報の確率
}
queue<int> q;
q.push(1);
while (!q.empty()) {
int from;
from = q.front();
q.pop();
while (!e[from].empty()) {
int to;
to = e[from].back();
e[from].pop_back();
if (to != t[from]) {
t[to] = from;
q.push(to);
}
}
}
for (int i = 0; i < Q; i++) {
int a, b;
cin >> a >> b;
d[a] = d[a] + b;
}
for (int i = 1; i <= n; i++) {
c_end[i] = false;
}
for (int i = 1; i <= n; i++) {
count(i);
}
for (int i = 1; i <= n - 1; i++) {
cout << c[i] << ' ';
}
cout << c[n] << endl;
return 0;
}
|
[] | 738,595
| 738,596
|
u992779443
|
cpp
|
p02936
|
#include <bits/stdc++.h>
using namespace std;
#define ALL(v) (v).begin(), (v).end()
#define REP(i, p, n) for (int i = p; i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define SZ(x) ((int)(x).size())
#define debug(x) cerr << #x << ": " << x << '\n'
#define INF 999999999
typedef long long int Int;
typedef pair<int, int> P;
using ll = long long;
using VI = vector<int>;
int N, Q;
vector<vector<Int>> G(200010);
vector<Int> cost(200010);
vector<bool> visited(200010, false);
void bfs(int s) {
queue<int> que;
que.push(s);
visited[s] = true;
while (!que.empty()) {
int v = que.front();
que.pop();
for (auto nv : G[v]) {
if (visited[nv] = false) {
que.push(nv);
cost[nv] += cost[v];
visited[nv] = true;
}
}
}
}
int main() {
cin >> N >> Q;
rep(i, N - 1) {
int a, b;
cin >> a >> b;
a--, b--;
G[a].push_back(b);
G[b].push_back(a);
}
rep(i, Q) {
int p, x;
cin >> p >> x;
p--;
cost[p] += x;
}
bfs(0);
rep(i, N - 1) cout << cost[i] << " ";
cout << cost[N - 1] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
#define ALL(v) (v).begin(), (v).end()
#define REP(i, p, n) for (int i = p; i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define SZ(x) ((int)(x).size())
#define debug(x) cerr << #x << ": " << x << '\n'
#define INF 999999999
typedef long long int Int;
typedef pair<int, int> P;
using ll = long long;
using VI = vector<int>;
int N, Q;
vector<vector<Int>> G(200010);
vector<Int> cost(200010);
vector<bool> visited(200010, false);
void bfs(int s) {
queue<int> que;
que.push(s);
visited[s] = true;
while (!que.empty()) {
int v = que.front();
que.pop();
for (auto nv : G[v]) {
if (visited[nv] == false) {
que.push(nv);
cost[nv] += cost[v];
visited[nv] = true;
}
}
}
}
int main() {
cin >> N >> Q;
rep(i, N - 1) {
int a, b;
cin >> a >> b;
a--, b--;
G[a].push_back(b);
G[b].push_back(a);
}
rep(i, Q) {
int p, x;
cin >> p >> x;
p--;
cost[p] += x;
}
bfs(0);
rep(i, N - 1) cout << cost[i] << " ";
cout << cost[N - 1] << endl;
}
|
[
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 738,614
| 738,615
|
u902149880
|
cpp
|
p02936
|
//部分木に含まれる頂点を全て求めてしまえばよい
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
vector<vector<int>> u(n);
for (int i = 0; i < n - 1; i++) {
int a, b;
cin >> a >> b;
u[a - 1].push_back(b - 1);
u[b - 1].push_back(a - 1);
}
vector<int> c(n);
for (int i = 0; i < q; i++) {
int p, x;
cin >> p >> x;
c[p - 1] = x;
}
// cout << 0 << endl;
/*
for(int i=0;i<n;i++){
for(int j=0;j<u[i].size();j++){
cout << u[i][j];
if(j==u[i].size()-1) cout << endl;
else cout << " ";
}
}
*/
queue<pair<int, int>> k;
k.push(make_pair(-1, 0));
while (k.size() != 0) {
// for(int z=0;z<10;z++){
int l1 = k.size();
for (int i = 0; i < l1; i++) {
pair<int, int> a = k.front();
int l2 = u[a.second].size();
for (int j = 0; j < l2; j++) {
if (u[a.second][j] != a.first) {
c[u[a.second][j]] += c[a.second];
k.push(make_pair(a.second, u[a.second][j]));
}
}
k.pop();
}
}
for (int i = 0; i < n; i++) {
cout << c[i];
if (i == n - 1)
cout << endl;
else
cout << " ";
}
}
|
//部分木に含まれる頂点を全て求めてしまえばよい
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, q;
cin >> n >> q;
vector<vector<int>> u(n);
for (int i = 0; i < n - 1; i++) {
int a, b;
cin >> a >> b;
u[a - 1].push_back(b - 1);
u[b - 1].push_back(a - 1);
}
vector<int> c(n, 0);
for (int i = 0; i < q; i++) {
int p, x;
cin >> p >> x;
c[p - 1] += x;
}
// cout << 0 << endl;
/*
for(int i=0;i<n;i++){
for(int j=0;j<u[i].size();j++){
cout << u[i][j];
if(j==u[i].size()-1) cout << endl;
else cout << " ";
}
}
*/
queue<pair<int, int>> k;
k.push(make_pair(-1, 0));
while (k.size() != 0) {
// for(int z=0;z<10;z++){
int l1 = k.size();
for (int i = 0; i < l1; i++) {
pair<int, int> a = k.front();
int l2 = u[a.second].size();
for (int j = 0; j < l2; j++) {
if (u[a.second][j] != a.first) {
c[u[a.second][j]] += c[a.second];
k.push(make_pair(a.second, u[a.second][j]));
}
}
k.pop();
}
}
for (int i = 0; i < n; i++) {
cout << c[i];
if (i == n - 1)
cout << endl;
else
cout << " ";
}
}
|
[
"call.arguments.add",
"assignment.value.change"
] | 738,616
| 738,617
|
u989345508
|
cpp
|
p02936
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
const long long MOD = 1000000007LL;
const string alpha = "abcdefghijklmnopqrstuvwxyz";
int main() {
int n, q;
cin >> n >> q;
vector<vector<int>> edge;
int a, b;
rep(i, n + 1) { edge.push_back({}); }
rep(i, n - 1) {
cin >> a >> b;
edge[a].push_back(b);
edge[b].push_back(a);
}
long long val[n + 1] = {0};
long long ans[n + 1] = {0};
long long p, x;
rep(i, q) {
cin >> p >> x;
val[p] += x;
}
ans[1] = val[1];
queue<int> que;
que.push(1);
bool check[n + 1] = {true};
check[1] = false;
while (!que.empty()) {
int tmp = que.front();
que.pop();
for (int i = 0; i < edge[tmp].size(); i++) {
int tem = edge[tmp][i];
if (check[tem]) {
ans[tem] += ans[tmp] + val[tem];
que.push(tem);
check[tem] = false;
}
}
}
rep(i, n) { cout << ans[i + 1] << " "; }
cout << endl;
}
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
const long long MOD = 1000000007LL;
const string alpha = "abcdefghijklmnopqrstuvwxyz";
int main() {
int n, q;
cin >> n >> q;
vector<vector<int>> edge;
int a, b;
rep(i, n + 1) { edge.push_back({}); }
rep(i, n - 1) {
cin >> a >> b;
edge[a].push_back(b);
edge[b].push_back(a);
}
long long val[n + 1] = {0};
long long ans[n + 1] = {0};
long long p, x;
rep(i, q) {
cin >> p >> x;
val[p] += x;
}
ans[1] = val[1];
queue<int> que;
que.push(1);
bool check[n + 1] = {false};
check[1] = true;
while (!que.empty()) {
int tmp = que.front();
que.pop();
for (int i = 0; i < edge[tmp].size(); i++) {
int tem = edge[tmp][i];
if (!check[tem]) {
ans[tem] += ans[tmp] + val[tem];
que.push(tem);
check[tem] = true;
}
}
}
rep(i, n) { cout << ans[i + 1] << " "; }
cout << endl;
}
|
[
"misc.opposites",
"assignment.value.change",
"expression.operation.unary.add",
"control_flow.branch.if.condition.change"
] | 738,633
| 738,634
|
u467826805
|
cpp
|
p02936
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
const long long MOD = 1000000007LL;
const string alpha = "abcdefghijklmnopqrstuvwxyz";
int main() {
int n, q;
cin >> n >> q;
vector<vector<int>> edge;
int a, b;
rep(i, n + 1) { edge.push_back({}); }
rep(i, n - 1) {
cin >> a >> b;
edge[a].push_back(b);
edge[b].push_back(a);
}
long long val[n + 1] = {0};
long long ans[n + 1] = {0};
long long p, x;
rep(i, q) {
cin >> p >> x;
val[p] += x;
}
ans[1] = val[1];
queue<int> que;
que.push(1);
bool check[n + 1] = {true};
check[1] = true;
while (!que.empty()) {
int tmp = que.front();
que.pop();
for (int i = 0; i < edge[tmp].size(); i++) {
int tem = edge[tmp][i];
if (check[tem]) {
ans[tem] += ans[tmp] + val[tem];
que.push(tem);
check[tem] = false;
}
}
}
rep(i, n) { cout << ans[i + 1] << " "; }
cout << endl;
}
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
const long long MOD = 1000000007LL;
const string alpha = "abcdefghijklmnopqrstuvwxyz";
int main() {
int n, q;
cin >> n >> q;
vector<vector<int>> edge;
int a, b;
rep(i, n + 1) { edge.push_back({}); }
rep(i, n - 1) {
cin >> a >> b;
edge[a].push_back(b);
edge[b].push_back(a);
}
long long val[n + 1] = {0};
long long ans[n + 1] = {0};
long long p, x;
rep(i, q) {
cin >> p >> x;
val[p] += x;
}
ans[1] = val[1];
queue<int> que;
que.push(1);
bool check[n + 1] = {false};
check[1] = true;
while (!que.empty()) {
int tmp = que.front();
que.pop();
for (int i = 0; i < edge[tmp].size(); i++) {
int tem = edge[tmp][i];
if (!check[tem]) {
ans[tem] += ans[tmp] + val[tem];
que.push(tem);
check[tem] = true;
}
}
}
rep(i, n) { cout << ans[i + 1] << " "; }
cout << endl;
}
|
[
"misc.opposites",
"expression.operation.unary.add",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 738,635
| 738,634
|
u467826805
|
cpp
|
p02936
|
#include <bits/stdc++.h>
using namespace std;
int ans[200005] = {}, memo[200005] = {};
vector<int> ab[200005];
void my(int now, int carry) {
ans[now] += carry;
for (auto i = ab[now].begin(); i != ab[now].end(); ++i) {
if (memo[*i] == 0) {
memo[*i] = 1;
my(*i, ans[now]);
}
}
}
int main(int argc, char const *argv[]) {
int n, q;
cin >> n >> q;
int a, b;
for (int i = 0; i < n - 1; ++i) {
cin >> a >> b;
--a, --b;
ab[a].emplace_back(b);
ab[b].emplace_back(a);
}
int p, x;
for (int i = 0; i < q; ++i) {
cin >> p >> x;
--p;
ans[p] += x;
}
memo[0] = 1;
my(0, 0);
cout << ans[0];
for (int i = 0; i < n; ++i) {
cout << " " << ans[i];
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int ans[200005] = {}, memo[200005] = {};
vector<int> ab[200005];
void my(int now, int carry) {
ans[now] += carry;
for (auto i = ab[now].begin(); i != ab[now].end(); ++i) {
if (memo[*i] == 0) {
memo[*i] = 1;
my(*i, ans[now]);
}
}
}
int main(int argc, char const *argv[]) {
int n, q;
cin >> n >> q;
int a, b;
for (int i = 0; i < n - 1; ++i) {
cin >> a >> b;
--a, --b;
ab[a].emplace_back(b);
ab[b].emplace_back(a);
}
int p, x;
for (int i = 0; i < q; ++i) {
cin >> p >> x;
--p;
ans[p] += x;
}
memo[0] = 1;
my(0, 0);
cout << ans[0];
for (int i = 1; i < n; ++i) {
cout << " " << ans[i];
}
cout << endl;
return 0;
}
|
[
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 738,649
| 738,650
|
u399987025
|
cpp
|
p02936
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int timer = 0;
vector<int> a[N], tin(N), tout(N);
long long ans[N + 5];
void dfs(int x, int p = -1) {
tin[x] = ++timer;
for (auto i : a[x])
if (i != p)
dfs(i, x);
tout[x] = timer;
}
int main() {
int n, q;
cin >> n >> q;
for (int i = 1; i < n; ++i) {
int u, v;
cin >> u >> v;
a[u].push_back(v);
a[v].push_back(u);
}
memset(ans, 0, sizeof ans);
dfs(1);
while (q--) {
int p, x;
cin >> p >> x;
ans[tin[p]] += x;
ans[tout[p] + 1] -= x;
}
for (int i = 2; i <= n; ++i)
ans[i] += ans[i - 1];
for (int i = 1; i <= n; ++i)
cout << ans[i] << " ";
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int timer = 0;
vector<int> a[N], tin(N), tout(N);
long long ans[N + 5];
void dfs(int x, int p = -1) {
tin[x] = ++timer;
for (auto i : a[x])
if (i != p)
dfs(i, x);
tout[x] = timer;
}
int main() {
int n, q;
cin >> n >> q;
for (int i = 1; i < n; ++i) {
int u, v;
cin >> u >> v;
a[u].push_back(v);
a[v].push_back(u);
}
memset(ans, 0, sizeof ans);
dfs(1);
while (q--) {
int p, x;
cin >> p >> x;
ans[tin[p]] += x;
ans[tout[p] + 1] -= x;
}
for (int i = 2; i <= n; ++i)
ans[i] += ans[i - 1];
for (int i = 1; i <= n; ++i)
cout << ans[tin[i]] << " ";
}
|
[] | 738,687
| 738,688
|
u971421535
|
cpp
|
p02936
|
//
// main.cpp
// ABC
//
// Created by Amarsanaa Davaasuren on 2019/08/31.
// Copyright © 2019 Amarsanaa Davaasuren. All rights reserved.
//
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
class UnionFind {
public:
vector<int> Parent;
UnionFind(int N) { Parent = vector<int>(N, -1); }
int root(int node) {
if (Parent[node] < 0) {
return node;
} else {
return Parent[node] = root(Parent[node]);
}
}
int size(int node) { return -root(node); }
bool connect(int A, int B) {
int Aroot = root(A);
int Broot = root(B);
if (Aroot != Broot) {
if (size(Aroot) < size(Broot))
swap(Aroot, Broot);
Parent[Aroot] += Parent[Broot];
Parent[Broot] = Aroot;
return true;
} else {
return false;
}
}
};
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repr(i, n) for (int i = (n)-1; i >= 0; i--)
using ll = long long;
int main() {
int N, Q;
cin >> N >> Q;
vector<vector<int>> G;
rep(i, N - 1) {
int a, b;
cin >> a >> b;
a--;
b--;
G[a].push_back(b);
G[b].push_back(a);
}
vector<ll> value(N);
rep(i, Q) {
int p, x;
cin >> p >> x;
p--;
value[p] += x;
}
auto dfs = [&](auto dfs, int child, int parent) -> void {
for (int relative : G[child])
if (relative != parent) {
value[relative] += value[child];
dfs(dfs, relative, child);
}
};
dfs(dfs, 0, -1);
rep(i, N) cout << value[i] << (i == N - 1 ? '\n' : ' ');
}
|
//
// main.cpp
// ABC
//
// Created by Amarsanaa Davaasuren on 2019/08/31.
// Copyright © 2019 Amarsanaa Davaasuren. All rights reserved.
//
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
class UnionFind {
public:
vector<int> Parent;
UnionFind(int N) { Parent = vector<int>(N, -1); }
int root(int node) {
if (Parent[node] < 0) {
return node;
} else {
return Parent[node] = root(Parent[node]);
}
}
int size(int node) { return -root(node); }
bool connect(int A, int B) {
int Aroot = root(A);
int Broot = root(B);
if (Aroot != Broot) {
if (size(Aroot) < size(Broot))
swap(Aroot, Broot);
Parent[Aroot] += Parent[Broot];
Parent[Broot] = Aroot;
return true;
} else {
return false;
}
}
};
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repr(i, n) for (int i = (n)-1; i >= 0; i--)
using ll = long long;
int main() {
int N, Q;
cin >> N >> Q;
vector<vector<int>> G(N);
rep(i, N - 1) {
int a, b;
cin >> a >> b;
a--;
b--;
G[a].push_back(b);
G[b].push_back(a);
}
vector<ll> value(N);
rep(i, Q) {
int p, x;
cin >> p >> x;
p--;
value[p] += x;
}
auto dfs = [&](auto dfs, int child, int parent) -> void {
for (int relative : G[child])
if (relative != parent) {
value[relative] += value[child];
dfs(dfs, relative, child);
}
};
dfs(dfs, 0, -1);
rep(i, N) cout << value[i] << (i == N - 1 ? '\n' : ' ');
}
|
[] | 738,689
| 738,690
|
u358748139
|
cpp
|
p02936
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <math.h>
#include <queue>
#include <string.h>
#include <string>
#include <vector>
#define ll long long
#define ull unsigned long long
#define mod 1000000007
using namespace std;
struct node {
ll count;
vector<int> cNodes;
};
node nodes[200000];
void countIncrease(int t, ll x) {
nodes[t].count += x;
for (int i = 0; i < nodes[t].cNodes.size(); i++) {
countIncrease(nodes[t].cNodes[i] - 1, nodes[t].count);
}
}
int main() {
unsigned int n, q;
cin >> n >> q;
for (int i = 0; i < n - 1; i++) {
nodes[i].count = 0;
int a, b;
cin >> a >> b;
nodes[a - 1].cNodes.push_back(b);
}
for (int i = 0; i < q; i++) {
int p;
ll x;
cin >> p >> x;
nodes[p - 1].count += x;
}
countIncrease(0, 0);
cout << nodes[0].count;
for (int i = 1; i < n - 1; i++) {
cout << " " << nodes[i].count;
}
cout << endl;
}
|
#include <algorithm>
#include <cmath>
#include <iostream>
#include <math.h>
#include <queue>
#include <string.h>
#include <string>
#include <vector>
#define ll long long
#define ull unsigned long long
#define mod 1000000007
using namespace std;
struct node {
ll count;
vector<int> cNodes;
};
node nodes[200000];
void countIncrease(int t, ll x) {
nodes[t].count += x;
for (int i = 0; i < nodes[t].cNodes.size(); i++) {
countIncrease(nodes[t].cNodes[i] - 1, nodes[t].count);
}
}
int main() {
unsigned int n, q;
cin >> n >> q;
for (int i = 0; i < n - 1; i++) {
nodes[i].count = 0;
int a, b;
cin >> a >> b;
nodes[a - 1].cNodes.push_back(b);
}
for (int i = 0; i < q; i++) {
int p;
ll x;
cin >> p >> x;
nodes[p - 1].count += x;
}
countIncrease(0, 0);
cout << nodes[0].count;
for (int i = 1; i < n; i++) {
cout << " " << nodes[i].count;
}
cout << endl;
}
|
[
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 738,705
| 738,706
|
u020230257
|
cpp
|
p02936
|
#include <bits/stdc++.h>
using namespace std;
void dfs(vector<bool> &flag, int pos, vector<long long> &ans, int par,
vector<vector<int>> &tree) {
if (flag[pos])
return;
if (par != -1) {
ans[pos] += ans[par];
flag[pos] = true;
}
for (int i = 0; i < tree[pos].size(); i++) {
dfs(flag, tree[pos][i], ans, pos, tree);
}
return;
}
int main() {
int n, q;
cin >> n >> q;
vector<vector<int>> tree(n + 1);
for (int i = 0; i < n - 1; i++) {
int a, b;
cin >> a >> b;
tree[a].push_back(b);
tree[b].push_back(a);
}
vector<long long> ans(n + 1, 0);
vector<bool> flag(n + 1, false);
for (int i = 0; i < q; i++) {
int pos, val;
cin >> pos >> val;
ans[pos] += val;
}
dfs(flag, 1, ans, -1, tree);
for (int i = 1; i < n; i++) {
cout << ans[i] << ' ';
}
cout << ans[n] << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
void dfs(vector<bool> &flag, int pos, vector<long long> &ans, int par,
vector<vector<int>> &tree) {
if (flag[pos])
return;
if (par != -1) {
ans[pos] += ans[par];
}
flag[pos] = true;
for (int i = 0; i < tree[pos].size(); i++) {
dfs(flag, tree[pos][i], ans, pos, tree);
}
return;
}
int main() {
int n, q;
cin >> n >> q;
vector<vector<int>> tree(n + 1);
for (int i = 0; i < n - 1; i++) {
int a, b;
cin >> a >> b;
tree[a].push_back(b);
tree[b].push_back(a);
}
vector<long long> ans(n + 1, 0);
vector<bool> flag(n + 1, false);
for (int i = 0; i < q; i++) {
int pos, val;
cin >> pos >> val;
ans[pos] += val;
}
dfs(flag, 1, ans, -1, tree);
for (int i = 1; i < n; i++) {
cout << ans[i] << ' ';
}
cout << ans[n] << endl;
}
|
[] | 738,723
| 738,724
|
u351265848
|
cpp
|
p02936
|
#include <bits/stdc++.h>
using namespace std;
// counterの値を親から子に伝搬させる
void dfs(int vertex, int parent, vector<vector<int>> &Tree,
vector<int> &counter) {
//親のカウンターの値を足し合わせる
counter[vertex] += counter[parent];
//子に伝播させる
for (const int &nxtv : Tree[vertex]) {
if (nxtv == parent)
continue;
dfs(nxtv, vertex, Tree, counter);
}
}
//方針：親から子にカウンターの値を伝播させていくことで実現
int main(void) {
//入力
int N, Q;
cin >> N >> Q;
//木
vector<vector<int>> Tree(N);
//頂点のカウンター
vector<int> counter(N + 1, 0);
//木の構築
for (int i = 0; i < N - 1; ++i) {
int a, b;
cin >> a >> b;
Tree[a].push_back(b);
Tree[b].push_back(a);
}
//カウンターの加算
for (int j = 0; j < Q; ++j) {
int p, x;
cin >> p >> x;
counter[p] += x;
}
//カウンターの伝搬
dfs(1, 0, Tree, counter);
//出力
for (int i = 1; i <= N; ++i) {
cout << counter[i] << " ";
}
cout << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
// counterの値を親から子に伝搬させる
void dfs(int vertex, int parent, vector<vector<int>> &Tree,
vector<int> &counter) {
//親のカウンターの値を足し合わせる
counter[vertex] += counter[parent];
//子に伝播させる
for (const int &nxtv : Tree[vertex]) {
if (nxtv == parent)
continue;
dfs(nxtv, vertex, Tree, counter);
}
}
//方針：親から子にカウンターの値を伝播させていくことで実現
int main(void) {
//入力
int N, Q;
cin >> N >> Q;
//木
vector<vector<int>> Tree(N + 1);
//頂点のカウンター
vector<int> counter(N + 1, 0);
//木の構築
for (int i = 0; i < N - 1; ++i) {
int a, b;
cin >> a >> b;
Tree[a].push_back(b);
Tree[b].push_back(a);
}
//カウンターの加算
for (int j = 0; j < Q; ++j) {
int p, x;
cin >> p >> x;
counter[p] += x;
}
//カウンターの伝搬
dfs(1, 0, Tree, counter);
//出力
for (int i = 1; i <= N; ++i) {
cout << counter[i] << " ";
}
cout << endl;
return 0;
}
|
[
"assignment.change"
] | 738,725
| 738,726
|
u069450081
|
cpp
|
p02936
|
//#include "stdafx.h"
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
/*-----------------------------------------------------------------------------
パラメータ定義
-------------------------------------------------------------------------------*/
#define N_MAX (200000)
#define K_MAX (10)
#define M_MAX (10)
#define H_MAX (1000)
#define W_MAX (1000)
using namespace std;
/*-----------------------------------------------------------------------------
メモ
-------------------------------------------------------------------------------*/
#if 0
vector<vector<vector<SDWORD>>> XXX(AAA, vector<vector<SDWORD>>(BBBB, vector<SDWORD>(CCC, -1)));
auto position = lower_bound(getValue.begin(), getValue.end(), 0); // 0以上の要素位置を探す
int idx_lower = distance(getValue.begin(), position); // 0以上の要素インデックス
int eraseNum = MIN(idx_lower, delCnt); // 要素位置が個数になる
priority_queue<int, std::vector<int>, greater<int>> que;
#endif
/*-----------------------------------------------------------------------------
定義
-------------------------------------------------------------------------------*/
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define INF 2e9
#define MOD (1000 * 1000 * 1000 + 7)
#define MIN(a, b) ((a) < (b) ? a : b)
#define MAX(a, b) ((a) > (b) ? a : b)
#define CeilN(x, n) (((((DWORD)(x)) + ((n)-1)) / n) * n) /* Nの倍数に切り上げ \
*/
#define FloorN(x, n) ((x) - (x) % (n)) /* Nの倍数に切り下げ */
#define IsOdd(x) (((x)&0x01UL) == 0x01UL)
#define IsEven(x) (!IsOdd((x)))
#define BitSetV(Val, Bit) ((Val) |= (Bit))
#define BitTstV(Val, Bit) ((Val) & (Bit))
#define ArrayLength(x) (sizeof(x) / sizeof(x[0]))
#define ArrayEnd(a) (&(a)[ArrayLength(a)])
#define ArrayLast(a) (&(a)[ArrayLength(a) - 1])
#define MAX_DWORD (0xFFFFFFFF)
#define MAX_SDWORD ((SDWORD)0x7FFFFFFF)
#define MIN_SDWORD ((SDWORD)0x80000000)
#define MAX_QWORD ((QWORD)0xFFFFFFFFFFFFFFFF)
#define MIN_QWORD ((QWORD)0x0000000000000000)
#define MAX_SQWORD ((SQWORD)0x7FFFFFFFFFFFFFFF)
#define MIN_SQWORD ((SQWORD)0x8000000000000000)
#define M_PI 3.14159265358979323846
#define deg_to_rad(deg) (((deg) / 180) * M_PI)
#define rad_to_deg(rad) ((rad * 180) / M_PI)
#define prique(T) priority_queue<T, vector<T>, greater<T>>
typedef long SDWORD;
typedef long long SQWORD;
typedef unsigned long DWORD;
typedef unsigned long long int QWORD;
typedef pair<int, int> P;
/*-----------------------------------------------------------------------------
自作ライブラリ
-------------------------------------------------------------------------------*/
/* 最大公約数 */
QWORD gcd(QWORD a, QWORD b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
/* 最小公倍数 */
QWORD lcm(QWORD a, QWORD b) { return a * b / gcd(a, b); }
/* 素数判定 */
bool pri(QWORD p) {
for (QWORD i = 2; i * i <= p; ++i)
if (p % i == 0)
return false;
return p > 1;
}
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n, -1) {}
int find(int x) {
if (par[x] < 0)
return x;
else
return par[x] = find(par[x]);
}
bool same(int x, int y) { return find(x) == find(y); }
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (-par[x] < -par[y])
swap(x, y);
par[x] += par[y];
par[y] = x;
}
};
typedef struct edge {
DWORD to;
QWORD cost;
edge() : to(0), cost(0) {}
edge(DWORD argTo, QWORD argCost) : to(argTo), cost(argCost) {}
bool operator>(const edge &e) const { return cost > e.cost; }
} EDGE;
typedef struct node {
DWORD point;
QWORD cost;
node(DWORD argPoint, QWORD argCost) : point(argPoint), cost(argCost) {}
bool operator>(const node &n) const { return cost > n.cost; }
} NODE;
/*-----------------------------------------------------------------------------
処理
-------------------------------------------------------------------------------*/
vector<int> nodeList[N_MAX];
int N, Q;
vector<int> res;
void dfs(int from, int prevfrom = -1) {
for (auto nextTo : nodeList[from]) {
if (nextTo != prevfrom) {
res[nextTo] += res[from];
dfs(nextTo, from);
}
}
}
int main() {
cin >> N >> Q;
REP(i, N - 1) {
int a, b;
cin >> a >> b;
a--;
b--;
nodeList[a].push_back(b);
nodeList[b].push_back(a);
};
res.resize(N, 0);
REP(i, Q) {
int a, b;
cin >> a >> b;
a--;
res[i] += b;
};
dfs(0);
for (auto resOne : res) {
cout << resOne << " ";
}
cout << endl;
return 0;
}
|
//#include "stdafx.h"
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
/*-----------------------------------------------------------------------------
パラメータ定義
-------------------------------------------------------------------------------*/
#define N_MAX (200000)
#define K_MAX (10)
#define M_MAX (10)
#define H_MAX (1000)
#define W_MAX (1000)
using namespace std;
/*-----------------------------------------------------------------------------
メモ
-------------------------------------------------------------------------------*/
#if 0
vector<vector<vector<SDWORD>>> XXX(AAA, vector<vector<SDWORD>>(BBBB, vector<SDWORD>(CCC, -1)));
auto position = lower_bound(getValue.begin(), getValue.end(), 0); // 0以上の要素位置を探す
int idx_lower = distance(getValue.begin(), position); // 0以上の要素インデックス
int eraseNum = MIN(idx_lower, delCnt); // 要素位置が個数になる
priority_queue<int, std::vector<int>, greater<int>> que;
#endif
/*-----------------------------------------------------------------------------
定義
-------------------------------------------------------------------------------*/
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define INF 2e9
#define MOD (1000 * 1000 * 1000 + 7)
#define MIN(a, b) ((a) < (b) ? a : b)
#define MAX(a, b) ((a) > (b) ? a : b)
#define CeilN(x, n) (((((DWORD)(x)) + ((n)-1)) / n) * n) /* Nの倍数に切り上げ \
*/
#define FloorN(x, n) ((x) - (x) % (n)) /* Nの倍数に切り下げ */
#define IsOdd(x) (((x)&0x01UL) == 0x01UL)
#define IsEven(x) (!IsOdd((x)))
#define BitSetV(Val, Bit) ((Val) |= (Bit))
#define BitTstV(Val, Bit) ((Val) & (Bit))
#define ArrayLength(x) (sizeof(x) / sizeof(x[0]))
#define ArrayEnd(a) (&(a)[ArrayLength(a)])
#define ArrayLast(a) (&(a)[ArrayLength(a) - 1])
#define MAX_DWORD (0xFFFFFFFF)
#define MAX_SDWORD ((SDWORD)0x7FFFFFFF)
#define MIN_SDWORD ((SDWORD)0x80000000)
#define MAX_QWORD ((QWORD)0xFFFFFFFFFFFFFFFF)
#define MIN_QWORD ((QWORD)0x0000000000000000)
#define MAX_SQWORD ((SQWORD)0x7FFFFFFFFFFFFFFF)
#define MIN_SQWORD ((SQWORD)0x8000000000000000)
#define M_PI 3.14159265358979323846
#define deg_to_rad(deg) (((deg) / 180) * M_PI)
#define rad_to_deg(rad) ((rad * 180) / M_PI)
#define prique(T) priority_queue<T, vector<T>, greater<T>>
typedef long SDWORD;
typedef long long SQWORD;
typedef unsigned long DWORD;
typedef unsigned long long int QWORD;
typedef pair<int, int> P;
/*-----------------------------------------------------------------------------
自作ライブラリ
-------------------------------------------------------------------------------*/
/* 最大公約数 */
QWORD gcd(QWORD a, QWORD b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
/* 最小公倍数 */
QWORD lcm(QWORD a, QWORD b) { return a * b / gcd(a, b); }
/* 素数判定 */
bool pri(QWORD p) {
for (QWORD i = 2; i * i <= p; ++i)
if (p % i == 0)
return false;
return p > 1;
}
struct UnionFind {
vector<int> par;
UnionFind(int n) : par(n, -1) {}
int find(int x) {
if (par[x] < 0)
return x;
else
return par[x] = find(par[x]);
}
bool same(int x, int y) { return find(x) == find(y); }
void unite(int x, int y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (-par[x] < -par[y])
swap(x, y);
par[x] += par[y];
par[y] = x;
}
};
typedef struct edge {
DWORD to;
QWORD cost;
edge() : to(0), cost(0) {}
edge(DWORD argTo, QWORD argCost) : to(argTo), cost(argCost) {}
bool operator>(const edge &e) const { return cost > e.cost; }
} EDGE;
typedef struct node {
DWORD point;
QWORD cost;
node(DWORD argPoint, QWORD argCost) : point(argPoint), cost(argCost) {}
bool operator>(const node &n) const { return cost > n.cost; }
} NODE;
/*-----------------------------------------------------------------------------
処理
-------------------------------------------------------------------------------*/
vector<int> nodeList[N_MAX];
int N, Q;
vector<int> res;
void dfs(int from, int prevfrom = -1) {
for (auto nextTo : nodeList[from]) {
if (nextTo != prevfrom) {
res[nextTo] += res[from];
dfs(nextTo, from);
}
}
}
int main() {
cin >> N >> Q;
REP(i, N - 1) {
int a, b;
cin >> a >> b;
a--;
b--;
nodeList[a].push_back(b);
nodeList[b].push_back(a);
};
res.resize(N, 0);
REP(i, Q) {
int a, b;
cin >> a >> b;
a--;
res[a] += b;
};
dfs(0);
for (auto resOne : res) {
cout << resOne << " ";
}
cout << endl;
return 0;
}
|
[
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 738,727
| 738,728
|
u796408111
|
cpp
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.