oj.uz

Submission #897013

# Submission time Handle Problem Language Result Execution time Memory
897013 2024-01-02T12:18:48 Z alexander707070 Flights (JOI22_flights) C++17
30 / 100
 820 ms 3148 KB 
#include<bits/stdc++.h>
#include "Ali.h"

#define MAXN 10007
using namespace std;

namespace{

    int n,xx,yy;

    vector<int> v[MAXN];
    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();

    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);
    pos=0;

    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

Ali.cpp: In function 'void {anonymous}::dfs(int, int, int)':
Ali.cpp:16:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |         for(int i=0;i<v[x].size();i++){
      |                     ~^~~~~~~~~~~~
grader_ali.cpp:10:8: warning: '{anonymous}::_randmem' defined but not used [-Wunused-variable]
   10 |   char _randmem[12379];
      |        ^~~~~~~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1176 KB Output is correct
2 Correct 1 ms 1176 KB Output is correct
3 Correct 0 ms 1176 KB Output is correct
4 Correct 0 ms 1176 KB Output is correct
5 Correct 0 ms 1176 KB Output is correct
6 Correct 13 ms 1896 KB Output is correct
7 Correct 13 ms 1732 KB Output is correct
8 Correct 20 ms 1660 KB Output is correct
9 Correct 13 ms 1780 KB Output is correct
10 Correct 17 ms 2224 KB Output is correct
11 Correct 6 ms 1688 KB Output is correct
12 Correct 6 ms 1560 KB Output is correct
13 Correct 8 ms 1736 KB Output is correct
14 Correct 6 ms 1776 KB Output is correct
15 Correct 10 ms 2236 KB Output is correct
16 Correct 8 ms 1788 KB Output is correct

Subtask #2
15.0 / 85.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1176 KB Output is correct
2 Partially correct 100 ms 2368 KB Output is partially correct
3 Correct 2 ms 1004 KB Output is correct
4 Partially correct 629 ms 1868 KB Output is partially correct
5 Partially correct 639 ms 2236 KB Output is partially correct
6 Partially correct 662 ms 1880 KB Output is partially correct
7 Partially correct 562 ms 3052 KB Output is partially correct
8 Partially correct 641 ms 2088 KB Output is partially correct
9 Partially correct 290 ms 2688 KB Output is partially correct
10 Partially correct 291 ms 2680 KB Output is partially correct
11 Partially correct 458 ms 1848 KB Output is partially correct
12 Partially correct 23 ms 2340 KB Output is partially correct
13 Partially correct 171 ms 2032 KB Output is partially correct
14 Partially correct 220 ms 2108 KB Output is partially correct
15 Correct 3 ms 1304 KB Output is correct
16 Partially correct 302 ms 2792 KB Output is partially correct
17 Partially correct 302 ms 3032 KB Output is partially correct
18 Partially correct 343 ms 3000 KB Output is partially correct
19 Partially correct 327 ms 3148 KB Output is partially correct
20 Partially correct 198 ms 2360 KB Output is partially correct
21 Partially correct 297 ms 2864 KB Output is partially correct
22 Partially correct 295 ms 2808 KB Output is partially correct
23 Partially correct 294 ms 2360 KB Output is partially correct
24 Partially correct 301 ms 2720 KB Output is partially correct
25 Partially correct 320 ms 2572 KB Output is partially correct
26 Partially correct 306 ms 2136 KB Output is partially correct
27 Partially correct 305 ms 2424 KB Output is partially correct
28 Partially correct 308 ms 1900 KB Output is partially correct
29 Partially correct 295 ms 2080 KB Output is partially correct
30 Partially correct 286 ms 2452 KB Output is partially correct
31 Partially correct 286 ms 2288 KB Output is partially correct
32 Partially correct 290 ms 2428 KB Output is partially correct
33 Partially correct 284 ms 2480 KB Output is partially correct
34 Partially correct 282 ms 2272 KB Output is partially correct
35 Partially correct 285 ms 2540 KB Output is partially correct
36 Partially correct 284 ms 2192 KB Output is partially correct
37 Partially correct 289 ms 2320 KB Output is partially correct
38 Partially correct 284 ms 1852 KB Output is partially correct
39 Partially correct 46 ms 2028 KB Output is partially correct
40 Partially correct 820 ms 2992 KB Output is partially correct