oj.uz

Submission #967433

# Submission time Handle Problem Language Result Execution time Memory
967433 2024-04-22T05:54:09 Z LucaIlie Stray Cat (JOI20_stray) C++17
20 / 100
 38 ms 17228 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 = 0, 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 {
        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;
        }
        t++;
        p = s.back() - '0';
        return p;
    }
}

Compilation message

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

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 15664 KB Output is correct
2 Correct 1 ms 1312 KB Output is correct
3 Correct 24 ms 15452 KB Output is correct
4 Correct 37 ms 17148 KB Output is correct
5 Correct 35 ms 17228 KB Output is correct
6 Correct 28 ms 15956 KB Output is correct
7 Correct 28 ms 15944 KB Output is correct
8 Correct 33 ms 16684 KB Output is correct
9 Correct 34 ms 16544 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 15664 KB Output is correct
2 Correct 1 ms 1312 KB Output is correct
3 Correct 24 ms 15452 KB Output is correct
4 Correct 37 ms 17148 KB Output is correct
5 Correct 35 ms 17228 KB Output is correct
6 Correct 28 ms 15956 KB Output is correct
7 Correct 28 ms 15944 KB Output is correct
8 Correct 33 ms 16684 KB Output is correct
9 Correct 34 ms 16544 KB Output is correct
10 Correct 34 ms 14136 KB Output is correct
11 Correct 25 ms 14164 KB Output is correct
12 Correct 31 ms 14140 KB Output is correct
13 Correct 26 ms 14084 KB Output is correct
14 Correct 27 ms 14412 KB Output is correct
15 Correct 31 ms 14656 KB Output is correct
16 Correct 38 ms 16724 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 13424 KB Output is correct
2 Correct 1 ms 1308 KB Output is correct
3 Correct 24 ms 12924 KB Output is correct
4 Correct 33 ms 14572 KB Output is correct
5 Correct 34 ms 14700 KB Output is correct
6 Correct 26 ms 13432 KB Output is correct
7 Correct 26 ms 13424 KB Output is correct
8 Correct 32 ms 13872 KB Output is correct
9 Correct 34 ms 13948 KB Output is correct
10 Correct 28 ms 13692 KB Output is correct
11 Correct 31 ms 13936 KB Output is correct
12 Correct 28 ms 13688 KB Output is correct
13 Correct 28 ms 14196 KB Output is correct
14 Correct 31 ms 13944 KB Output is correct
15 Correct 32 ms 13940 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 13424 KB Output is correct
2 Correct 1 ms 1308 KB Output is correct
3 Correct 24 ms 12924 KB Output is correct
4 Correct 33 ms 14572 KB Output is correct
5 Correct 34 ms 14700 KB Output is correct
6 Correct 26 ms 13432 KB Output is correct
7 Correct 26 ms 13424 KB Output is correct
8 Correct 32 ms 13872 KB Output is correct
9 Correct 34 ms 13948 KB Output is correct
10 Correct 28 ms 13692 KB Output is correct
11 Correct 31 ms 13936 KB Output is correct
12 Correct 28 ms 13688 KB Output is correct
13 Correct 28 ms 14196 KB Output is correct
14 Correct 31 ms 13944 KB Output is correct
15 Correct 32 ms 13940 KB Output is correct
16 Correct 24 ms 11892 KB Output is correct
17 Correct 24 ms 11620 KB Output is correct
18 Correct 25 ms 11812 KB Output is correct
19 Correct 27 ms 11628 KB Output is correct
20 Correct 35 ms 12324 KB Output is correct
21 Correct 27 ms 12140 KB Output is correct
22 Correct 28 ms 14200 KB Output is correct
23 Correct 27 ms 11888 KB Output is correct
24 Correct 25 ms 11888 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1560 KB Output is correct
2 Correct 1 ms 1308 KB Output is correct
3 Correct 1 ms 1824 KB Output is correct
4 Correct 2 ms 1564 KB Output is correct
5 Correct 2 ms 1744 KB Output is correct
6 Correct 2 ms 1576 KB Output is correct
7 Correct 2 ms 1568 KB Output is correct
8 Correct 2 ms 1572 KB Output is correct
9 Correct 2 ms 1556 KB Output is correct
10 Correct 2 ms 1564 KB Output is correct
11 Correct 2 ms 1568 KB Output is correct
12 Correct 2 ms 1572 KB Output is correct
13 Correct 2 ms 1572 KB Output is correct
14 Correct 2 ms 1564 KB Output is correct
15 Correct 2 ms 1560 KB Output is correct
16 Correct 2 ms 1572 KB Output is correct
17 Correct 2 ms 1564 KB Output is correct
18 Correct 2 ms 1572 KB Output is correct
19 Correct 2 ms 1572 KB Output is correct
20 Correct 2 ms 1564 KB Output is correct
21 Correct 2 ms 1568 KB Output is correct
22 Correct 2 ms 1564 KB Output is correct
23 Correct 1 ms 1564 KB Output is correct
24 Correct 2 ms 1564 KB Output is correct
25 Correct 1 ms 1572 KB Output is correct
26 Correct 1 ms 1564 KB Output is correct
27 Correct 2 ms 1568 KB Output is correct
28 Correct 2 ms 1564 KB Output is correct

Subtask #6
0 / 71.0

# Verdict Execution time Memory Grader output
1 Incorrect 23 ms 11312 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 23 ms 11396 KB Wrong Answer [5]
2 Halted 0 ms 0 KB -