oj.uz

답안 #967443

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

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 15532 KB Output is correct
2 Correct 1 ms 1296 KB Output is correct
3 Correct 25 ms 15220 KB Output is correct
4 Correct 34 ms 16772 KB Output is correct
5 Correct 34 ms 16728 KB Output is correct
6 Correct 27 ms 15732 KB Output is correct
7 Correct 30 ms 15736 KB Output is correct
8 Correct 33 ms 16432 KB Output is correct
9 Correct 32 ms 16100 KB Output is correct

Subtask #2
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 15532 KB Output is correct
2 Correct 1 ms 1296 KB Output is correct
3 Correct 25 ms 15220 KB Output is correct
4 Correct 34 ms 16772 KB Output is correct
5 Correct 34 ms 16728 KB Output is correct
6 Correct 27 ms 15732 KB Output is correct
7 Correct 30 ms 15736 KB Output is correct
8 Correct 33 ms 16432 KB Output is correct
9 Correct 32 ms 16100 KB Output is correct
10 Correct 25 ms 13816 KB Output is correct
11 Correct 26 ms 13640 KB Output is correct
12 Correct 26 ms 13680 KB Output is correct
13 Correct 27 ms 13684 KB Output is correct
14 Correct 27 ms 14016 KB Output is correct
15 Correct 30 ms 14260 KB Output is correct
16 Correct 36 ms 16892 KB Output is correct

Subtask #3
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 13172 KB Output is correct
2 Correct 0 ms 1304 KB Output is correct
3 Correct 23 ms 12920 KB Output is correct
4 Correct 32 ms 14772 KB Output is correct
5 Correct 31 ms 14716 KB Output is correct
6 Correct 27 ms 13432 KB Output is correct
7 Correct 26 ms 13436 KB Output is correct
8 Correct 31 ms 13940 KB Output is correct
9 Correct 30 ms 13912 KB Output is correct
10 Correct 27 ms 13752 KB Output is correct
11 Correct 30 ms 13688 KB Output is correct
12 Correct 30 ms 13936 KB Output is correct
13 Correct 28 ms 13688 KB Output is correct
14 Correct 32 ms 14004 KB Output is correct
15 Correct 30 ms 13944 KB Output is correct

Subtask #4
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 13172 KB Output is correct
2 Correct 0 ms 1304 KB Output is correct
3 Correct 23 ms 12920 KB Output is correct
4 Correct 32 ms 14772 KB Output is correct
5 Correct 31 ms 14716 KB Output is correct
6 Correct 27 ms 13432 KB Output is correct
7 Correct 26 ms 13436 KB Output is correct
8 Correct 31 ms 13940 KB Output is correct
9 Correct 30 ms 13912 KB Output is correct
10 Correct 27 ms 13752 KB Output is correct
11 Correct 30 ms 13688 KB Output is correct
12 Correct 30 ms 13936 KB Output is correct
13 Correct 28 ms 13688 KB Output is correct
14 Correct 32 ms 14004 KB Output is correct
15 Correct 30 ms 13944 KB Output is correct
16 Correct 23 ms 11648 KB Output is correct
17 Correct 24 ms 11632 KB Output is correct
18 Correct 25 ms 11632 KB Output is correct
19 Correct 25 ms 11624 KB Output is correct
20 Correct 27 ms 12256 KB Output is correct
21 Correct 27 ms 12232 KB Output is correct
22 Correct 28 ms 14148 KB Output is correct
23 Correct 27 ms 11896 KB Output is correct
24 Correct 26 ms 11888 KB Output is correct

Subtask #5
0 / 5.0

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

Subtask #6
0 / 71.0

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

Subtask #7
0 / 9.0

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