oj.uz

Submission #23059

# Submission time Handle Problem Language Result Execution time Memory
23059 2017-05-02T14:37:56 Z model_code Tavan (COCI16_tavan) C++11
80 / 80
 0 ms 2276 KB 
#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;

const int MAXN = 510;

int n, m, k, x, br;

char s[MAXN];
char niz[MAXN][MAXN];

int pos[MAXN];

int main()
{
  scanf("%d %d %d %d", &n, &m, &k, &x);
  scanf("%s", s);
  for(int i = 0; i < n; i++)
    if(s[i] == '#')
      pos[br++] = i;
  for(int i = 0; i < m; i++)
    scanf("%s", niz[i]);
  if(m == 1 && k == 3)
  {
    char zelim = 'a';
    for(int a = 0; a < 3; a++)
      for(int b = 0; b < 3; b++)
        for(int c = 0; c < 3; c++)
        {
          if(a == b || a == c || b == c) continue;
          if(niz[0][a] < niz[0][b] && niz[0][b] < niz[0][c])
          {
            if(x == 1) zelim = niz[0][a];
            if(x == 2) zelim = niz[0][b];
            if(x == 3) zelim = niz[0][c];
          }
        }
    s[pos[0]] = zelim;
    printf("%s\n", s);
  } 
  else if(m == 1)
  {
    sort(niz[0], niz[0] + k);
    s[pos[0]] = niz[0][x - 1];
    printf("%s\n", s);
    return 0;
  }
  else
  {
    x--;
    for(int i = 0; i < m; i++)
      sort(niz[i], niz[i] + k);
    for(int i = 0; i < m; i++)
      s[pos[i]] = niz[i][0];
    for(int i = m - 1; i >= 0; i--)
    {
      if(x == 0) break;
      int koji = x % k;
      s[pos[i]] = niz[i][koji];
      x /= k;
    }
    printf("%s\n", s);    
  }
  return 0;
}

Compilation message

tavan.cpp: In function 'int main()':
tavan.cpp:18:39: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d %d", &n, &m, &k, &x);
                                       ^
tavan.cpp:19:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s", s);
                 ^
tavan.cpp:24:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%s", niz[i]);
                        ^

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2276 KB Output is correct
2 Correct 0 ms 2276 KB Output is correct
3 Correct 0 ms 2276 KB Output is correct
4 Correct 0 ms 2276 KB Output is correct
5 Correct 0 ms 2276 KB Output is correct
6 Correct 0 ms 2276 KB Output is correct
7 Correct 0 ms 2276 KB Output is correct
8 Correct 0 ms 2276 KB Output is correct
9 Correct 0 ms 2276 KB Output is correct
10 Correct 0 ms 2276 KB Output is correct