oj.uz

답안 #967438

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
967438 2024-04-22T06:01:10 Z LucaIlie 길고양이 (JOI20_stray) C++17
20 / 100
 44 ms 16908 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;
            p = (y[0] == 1 ? 0 : 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:68:1: warning: control reaches end of non-void function [-Wreturn-type]
   68 | }
      | ^

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 15748 KB Output is correct
2 Correct 1 ms 1296 KB Output is correct
3 Correct 25 ms 15224 KB Output is correct
4 Correct 36 ms 16760 KB Output is correct
5 Correct 36 ms 16908 KB Output is correct
6 Correct 28 ms 15732 KB Output is correct
7 Correct 30 ms 15744 KB Output is correct
8 Correct 35 ms 16176 KB Output is correct
9 Correct 32 ms 16232 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 15748 KB Output is correct
2 Correct 1 ms 1296 KB Output is correct
3 Correct 25 ms 15224 KB Output is correct
4 Correct 36 ms 16760 KB Output is correct
5 Correct 36 ms 16908 KB Output is correct
6 Correct 28 ms 15732 KB Output is correct
7 Correct 30 ms 15744 KB Output is correct
8 Correct 35 ms 16176 KB Output is correct
9 Correct 32 ms 16232 KB Output is correct
10 Correct 38 ms 13764 KB Output is correct
11 Correct 33 ms 13680 KB Output is correct
12 Correct 32 ms 13668 KB Output is correct
13 Correct 27 ms 13688 KB Output is correct
14 Correct 26 ms 13932 KB Output is correct
15 Correct 32 ms 14100 KB Output is correct
16 Correct 34 ms 16252 KB Output is correct

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 13172 KB Output is correct
2 Correct 1 ms 1308 KB Output is correct
3 Correct 24 ms 12920 KB Output is correct
4 Correct 44 ms 14740 KB Output is correct
5 Correct 41 ms 14400 KB Output is correct
6 Correct 26 ms 13436 KB Output is correct
7 Correct 26 ms 13440 KB Output is correct
8 Correct 30 ms 14188 KB Output is correct
9 Correct 31 ms 14124 KB Output is correct
10 Correct 28 ms 13688 KB Output is correct
11 Correct 30 ms 13604 KB Output is correct
12 Correct 30 ms 13588 KB Output is correct
13 Correct 28 ms 13692 KB Output is correct
14 Correct 33 ms 13944 KB Output is correct
15 Correct 31 ms 13948 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 13172 KB Output is correct
2 Correct 1 ms 1308 KB Output is correct
3 Correct 24 ms 12920 KB Output is correct
4 Correct 44 ms 14740 KB Output is correct
5 Correct 41 ms 14400 KB Output is correct
6 Correct 26 ms 13436 KB Output is correct
7 Correct 26 ms 13440 KB Output is correct
8 Correct 30 ms 14188 KB Output is correct
9 Correct 31 ms 14124 KB Output is correct
10 Correct 28 ms 13688 KB Output is correct
11 Correct 30 ms 13604 KB Output is correct
12 Correct 30 ms 13588 KB Output is correct
13 Correct 28 ms 13692 KB Output is correct
14 Correct 33 ms 13944 KB Output is correct
15 Correct 31 ms 13948 KB Output is correct
16 Correct 23 ms 11568 KB Output is correct
17 Correct 25 ms 11888 KB Output is correct
18 Correct 28 ms 11632 KB Output is correct
19 Correct 24 ms 11728 KB Output is correct
20 Correct 34 ms 12324 KB Output is correct
21 Correct 26 ms 12148 KB Output is correct
22 Correct 28 ms 14160 KB Output is correct
23 Correct 25 ms 11884 KB Output is correct
24 Correct 31 ms 11888 KB Output is correct

Subtask #5
5.0 / 5.0

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

Subtask #6
0 / 71.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 11164 KB Output is correct
2 Incorrect 24 ms 12280 KB Wrong Answer [5]
3 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 23 ms 11380 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -