oj.uz

답안 #296602

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
296602 2020-09-10T17:00:59 Z Leonardo16 Vision Program (IOI19_vision) C++14
8 / 100
 1 ms 532 KB 
///   Code by Leonardo16
/// “Your focus determines your reality.” – Qui-Gon Jinn
#include<bits/stdc++.h>
#include "vision.h"
using namespace std;
#pragma GCC optimize("Ofast","unroll-loops","omit-frame-pointer","inline")
//#pragma GCC option("arch=native","tune=native","no-zero-upper")
//#pragma GCC target("avx2")
//#define int  long long
#define ll long long
#define sz size
#define ull unsigned long long
#define ld long double
#define ii pair<int,int>
#define fst first
#define scd second
#define vi vector<int>
#define vii vector<ii>
#define pb push_back
#define pf push_front
#define fl '\n'
#define el endl
#define all(x) x.begin() , x.end()
#define rall(x) x.rbegin() , x.rend()
/// Functions
#define db(x) cerr << #x << ": " << (x) << '\n';
#define random() __builtin_ia32_rdtsc()
#define lg2(x) 31-__builtin_clz(x)
#define lg2ll(x) 63-__builtin_clzll(x)
#define pi acos(-1)
#define YN(x) cout<<((x)?("YES"):("NO"))<<fl;
#define yn(x) cout<<((x)?("Yes"):("No"))<<fl;
#define des(x,s1,s2,end1,end2) cout<<((x)?(s1):(s2))<<fl;if(x){end1;}else{end2;}
#define precision(x) cout.setf(ios::fixed);cout.precision(x);
/// Red-Black Tree Template
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//typedef tree < long long ,  null_type ,  less<long long> ,  rb_tree_tag ,  tree_order_statistics_node_update > ordered_set;
//#define less_than(n) order_of_key(n)
//#define en_pos(n) find_by_order(n)
/// Prime numbers  173,179,311,331,737,1009,2011,2027,3079,4001,100003
///=====================================================================

//void add_or(vi v){
////    cout<< "OR : ";
////    for(int i=0;i<v.sz();i++){cout<<v[i]<<" ";}cout<<fl;
//}
//
//void add_xor(vi v){
////    cout<< "XOR : ";
////    for(int i=0;i<v.sz();i++){cout<<v[i]<<" ";}cout<<fl;
//}
//
//void add_and(vi v){
////    cout<< "AND : ";
////    for(int i=0;i<v.sz();i++){cout<<v[i]<<" ";}cout<<fl;
//}


int dist(ii a,ii b){
    return abs(a.fst-b.fst)+abs(a.scd-b.scd);
}

int real_dist(int n,int m,ii a,ii b){
    if(a.fst>b.fst)swap(a,b);

    if(a.fst==b.fst){
        return abs(a.scd-b.scd)+1;
    }

    int cnt=m*(b.fst-a.fst-1);
    cnt+=m-a.scd;
    cnt+=b.scd;
    return cnt;
}

vector<vi> v;

int arr[202][202];

void count_dist(int n,int m,int k){
    int wr=0;
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            arr[i][j]=wr++;
        }
    }

    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            vi vv;
            for(int h=0;h<n;h++){
                for(int g=0;g<m;g++){
                    if( dist({i,j},{h,g})==k ){
                        vv.pb(arr[h][g]);
                    }
                }
            }
            if(vv.sz()==0)continue;
            v.pb(vv);

            vv.clear();
            vv.pb(arr[i][j]);
            v.pb(vv);
        }
    }

}



void count_dist2(int n,int m,int k){
    int wr=0;
    for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            arr[i][j]=wr++;
        }
    }

    int i=0,j=0;
    vi vv;
    for(int h=0;h<n;h++){
        for(int g=0;g<m;g++){
            if( dist({i,j},{h,g})==k ){
                vv.pb(arr[h][g]);
            }
        }
    }
    if(vv.sz()==0)return;
    v.pb(vv);

    vv.clear();
    vv.pb(arr[i][j]);
    v.pb(vv);
}



void construct_network( int n,int m,int k){
    if( 0 &&  n*m<10000){
        count_dist(n,m,k);
        int wr=n*m-1;
        for(int i=0;i<v.sz();i+=2){
            add_xor(v[i]);
            add_or(v[i+1]);
            wr+=2;
        }


        if(v.sz()==0){
            vi nv;
            for(int i=0;i<n*m;i++){
                nv.pb(i);
            }
            add_and(nv);
            return;
        }

        int ow=wr+1;
        int nw=wr+1;

        for(int i=n*m;i<=wr;i+=2){
            vi nv;
            nv.pb(i);
            nv.pb(i+1);
            add_and(nv);
            nw++;
        }

        vi nv;
        for(int i=ow;i<nw;i++){
            nv.pb(i);
        }
        add_or(nv);

    }else{
        count_dist2(n,m,k);
        int wr=n*m-1;
        for(int i=0;i<v.sz();i+=2){
            add_xor(v[i]);
            add_or(v[i+1]);
            wr+=2;
        }


        if(v.sz()==0){
            vi nv;
            for(int i=0;i<n*m;i++){
                nv.pb(i);
            }
            add_and(nv);
            return;
        }

        int ow=wr+1;
        int nw=wr+1;

        for(int i=n*m;i<=wr;i+=2){
            vi nv;
            nv.pb(i);
            nv.pb(i+1);
            add_and(nv);
            nw++;
        }

        vi nv;
        for(int i=ow;i<nw;i++){
            nv.pb(i);
        }
        add_or(nv);

    }
    return;
}


//
//int main(){
//    construct_network(100,100,60);
//}

Compilation message

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:144:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  144 |         for(int i=0;i<v.sz();i+=2){
      |                     ~^~~~~~~
vision.cpp:180:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  180 |         for(int i=0;i<v.sz();i+=2){
      |                     ~^~~~~~~

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 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 0 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 0 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 0 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 1 ms 256 KB on inputs (0, 1), (0, 2), 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 0 ms 256 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 1 ms 532 KB Output is correct
19 Correct 1 ms 512 KB Output is correct
20 Correct 1 ms 512 KB Output is correct
21 Correct 1 ms 512 KB Output is correct
22 Correct 1 ms 512 KB Output is correct
23 Correct 1 ms 512 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 512 KB Output is correct
28 Correct 1 ms 512 KB Output is correct
29 Correct 1 ms 512 KB Output is correct
30 Correct 1 ms 512 KB Output is correct
31 Correct 1 ms 512 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 0 ms 512 KB on inputs (80, 199), (81, 199), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

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