oj.uz

Submission #799505

# Submission time Handle Problem Language Result Execution time Memory
799505 2023-07-31T15:23:43 Z burythelightdeepwithin Stray Cat (JOI20_stray) C++14
0 / 100
 34 ms 16620 KB 
#include <bits/stdc++.h>
#include "Anthony.h"
 
using namespace std;
 
vector <pair <int, int> > adj[20003], adj_dfs[20003];
vector <int> plan;
int vs[20003];
queue <int> q;
vector <int> leaf;
 
void bfs(){
    while(!q.empty()){
        int u = q.front();
        vs[u] = 1;
        q.pop();
        for (auto e: adj[u]){
            int v = e.first, id = e.second;
            if (!vs[v]){
                q.push(v);
                vs[v] = 1;
                adj_dfs[u].push_back({v, id});
                //adj_dfs[v].push_back({u, id});
            }
        }
    }
}
 
void dfs(int u, int mark){
    vs[u] = 1;
    for (auto e: adj_dfs[u]){
        int v = e.first, id = e.second;
        if (!vs[v]){
            plan[id] = mark;
            dfs(v, (mark^1));
        }
    }
}
 
vector <int> Mark(int N, int M, int A, int B, vector<int> U, vector <int> V){
    for (int i = 0; i < M; i++){
        adj[U[i]].push_back({V[i], i});
        adj[V[i]].push_back({U[i], i});
        plan.push_back(-1);
    }
    q.push(0);
    bfs();
    for (int i = 0; i < N; i++){
        vs[i] = 0;
    }
    dfs(0, 0);
    for (int i = 0; i < M; i++){
        if (plan[i] == -1){
            plan[i] = 2;
        }
    }
    return plan;
}
#include <bits/stdc++.h>
#include "Catherine.h"
 
using namespace std;
 
int first = -1, last = -1, cnt = 0;
 
void Init(int A, int B){
 
}
 
int Move(vector <int> y){
    if (first == -1){
        if (last == -1){
            if (y[0] == 0){
                first = 1;
                return first;
            } else if (y[1] == 0){
                first = 0;
                return first;
            }
            if (y[0] > y[1]){
                first = 1;
                return first;
            } else if (y[0] < y[1]){
                first = 0;
                return first;
            } else {
                last = 0;
                return 0;
            }
        } else {
            if (y[last^1] != 1){
                first = last;
                return -1;
            } else {
                last ^= 1;
                return last;
            }
        }
    } else {
        if (y[0] == 1){
          return 0;
      } else {
          return 1;
      }
    }
}

Subtask #1
0 / 2.0

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

Subtask #2
0 / 2.0

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

Subtask #3
0 / 2.0

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

Subtask #4
0 / 9.0

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

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1756 KB Output is correct
2 Correct 1 ms 1540 KB Output is correct
3 Correct 1 ms 1808 KB Output is correct
4 Correct 2 ms 1808 KB Output is correct
5 Correct 2 ms 1808 KB Output is correct
6 Correct 2 ms 1820 KB Output is correct
7 Correct 2 ms 1800 KB Output is correct
8 Correct 2 ms 1800 KB Output is correct
9 Correct 2 ms 1804 KB Output is correct
10 Correct 2 ms 1808 KB Output is correct
11 Correct 2 ms 1812 KB Output is correct
12 Incorrect 2 ms 1800 KB Wrong Answer [5]
13 Halted 0 ms 0 KB -

Subtask #6
0 / 71.0

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

Subtask #7
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 12172 KB Output is correct
2 Incorrect 25 ms 13296 KB Wrong Answer [5]
3 Halted 0 ms 0 KB -