답안 #939061

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
939061	2024-03-06T04:52:22 Z	guagua0407	길고양이 (JOI20_stray)	C++17	4 / 100	40 ms	17784 KB

Anthony

#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];

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){
                ans[u.s]=3;
            }
            continue;
        }
        ans[u.s]=(c+1)%3;
        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;
}

Catherine

#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

#	결과	실행 시간	메모리	Grader output
1	Correct	28 ms	16068 KB	Output is correct
2	Correct	1 ms	1296 KB	Output is correct
3	Correct	24 ms	14980 KB	Output is correct
4	Correct	33 ms	17784 KB	Output is correct
5	Correct	40 ms	17696 KB	Output is correct
6	Correct	34 ms	15644 KB	Output is correct
7	Correct	34 ms	15696 KB	Output is correct
8	Correct	34 ms	17008 KB	Output is correct
9	Correct	34 ms	17020 KB	Output is correct

Subtask #2

0 / 2.0

#	결과	실행 시간	메모리	Grader output
1	Correct	28 ms	16068 KB	Output is correct
2	Correct	1 ms	1296 KB	Output is correct
3	Correct	24 ms	14980 KB	Output is correct
4	Correct	33 ms	17784 KB	Output is correct
5	Correct	40 ms	17696 KB	Output is correct
6	Correct	34 ms	15644 KB	Output is correct
7	Correct	34 ms	15696 KB	Output is correct
8	Correct	34 ms	17008 KB	Output is correct
9	Correct	34 ms	17020 KB	Output is correct
10	Incorrect	27 ms	13984 KB	Wrong Answer [6]
11	Halted	0 ms	0 KB	-

Subtask #3

2.0 / 2.0

#	결과	실행 시간	메모리	Grader output
1	Correct	28 ms	13676 KB	Output is correct
2	Correct	1 ms	1304 KB	Output is correct
3	Correct	22 ms	12632 KB	Output is correct
4	Correct	33 ms	15708 KB	Output is correct
5	Correct	33 ms	15928 KB	Output is correct
6	Correct	28 ms	13432 KB	Output is correct
7	Correct	27 ms	13412 KB	Output is correct
8	Correct	30 ms	15224 KB	Output is correct
9	Correct	31 ms	14820 KB	Output is correct
10	Correct	32 ms	14328 KB	Output is correct
11	Correct	28 ms	14464 KB	Output is correct
12	Correct	28 ms	14320 KB	Output is correct
13	Correct	30 ms	14544 KB	Output is correct
14	Correct	31 ms	14712 KB	Output is correct
15	Correct	31 ms	14856 KB	Output is correct

Subtask #4

0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Correct	28 ms	13676 KB	Output is correct
2	Correct	1 ms	1304 KB	Output is correct
3	Correct	22 ms	12632 KB	Output is correct
4	Correct	33 ms	15708 KB	Output is correct
5	Correct	33 ms	15928 KB	Output is correct
6	Correct	28 ms	13432 KB	Output is correct
7	Correct	27 ms	13412 KB	Output is correct
8	Correct	30 ms	15224 KB	Output is correct
9	Correct	31 ms	14820 KB	Output is correct
10	Correct	32 ms	14328 KB	Output is correct
11	Correct	28 ms	14464 KB	Output is correct
12	Correct	28 ms	14320 KB	Output is correct
13	Correct	30 ms	14544 KB	Output is correct
14	Correct	31 ms	14712 KB	Output is correct
15	Correct	31 ms	14856 KB	Output is correct
16	Incorrect	5 ms	2576 KB	Wrong Answer [2]
17	Halted	0 ms	0 KB	-

Subtask #5

0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	1 ms	1296 KB	Wrong Answer [2]
2	Halted	0 ms	0 KB	-

Subtask #6

0 / 71.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	5 ms	2580 KB	Wrong Answer [2]
2	Halted	0 ms	0 KB	-

Subtask #7

0 / 9.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	7 ms	2764 KB	Wrong Answer [2]
2	Halted	0 ms	0 KB	-