oj.uz

Submission #964230

# Submission time Handle Problem Language Result Execution time Memory
964230 2024-04-16T13:09:23 Z LucaIlie Stray Cat (JOI20_stray) C++17
4 / 100
 40 ms 17168 KB 
#include "Anthony.h"
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 2e4;
bool vis[MAX_N];
int d[MAX_N];
vector<int> adj[MAX_N];

vector<int> Mark( int N, int M, int A, int B, vector<int> U, vector<int> V ) {
    vector<int> X( M );

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

    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] ) {
            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 );
        }
    }

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

using namespace std;

void Init(int A, int B) {
    A = A;
    B = B;
}

int Move( vector<int> y ) {
    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;
    exit( 1 );
    return -1;
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 15892 KB Output is correct
2 Correct 1 ms 1296 KB Output is correct
3 Correct 27 ms 15652 KB Output is correct
4 Correct 39 ms 17168 KB Output is correct
5 Correct 34 ms 16908 KB Output is correct
6 Correct 35 ms 15784 KB Output is correct
7 Correct 28 ms 16036 KB Output is correct
8 Correct 40 ms 16380 KB Output is correct
9 Correct 38 ms 16408 KB Output is correct

Subtask #2
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 30 ms 15892 KB Output is correct
2 Correct 1 ms 1296 KB Output is correct
3 Correct 27 ms 15652 KB Output is correct
4 Correct 39 ms 17168 KB Output is correct
5 Correct 34 ms 16908 KB Output is correct
6 Correct 35 ms 15784 KB Output is correct
7 Correct 28 ms 16036 KB Output is correct
8 Correct 40 ms 16380 KB Output is correct
9 Correct 38 ms 16408 KB Output is correct
10 Incorrect 27 ms 13556 KB Wrong Answer [6]
11 Halted 0 ms 0 KB -

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 13532 KB Output is correct
2 Correct 1 ms 1300 KB Output is correct
3 Correct 27 ms 13084 KB Output is correct
4 Correct 39 ms 14904 KB Output is correct
5 Correct 32 ms 14628 KB Output is correct
6 Correct 36 ms 13400 KB Output is correct
7 Correct 26 ms 13456 KB Output is correct
8 Correct 33 ms 14076 KB Output is correct
9 Correct 32 ms 14296 KB Output is correct
10 Correct 33 ms 13888 KB Output is correct
11 Correct 32 ms 14180 KB Output is correct
12 Correct 30 ms 13888 KB Output is correct
13 Correct 31 ms 13920 KB Output is correct
14 Correct 36 ms 14068 KB Output is correct
15 Correct 31 ms 14160 KB Output is correct

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 13532 KB Output is correct
2 Correct 1 ms 1300 KB Output is correct
3 Correct 27 ms 13084 KB Output is correct
4 Correct 39 ms 14904 KB Output is correct
5 Correct 32 ms 14628 KB Output is correct
6 Correct 36 ms 13400 KB Output is correct
7 Correct 26 ms 13456 KB Output is correct
8 Correct 33 ms 14076 KB Output is correct
9 Correct 32 ms 14296 KB Output is correct
10 Correct 33 ms 13888 KB Output is correct
11 Correct 32 ms 14180 KB Output is correct
12 Correct 30 ms 13888 KB Output is correct
13 Correct 31 ms 13920 KB Output is correct
14 Correct 36 ms 14068 KB Output is correct
15 Correct 31 ms 14160 KB Output is correct
16 Incorrect 25 ms 11584 KB Wrong Answer [6]
17 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

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

Subtask #6
0 / 71.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 2776 KB Wrong Answer [2]
2 Halted 0 ms 0 KB -

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 2788 KB Wrong Answer [2]
2 Halted 0 ms 0 KB -