# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
3137 | club4208 | Saveit (IOI10_saveit) | C++98 | 584 ms | 15080 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<stdio.h>
#include "grader.h"
#include "encoder.h"
#include<vector>
#include<algorithm>
#include<queue>
using namespace std;
typedef pair<int,int>pii;
void encode(int cit, int hab, int way, int *va, int *vb)
{
vector<int>pat[1000];
int dist[36][1000];
for(int i=0;i<way;i++)
{
pat[va[i]].push_back(vb[i]);
pat[vb[i]].push_back(va[i]);
}
for(int i=0;i<hab;i++)
{
for(int j=0;j<cit;j++)
{
dist[i][j]=-1;
}
}
for(int p=0;p<hab;p++)
{
queue<pii>que;
que.push(make_pair(0,p));
for(;;)
{
Compilation message (stderr)
# | 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... |