#include "Encoder.h"
#include <vector>
#include <iostream>
using namespace std;
static const int maxn = 1<<20;
static vector<int> adj[maxn];
static int ini[maxn], fin[maxn];
static int pos = 1;
static void dfs(int yo, int pa)
{
ini[yo] = pos++;
for (int v: adj[yo])
if (v != pa) dfs(v, yo);
fin[yo] = pos-1;
}
void Encode(int N, int A[], int B[])
{
//cout << "llama ";
vector<int> v;
for (int i = 0; i < N-1; ++i)
{
adj[A[i]].push_back(B[i]);
adj[B[i]].push_back(A[i]);
}
dfs(0, -1);
long long temp;
for (int i = 0; i < N; i++)
{
//cout << i << " " << ini[i] << " " << fin[i] << '\n';
temp = ini[i]*(1e6) + fin[i];
//cout << temp << " ";
Code(i, temp);
}
}
// g++ grader.cpp Encoder.cpp Device.cpp
#include "Device.h"
#include <vector>
#include <string>
#include <iostream>
using namespace std;
void InitDevice()
{
}
int Answer(long long S, long long T)
{
int div = 1e6;
//cout << S << " " << T << '\n';
long long iniS = S/div, iniT = T/div;
long long finS = S%div, finT = T%div;
//cout << iniS << " " << finS << '\n';
//cout << iniT << " " << finT << '\n';
if (iniS <= iniT && finT <= finS)
{
return 1;
}
if (iniT <= iniS && finS <= finT)
{
return 0;
}
return 2;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
6 ms |
33548 KB |
Output is correct |
| 2 |
Correct |
6 ms |
33552 KB |
Output is correct |
| 3 |
Correct |
6 ms |
33552 KB |
Output is correct |
| 4 |
Correct |
7 ms |
33552 KB |
Output is correct |
| 5 |
Correct |
6 ms |
33560 KB |
Output is correct |
| 6 |
Correct |
7 ms |
33564 KB |
Output is correct |
| 7 |
Correct |
6 ms |
33552 KB |
Output is correct |
| 8 |
Correct |
6 ms |
33564 KB |
Output is correct |
| 9 |
Correct |
6 ms |
33564 KB |
Output is correct |
| 10 |
Correct |
7 ms |
33548 KB |
Output is correct |
| 11 |
Correct |
6 ms |
33548 KB |
Output is correct |
| 12 |
Correct |
6 ms |
33552 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Partially correct |
128 ms |
41248 KB |
Output is partially correct - L = 700000700 |
| 2 |
Partially correct |
128 ms |
41124 KB |
Output is partially correct - L = 699000699 |
| 3 |
Partially correct |
131 ms |
41144 KB |
Output is partially correct - L = 700000700 |
| 4 |
Partially correct |
127 ms |
41116 KB |
Output is partially correct - L = 700000700 |
| 5 |
Partially correct |
287 ms |
64140 KB |
Output is partially correct - L = 250000250000 |
| 6 |
Partially correct |
293 ms |
64160 KB |
Output is partially correct - L = 250000250000 |
| 7 |
Partially correct |
284 ms |
64004 KB |
Output is partially correct - L = 250000250000 |
| 8 |
Partially correct |
346 ms |
63796 KB |
Output is partially correct - L = 250000250000 |
| 9 |
Partially correct |
271 ms |
64928 KB |
Output is partially correct - L = 250000250000 |
| 10 |
Partially correct |
256 ms |
64712 KB |
Output is partially correct - L = 250000250000 |
| 11 |
Partially correct |
246 ms |
64768 KB |
Output is partially correct - L = 250000250000 |
| 12 |
Partially correct |
256 ms |
64708 KB |
Output is partially correct - L = 250000250000 |
| 13 |
Partially correct |
254 ms |
64516 KB |
Output is partially correct - L = 250000250000 |
| 14 |
Partially correct |
303 ms |
64388 KB |
Output is partially correct - L = 250000250000 |
| 15 |
Partially correct |
130 ms |
41224 KB |
Output is partially correct - L = 700000700 |
| 16 |
Partially correct |
127 ms |
41092 KB |
Output is partially correct - L = 700000700 |
| 17 |
Partially correct |
129 ms |
41108 KB |
Output is partially correct - L = 700000700 |
| 18 |
Partially correct |
262 ms |
64652 KB |
Output is partially correct - L = 250000250000 |
| 19 |
Partially correct |
298 ms |
64248 KB |
Output is partially correct - L = 250000250000 |
| 20 |
Partially correct |
268 ms |
64220 KB |
Output is partially correct - L = 250000250000 |
| 21 |
Partially correct |
267 ms |
64440 KB |
Output is partially correct - L = 250000250000 |
| 22 |
Partially correct |
259 ms |
64132 KB |
Output is partially correct - L = 250000250000 |
| 23 |
Partially correct |
294 ms |
64084 KB |
Output is partially correct - L = 250000250000 |
| 24 |
Partially correct |
280 ms |
64108 KB |
Output is partially correct - L = 250000250000 |
| 25 |
Partially correct |
272 ms |
64672 KB |
Output is partially correct - L = 250000250000 |
| 26 |
Partially correct |
302 ms |
64272 KB |
Output is partially correct - L = 250000250000 |
| 27 |
Partially correct |
271 ms |
64392 KB |
Output is partially correct - L = 250000250000 |
