| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 471232 |
2021-09-07T19:14:44 Z |
rainboy |
Garaža (COCI17_garaza) |
C |
|
543 ms |
139964 KB |
#include <stdio.h>
#include <string.h>
#define N 100000
#define N_ (1 << 17) /* N_ = pow2(ceil(log2(N))) */
#define K 32
int aa[N];
int st[N_ * 2], n_; long long cnt[N_ * 2];
int pp[N_ * 2][K], cp[N_ * 2][K], nnp[N_ * 2];
int qq[N_ * 2][K], cq[N_ * 2][K], nnq[N_ * 2];
int gcd(int a, int b) {
return b == 0 ? a : gcd(b, a % b);
}
long long solve(int *aa, int *cc, int n, int *bb, int *dd, int m) {
int i, j, d;
long long ans;
d = 0, ans = 0;
for (i = n - 1, j = 0, d = 0; i >= 0; i--) {
int a = i + 1 == n ? aa[i] : aa[i] / aa[i + 1];
while (j < m && (a = gcd(a, bb[j])) > 1)
d += dd[j++];
ans += (long long) cc[i] * d;
}
return ans;
}
int merge(int *aa, int *cc, int n, int *bb, int *dd, int m, int *ab, int *cd) {
int j, k, a;
memcpy(ab, aa, n * sizeof *aa), memcpy(cd, cc, n * sizeof *cc);
a = aa[n - 1], k = n;
for (j = 0; j < m; j++) {
a = gcd(a, bb[j]);
if (ab[k - 1] != a)
ab[k] = a, cd[k] = dd[j], k++;
else
cd[k - 1] += dd[j];
}
return k;
}
void pul(int i) {
int l = i << 1, r = l | 1;
st[i] = gcd(st[l], st[r]);
cnt[i] = cnt[l] + cnt[r] + solve(qq[l], cq[l], nnq[l], pp[r], cp[l], nnp[r]);
nnp[i] = merge(pp[l], cp[l], nnp[l], pp[r], cp[r], nnp[r], pp[i], cp[i]);
nnq[i] = merge(qq[r], cq[r], nnq[r], qq[l], cq[l], nnq[l], qq[i], cq[i]);
}
void build(int *aa, int n) {
int i;
n_ = 1;
while (n_ < n)
n_ <<= 1;
for (i = 0; i < n_; i++) {
int a = i < n ? aa[i] : 1;
st[n_ + i] = a;
cnt[n_ + i] = a == 1 ? 0 : 1;
pp[n_ + i][0] = a, cp[n_ + i][0] = 1, nnp[n_ + i] = 1;
qq[n_ + i][0] = a, cq[n_ + i][0] = 1, nnq[n_ + i] = 1;
}
for (i = n_ - 1; i > 0; i--)
pul(i);
}
void update(int i, int x) {
st[n_ + i] = x;
cnt[n_ + i] = x == 1 ? 0 : 1;
pp[n_ + i][0] = x, cp[n_ + i][0] = 1, nnp[n_ + i] = 1;
qq[n_ + i][0] = x, cq[n_ + i][0] = 1, nnq[n_ + i] = 1;
i += n_;
while (i > 1)
pul(i >>= 1);
}
long long query(int l, int r) {
static int pp_[K], cp_[K], qq_[K], cq_[K], pp1[K], cp1[K], qq1[K], cq1[K];
int np, nq;
long long cntl, cntr;
np = nq = 0, cntl = cntr = 0;
for (l += n_, r += n_; l <= r; l >>= 1, r >>= 1) {
if ((l & 1) == 1) {
cntl += solve(qq_, cq_, nq, pp[l], cp[l], nnp[l]) + cnt[l];
nq = merge(qq[l], cq[l], nnq[l], qq_, cq_, nq, qq1, cq1);
memcpy(qq_, qq1, nq * sizeof *qq1), memcpy(cq_, cq1, nq * sizeof *cq1);
l++;
}
if ((r & 1) == 0) {
cntr += cnt[r] + solve(qq[r], cq[r], nnq[r], pp_, cp_, np);
np = merge(pp[r], cp[r], nnp[r], pp_, cp_, np, pp1, cp1);
memcpy(pp_, pp1, np * sizeof *pp1), memcpy(cp_, cp1, np * sizeof *cp1);
r--;
}
}
return cntl + cntr + solve(qq_, cq_, nq, pp_, cp_, np);
}
int main() {
int n, q, i;
scanf("%d%d", &n, &q);
for (i = 0; i < n; i++)
scanf("%d", &aa[i]);
build(aa, n);
while (q--) {
int t;
scanf("%d", &t);
if (t == 1) {
int x;
scanf("%d%d", &i, &x);
update(i, x);
} else {
int l, r;
scanf("%d%d", &l, &r), l--, r--;
printf("%lld\n", query(l, r));
}
}
return 0;
}
Compilation message
garaza.c: In function 'main':
garaza.c:110:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
110 | scanf("%d%d", &n, &q);
| ^~~~~~~~~~~~~~~~~~~~~
garaza.c:112:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
112 | scanf("%d", &aa[i]);
| ^~~~~~~~~~~~~~~~~~~
garaza.c:117:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
117 | scanf("%d", &t);
| ^~~~~~~~~~~~~~~
garaza.c:121:4: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
121 | scanf("%d%d", &i, &x);
| ^~~~~~~~~~~~~~~~~~~~~
garaza.c:126:4: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
126 | scanf("%d%d", &l, &r), l--, r--;
| ^~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
4 ms |
1356 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
112 ms |
35012 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
284 ms |
69944 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
543 ms |
139964 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
