oj.uz

답안 #316670

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
316670 2020-10-27T07:00:05 Z jainbot27 Vision Program (IOI19_vision) C++17
8 / 100
 12 ms 1920 KB 
#include <bits/stdc++.h>
#include "vision.h"
using namespace std;

#define f first
#define s second
#define pb push_back
#define ar array
#define all(x) x.begin(), x.end()
#define siz(x) (int)x.size()

#define FOR(x, y, z) for(int x = (y); x < (z); x++)
#define ROF(x, z, y) for(int x = (y-1); x >= (z); x--)
#define F0R(x, z) FOR(x, 0, z)
#define R0F(x, z) ROF(x, 0, z)
#define trav(x, y) for(auto&x:y)

using ll = long long;
using vi = vector<int>;
using vl = vector<long long>;
using pii = pair<int, int>;
using vpii = vector<pair<int, int>>;

template<class T> inline bool ckmin(T&a, T b) {return b < a ? a = b, 1 : 0;}
template<class T> inline bool ckmax(T&a, T b) {return b > a ? a = b, 1 : 0;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const char nl = '\n';
const int mxN = 2e5 + 10;
const int MOD = 1e9 + 7;
const long long infLL = 1e18;

void construct_network(int n, int m, int k){
    vector<vi> di0(n+m-1), di1(n+m-1);
    vi tot0(n+m-1), tot1(n+m-1);
    F0R(i, n){
        F0R(j, m){
            di0[i+j].pb(i*m+j);
            di1[i+j].pb(i*m+(m-1-j));
        }
    }
    F0R(i, n+m-1){
        tot0[i] = add_or(di0[i]);
        tot1[i] = add_or(di1[i]);
    }
    vi p0(n + m - 1), p1(n + m - 1);
    p0[0] = tot0[0], p1[0] = tot1[0];
    FOR(i, 1, n+m-1){
        p0[i]=add_or({p0[i-1],tot0[i]});
        p1[i]=add_or({p1[i-1],tot1[i]});
    }
    int nk0 = -1, nk1 = -1;
    F0R(i, 2){
        int K = (i == 0 ? k : k + 1);
        int& nk = (i == 0 ? nk0 : nk1);
        vi al;
        FOR(s, 0, n+m-1-K){
            al.pb(add_and({p0[s], tot0[s+K]}));
        }
        FOR(s, 0, n+m-1-K){
            al.pb(add_and({p1[s], tot0[s+K]}));
        }
        if(siz(al))
            nk = add_or(al);
    }
    if(nk1 == -1){
        add_or({nk0, nk0});
    }
    else{
        add_xor({nk0, nk1});
    }
}
//int32_t main(){
//    ios_base::sync_with_stdio(0); cin.tie(0);


//    return 0;
//}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 256 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 256 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 256 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 256 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 512 KB on inputs (0, 99), (0, 100), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #6
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 3 ms 640 KB Output is correct
9 Correct 3 ms 640 KB Output is correct
10 Correct 3 ms 640 KB Output is correct
11 Correct 2 ms 512 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 1 ms 512 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 2 ms 512 KB Output is correct
18 Correct 2 ms 512 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 7 ms 1152 KB Output is correct
21 Correct 7 ms 1024 KB Output is correct
22 Correct 6 ms 1024 KB Output is correct
23 Correct 6 ms 1024 KB Output is correct
24 Correct 7 ms 1152 KB Output is correct
25 Correct 7 ms 1024 KB Output is correct
26 Correct 6 ms 1024 KB Output is correct
27 Correct 12 ms 1920 KB Output is correct
28 Correct 12 ms 1792 KB Output is correct
29 Correct 12 ms 1792 KB Output is correct
30 Correct 12 ms 1792 KB Output is correct
31 Correct 11 ms 1664 KB Output is correct
32 Correct 0 ms 256 KB Output is correct
33 Correct 0 ms 256 KB Output is correct

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 12 ms 1920 KB on inputs (59, 80), (127, 11), expected 0, but computed 1
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 256 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -