oj.uz

Submission #734831

# Submission time Handle Problem Language Result Execution time Memory
734831 2023-05-03T06:55:02 Z GrindMachine Tenis (COI19_tenis) C++17
30 / 100
 500 ms 6900 KB 
// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

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

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    ll n, q; cin >> n >> q;
    ll a[3][n + 5], pos[3][n + 5];
    rep(j, 3) {
        rep1(i, n) {
            cin >> a[j][i];
            pos[j][a[j][i]] = i;
        }
    }

    while (q--) {
        ll t; cin >> t;
        if (t == 1) {
            ll s; cin >> s;
            queue<ll> q;
            q.push(s);

            vector<bool> vis(n + 5);
            vis[s] = 1;

            while (!q.empty()) {
                ll i = q.front();
                q.pop();

                rep(j, 3) {
                    ll p = pos[j][i];

                    if (p + 1 <= n) {
                        ll v = a[j][p + 1];
                        if (!vis[v]) {
                            vis[v] = 1;
                            q.push(v);
                        }
                    }
                }
            }

            ll cnt = count(all(vis), 1);

            if (cnt == n) {
                cout << "DA" << endl;
            }
            else {
                cout << "NE" << endl;
            }
        }
        else {
            ll j, x, y; cin >> j >> x >> y;
            j--;
            ll p1 = pos[j][x], p2 = pos[j][y];
            swap(a[j][p1], a[j][p2]);
            swap(pos[j][x], pos[j][y]);
        }
    }
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 324 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 324 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 324 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 324 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 340 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 324 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 324 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 35 ms 6632 KB Output is correct
14 Correct 33 ms 6644 KB Output is correct
15 Correct 35 ms 6620 KB Output is correct
16 Correct 42 ms 6664 KB Output is correct
17 Correct 49 ms 6636 KB Output is correct
18 Correct 41 ms 6732 KB Output is correct
19 Correct 45 ms 6708 KB Output is correct
20 Correct 27 ms 6668 KB Output is correct
21 Correct 45 ms 6692 KB Output is correct
22 Correct 37 ms 6656 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1079 ms 6900 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 324 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 324 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 320 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 35 ms 6632 KB Output is correct
14 Correct 33 ms 6644 KB Output is correct
15 Correct 35 ms 6620 KB Output is correct
16 Correct 42 ms 6664 KB Output is correct
17 Correct 49 ms 6636 KB Output is correct
18 Correct 41 ms 6732 KB Output is correct
19 Correct 45 ms 6708 KB Output is correct
20 Correct 27 ms 6668 KB Output is correct
21 Correct 45 ms 6692 KB Output is correct
22 Correct 37 ms 6656 KB Output is correct
23 Execution timed out 1079 ms 6900 KB Time limit exceeded
24 Halted 0 ms 0 KB -