oj.uz

Submission #939062

# Submission time Handle Problem Language Result Execution time Memory
939062 2024-03-06T04:58:01 Z guagua0407 Stray Cat (JOI20_stray) C++17
4 / 100
 36 ms 18308 KB 
#include "Anthony.h"
#include <vector>
#include<bits/stdc++.h>

namespace {

using namespace std;
#define f first
#define s second
int A,B;
const int mxn=2e4+5;
vector<pair<int,int>> adj[mxn];
vector<int> ans;
bool visited[mxn];
int depth[mxn];

void dfs(int v,int p=-1,int c=2){
    visited[v]=true;
    for(auto u:adj[v]){
        if(visited[u.f]){
            if(u.f!=p and depth[u.f]<depth[v]){
                ans[u.s]=3;
            }
            continue;
        }
        ans[u.s]=(c+1)%3;
        depth[u.f]=depth[v]+1;
        dfs(u.f,v,ans[u.s]);
    }
}

}  // namespace

std::vector<int> Mark(int N, int M, int A, int B,std::vector<int> U, std::vector<int> V) {
    ::A = A;
    ::B = B;
    ans.resize(M);
    for(int i=0;i<M;i++){
        adj[U[i]].push_back({V[i],i});
        adj[V[i]].push_back({U[i],i});
    }
    dfs(0);
    return ans;
}

#include "Catherine.h"
#include <vector>
#include<bits/stdc++.h>
namespace {
using namespace std;
int A, B;
int variable_example = 0;

}  // namespace

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

int Move(std::vector<int> y) {
    vector<int> pos;
    for(int i=0;i<3;i++){
        if(y[i]>0) pos.push_back(i);
    }
    if((int)pos.size()==1) return pos[0];
    else{
        if((pos[0]+1)%3==pos[1]) return pos[0];
        else return pos[1];
    }
}

Compilation message

Catherine.cpp:7:5: warning: '{anonymous}::variable_example' defined but not used [-Wunused-variable]
    7 | int variable_example = 0;
      |     ^~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 16496 KB Output is correct
2 Correct 1 ms 1296 KB Output is correct
3 Correct 24 ms 14976 KB Output is correct
4 Correct 35 ms 18308 KB Output is correct
5 Correct 34 ms 18212 KB Output is correct
6 Correct 26 ms 15740 KB Output is correct
7 Correct 27 ms 15740 KB Output is correct
8 Correct 32 ms 17268 KB Output is correct
9 Correct 34 ms 17288 KB Output is correct

Subtask #2
0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 31 ms 16496 KB Output is correct
2 Correct 1 ms 1296 KB Output is correct
3 Correct 24 ms 14976 KB Output is correct
4 Correct 35 ms 18308 KB Output is correct
5 Correct 34 ms 18212 KB Output is correct
6 Correct 26 ms 15740 KB Output is correct
7 Correct 27 ms 15740 KB Output is correct
8 Correct 32 ms 17268 KB Output is correct
9 Correct 34 ms 17288 KB Output is correct
10 Incorrect 24 ms 14056 KB Wrong Answer [6]
11 Halted 0 ms 0 KB -

Subtask #3
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 14072 KB Output is correct
2 Correct 0 ms 1308 KB Output is correct
3 Correct 23 ms 12676 KB Output is correct
4 Correct 36 ms 16248 KB Output is correct
5 Correct 33 ms 16260 KB Output is correct
6 Correct 27 ms 13432 KB Output is correct
7 Correct 27 ms 13436 KB Output is correct
8 Correct 33 ms 14996 KB Output is correct
9 Correct 33 ms 14912 KB Output is correct
10 Correct 30 ms 14792 KB Output is correct
11 Correct 30 ms 14716 KB Output is correct
12 Correct 27 ms 14712 KB Output is correct
13 Correct 27 ms 14736 KB Output is correct
14 Correct 30 ms 15036 KB Output is correct
15 Correct 30 ms 14984 KB Output is correct

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 14072 KB Output is correct
2 Correct 0 ms 1308 KB Output is correct
3 Correct 23 ms 12676 KB Output is correct
4 Correct 36 ms 16248 KB Output is correct
5 Correct 33 ms 16260 KB Output is correct
6 Correct 27 ms 13432 KB Output is correct
7 Correct 27 ms 13436 KB Output is correct
8 Correct 33 ms 14996 KB Output is correct
9 Correct 33 ms 14912 KB Output is correct
10 Correct 30 ms 14792 KB Output is correct
11 Correct 30 ms 14716 KB Output is correct
12 Correct 27 ms 14712 KB Output is correct
13 Correct 27 ms 14736 KB Output is correct
14 Correct 30 ms 15036 KB Output is correct
15 Correct 30 ms 14984 KB Output is correct
16 Incorrect 5 ms 2584 KB Wrong Answer [2]
17 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

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