# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
934079 |
2024-02-26T18:55:29 Z |
Juanchoki |
City (JOI17_city) |
C++14 |
|
283 ms |
64272 KB |
#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++;
}
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;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
17 ms |
33492 KB |
Output is correct |
2 |
Correct |
6 ms |
33552 KB |
Output is correct |
3 |
Correct |
6 ms |
33556 KB |
Output is correct |
4 |
Correct |
6 ms |
33552 KB |
Output is correct |
5 |
Correct |
6 ms |
33560 KB |
Output is correct |
6 |
Correct |
6 ms |
33556 KB |
Output is correct |
7 |
Correct |
7 ms |
33564 KB |
Output is correct |
8 |
Correct |
8 ms |
33552 KB |
Output is correct |
9 |
Correct |
7 ms |
33564 KB |
Output is correct |
10 |
Correct |
7 ms |
33556 KB |
Output is correct |
11 |
Correct |
6 ms |
33548 KB |
Output is correct |
12 |
Correct |
6 ms |
33564 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Partially correct |
133 ms |
41136 KB |
Output is partially correct - L = 1398001399 |
2 |
Partially correct |
126 ms |
41204 KB |
Output is partially correct - L = 1391001392 |
3 |
Partially correct |
128 ms |
41260 KB |
Output is partially correct - L = 1395001396 |
4 |
Partially correct |
135 ms |
41144 KB |
Output is partially correct - L = 1391001392 |
5 |
Incorrect |
283 ms |
64272 KB |
Output isn't correct - L = 499993499994 |
6 |
Halted |
0 ms |
0 KB |
- |