Submission #75002312


Source Code Expand

#include <bits/stdc++.h>

using namespace std;

mt19937_64    rng(chrono::steady_clock::now().time_since_epoch().count());

#define       nline                     "\n"
#define       pb                        push_back
#define       ppb                       pop_back
#define       mp                        make_pair
#define       ff                        first
#define       ss                        second
#define       fall(x, n)                for(int x=0; x<n; x++)
#define       rall(x, n)                for(int x=n-1; x>=0; x--)
#define       frange(x, start, end)     for(int x=start; x<=end; x++)
#define       rrange(x, start, end)     for(int x=start; x>=end; x--)
#define       in(i, v)                  for(auto &i: v) cin >> i;
#define       vi                        vector<int>
#define       ii                        pair<int, int>
#define       sz(x)                     ((int)(x).size())
#define       all(x)                    (x).begin(), (x).end()
#define       mod                       1000000007
#define       INF                       0x1fffffffffffffffLL

typedef       long long                 ll;
typedef       unsigned long long        ull;
typedef       long double               lld;

#ifdef        LOCAL
#include      "debug.h"
#else
#define       debug(x)
#endif

#define       int                       long long

void solve()
{
    int n, m; cin >> n >> m;
    vi flag(3, 0);
    auto cal = [&](int s) {
        if (!s) return;
        if (s == 1) flag[0] = 1;
        else if (s == 2) flag[1] = 1;
        else if (s == 3) flag[0] = flag[1] = 1;
        else if (s == 4) flag[2] = 1;
        else if (s == 5) flag[0] = flag[2] = 1;
        else if (s == 6) flag[1] = flag[2] = 1;
        else flag[0] = flag[1] = flag[2] = 1;
    };
    cal(n); cal(m);
    int ans = 0;
    ans += flag[0] ? 1 : 0;
    ans += flag[1] ? 2 : 0;
    ans += flag[2] ? 4 : 0;
    cout << ans << nline;
}

signed main()
{
#ifdef LOCAL
    freopen("i.txt", "r", stdin); freopen("o.txt", "w", stdout); freopen("e.txt", "w", stderr);
#endif
    auto begin = chrono::high_resolution_clock::now();
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int t = 1;
    while (t--) solve();
    auto end = chrono::high_resolution_clock::now();
    auto elapsed = chrono::duration_cast<chrono::nanoseconds>(end - begin);
    cerr << fixed << "Time measured <= *_* => " << elapsed.count() * 1e-9 << " seconds.\n";
    return 0;
}

Submission Info

Submission Time
Task B - 1-2-4 Test
User kumaresh_rk
Language C++23 (GCC 15.2.0)
Score 100
Code Size 2518 Byte
Status AC
Exec Time 1 ms
Memory 4016 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 10
Set Name Test Cases
Sample example_00.txt, example_01.txt, example_02.txt
All example_00.txt, example_01.txt, example_02.txt, hand_00.txt, hand_01.txt, hand_02.txt, hand_03.txt, hand_04.txt, hand_05.txt, hand_06.txt
Case Name Status Exec Time Memory
example_00.txt AC 1 ms 3964 KiB
example_01.txt AC 1 ms 4004 KiB
example_02.txt AC 1 ms 3836 KiB
hand_00.txt AC 1 ms 3816 KiB
hand_01.txt AC 1 ms 3940 KiB
hand_02.txt AC 1 ms 3904 KiB
hand_03.txt AC 1 ms 3940 KiB
hand_04.txt AC 1 ms 3888 KiB
hand_05.txt AC 1 ms 3792 KiB
hand_06.txt AC 1 ms 4016 KiB