| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1125513 | sleepntsheep | 복사 붙여넣기 2 (JOI15_copypaste2) | C11 | 193 ms | 2888 KiB | 
#include <stdio.h>
#define N (1 << 18)
int k, m, n,
    a[N], b[N], c[N];
char s[N];
int main()
{
  int i, j, ii;
  (void)scanf("%d%d%s%d", &k, &n, s, &m);
  for (i = 0; i < m; ++i)
    (void)scanf("%d%d%d", a + i, b + i, c + i);
  for (i = 0; i < k; ++i)
  {
    ii = i;
    for (j = m - 1; j >= 0; --j)
    {
      if (ii < c[j])
        continue;
      if (ii < b[j] + c[j] - a[j])
        ii += a[j] - c[j];
      else
        ii += a[j] - b[j];
    }
    putchar(s[ii]);
  }
  return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
