#include"Anyalib.h"
#include<iostream>
#include<vector>
#include<algorithm>
#define ep emplace
#define eb emplace_back
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef pair<int,int>pi;
typedef pair<ll,ll>pl;
const int inf=1e9+7;
const ll INF=1e18+7;
static vector<pi>edge;
static int n;
void InitAnya(int N,int A[],int B[])
{
n=N;
for(int i=0;i<n-1;i++)
edge.eb(A[i],B[i]);
return;
}
void Anya(int C[])
{
vector<int>p(n,0);
for(int i=1;i<n;i++)
p[i]=p[i-1]+C[i-1];
for(int i=0;(i+1)*1<n;i++)
for(int j=0;j<9;j++)
Save(i*9+j,p[(i+1)*1]>>j&1);
for(int i=0;i<n-1;i++)
Save(500+i,C[i]);
return;
}
#include"Borislib.h"
#include<iostream>
#include<vector>
#include<algorithm>
#define ep emplace
#define eb emplace_back
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef pair<int,int>pi;
typedef pair<ll,ll>pl;
const int inf=1e9+7;
const ll INF=1e18+7;
static vector<pi>edge;
static int n;
void InitBoris(int N ,int A[],int B[])
{
n=N;
for(int i=0;i<n-1;i++)
edge.eb(A[i],B[i]);
return;
}
int Boris(int city)
{
int get=0;
if(city>=1)
for(int i=0;i<9;i++)
get+=Ask((city/1-1)*9+i)*(1<<i);
for(int i=city/1*1;i<city;i++)
get+=Ask(500+i);
return get;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
1016 KB |
Output is correct |
2 |
Incorrect |
1 ms |
1016 KB |
Wrong Answer [7] |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
1028 KB |
Wrong Answer [2] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
772 KB |
Wrong Answer [1] |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
1020 KB |
Wrong Answer [1] |
2 |
Halted |
0 ms |
0 KB |
- |