oj.uz

Submission #1107974

# Submission time Handle Problem Language Result Execution time Memory
1107974 2024-11-02T13:42:29 Z AlgorithmWarrior Magic Show (APIO24_show) C++17
0 / 100
 2 ms 784 KB 
#include <bits/stdc++.h>
#include "Alice.h"

using namespace std;

vector<pair<int,int>>Alice(){
    long long x=setN(3602);
    vector<pair<int,int>>tree;
    tree.push_back({1,2});
    int i,j;
    for(i=0;i<60;++i){
        int bit=(x&(1<<i));
        for(j=0;j<60;++j){
            tree.push_back({bit+1,3+i*60+j});
        }
    }
    return tree;
}
#include <bits/stdc++.h>
#include "Bob.h"

using namespace std;

long long Bob(vector<pair<int,int>> V){
    long long x=0;
    for(auto edge : V){
        if(edge.first==2){
            x|=(1<<((edge.second-3)/60));
        }
    }
    return x;
}

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 784 KB Incorrect answer.
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 784 KB Incorrect answer.
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 65.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 784 KB Incorrect answer.
2 Halted 0 ms 0 KB -