oj.uz

Submission #529005

# Submission time Handle Problem Language Result Execution time Memory
529005 2022-02-21T21:44:09 Z OttoTheDino Inside information (BOI21_servers) C++17
0 / 100
 52 ms 4172 KB 
#include <bits/stdc++.h>
using namespace std;

#define rep(i,s,e)                  for (int i = s; i <= e; ++i)
#define rrep(i,s,e)                 for (int i = s; i >= e; --i)
#define pb                          push_back
#define pf                          push_front
#define fi                          first
#define se                          second
#define all(a)                      a.begin(), a.end()
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<ll> vll;

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    int n, k; cin >> n >> k;
    int rec_r[n+1], rec_l[n+1], prop_r[n+1], prop_l[n+1];

    rep (i,1,n) rec_r[i] = rec_l[i] = prop_r[i] = prop_l[i] = i;

    rep (q,1,n+k-1) {
        char tp; cin >> tp;
        if (tp=='S') {
            int a, b; cin >> a >> b;
            if (b<a) swap(a,b);
            rec_r[a] = rec_r[b];
            prop_l[rec_r[a]] = a;
            rec_l[b] = rec_l[a];
            prop_r[rec_l[b]] = b;
        }
        else if (tp=='Q') {
            int a, d; cin >> a >> d;
            if (d<a && rec_l[a]<=d) cout << "yes\n";
            else if (d>a && rec_r[a]>=d) cout << "yes\n";
            else cout << "no\n";
        }
        else {
            int d; cin >> d;
            cout << prop_r[d]-prop_l[d]+1 << "\n";
        }
    }

    return 0;
}

Subtask #1
0 / 2.5

# Verdict Execution time Memory Grader output
1 Incorrect 18 ms 1476 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 2.5

# Verdict Execution time Memory Grader output
1 Incorrect 18 ms 1476 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 2.5

# Verdict Execution time Memory Grader output
1 Incorrect 18 ms 1536 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 2.5

# Verdict Execution time Memory Grader output
1 Incorrect 18 ms 1536 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 1448 KB Output is correct
2 Incorrect 51 ms 4172 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 1448 KB Output is correct
2 Incorrect 51 ms 4172 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 19 ms 1528 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 19 ms 1528 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 12.5

# Verdict Execution time Memory Grader output
1 Correct 18 ms 1504 KB Output is correct
2 Incorrect 52 ms 3744 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #10
0 / 12.5

# Verdict Execution time Memory Grader output
1 Correct 18 ms 1504 KB Output is correct
2 Incorrect 52 ms 3744 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #11
0 / 17.5

# Verdict Execution time Memory Grader output
1 Incorrect 19 ms 1328 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #12
0 / 17.5

# Verdict Execution time Memory Grader output
1 Incorrect 19 ms 1328 KB Output isn't correct
2 Halted 0 ms 0 KB -