oj.uz

Submission #253606

# Submission time Handle Problem Language Result Execution time Memory
253606 2020-07-28T12:40:37 Z Vimmer Marko (COCI15_marko) C++14
50 / 50
 9 ms 1408 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define pf push_front
#define N 10005
#define M ll(998244353)
#define inf 1e9 + 1e9

using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef short int si;
typedef array <ll, 3> a3;
typedef array <ll, 4> a4;

//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;


set <char> se[10];

int main()
{
    //freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    char c = 'a';

    for (int i = 2; i <= 9; i++)
    {
        int kol = 3;

        if (i == 7 || i == 9) kol++;

        while (kol > 0)
        {
            kol--;

            se[i].insert(c++);
        }
    }
    int n;

    cin >> n;

    string s[n];

    for (int i = 0; i < n; i++) cin >> s[i];

    string t;

    cin >> t;

    int ans = 0;

    for (int i = 0; i < n; i++)
    {
        if (sz(s[i]) != sz(t)) continue;

        bool bad = 0;

        for (int j = 0; j < sz(t); j++)
          if (se[t[j] - '0'].find(s[i][j]) == se[t[j] - '0'].end()) {bad = 1; break;}

        if (!bad) ans++;
    }

    cout << ans << endl;
}

Subtask #1
50.0 / 50.0

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