제출 #1246856

#제출 시각아이디문제언어결과실행 시간메모리
1246856sofiefuVision Program (IOI19_vision)C++20
0 / 100
240 ms1988 KiB
#include <bits/stdc++.h>
#include "vision.h"
using namespace std;

#define vo vector
#define pb push_back
#define fi first 
#define se second 
#define all(x) x.begin(), x.end()
typedef vector<signed> vs;
typedef vector<int> vi;
typedef pair<int, int> pii;

#define rep(i, a, b) for(int i=(a); i<(b);i++)
#define repd(i, a, b) for(int i=(b-1); i>=a;i--)
#define pr(x) cerr << #x << " = " << x << endl;
int const inf = 1e18, mxn = 1e5+5;
int n, m;

void construct_network(int R, int C, int K){

    vo<vi> where(R, vi(C));

    rep(i, 0, R){
        rep(u, 0, C){
            vi op;
            rep(a, 0, R){
                rep(b, 0, C){
                    int d = abs(i-a) + abs(u-b);
                    if(d==K) op.pb(a*C+b);
                }
            }
            where[i][u] = add_or(op);
        }
    }
    int nex = 2*R*C;
    vi last;
    rep(i, 0, R){
        rep(u, 0, C){
            vi op = {i*C+u, where[i][u]};
            last.pb(add_and(op));
        }
    }
    add_or(last);
}

/*
1 1 1 

*/

컴파일 시 표준 에러 (stderr) 메시지

vision.cpp:17:17: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   17 | int const inf = 1e18, mxn = 1e5+5;
      |                 ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...