oj.uz

Submission #750965

# Submission time Handle Problem Language Result Execution time Memory
750965 2023-05-30T16:50:09 Z joelgun14 Crossing (JOI21_crossing) C++17
3 / 100
 7000 ms 1828 KB 
// header file
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
// pragma
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
// macros
#define endl "\n"
#define ll long long
#define mp make_pair
#define ins insert
#define lb lower_bound
#define pb push_back
#define ub upper_bound
#define lll __int128
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_multiset;
typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set;
string operate(string a, string b) {
    for(int it = 0; it < a.size(); ++it) {
        if(a[it] == b[it])
            continue;
        bool j = 0, o = 0, i = 0;
        if(a[it] == 'J')
            j = 1;
        else if(a[it] == 'O')
            o = 1;
        else
            i = 1;
        if(b[it] == 'J')
            j = 1;
        else if(b[it] == 'O')
            o = 1;
        else
            i = 1;
        if(!j)
            a[it] = 'J';
        else if(!o)
            a[it] = 'O';
        else
            a[it] = 'I';
    }
    return a;
}
int main() {
    ios_base::sync_with_stdio(0); cin.tie(NULL);
    int n;
    cin >> n;
    // coba cek tiap possibility pengambilan
    // max pengambilan cmn 3?
    string a[3];
    cin >> a[0] >> a[1] >> a[2];
    int q;
    cin >> q;
    string init;
    cin >> init;
    bool ans = 0;
    for(int i = 0; i < 3; ++i) {
        string tmp = a[i];
        if(tmp == init)
            ans = 1;
        for(int j = 0; j < 3; ++j) {
            if(i == j)
                continue;
            // lakuin operasi antara a[i] dan a[j];
            tmp = operate(tmp, a[j]);
            if(tmp == init)
                ans = 1;
            for(int k = 0; k < 3; ++k) {
                if(i == k || j == k)
                    continue;
                tmp = operate(tmp, a[k]);
                if(tmp == init)
                    ans = 1;
            }
        }
    }
    if(ans)
        cout << "Yes" << endl;
    else
        cout << "No" << endl;
    // coba permutasi size 1, 2, 3
    while(q--) {
        int l, r;
        char x;
        cin >> l >> r >> x;
        for(int i = l - 1; i <= r - 1; ++i)
            init[i] = x;
        bool ans = 0;
        for(int i = 0; i < 3; ++i) {
            string tmp = a[i];
            if(tmp == init)
                ans = 1;
            for(int j = 0; j < 3; ++j) {
                // lakuin operasi antara a[i] dan a[j];
                if(i == j)
                    continue;
                tmp = operate(tmp, a[j]);
                if(tmp == init)
                    ans = 1;
                for(int k = 0; k < 3; ++k) {
                    if(i == k || j == k)
                        continue;
                    tmp = operate(tmp, a[k]);
                    if(tmp == init)
                        ans = 1;
                }
            }
        }
        if(ans)
            cout << "Yes" << endl;
        else
            cout << "No" << endl;
    }
    return 0;
}

Compilation message

Main.cpp: In function 'std::string operate(std::string, std::string)':
Main.cpp:24:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |     for(int it = 0; it < a.size(); ++it) {
      |                     ~~~^~~~~~~~~~
Main.cpp:27:28: warning: variable 'i' set but not used [-Wunused-but-set-variable]
   27 |         bool j = 0, o = 0, i = 0;
      |                            ^

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 465 ms 860 KB Output is correct
2 Correct 486 ms 944 KB Output is correct
3 Correct 521 ms 824 KB Output is correct
4 Correct 437 ms 872 KB Output is correct
5 Correct 420 ms 848 KB Output is correct
6 Correct 409 ms 912 KB Output is correct
7 Correct 449 ms 848 KB Output is correct
8 Correct 458 ms 896 KB Output is correct
9 Correct 432 ms 896 KB Output is correct
10 Correct 446 ms 1060 KB Output is correct
11 Correct 442 ms 860 KB Output is correct
12 Correct 437 ms 900 KB Output is correct
13 Correct 443 ms 860 KB Output is correct
14 Correct 474 ms 824 KB Output is correct
15 Correct 446 ms 884 KB Output is correct
16 Correct 451 ms 808 KB Output is correct
17 Correct 460 ms 852 KB Output is correct
18 Correct 505 ms 852 KB Output is correct

Subtask #2
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 465 ms 860 KB Output is correct
2 Correct 486 ms 944 KB Output is correct
3 Correct 521 ms 824 KB Output is correct
4 Correct 437 ms 872 KB Output is correct
5 Correct 420 ms 848 KB Output is correct
6 Correct 409 ms 912 KB Output is correct
7 Correct 449 ms 848 KB Output is correct
8 Correct 458 ms 896 KB Output is correct
9 Correct 432 ms 896 KB Output is correct
10 Correct 446 ms 1060 KB Output is correct
11 Correct 442 ms 860 KB Output is correct
12 Correct 437 ms 900 KB Output is correct
13 Correct 443 ms 860 KB Output is correct
14 Correct 474 ms 824 KB Output is correct
15 Correct 446 ms 884 KB Output is correct
16 Correct 451 ms 808 KB Output is correct
17 Correct 460 ms 852 KB Output is correct
18 Correct 505 ms 852 KB Output is correct
19 Execution timed out 7051 ms 1828 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 465 ms 860 KB Output is correct
2 Correct 486 ms 944 KB Output is correct
3 Correct 521 ms 824 KB Output is correct
4 Correct 437 ms 872 KB Output is correct
5 Correct 420 ms 848 KB Output is correct
6 Correct 409 ms 912 KB Output is correct
7 Correct 449 ms 848 KB Output is correct
8 Correct 458 ms 896 KB Output is correct
9 Correct 432 ms 896 KB Output is correct
10 Correct 446 ms 1060 KB Output is correct
11 Correct 442 ms 860 KB Output is correct
12 Correct 437 ms 900 KB Output is correct
13 Correct 443 ms 860 KB Output is correct
14 Correct 474 ms 824 KB Output is correct
15 Correct 446 ms 884 KB Output is correct
16 Correct 451 ms 808 KB Output is correct
17 Correct 460 ms 852 KB Output is correct
18 Correct 505 ms 852 KB Output is correct
19 Correct 830 ms 824 KB Output is correct
20 Correct 992 ms 896 KB Output is correct
21 Correct 790 ms 952 KB Output is correct
22 Correct 538 ms 792 KB Output is correct
23 Correct 766 ms 952 KB Output is correct
24 Correct 809 ms 832 KB Output is correct
25 Correct 974 ms 844 KB Output is correct
26 Correct 554 ms 904 KB Output is correct
27 Correct 699 ms 852 KB Output is correct
28 Correct 571 ms 760 KB Output is correct
29 Correct 705 ms 912 KB Output is correct
30 Correct 477 ms 752 KB Output is correct
31 Incorrect 942 ms 860 KB Output isn't correct
32 Halted 0 ms 0 KB -

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 465 ms 860 KB Output is correct
2 Correct 486 ms 944 KB Output is correct
3 Correct 521 ms 824 KB Output is correct
4 Correct 437 ms 872 KB Output is correct
5 Correct 420 ms 848 KB Output is correct
6 Correct 409 ms 912 KB Output is correct
7 Correct 449 ms 848 KB Output is correct
8 Correct 458 ms 896 KB Output is correct
9 Correct 432 ms 896 KB Output is correct
10 Correct 446 ms 1060 KB Output is correct
11 Correct 442 ms 860 KB Output is correct
12 Correct 437 ms 900 KB Output is correct
13 Correct 443 ms 860 KB Output is correct
14 Correct 474 ms 824 KB Output is correct
15 Correct 446 ms 884 KB Output is correct
16 Correct 451 ms 808 KB Output is correct
17 Correct 460 ms 852 KB Output is correct
18 Correct 505 ms 852 KB Output is correct
19 Execution timed out 7051 ms 1828 KB Time limit exceeded
20 Halted 0 ms 0 KB -