oj.uz

Submission #1066382

# Submission time Handle Problem Language Result Execution time Memory
1066382 2024-08-19T20:02:20 Z guanex Vision Program (IOI19_vision) C++14
0 / 100
 2 ms 1240 KB 
#include "vision.h"
#include<bits/stdc++.h>

using namespace std;

typedef pair<int, int> ii;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<long long, long long> pll;
typedef pair<char, int> ci;
typedef pair<string, int> si;
typedef long double ld;
typedef vector<int> vi;
typedef vector<string> vs;
#define pb push_back
#define fi first
#define se second
#define whole(v) v.begin(), v.end()
#define rwhole(v) v.rbegin(), v.rend()
#define inf INT_MAX/2
#define fro front

void construct_network(int H, int W, int K) {
    vector<int> ins;
    int pos = 0;
    vector<int> impo;
    for(int i = 0; i <= H*W - 1; ++i){
        impo.pb(i);
        int d = -K;
        int r = 0;
        vector<int> z;
        for(int j = 0; j < K+1; ++j){
            int num = i+r;
            if(i % W + r >= W){
                continue;
            }
            //cout << num << endl;
            num += W * d;
            r++;
            d++;
            if(num < 0 || num >= H * W){
                continue;
            }
            //cout << r << " " << d << endl;
            //cout << i << " " << num << endl;
            z.pb(num);
            ins.pb(pos);
        }
        d = K;
        r = 0;
        for(int j = 0; j < K; ++j){
            int num = i+r;
            if(i % W + r >= W){
                continue;
            }
            num += W * d;
            r++;
            d--;
            if(num < 0 || num >= H * W){
                continue;
            }
            z.pb(num);
            //cout << i << " " << num << endl;
        }
        if(z.size() <= 0){
            continue;
        }
        int u = add_or(z);
        vector<int> f;
        f.pb(u); f.pb(i);
        pos = add_and(f);
        ins.pb(pos);
    }
    if(ins.size() <= 0){
        add_xor(impo);
        return;
    }
    //cout << ins[0] << endl;
    add_or(ins);
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB on inputs (0, 0), (0, 2), expected 0, but computed 1
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB on inputs (0, 0), (0, 2), expected 0, but computed 1
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB on inputs (0, 0), (0, 2), expected 0, but computed 1
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB on inputs (0, 0), (0, 2), expected 0, but computed 1
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB on inputs (0, 0), (0, 2), expected 0, but computed 1
2 Halted 0 ms 0 KB -

Subtask #6
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB on inputs (0, 0), (1, 1), expected 0, but computed 1
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 1240 KB WA in grader: Too many instructions
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB on inputs (0, 0), (0, 2), expected 0, but computed 1
2 Halted 0 ms 0 KB -