# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1162925 | sleepntsheep | Restore Array (RMI19_restore) | C11 | 271 ms | 672 KiB |
#include <stdio.h>
int n, y, m, u[99999], v[99999], w[99999], d[9999];
/* xj - xi <= ww */
void inequality(int i, int j, int ww) {
u[y] = i;
v[y] = j;
w[y] = ww;
++y;
}
int main() {
scanf("%d%d", &n, &m);
for (int l, r, k, value; m--; ) {
scanf("%d%d%d%d", &l, &r, &k, &value);
k = (r - l + 2) - k;
++r;
if (value) {
inequality(r, l, -k);
} else {
inequality(l, r, k - 1);
}
}
for (int i = 0; i <= n; ++i) {
if (i) {
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |