oj.uz

Submission #245370

# Submission time Handle Problem Language Result Execution time Memory
245370 2020-07-06T07:16:55 Z kartel Kartomat (COCI17_kartomat) C++14
80 / 80
 5 ms 436 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +405
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e9)
#define el '\n'
//#define el endl
#define pii pair <int, int>
#define err ld(1e-9)
#define last(x) x.back()
#define all(x) (x).begin(), (x).end()
#define arr_all(x, n) (x + 1), (x + 1 + n)
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

string Map[4];
int pos[26][2] = {{0, 3}, {0, 4}, {0, 5}, {0, 6}, {0, 7},
                  {1, 0}, {1, 1}, {1, 2}, {1, 3}, {1, 4}, {1, 5}, {1, 6}, {1, 7},
                  {2, 0}, {2, 1}, {2, 2}, {2, 3}, {2, 4}, {2, 5}, {2, 6}, {2, 7},
                  {3, 0}, {3, 1}, {3, 2}, {3, 3}, {3, 4}};

string s[N], t;
int n, i, j;

int main()
{
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
//
//    in("input.txt");
//    out("output.txt");

    cin >> n;

    for (i = 1; i <= n; i++) cin >> s[i];
    cin >> t;

    for (i = 0; i < 4; i++)
      for (j = 0; j < 8; j++) Map[i] += "*";

    for (i = 1; i <= n; i++)
        {
            j = 0;
            while (j < sz(t) && s[i][j] == t[j]) j++;
            if (sz(s[i]) > j && j == sz(t))
                Map[pos[s[i][j] - 'A'][0]][pos[s[i][j] - 'A'][1]] = s[i][j];
        }

    for (i = 0; i < 4; i++) cout << Map[i] << el;
}

//
//00000
//00110
//00111
//00011
//00000

Subtask #1
80.0 / 80.0

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