oj.uz

Submission #771066

# Submission time Handle Problem Language Result Execution time Memory
771066 2023-07-02T12:13:00 Z davitmarg Crossing (JOI21_crossing) C++17
26 / 100
 1978 ms 1048576 KB 
/*
DavitMarg
In a honky-tonk,
Down in Mexico
*/
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <bitset>
#include <stack>
#include <cassert>
#include <iterator>
#include <random>
#include <chrono>
#define mod 998244353ll
#define LL long long
#define LD long double
#define MP make_pair    
#define PB push_back
#define all(v) v.begin(), v.end()
#define fastIO ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
using namespace std;

const int N = 500005;


string crossing(string a, string b)
{
    string s = a;
    for (int i = 0; i < a.length(); i++)
    {
        if (a[i] == b[i])
            continue;
        s[i] = '0' + ((a[i] - '0') ^ (b[i] - '0'));
    }
    return s;
}

string norm(string s)
{
    for (int i = 0; i < s.length(); i++)
    {
        if (s[i] == 'J')
            s[i] = '1';
        else if(s[i] == 'O')
			s[i] = '2';
		else
			s[i] = '3';
    }
    return s;
}

int n, q;
string s[N];
map<string, bool> used;

void solve()
{
    cin >> n;
    cin >> s[1] >> s[2] >> s[3];
    s[1] = norm(s[1]);
    s[2] = norm(s[2]);
    s[3] = norm(s[3]);

    for (int i = 1; i <= 3; i++)
        for (int j = 1; j <= 3; j++)
            for (int k = 1; k <= 3; k++)
                used[crossing(crossing(s[i], s[j]), s[k])] = 1;

    cin >> q;

    string t;
    cin >> t;
    if (used[norm(t)])
		cout << "Yes\n";
	else
		cout << "No\n";

    for (int i = 1; i <= q; i++)
    {
        int l, r;
        char c;
        cin>>l>>r>>c;
        for(int j = l - 1; j <= r - 1; j++)
            t[j] = c;

        if (used[norm(t)])
            cout << "Yes\n";
		else
			cout << "No\n";
    }
}


int main()
{
    fastIO;
    int T = 1;
    //cin >> T;
    while (T--)
    {
        solve();
    }

    return 0;
}

/*


*/

Compilation message

Main.cpp: In function 'std::string crossing(std::string, std::string)':
Main.cpp:39:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |     for (int i = 0; i < a.length(); i++)
      |                     ~~^~~~~~~~~~~~
Main.cpp: In function 'std::string norm(std::string)':
Main.cpp:50:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |     for (int i = 0; i < s.length(); i++)
      |                     ~~^~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 131 ms 42520 KB Output is correct
2 Correct 156 ms 48332 KB Output is correct
3 Correct 131 ms 28736 KB Output is correct
4 Correct 159 ms 48228 KB Output is correct
5 Correct 158 ms 48564 KB Output is correct
6 Correct 154 ms 46156 KB Output is correct
7 Correct 150 ms 44584 KB Output is correct
8 Correct 174 ms 49288 KB Output is correct
9 Correct 173 ms 48112 KB Output is correct
10 Correct 168 ms 52428 KB Output is correct
11 Correct 178 ms 50140 KB Output is correct
12 Correct 173 ms 52504 KB Output is correct
13 Correct 158 ms 50196 KB Output is correct
14 Correct 169 ms 52552 KB Output is correct
15 Correct 163 ms 50184 KB Output is correct
16 Correct 161 ms 52548 KB Output is correct
17 Correct 158 ms 50252 KB Output is correct
18 Correct 114 ms 23628 KB Output is correct

Subtask #2
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 131 ms 42520 KB Output is correct
2 Correct 156 ms 48332 KB Output is correct
3 Correct 131 ms 28736 KB Output is correct
4 Correct 159 ms 48228 KB Output is correct
5 Correct 158 ms 48564 KB Output is correct
6 Correct 154 ms 46156 KB Output is correct
7 Correct 150 ms 44584 KB Output is correct
8 Correct 174 ms 49288 KB Output is correct
9 Correct 173 ms 48112 KB Output is correct
10 Correct 168 ms 52428 KB Output is correct
11 Correct 178 ms 50140 KB Output is correct
12 Correct 173 ms 52504 KB Output is correct
13 Correct 158 ms 50196 KB Output is correct
14 Correct 169 ms 52552 KB Output is correct
15 Correct 163 ms 50184 KB Output is correct
16 Correct 161 ms 52548 KB Output is correct
17 Correct 158 ms 50252 KB Output is correct
18 Correct 114 ms 23628 KB Output is correct
19 Runtime error 1978 ms 1048576 KB Execution killed with signal 9
20 Halted 0 ms 0 KB -

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 131 ms 42520 KB Output is correct
2 Correct 156 ms 48332 KB Output is correct
3 Correct 131 ms 28736 KB Output is correct
4 Correct 159 ms 48228 KB Output is correct
5 Correct 158 ms 48564 KB Output is correct
6 Correct 154 ms 46156 KB Output is correct
7 Correct 150 ms 44584 KB Output is correct
8 Correct 174 ms 49288 KB Output is correct
9 Correct 173 ms 48112 KB Output is correct
10 Correct 168 ms 52428 KB Output is correct
11 Correct 178 ms 50140 KB Output is correct
12 Correct 173 ms 52504 KB Output is correct
13 Correct 158 ms 50196 KB Output is correct
14 Correct 169 ms 52552 KB Output is correct
15 Correct 163 ms 50184 KB Output is correct
16 Correct 161 ms 52548 KB Output is correct
17 Correct 158 ms 50252 KB Output is correct
18 Correct 114 ms 23628 KB Output is correct
19 Correct 152 ms 47128 KB Output is correct
20 Correct 153 ms 28984 KB Output is correct
21 Correct 172 ms 50832 KB Output is correct
22 Correct 148 ms 40704 KB Output is correct
23 Correct 176 ms 51308 KB Output is correct
24 Correct 158 ms 47812 KB Output is correct
25 Correct 168 ms 50848 KB Output is correct
26 Correct 141 ms 41980 KB Output is correct
27 Correct 170 ms 51024 KB Output is correct
28 Correct 151 ms 47756 KB Output is correct
29 Correct 172 ms 49152 KB Output is correct
30 Correct 138 ms 41164 KB Output is correct
31 Correct 168 ms 51684 KB Output is correct
32 Correct 165 ms 51240 KB Output is correct
33 Correct 161 ms 49740 KB Output is correct
34 Correct 145 ms 44444 KB Output is correct
35 Correct 164 ms 52724 KB Output is correct
36 Correct 160 ms 50528 KB Output is correct
37 Correct 171 ms 52768 KB Output is correct
38 Correct 162 ms 50492 KB Output is correct
39 Correct 181 ms 52772 KB Output is correct
40 Correct 160 ms 50456 KB Output is correct
41 Correct 169 ms 52688 KB Output is correct
42 Correct 164 ms 50476 KB Output is correct
43 Correct 161 ms 45900 KB Output is correct
44 Correct 162 ms 49576 KB Output is correct

Subtask #4
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 131 ms 42520 KB Output is correct
2 Correct 156 ms 48332 KB Output is correct
3 Correct 131 ms 28736 KB Output is correct
4 Correct 159 ms 48228 KB Output is correct
5 Correct 158 ms 48564 KB Output is correct
6 Correct 154 ms 46156 KB Output is correct
7 Correct 150 ms 44584 KB Output is correct
8 Correct 174 ms 49288 KB Output is correct
9 Correct 173 ms 48112 KB Output is correct
10 Correct 168 ms 52428 KB Output is correct
11 Correct 178 ms 50140 KB Output is correct
12 Correct 173 ms 52504 KB Output is correct
13 Correct 158 ms 50196 KB Output is correct
14 Correct 169 ms 52552 KB Output is correct
15 Correct 163 ms 50184 KB Output is correct
16 Correct 161 ms 52548 KB Output is correct
17 Correct 158 ms 50252 KB Output is correct
18 Correct 114 ms 23628 KB Output is correct
19 Runtime error 1978 ms 1048576 KB Execution killed with signal 9
20 Halted 0 ms 0 KB -