oj.uz

Submission #964232

# Submission time Handle Problem Language Result Execution time Memory
964232 2024-04-16T13:14:45 Z LucaIlie Stray Cat (JOI20_stray) C++17
15 / 100
 55 ms 16968 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];

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] ) {
            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 );
        }
    }
    
    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 36 ms 15888 KB Output is correct
2 Correct 2 ms 1452 KB Output is correct
3 Correct 33 ms 15444 KB Output is correct
4 Correct 55 ms 16864 KB Output is correct
5 Correct 36 ms 16968 KB Output is correct
6 Correct 26 ms 15688 KB Output is correct
7 Correct 33 ms 15692 KB Output is correct
8 Correct 36 ms 16468 KB Output is correct
9 Correct 34 ms 16488 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 15888 KB Output is correct
2 Correct 2 ms 1452 KB Output is correct
3 Correct 33 ms 15444 KB Output is correct
4 Correct 55 ms 16864 KB Output is correct
5 Correct 36 ms 16968 KB Output is correct
6 Correct 26 ms 15688 KB Output is correct
7 Correct 33 ms 15692 KB Output is correct
8 Correct 36 ms 16468 KB Output is correct
9 Correct 34 ms 16488 KB Output is correct
10 Correct 26 ms 13728 KB Output is correct
11 Correct 26 ms 13640 KB Output is correct
12 Correct 34 ms 14028 KB Output is correct
13 Correct 35 ms 13820 KB Output is correct
14 Correct 30 ms 14560 KB Output is correct
15 Correct 36 ms 14380 KB Output is correct
16 Correct 38 ms 16540 KB Output is correct

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 13372 KB Output is correct
2 Correct 1 ms 1308 KB Output is correct
3 Correct 28 ms 13360 KB Output is correct
4 Correct 32 ms 14896 KB Output is correct
5 Correct 34 ms 14928 KB Output is correct
6 Correct 26 ms 13532 KB Output is correct
7 Correct 27 ms 13792 KB Output is correct
8 Correct 33 ms 14468 KB Output is correct
9 Correct 32 ms 14092 KB Output is correct
10 Correct 34 ms 13888 KB Output is correct
11 Correct 28 ms 13976 KB Output is correct
12 Correct 27 ms 13884 KB Output is correct
13 Correct 27 ms 13896 KB Output is correct
14 Correct 30 ms 14200 KB Output is correct
15 Correct 35 ms 14084 KB Output is correct

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 13372 KB Output is correct
2 Correct 1 ms 1308 KB Output is correct
3 Correct 28 ms 13360 KB Output is correct
4 Correct 32 ms 14896 KB Output is correct
5 Correct 34 ms 14928 KB Output is correct
6 Correct 26 ms 13532 KB Output is correct
7 Correct 27 ms 13792 KB Output is correct
8 Correct 33 ms 14468 KB Output is correct
9 Correct 32 ms 14092 KB Output is correct
10 Correct 34 ms 13888 KB Output is correct
11 Correct 28 ms 13976 KB Output is correct
12 Correct 27 ms 13884 KB Output is correct
13 Correct 27 ms 13896 KB Output is correct
14 Correct 30 ms 14200 KB Output is correct
15 Correct 35 ms 14084 KB Output is correct
16 Correct 27 ms 11840 KB Output is correct
17 Correct 30 ms 12064 KB Output is correct
18 Correct 28 ms 11776 KB Output is correct
19 Correct 27 ms 11840 KB Output is correct
20 Correct 28 ms 12672 KB Output is correct
21 Correct 27 ms 12348 KB Output is correct
22 Correct 30 ms 14208 KB Output is correct
23 Correct 25 ms 12108 KB Output is correct
24 Correct 30 ms 11984 KB Output is correct

Subtask #5
0 / 5.0

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

Subtask #6
0 / 71.0

# Verdict Execution time Memory Grader output
1 Incorrect 9 ms 2852 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 2800 KB Wrong Answer [2]
2 Halted 0 ms 0 KB -