# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
694973 | rainboy | Telegraph (JOI16_telegraph) | C11 | 35 ms | 3532 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
#include <string.h>
#define N 100000
#define INF 0x3f3f3f3f
int min(int a, int b) { return a < b ? a : b; }
int main() {
static int pp[N], cc1[N], cc2[N], jj[N];
static char visited[N];
int n, i, j, c, x;
long long ans;
scanf("%d", &n);
memset(jj, -1, n * sizeof *jj);
ans = 0;
for (j = 0; j < n; j++) {
scanf("%d%d", &i, &c), i--;
pp[j] = i;
if (cc1[i] < c)
cc2[i] = cc1[i], cc1[i] = c, jj[i] = j;
else if (cc2[i] < c)
cc2[i] = c;
ans += c;
}
for (i = 0; i < n; i++)
ans -= cc1[i];
for (i = 0; i < n; i++)
if (!visited[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... |