Submission #469978

#TimeUsernameProblemLanguageResultExecution timeMemory
469978rainboyHokej (COCI17_hokej)C11
72 / 120
200 ms18004 KiB
#include <stdio.h> #include <assert.h> #define N 500000 #define M 500000 unsigned int X = 12345; int rand_() { return (X *= 3) >> 1; } int aa[N], bb[N]; void sort(int *ii, int l, int r) { while (l < r) { int i = l, j = l, k = r, i_ = ii[l + rand_() % (r - l)], tmp; while (j < k) if (aa[ii[j]] == aa[i_]) j++; else if (aa[ii[j]] > aa[i_]) { tmp = ii[i], ii[i] = ii[j], ii[j] = tmp; i++, j++; } else { k--; tmp = ii[j], ii[j] = ii[k], ii[k] = tmp; } sort(ii, l, i); l = k; } } int main() { static int ii[N], ii_[M * 6]; int n, m, h, i, j, k; long long ans; scanf("%d%d", &m, &n); for (i = 0; i < n; i++) { scanf("%d%d", &aa[i], &bb[i]); ii[i] = i; } sort(ii, 0, n); ans = 0; for (i = 0, j = 0; i < n && j < m * 6; i++) { int i_ = ii[i]; while (j < m * 6 && bb[i_]--) ii_[j++] = i_, ans += aa[i_]; } printf("%lld\n", ans); for (h = 0; h < 6; h++) printf("%d ", ii_[h * m + 0] + 1); printf("\n"); k = 0; for (j = 1; j < m; j++) for (h = 0; h < 6; h++) if (ii_[h * m + j] != ii_[h * m + j - 1]) k++; assert(k <= n * 3); printf("%d\n", k); for (j = 1; j < m; j++) for (h = 0; h < 6; h++) if (ii_[h * m + j] != ii_[h * m + j - 1]) printf("%d %d %d\n", j, ii_[h * m + j - 1] + 1, ii_[h * m + j] + 1); return 0; }

Compilation message (stderr)

hokej.c: In function 'main':
hokej.c:39:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   39 |  scanf("%d%d", &m, &n);
      |  ^~~~~~~~~~~~~~~~~~~~~
hokej.c:41:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   41 |   scanf("%d%d", &aa[i], &bb[i]);
      |   ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...