Submission #1138751

#	Time	Username	Problem	Language	Result	Execution time	Memory
1138751		Noproblem29	Amusement Park (JOI17_amusement_park)	C++20	0 / 100	14 ms	4680 KiB

Joi

#include "Joi.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define y1 cheza
const int N=1e5+100;
const int M=5001;
const int B=447;
const int mod=998244353;
const ll INF=1e18;

void Joi(int N, int M, int A[], int B[], long long X, int T) {
    for(int i = 0; i < N; i++){
        long long cur=(i%60);
        int bt=(X>>cur)&1ll;
        MessageBoard(i,bt);
    }
}

Ioi

#include "Ioi.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define y1 cheza
const int N=1e5+100;
const int M=5001;
const int B=447;
const int mod=998244353;
const ll INF=1e18;
int cnt[60];
vector<int>g[N];
void dfs(int x,int p){
    for(auto i:g[x]){
        if(i!=p){
            cnt[i%60]=Move(i);
            dfs(i,x);
            Move(x);
        }
    }
}
long long Ioi(int N, int M, int A[], int B[], int P, int V, int T) {
    cnt[P%60]=V;
    for(int i=0;i<M;i++){
        g[A[i]].push_back(B[i]);
        g[B[i]].push_back(A[i]);
    }
    dfs(P,P);
    ll ans=0;  
    for(int i=0;i<60;i++){
        if(cnt[i]){
            ans+=(1ll<<i);
        }
    }
    return ans;
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 10
• Subtask 3: 0 / 10
• Subtask 4: 0 / 55
• Subtask 5: 0 / 17