oj.uz

답안 #289433

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
289433 2020-09-02T16:25:15 Z Dremix10 Vision Program (IOI19_vision) C++17
0 / 100
 3 ms 1148 KB 
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int,int> pi;
typedef pair<ll,ll> pl;
#define F first
#define S second
#define endl '\n'
#define all(x) (x).begin(),(x).end()
#ifdef dremix
    #define p(x) cerr<<#x<<" = "<<x<<endl;
    #define p2(x,y) cerr<<#x<<" , "<<#y<<" = "<<x<<" , "<<y<<endl;
    #define pp(x) cerr<<#x<<" = ("<<x.F<<" , "<<x.S<<")"<<endl;
    #define pv(x) cerr<<#x<<" = {";for(auto u : x)cerr<<u<<", ";cerr<<"}"<<endl;
    #define ppv(x) cerr<<#x<<" = {";for(auto u : x)cerr<<u.F<<"-"<<u.S<<", ";cerr<<"}"<<endl;
#else
    #define p(x)
    #define p2(x,y)
    #define pp(x)
    #define pv(x)
    #define ppv(x)
#endif
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
const int maxp = 22;
const ld EPS = 1e-18;
const ll INF = 1e18;
const int MOD = 1e9+7;

int N,M;

bool valid(int i, int j){
    return (i>=0 && i<N && j>=0 && j<M);
}

void construct_network(int n, int m, int k) {
    N = n;
    M = m;
	int arr[n][m];
    int i,j,di;
    //int temp = add_not(0);
    vector<int> asks;
    for(i=0;i<n;i++)
    for(j=0;j<m;j++){
        vector<int> idx;
        for(di=-k;di<=k;di++){
            int dj = k - abs(di);
            if(valid(i+di,j+dj))
                idx.push_back((i+di)*m+j+dj);
            if(dj && valid(i+di,j-dj))
                idx.push_back((i+di)*m+j-dj);
        }
        p2(i,j)
        pv(idx)
        if(!idx.empty()){
            asks.push_back(add_xor(idx));
            asks.push_back(add_or(idx));
        }
    }
    pv(asks)
    vector<int> fin;
    for(i=0;i<asks.size();i+=2)
        fin.push_back(add_xor({asks[i],asks[i+1]}));
    pv(fin)
    int temp = add_or(fin);
    return;
}

Compilation message

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:64:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |     for(i=0;i<asks.size();i+=2)
      |             ~^~~~~~~~~~~~
vision.cpp:41:6: warning: unused variable 'arr' [-Wunused-variable]
   41 |  int arr[n][m];
      |      ^~~
vision.cpp:67:9: warning: unused variable 'temp' [-Wunused-variable]
   67 |     int temp = add_or(fin);
      |         ^~~~

Subtask #1
0 / 10.0

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

Subtask #5
0 / 12.0

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

Subtask #6
0 / 8.0

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

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 1148 KB WA in grader: Too many instructions
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

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