oj.uz

Submission #257300

# Submission time Handle Problem Language Result Execution time Memory
257300 2020-08-04T05:15:32 Z 최은수(#5045) None (JOI16_snowy) C++14
35 / 100
 19 ms 2112 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/10*10;i<city;i++)
        get+=Ask(500+i);
    return get;
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1008 KB Output is correct
2 Incorrect 2 ms 788 KB Wrong Answer [7]
3 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

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

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 1456 KB Output is correct
2 Correct 14 ms 1792 KB Output is correct
3 Correct 15 ms 1792 KB Output is correct
4 Correct 14 ms 1972 KB Output is correct
5 Correct 14 ms 1792 KB Output is correct
6 Correct 13 ms 1876 KB Output is correct
7 Correct 19 ms 1976 KB Output is correct
8 Correct 14 ms 1864 KB Output is correct
9 Correct 14 ms 1864 KB Output is correct
10 Correct 14 ms 1968 KB Output is correct
11 Correct 15 ms 1980 KB Output is correct
12 Correct 14 ms 1964 KB Output is correct
13 Correct 14 ms 1976 KB Output is correct
14 Correct 14 ms 2112 KB Output is correct
15 Correct 13 ms 1964 KB Output is correct
16 Correct 14 ms 1964 KB Output is correct
17 Correct 16 ms 1972 KB Output is correct
18 Correct 13 ms 1792 KB Output is correct
19 Correct 14 ms 1792 KB Output is correct
20 Correct 18 ms 1968 KB Output is correct

Subtask #4
0 / 45.0

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