| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 897011 | alexander707070 | Flights (JOI22_flights) | C++17 | 23 ms | 2392 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<bits/stdc++.h>
#include "Ali.h"
#define MAXN 10007
using namespace std;
namespace{
    int n,xx,yy;
    bool dali;
    vector<int> v[MAXN],w;
    int dist[MAXN];
    void dfs(int x,int p,int d){
        dist[x]=d;
        for(int i=0;i<v[x].size();i++){
            if(v[x][i]==p)continue;
            dfs(v[x][i],x,d+1);
        }
    }
}
void Init(int N, vector<int> U, vector<int> V){
    n=N;
    for(int i=0;i<n;i++)v[i].clear();
    w.clear();
    for(int i=0;i<n-1;i++){
        v[U[i]].push_back(V[i]);
        v[V[i]].push_back(U[i]);
    }
    for(int i=0;i<=n-1;i++){
        SetID(i,i);
    }
}
string SendA(string S){
    xx=yy=0;
    for(int i=0;i<10;i++){
        xx*=2;
        if(S[i]=='1')xx++;
    }
    for(int i=0;i<10;i++){
        yy*=2;
        if(S[10+i]=='1')yy++;
    }
    string res="";
    for(int i=0;i<10;i++){
        for(int f=0;f<10;f++){
            xx+=i*(1<<10);
            yy+=f*(1<<10);
            if(xx>=n or yy>=n or xx>=yy){
                xx-=i*(1<<10);
                yy-=f*(1<<10);
                continue;
            }
            dfs(xx,-1,0);
            for(int e=13;e>=0;e--){
                if(((1<<e)&dist[yy])>0)res.push_back('1');
                else res.push_back('0');
            }
            xx-=i*(1<<10);
            yy-=f*(1<<10);
        }
    }
    return res;
}
#include<bits/stdc++.h>
#include "Benjamin.h"
#define MAXN 10007
using namespace std;
namespace{
    int nn,from,to,s,pos,xx,yy;
}
string SendB(int N, int X, int Y){
    
    nn=N; from=X; to=Y;
    
    if(from>to)swap(from,to);
    string res="";
    for(int i=9;i>=0;i--){
        if((from&(1<<i))==0)res.push_back('0');
        else res.push_back('1');
    }
    for(int i=9;i>=0;i--){
        if((to&(1<<i))==0)res.push_back('0');
        else res.push_back('1');
    }
    return res;
}
int Answer(string T){
    xx=from&((1<<10)-1);
    yy=to&((1<<10)-1);
    for(int i=0;i<10;i++){
        for(int f=0;f<10;f++){
            xx+=i*(1<<10);
            yy+=f*(1<<10);
            if(xx>=nn or yy>=nn or xx>=yy){
                xx-=i*(1<<10);
                yy-=f*(1<<10);
                continue;
            }
            if(xx==from and yy==to){
                s=0;
                for(int e=pos;e<pos+14;e++){
                    s*=2;
                    if(T[e]=='1')s++;
                }
                return s;
            }
            pos+=14;
            xx-=i*(1<<10);
            yy-=f*(1<<10);
        }
    }
    return -1;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
