Submission #213092

#	Time	Username	Problem	Language	Result	Execution time	Memory
213092		HNO2	Amusement Park (JOI17_amusement_park)	C++17	18 / 100	39 ms	3832 KiB

Joi

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

typedef long long ll;
const int maxn=1e6+7;
const int inf=INT_MAX;
const ll inff=1e18;
const ll mod=1e9+7;
#define pii pair<int,int>
#define mkp make_pair
#define F first
#define S second
#define pb push_back
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(),(v).end()
//#define int ll

#ifdef HNO2
#define IOS
#else
#define endl '\n'
#define IOS ios::sync_with_stdio(0); cin.tie(0);
#endif // HNO2

namespace {


}  // namespace

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

Ioi

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

typedef long long ll;
const int maxn=1e4+7;
const int inf=INT_MAX;
const ll inff=1e18;
const ll mod=1e9+7;
#define pii pair<int,int>
#define mkp make_pair
#define F first
#define S second
#define pb push_back
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(),(v).end()
//#define int ll

#ifdef HNO2
#define IOS
#else
#define endl '\n'
#define IOS ios::sync_with_stdio(0); cin.tie(0);
#endif // HNO2

namespace {

int used[maxn];
int ans[maxn];
vector<int> G[maxn];

void dfs(int now)
{
    used[now]=1;
    for (int i:G[now])
        if (!used[i])
    {
        ans[i]=Move(i);
        dfs(i);
        Move(now);
    }
}

}

long long Ioi(int N, int M, int A[], int B[], int P, int V, int T)
{
    for (int i=0;i<M;i++)
        G[A[i]].pb(B[i]),G[B[i]].pb(A[i]);
    ans[P]=V;
    dfs(P);
    ll ret=0;
    for (int j=0;j<60;j++) ret|=(1ll<<j)*ans[j];
    return ret;
}

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