oj.uz

답안 #851254

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
851254 2023-09-19T07:20:23 Z LucaIlie Crossing (JOI21_crossing) C++17
26 / 100
 7000 ms 2260 KB 
#include <bits/stdc++.h>

using namespace std;


char other( char a, char b ) {
    if ( a != 'J' && b != 'J' )
        return 'J';
    if ( a != 'O' && b != 'O' )
        return 'O';
    return 'I';
}

string combine( string a, string b ) {
    string ans;
    ans.resize( a.size() );
    for ( int i = 0; i < a.size(); i++ )
        ans[i] = (a[i] == b[i] ? a[i] : other( a[i], b[i] ) );
    return ans;
}

set<string> s;

int main() {
    int n, q;
    string s1, s2, s3, t;

    cin >> n >> s1 >> s2 >> s3;

    s.insert( s1 );
    s.insert( s2 );
    s.insert( s3 );
    bool isNew = true;
    while ( isNew ) {
        isNew = false;
        set<string> newS;
        for ( string x: s ) {
            string y1 = combine( x, s1 );
            string y2 = combine( x, s2 );
            string y3 = combine( x, s3 );

            if ( s.find( y1 ) == s.end() && newS.find( y1 ) == newS.end() ) {
                isNew = true;
                newS.insert( y1 );
            }
            if ( s.find( y2 ) == s.end() && newS.find( y2 ) == newS.end() ) {
                isNew = true;
                newS.insert( y2 );
            }
            if ( s.find( y3 ) == s.end() && newS.find( y3 ) == newS.end() ) {
                isNew = true;
                newS.insert( y3 );
            }
        }

        for ( string x: newS )
            s.insert( x );
    }
  
  	if ( s.size() > 9 )
      return 1;

    cin >> q >> t;
    cout << ((s.find( t ) != s.end()) ? "Yes\n" : "No\n");
    while ( q-- ) {
        int l, r;
        char ch;

        cin >> l >> r >> ch;
        l--;
        r--;
        for ( int i = l; i <= r; i++ )
            t[i] = ch;

        cout << ((s.find( t ) != s.end()) ? "Yes\n" : "No\n");
    }
  

    return 0;
}

Compilation message

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

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 282 ms 1200 KB Output is correct
2 Correct 296 ms 968 KB Output is correct
3 Correct 302 ms 912 KB Output is correct
4 Correct 289 ms 756 KB Output is correct
5 Correct 284 ms 944 KB Output is correct
6 Correct 281 ms 900 KB Output is correct
7 Correct 288 ms 968 KB Output is correct
8 Correct 312 ms 1108 KB Output is correct
9 Correct 291 ms 824 KB Output is correct
10 Correct 298 ms 1128 KB Output is correct
11 Correct 289 ms 852 KB Output is correct
12 Correct 287 ms 1004 KB Output is correct
13 Correct 291 ms 856 KB Output is correct
14 Correct 289 ms 848 KB Output is correct
15 Correct 296 ms 1160 KB Output is correct
16 Correct 291 ms 996 KB Output is correct
17 Correct 299 ms 1012 KB Output is correct
18 Correct 305 ms 1000 KB Output is correct

Subtask #2
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 282 ms 1200 KB Output is correct
2 Correct 296 ms 968 KB Output is correct
3 Correct 302 ms 912 KB Output is correct
4 Correct 289 ms 756 KB Output is correct
5 Correct 284 ms 944 KB Output is correct
6 Correct 281 ms 900 KB Output is correct
7 Correct 288 ms 968 KB Output is correct
8 Correct 312 ms 1108 KB Output is correct
9 Correct 291 ms 824 KB Output is correct
10 Correct 298 ms 1128 KB Output is correct
11 Correct 289 ms 852 KB Output is correct
12 Correct 287 ms 1004 KB Output is correct
13 Correct 291 ms 856 KB Output is correct
14 Correct 289 ms 848 KB Output is correct
15 Correct 296 ms 1160 KB Output is correct
16 Correct 291 ms 996 KB Output is correct
17 Correct 299 ms 1012 KB Output is correct
18 Correct 305 ms 1000 KB Output is correct
19 Correct 3544 ms 2208 KB Output is correct
20 Execution timed out 7075 ms 2260 KB Time limit exceeded
21 Halted 0 ms 0 KB -

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 282 ms 1200 KB Output is correct
2 Correct 296 ms 968 KB Output is correct
3 Correct 302 ms 912 KB Output is correct
4 Correct 289 ms 756 KB Output is correct
5 Correct 284 ms 944 KB Output is correct
6 Correct 281 ms 900 KB Output is correct
7 Correct 288 ms 968 KB Output is correct
8 Correct 312 ms 1108 KB Output is correct
9 Correct 291 ms 824 KB Output is correct
10 Correct 298 ms 1128 KB Output is correct
11 Correct 289 ms 852 KB Output is correct
12 Correct 287 ms 1004 KB Output is correct
13 Correct 291 ms 856 KB Output is correct
14 Correct 289 ms 848 KB Output is correct
15 Correct 296 ms 1160 KB Output is correct
16 Correct 291 ms 996 KB Output is correct
17 Correct 299 ms 1012 KB Output is correct
18 Correct 305 ms 1000 KB Output is correct
19 Correct 289 ms 1020 KB Output is correct
20 Correct 305 ms 848 KB Output is correct
21 Correct 294 ms 852 KB Output is correct
22 Correct 269 ms 948 KB Output is correct
23 Correct 299 ms 992 KB Output is correct
24 Correct 291 ms 752 KB Output is correct
25 Correct 299 ms 900 KB Output is correct
26 Correct 291 ms 980 KB Output is correct
27 Correct 292 ms 988 KB Output is correct
28 Correct 289 ms 848 KB Output is correct
29 Correct 296 ms 1004 KB Output is correct
30 Correct 296 ms 1296 KB Output is correct
31 Correct 293 ms 1000 KB Output is correct
32 Correct 295 ms 1200 KB Output is correct
33 Correct 301 ms 856 KB Output is correct
34 Correct 276 ms 780 KB Output is correct
35 Correct 300 ms 888 KB Output is correct
36 Correct 296 ms 848 KB Output is correct
37 Correct 300 ms 1004 KB Output is correct
38 Correct 313 ms 852 KB Output is correct
39 Correct 304 ms 1092 KB Output is correct
40 Correct 304 ms 828 KB Output is correct
41 Correct 313 ms 1228 KB Output is correct
42 Correct 294 ms 984 KB Output is correct
43 Correct 292 ms 876 KB Output is correct
44 Correct 293 ms 852 KB Output is correct

Subtask #4
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 282 ms 1200 KB Output is correct
2 Correct 296 ms 968 KB Output is correct
3 Correct 302 ms 912 KB Output is correct
4 Correct 289 ms 756 KB Output is correct
5 Correct 284 ms 944 KB Output is correct
6 Correct 281 ms 900 KB Output is correct
7 Correct 288 ms 968 KB Output is correct
8 Correct 312 ms 1108 KB Output is correct
9 Correct 291 ms 824 KB Output is correct
10 Correct 298 ms 1128 KB Output is correct
11 Correct 289 ms 852 KB Output is correct
12 Correct 287 ms 1004 KB Output is correct
13 Correct 291 ms 856 KB Output is correct
14 Correct 289 ms 848 KB Output is correct
15 Correct 296 ms 1160 KB Output is correct
16 Correct 291 ms 996 KB Output is correct
17 Correct 299 ms 1012 KB Output is correct
18 Correct 305 ms 1000 KB Output is correct
19 Correct 3544 ms 2208 KB Output is correct
20 Execution timed out 7075 ms 2260 KB Time limit exceeded
21 Halted 0 ms 0 KB -