제출 #246330

#제출 시각아이디문제언어결과실행 시간메모리
246330kostia244길고양이 (JOI20_stray)C++17
0 / 100
1256 ms19468 KiB
#include "Anthony.h" #include <bits/stdc++.h> #define pb push_back using namespace std; namespace anton { const int maxn = 1<<17; vector<int> val, p, pidx, col, god = {0, 0, 1, 0, 1, 1}; vector<array<int, 2>> g[maxn]; void dfs(int v) { for(auto &[i, idx] : g[v]) if(i != p[v]) { p[i] = v, pidx[i] = idx; col[i] = col[v]^1; dfs(i); } //cout << v << " // " << col[v] << '\n'; if(!v || g[v].size() == 2) return; int u = p[v]; vector<int> l {v}; while(u && g[u].size() > 1) { l.pb(u); u = p[u]; } int b = 0; while(god[b] != col[v] || god[(b + l.size() - 1)%6] != col[l.back()]) b++; //cout << v << " /// " << b << endl; //cout << god[b] << " vs " << col[v] << '\n'; for(int i = 0; i < l.size(); i++) val[pidx[l[i]]] = god[(i+b)%6]; } } std::vector<int> Mark(int N, int M, int A, int B, std::vector<int> U, std::vector<int> V) { using namespace anton; val.resize(M); for(int i = 0; i < M; i++) { g[U[i]].pb({V[i], i}); g[V[i]].pb({U[i], i}); } p.resize(N); pidx.resize(N); col.resize(N); dfs(0); //for(auto i : val) cout << i << " "; cout << "==sw\n"; return val; }
#include "Catherine.h" #include <bits/stdc++.h> #define pb push_back using namespace std; namespace kate { int A, B, gg = 0, lst = -2; string cur, god = "110100110100"; int decide(vector<int> c) { if(c[0] + c[1] == 0) { gg = 1; return -1; } if(lst == -2 && c[0]+c[1] == 1) { gg = 1; return lst = c[1]; } if(c[0] + c[1] + (lst != -2) > 2) { gg = 1; if(c[0]+(lst==0) == 1) { return lst = 0; } return lst = 1; } if(c[0] + c[1] == 2) { if(c[0]) { cur.pb('0'+c[1]); cur.pb('0'); return lst = 0; } cur += "11"; return lst = 1; } if(gg) return lst = c[1]; cur.pb('0'+c[1]); if(cur.size() == 5) { gg = 1; if(god.find(cur) == string::npos) return lst = -1; } return lst = c[1]; } } // namespace void Init(int A, int B) { kate::A = A; kate::B = B; } int Move(std::vector<int> y) { int t = kate::decide(y); //cout << y[0] << " " << y[1] << t << endl; return t; }

컴파일 시 표준 에러 (stderr) 메시지

Anthony.cpp: In function 'void anton::dfs(int)':
Anthony.cpp:29:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < l.size(); i++) val[pidx[l[i]]] = god[(i+b)%6];
                 ~~^~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...