oj.uz

답안 #1026747

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1026747 2024-07-18T10:28:43 Z Zicrus Vision Program (IOI19_vision) C++17
0 / 100
 6 ms 1260 KB 
#include <bits/stdc++.h>
#include "vision.h"
using namespace std;

typedef long long ll;

vector<int> distIdVec(vector<int> xId, int W, int K) {
    int sameX = add_xor(xId);
    vector<int> distXId;
    for (int xOffset = 0; xOffset <= K && xOffset < W; xOffset++) {
        vector<int> offsetId;
        for (int xPos = 0; xPos < W - xOffset; xPos++) {
            offsetId.push_back(add_and({xId[xPos], xOffset == 0 ? sameX : xId[xPos + xOffset]}));
        }
        distXId.push_back(add_or(offsetId));
    }
    return distXId;
}

void construct_network(int H, int W, int K) {
    vector<int> yId(H);
    for (int i = 0; i < H; i++) {
        vector<int> r;
        for (int j = 0; j < W; j++) {
            r.push_back(W * i + j);
        }
        yId[i] = add_or(r);
    }
    vector<int> xId(H);
    for (int i = 0; i < W; i++) {
        vector<int> c;
        for (int j = 0; j < H; j++) {
            c.push_back(W * j + i);
        }
        xId[i] = add_or(c);
    }
    vector<int> distXId = distIdVec(xId, W, K);
    vector<int> distYId = distIdVec(yId, H, K);
    vector<int> kAtXPosId;
    for (int x = 0; x <= K && x < distXId.size(); x++) {
        if (K-x >= distYId.size()) continue;
        kAtXPosId.push_back(add_and({distXId[x], distYId[K-x]}));
    }
    add_or(kAtXPosId);
}

Compilation message

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:40:33: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |     for (int x = 0; x <= K && x < distXId.size(); x++) {
      |                               ~~^~~~~~~~~~~~~~~~
vision.cpp:41:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |         if (K-x >= distYId.size()) continue;
      |             ~~~~^~~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

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

Subtask #2
0 / 11.0

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

Subtask #3
0 / 11.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 0 ms 348 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #6
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 2 ms 604 KB Output is correct
5 Correct 2 ms 860 KB Output is correct
6 Correct 3 ms 984 KB Output is correct
7 Correct 2 ms 984 KB Output is correct
8 Runtime error 1 ms 604 KB Execution killed with signal 6
9 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 1260 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Runtime error 1 ms 604 KB Execution killed with signal 6
5 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

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