제출 #1138760

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1138760		Noproblem29	Amusement Park (JOI17_amusement_park)	C++20	18 / 100	14 ms	1896 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);
        ll 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=1e4+100;
const int M=5001;
const int B=447;
const int mod=998244353;
const ll INF=1e18;
int cnt[60];
vector<int>g[N];
bool mark[N];
void dfs(int x){
    mark[x]=1;
    for(auto i:g[x]){
        if(!mark[i]){
            cnt[i%60]=Move(i);
            dfs(i);
            cnt[x%60]=Move(x);
        }
    }
}
long long Ioi(int n, int m, int a[], int b[], int pos, int V, int T) {
    cnt[pos%60]=V;
    if(n<60){
        assert(false);
    }
    for(int i=0;i<m;i++){
        g[a[i]].push_back(b[i]);
        g[b[i]].push_back(a[i]);
    }
    dfs(pos);
    ll ans=0;  
    for(ll i=0;i<60;i++){
        if(cnt[i]){
            ans+=(1ll<<i);
        }
    }
    return ans;
}

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