# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
17610 | Namnamseo | Saveit (IOI10_saveit) | C++14 | 408 ms | 11640 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "grader.h"
#include "encoder.h"
#include <vector>
#include <algorithm>
using namespace std;
typedef pair<int,int> pp;
static vector<int> e[1000];
static int vis[1000];
static int nowtime;
static int table[36][1000];
static int queue[1000];
static int parent[1000];
static int conv[3];
void input(int&ne, int*&v1, int*&v2){
int a,b;
for(;ne--;){
a=v1[ne]; b=v2[ne];
e[a].push_back(b);
e[b].push_back(a);
}
}
void bfs(int s) {
++nowtime; vis[s]=nowtime;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |