#include "Anthony.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define FOR(i, a, b) for(int i = (int)a; i <= (int)b; i++)
#define DEC(i, a, b) for(int i = (int)a; i >= (int)b; i--)
typedef pair<int, int> pi;
typedef pair<pi, int> pii;
typedef pair<int, pi> ipi;
typedef pair<pi, pi> pipi;
#define f first
#define s second
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef vector<pii> vpii;
#define pb push_back
#define pf push_front
#define aint(v) v.begin(), v.end()
#define size(v) (int) v.size()
#define disc(v) sort(aint(v)); v.resize(unique(aint(v)) - v.begin());
#define INF (int) 1e9 + 100
#define LLINF (ll) 1e18
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define sandybridge __attribute__((optimize("Ofast"), target("arch=sandybridge")))
int n, m, dist[20005];
vpi adj[20005];
vi ans;
queue<int> q;
vi Mark(int N, int M, int A, int B, vi U, vi V) {
n = N, m = M;
FOR(i, 0, m-1) {
adj[U[i]].pb(pi(V[i], i));
adj[V[i]].pb(pi(U[i], i));
}
memset(dist, -1, sizeof dist);
dist[0] = 0; q.push(0);
while (!q.empty()) {
int x = q.front(); q.pop();
for (auto [it, idx]:adj[x]) {
if (dist[it] == -1) {
dist[it] = dist[x] + 1;
q.push(it);
}
}
}
FOR(i, 0, m-1) {
int u = U[i], v = V[i];
if (dist[u] > dist[v]) swap(u, v);
ans.pb(dist[u] % 3);
}
return ans;
}
#include "Catherine.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define FOR(i, a, b) for(int i = (int)a; i <= (int)b; i++)
#define DEC(i, a, b) for(int i = (int)a; i >= (int)b; i--)
typedef pair<int, int> pi;
typedef pair<pi, int> pii;
typedef pair<int, pi> ipi;
typedef pair<pi, pi> pipi;
#define f first
#define s second
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef vector<pii> vpii;
#define pb push_back
#define pf push_front
#define aint(v) v.begin(), v.end()
#define size(v) (int) v.size()
#define disc(v) sort(aint(v)); v.resize(unique(aint(v)) - v.begin());
#define INF (int) 1e9 + 100
#define LLINF (ll) 1e18
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define sandybridge __attribute__((optimize("Ofast"), target("arch=sandybridge")))
void Init(int A, int B) {
}
int Move(vi v) {
if (v[0] and v[1]) return 0;
else if (v[1] and v[2]) return 1;
else if (v[2] and v[0]) return 2;
else FOR(i, 0, 2) if (v[i]) return i;
assert(false);
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
53 ms |
15956 KB |
Output is correct |
2 |
Correct |
2 ms |
1256 KB |
Output is correct |
3 |
Correct |
46 ms |
15636 KB |
Output is correct |
4 |
Correct |
77 ms |
17208 KB |
Output is correct |
5 |
Correct |
71 ms |
17248 KB |
Output is correct |
6 |
Correct |
49 ms |
15920 KB |
Output is correct |
7 |
Correct |
50 ms |
15920 KB |
Output is correct |
8 |
Correct |
60 ms |
16820 KB |
Output is correct |
9 |
Correct |
59 ms |
16764 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
53 ms |
15956 KB |
Output is correct |
2 |
Correct |
2 ms |
1256 KB |
Output is correct |
3 |
Correct |
46 ms |
15636 KB |
Output is correct |
4 |
Correct |
77 ms |
17208 KB |
Output is correct |
5 |
Correct |
71 ms |
17248 KB |
Output is correct |
6 |
Correct |
49 ms |
15920 KB |
Output is correct |
7 |
Correct |
50 ms |
15920 KB |
Output is correct |
8 |
Correct |
60 ms |
16820 KB |
Output is correct |
9 |
Correct |
59 ms |
16764 KB |
Output is correct |
10 |
Correct |
46 ms |
14120 KB |
Output is correct |
11 |
Correct |
47 ms |
14120 KB |
Output is correct |
12 |
Correct |
44 ms |
14328 KB |
Output is correct |
13 |
Correct |
41 ms |
14124 KB |
Output is correct |
14 |
Correct |
53 ms |
14380 KB |
Output is correct |
15 |
Correct |
50 ms |
14636 KB |
Output is correct |
16 |
Correct |
59 ms |
16824 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
45 ms |
13524 KB |
Output is correct |
2 |
Correct |
1 ms |
1464 KB |
Output is correct |
3 |
Correct |
46 ms |
13336 KB |
Output is correct |
4 |
Correct |
61 ms |
14900 KB |
Output is correct |
5 |
Correct |
66 ms |
14900 KB |
Output is correct |
6 |
Correct |
46 ms |
13760 KB |
Output is correct |
7 |
Correct |
47 ms |
13760 KB |
Output is correct |
8 |
Correct |
52 ms |
14588 KB |
Output is correct |
9 |
Correct |
55 ms |
14528 KB |
Output is correct |
10 |
Correct |
50 ms |
14132 KB |
Output is correct |
11 |
Correct |
51 ms |
14452 KB |
Output is correct |
12 |
Correct |
50 ms |
14132 KB |
Output is correct |
13 |
Correct |
51 ms |
14132 KB |
Output is correct |
14 |
Correct |
65 ms |
14580 KB |
Output is correct |
15 |
Correct |
55 ms |
14516 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
45 ms |
13524 KB |
Output is correct |
2 |
Correct |
1 ms |
1464 KB |
Output is correct |
3 |
Correct |
46 ms |
13336 KB |
Output is correct |
4 |
Correct |
61 ms |
14900 KB |
Output is correct |
5 |
Correct |
66 ms |
14900 KB |
Output is correct |
6 |
Correct |
46 ms |
13760 KB |
Output is correct |
7 |
Correct |
47 ms |
13760 KB |
Output is correct |
8 |
Correct |
52 ms |
14588 KB |
Output is correct |
9 |
Correct |
55 ms |
14528 KB |
Output is correct |
10 |
Correct |
50 ms |
14132 KB |
Output is correct |
11 |
Correct |
51 ms |
14452 KB |
Output is correct |
12 |
Correct |
50 ms |
14132 KB |
Output is correct |
13 |
Correct |
51 ms |
14132 KB |
Output is correct |
14 |
Correct |
65 ms |
14580 KB |
Output is correct |
15 |
Correct |
55 ms |
14516 KB |
Output is correct |
16 |
Correct |
41 ms |
12156 KB |
Output is correct |
17 |
Correct |
38 ms |
12076 KB |
Output is correct |
18 |
Correct |
42 ms |
12440 KB |
Output is correct |
19 |
Correct |
40 ms |
12204 KB |
Output is correct |
20 |
Correct |
48 ms |
12716 KB |
Output is correct |
21 |
Correct |
45 ms |
12800 KB |
Output is correct |
22 |
Correct |
51 ms |
14516 KB |
Output is correct |
23 |
Correct |
44 ms |
12204 KB |
Output is correct |
24 |
Correct |
44 ms |
12416 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
1432 KB |
Wrong Answer [2] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
9 ms |
2532 KB |
Wrong Answer [2] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
11 ms |
2724 KB |
Wrong Answer [2] |
2 |
Halted |
0 ms |
0 KB |
- |