oj.uz

Submission #1018836

# Submission time Handle Problem Language Result Execution time Memory
1018836 2024-07-10T10:06:37 Z Unforgettablepl Flights (JOI22_flights) C++17
15 / 100
 2209 ms 2740 KB 
#include "Ali.h"
#include <bits/stdc++.h>
using namespace std;

const int CASES = 48;

namespace {

vector<vector<int>> adj;
int n;

}

void Init(int N, vector<int> U, vector<int> V) {
    adj = vector<vector<int>>(N);
    n = N;
    for(int i=0;i<n-1;i++){
        adj[U[i]].emplace_back(V[i]);
        adj[V[i]].emplace_back(U[i]);
    }
    for(int i=0;i<N;i++)SetID(i,i);
}

string SendA(string S) {
    int x = 0;
    for(int bit=0;bit<20;bit++)if(S[bit]=='1')x|=(1<<bit);
    int curr = 0;
    int num = 0;
    vector<pair<int,int>> possibilities;
    for(int l=0;l<n;l++){
        for(int r=l+1;r<n;r++){
            if(num==CASES){
                num = 0;
                curr++;
            }
            num++;
            if(curr==x)possibilities.emplace_back(l,r);
        }
    }
    int tar = -1;
    function<int(int,int)> dfs = [&](int x,int p){
        if(tar==x)return 0;
        int ans = 1e5;
        for(int&i:adj[x])if(i!=p)ans=min(ans,dfs(i,x)+1);
        return ans;
    };
    string res;
    for(auto[a,b]:possibilities){
        tar = b;
        int ans = dfs(a,-1);
        for(int bit=0;bit<14;bit++){
            if(ans&(1<<bit))res.insert(res.end(),'1');
            else res.insert(res.end(),'0');
        }
    }
    return res;
}

#include "Benjamin.h"
#include <bits/stdc++.h>
using namespace std;

const int CASES = 48;

namespace {

int possno;

}

string SendB(int N, int X, int Y) {
    int curr = 0;
    int num = 0;
    int mine = 0;
    if(Y<X)swap(X,Y);
    vector<pair<int,int>> possibilities;
    for(int l=0;l<N;l++){
        for(int r=l+1;r<N;r++){
            if(num==CASES){
                num = 0;
                curr++;
            }
            num++;
            if(l==X and r==Y)mine=curr;
        }
    }
    string res;
    for(int bit=0;bit<20;bit++){
        if(mine&(1<<bit))res.insert(res.end(),'1');
        else res.insert(res.end(),'0');
    }
    curr = 0;
    num = 0;
    for(int l=0;l<N;l++){
        for(int r=l+1;r<N;r++){
            if(num==CASES){
                num = 0;
                curr++;
            }
            num++;
            if(curr==mine)possibilities.emplace_back(l,r);
        }
    }
    for(int i=0;i<possibilities.size();i++){
        if(possibilities[i]==make_pair(X,Y))possno=i;
    }
    return res;
}

int Answer(string T) {
    int ans = 0;
    for(int bit=0;bit<14;bit++)if(T[possno*14 + bit]=='1')ans|=(1<<bit);
    return ans;
}

Compilation message

grader_ali.cpp:10:8: warning: '{anonymous}::_randmem' defined but not used [-Wunused-variable]
   10 |   char _randmem[12379];
      |        ^~~~~~~~

Benjamin.cpp: In function 'std::string SendB(int, int, int)':
Benjamin.cpp:46:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |     for(int i=0;i<possibilities.size();i++){
      |                 ~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 664 KB Output is correct
2 Correct 1 ms 664 KB Output is correct
3 Correct 1 ms 748 KB Output is correct
4 Correct 0 ms 664 KB Output is correct
5 Correct 0 ms 664 KB Output is correct
6 Correct 196 ms 1588 KB Output is correct
7 Correct 151 ms 1508 KB Output is correct
8 Correct 136 ms 1512 KB Output is correct
9 Correct 177 ms 1500 KB Output is correct
10 Correct 172 ms 1796 KB Output is correct
11 Correct 93 ms 1252 KB Output is correct
12 Correct 172 ms 1504 KB Output is correct
13 Correct 134 ms 1536 KB Output is correct
14 Correct 159 ms 1532 KB Output is correct
15 Correct 147 ms 2304 KB Output is correct
16 Correct 136 ms 1592 KB Output is correct

Subtask #2
0 / 85.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 664 KB Output is partially correct
2 Partially correct 1605 ms 2740 KB Output is partially correct
3 Partially correct 3 ms 920 KB Output is partially correct
4 Failed 2209 ms 1588 KB Unexpected end of file - int32 expected (Bruno)
5 Halted 0 ms 0 KB -