oj.uz

Submission #257299

# Submission time Handle Problem Language Result Execution time Memory
257299 2020-08-04T05:14:31 Z 최은수(#5045) None (JOI16_snowy) C++14
0 / 100
 14 ms 1464 KB 
#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)*10<n;i++)
        for(int j=0;j<9;j++)
            Save(i*9+j,p[(i+1)*10]>>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>=10)
        for(int i=0;i<9;i++)
            get+=Ask((city/10-1)*9+i)*(1<<i);
    for(int i=city/1*1;i<city;i++)
        get+=Ask(500+i);
    return get;
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 784 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 1052 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 14 ms 1280 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 1464 KB Wrong Answer [7]
2 Halted 0 ms 0 KB -