oj.uz

답안 #967444

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
967444 2024-04-22T06:14:47 Z LucaIlie 길고양이 (JOI20_stray) C++17
100 / 100
 42 ms 17088 KB 
#include "Anthony.h"
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 2e4;
const int MAX_M = 2e4;
bool vis[MAX_N], visE[MAX_M];
int d[MAX_N];
vector<int> adj[MAX_N], uu, vv;
int pattern[6] = { 0, 0, 1, 0, 1, 1 };

vector<int> X;

void dfs( int u, int p, int t ) {
    if ( p != -1 && adj[u].size() == 2 )
        t = (t + 1) % 6;
    else
        t = (pattern[t] == 0 ? 2 : 0);

    for ( int e: adj[u] ) {
        if ( e == p )
            continue;
        X[e] = pattern[t];
        int v = (uu[e] == u ? vv[e] : uu[e]);
        dfs( v, e, t );
    }
}

vector<int> Mark( int N, int M, int A, int B, vector<int> U, vector<int> V ) {
    X.resize( M );
    uu = U;
    vv = V;

    for ( int i = 0; i < M; i++ ) {
        adj[U[i]].push_back( i );
        adj[V[i]].push_back( i );
    }

    if ( A >= 3 ) {
        queue<int> q;

        d[0] = 0;
        vis[0] = true;
        q.push( 0 );
        while ( !q.empty()) {
            int u = q.front();
            q.pop();

            for ( int e: adj[u] ) {
                if ( visE[e] )
                    continue;
                visE[e] = true;
                int v = (U[e] == u ? V[e] : U[e]);
                X[e] = d[u];
                if ( vis[v] )
                    continue;
                d[v] = (d[u] + 1) % 3;
                vis[v] = true;
                q.push( v );
            }
        }
    } else {
        dfs( 0, -1, 0 );
    }

    return X;
}
#include "Catherine.h"
#include <bits/stdc++.h>

using namespace std;

set<string> down;

int A, B;
void Init( int a, int b ) {
    A = a;
    B = b;
    down.insert( "00101" );
    down.insert( "01011" );
    down.insert( "10110" );
    down.insert( "01100" );
    down.insert( "11001" );
    down.insert( "10010" );
}
//001011 001011
int t = -1, p = -1;
bool dir = false;
string s = "";

int Move( vector<int> y ) {
    if ( A >= 3 ) {
        if ( y[0] > 0 && y[2] == 0 )
            return 0;
        if ( y[1] > 0 && y[0] == 0 )
            return 1;
        if ( y[2] > 0 && y[1] == 0 )
            return 2;
    } else {
        t++;

        if ( y[0] + y[1] == 0 ) {
            dir = true;
            return -1;
        }
        if ( y[0] + y[1] + (t > 0) != 2 ) {
            if ( t > 0 )
                y[p]++;
            dir = true;
            int c = p;
            p = (y[0] == 1 ? 0 : 1);
            if ( t > 0 )
                y[c]--;
            if ( y[p] == 0 )
                return -1;
            return p;
        }

        if ( dir ) {
            p = (y[0] == 1 ? 0 : 1);
            return p;
        }

        while ( y[0] > 0 ) {
            s += '0';
            y[0]--;
        }
        while ( y[1] > 0 ) {
            s += '1';
            y[1]--;
        }
        if ( t == 3 ) {
            dir = true;
            if ( down.find( s ) != down.end() )
                return -1;
        }
        p = s.back() - '0';
        return p;
    }
}

Compilation message

Catherine.cpp: In function 'int Move(std::vector<int>)':
Catherine.cpp:73:1: warning: control reaches end of non-void function [-Wreturn-type]
   73 | }
      | ^

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 15532 KB Output is correct
2 Correct 0 ms 1312 KB Output is correct
3 Correct 27 ms 15224 KB Output is correct
4 Correct 42 ms 17088 KB Output is correct
5 Correct 35 ms 16716 KB Output is correct
6 Correct 27 ms 15740 KB Output is correct
7 Correct 28 ms 15736 KB Output is correct
8 Correct 40 ms 16256 KB Output is correct
9 Correct 33 ms 16228 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 15532 KB Output is correct
2 Correct 0 ms 1312 KB Output is correct
3 Correct 27 ms 15224 KB Output is correct
4 Correct 42 ms 17088 KB Output is correct
5 Correct 35 ms 16716 KB Output is correct
6 Correct 27 ms 15740 KB Output is correct
7 Correct 28 ms 15736 KB Output is correct
8 Correct 40 ms 16256 KB Output is correct
9 Correct 33 ms 16228 KB Output is correct
10 Correct 26 ms 13692 KB Output is correct
11 Correct 25 ms 13676 KB Output is correct
12 Correct 26 ms 13668 KB Output is correct
13 Correct 26 ms 13680 KB Output is correct
14 Correct 27 ms 13756 KB Output is correct
15 Correct 30 ms 14224 KB Output is correct
16 Correct 30 ms 16248 KB Output is correct

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 13172 KB Output is correct
2 Correct 1 ms 1308 KB Output is correct
3 Correct 23 ms 12888 KB Output is correct
4 Correct 36 ms 14504 KB Output is correct
5 Correct 32 ms 14652 KB Output is correct
6 Correct 38 ms 13616 KB Output is correct
7 Correct 26 ms 13440 KB Output is correct
8 Correct 32 ms 13964 KB Output is correct
9 Correct 30 ms 13880 KB Output is correct
10 Correct 28 ms 13692 KB Output is correct
11 Correct 27 ms 13692 KB Output is correct
12 Correct 27 ms 13672 KB Output is correct
13 Correct 31 ms 13712 KB Output is correct
14 Correct 32 ms 13940 KB Output is correct
15 Correct 34 ms 14160 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 13172 KB Output is correct
2 Correct 1 ms 1308 KB Output is correct
3 Correct 23 ms 12888 KB Output is correct
4 Correct 36 ms 14504 KB Output is correct
5 Correct 32 ms 14652 KB Output is correct
6 Correct 38 ms 13616 KB Output is correct
7 Correct 26 ms 13440 KB Output is correct
8 Correct 32 ms 13964 KB Output is correct
9 Correct 30 ms 13880 KB Output is correct
10 Correct 28 ms 13692 KB Output is correct
11 Correct 27 ms 13692 KB Output is correct
12 Correct 27 ms 13672 KB Output is correct
13 Correct 31 ms 13712 KB Output is correct
14 Correct 32 ms 13940 KB Output is correct
15 Correct 34 ms 14160 KB Output is correct
16 Correct 23 ms 11896 KB Output is correct
17 Correct 24 ms 11616 KB Output is correct
18 Correct 27 ms 11632 KB Output is correct
19 Correct 26 ms 11616 KB Output is correct
20 Correct 27 ms 12408 KB Output is correct
21 Correct 29 ms 12128 KB Output is correct
22 Correct 32 ms 14196 KB Output is correct
23 Correct 28 ms 11884 KB Output is correct
24 Correct 26 ms 11884 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1564 KB Output is correct
2 Correct 1 ms 1304 KB Output is correct
3 Correct 2 ms 1568 KB Output is correct
4 Correct 2 ms 1564 KB Output is correct
5 Correct 3 ms 1560 KB Output is correct
6 Correct 2 ms 1568 KB Output is correct
7 Correct 2 ms 1564 KB Output is correct
8 Correct 2 ms 1564 KB Output is correct
9 Correct 2 ms 1564 KB Output is correct
10 Correct 2 ms 1568 KB Output is correct
11 Correct 1 ms 1560 KB Output is correct
12 Correct 2 ms 1548 KB Output is correct
13 Correct 1 ms 1564 KB Output is correct
14 Correct 2 ms 1568 KB Output is correct
15 Correct 2 ms 1560 KB Output is correct
16 Correct 2 ms 1568 KB Output is correct
17 Correct 2 ms 1568 KB Output is correct
18 Correct 2 ms 1568 KB Output is correct
19 Correct 2 ms 1552 KB Output is correct
20 Correct 1 ms 1560 KB Output is correct
21 Correct 1 ms 1560 KB Output is correct
22 Correct 2 ms 1560 KB Output is correct
23 Correct 2 ms 1564 KB Output is correct
24 Correct 2 ms 1568 KB Output is correct
25 Correct 1 ms 1560 KB Output is correct
26 Correct 2 ms 1568 KB Output is correct
27 Correct 1 ms 1568 KB Output is correct
28 Correct 2 ms 1716 KB Output is correct

Subtask #6
71.0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 24 ms 11396 KB Output is correct
2 Correct 27 ms 12408 KB Output is correct
3 Correct 1 ms 1300 KB Output is correct
4 Correct 25 ms 11640 KB Output is correct
5 Correct 31 ms 14664 KB Output is correct
6 Correct 31 ms 14492 KB Output is correct
7 Correct 26 ms 13432 KB Output is correct
8 Correct 27 ms 13396 KB Output is correct
9 Correct 30 ms 14588 KB Output is correct
10 Correct 40 ms 14548 KB Output is correct
11 Correct 31 ms 14408 KB Output is correct
12 Correct 30 ms 14412 KB Output is correct
13 Correct 31 ms 14400 KB Output is correct
14 Correct 31 ms 14420 KB Output is correct
15 Correct 38 ms 14584 KB Output is correct
16 Correct 31 ms 14416 KB Output is correct
17 Correct 28 ms 14160 KB Output is correct
18 Correct 28 ms 14160 KB Output is correct
19 Correct 28 ms 14168 KB Output is correct
20 Correct 31 ms 14076 KB Output is correct
21 Correct 38 ms 14076 KB Output is correct
22 Correct 27 ms 14144 KB Output is correct
23 Correct 24 ms 11860 KB Output is correct
24 Correct 24 ms 11844 KB Output is correct
25 Correct 25 ms 12372 KB Output is correct
26 Correct 28 ms 12360 KB Output is correct
27 Correct 27 ms 13040 KB Output is correct
28 Correct 28 ms 12896 KB Output is correct
29 Correct 28 ms 13128 KB Output is correct
30 Correct 28 ms 13388 KB Output is correct
31 Correct 29 ms 11860 KB Output is correct
32 Correct 25 ms 11864 KB Output is correct
33 Correct 25 ms 12360 KB Output is correct
34 Correct 32 ms 12312 KB Output is correct
35 Correct 28 ms 12860 KB Output is correct
36 Correct 27 ms 12892 KB Output is correct
37 Correct 28 ms 12804 KB Output is correct
38 Correct 27 ms 12900 KB Output is correct
39 Correct 27 ms 12888 KB Output is correct
40 Correct 27 ms 12940 KB Output is correct
41 Correct 30 ms 13392 KB Output is correct
42 Correct 30 ms 13312 KB Output is correct
43 Correct 30 ms 13360 KB Output is correct
44 Correct 30 ms 13388 KB Output is correct
45 Correct 31 ms 13444 KB Output is correct
46 Correct 28 ms 13540 KB Output is correct
47 Correct 33 ms 12928 KB Output is correct
48 Correct 27 ms 12628 KB Output is correct
49 Correct 27 ms 12628 KB Output is correct
50 Correct 27 ms 12848 KB Output is correct
51 Correct 26 ms 12076 KB Output is correct
52 Correct 27 ms 12112 KB Output is correct
53 Correct 30 ms 12172 KB Output is correct
54 Correct 24 ms 12100 KB Output is correct
55 Correct 25 ms 12124 KB Output is correct
56 Correct 27 ms 12120 KB Output is correct
57 Correct 25 ms 12092 KB Output is correct
58 Correct 26 ms 12096 KB Output is correct
59 Correct 26 ms 12228 KB Output is correct
60 Correct 31 ms 12028 KB Output is correct

Subtask #7
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 11588 KB Output is correct
2 Correct 27 ms 12620 KB Output is correct
3 Correct 1 ms 1308 KB Output is correct
4 Correct 22 ms 11624 KB Output is correct
5 Correct 31 ms 14412 KB Output is correct
6 Correct 35 ms 14384 KB Output is correct
7 Correct 26 ms 13368 KB Output is correct
8 Correct 27 ms 13468 KB Output is correct
9 Correct 42 ms 14376 KB Output is correct
10 Correct 31 ms 14400 KB Output is correct
11 Correct 30 ms 14356 KB Output is correct
12 Correct 31 ms 14408 KB Output is correct
13 Correct 31 ms 14320 KB Output is correct
14 Correct 30 ms 14400 KB Output is correct
15 Correct 30 ms 14416 KB Output is correct
16 Correct 31 ms 14408 KB Output is correct
17 Correct 33 ms 13944 KB Output is correct
18 Correct 28 ms 14144 KB Output is correct
19 Correct 31 ms 13928 KB Output is correct
20 Correct 30 ms 14172 KB Output is correct
21 Correct 27 ms 14088 KB Output is correct
22 Correct 28 ms 14132 KB Output is correct
23 Correct 26 ms 11848 KB Output is correct
24 Correct 25 ms 11848 KB Output is correct
25 Correct 26 ms 12376 KB Output is correct
26 Correct 26 ms 12100 KB Output is correct
27 Correct 32 ms 12868 KB Output is correct
28 Correct 35 ms 12836 KB Output is correct
29 Correct 28 ms 12792 KB Output is correct
30 Correct 27 ms 12920 KB Output is correct
31 Correct 26 ms 11844 KB Output is correct
32 Correct 24 ms 11844 KB Output is correct
33 Correct 26 ms 12372 KB Output is correct
34 Correct 26 ms 12364 KB Output is correct
35 Correct 27 ms 12872 KB Output is correct
36 Correct 27 ms 13008 KB Output is correct
37 Correct 27 ms 12960 KB Output is correct
38 Correct 28 ms 12824 KB Output is correct
39 Correct 27 ms 12876 KB Output is correct
40 Correct 30 ms 12948 KB Output is correct
41 Correct 28 ms 13364 KB Output is correct
42 Correct 28 ms 13396 KB Output is correct
43 Correct 28 ms 13328 KB Output is correct
44 Correct 28 ms 13352 KB Output is correct
45 Correct 28 ms 13388 KB Output is correct
46 Correct 30 ms 13412 KB Output is correct
47 Correct 31 ms 12576 KB Output is correct
48 Correct 32 ms 12856 KB Output is correct
49 Correct 28 ms 12772 KB Output is correct
50 Correct 27 ms 12936 KB Output is correct
51 Correct 26 ms 12152 KB Output is correct
52 Correct 28 ms 12084 KB Output is correct
53 Correct 27 ms 12120 KB Output is correct
54 Correct 25 ms 12092 KB Output is correct
55 Correct 26 ms 12104 KB Output is correct
56 Correct 27 ms 12104 KB Output is correct
57 Correct 27 ms 12104 KB Output is correct
58 Correct 27 ms 12236 KB Output is correct
59 Correct 25 ms 12120 KB Output is correct
60 Correct 26 ms 12040 KB Output is correct