oj.uz

Submission #210589

# Submission time Handle Problem Language Result Execution time Memory
210589 2020-03-17T19:02:08 Z ZloyHR Vision Program (IOI19_vision) C++17
0 / 100
 57 ms 7928 KB 
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> plll;
typedef pair<pll,pll> ppll;
typedef long double ld;

#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define fst first
#define snd second
#define ins insert
#define pb push_back
template< typename T,typename V>ostream &operator<< (ostream &out,const pair<T,V> x){ out << "{" << x.fst << " : " << x.snd << "}"; return out;}template< typename T>ostream &operator<< (ostream &out,const set<T> x){ for(auto &it : x){ out << it << " "; } return out;}template< typename T>ostream &operator<< (ostream &out,const multiset<T> x){ for(auto &it : x){ out << it << " "; } return out;}template< typename T,typename V>ostream &operator<< (ostream &out,const map<T,V> x){ for(auto &it : x){ out << "[" << it.fst << "]" << " = " << it.snd << "\n"; } return out;}template< typename T>ostream &operator<< (ostream &out,const vector<T> x){ for(int i = 0;i < x.size() - 1; ++i){ out << x[i] << " "; } out << x.back(); return out;}template< typename T>ostream &operator<< (ostream &out,const vector<vector<T> > x){ for(int i = 0;i < x.size() - 1; ++i){ out << "[" << i << "]" << " = {" << x[i] << "}\n"; } out << "[" << x.size() - 1 << "]" << " = {" << x.back() << "}\n"; return out;}

const int N = 1e6 + 5;
const int MOD = 1e9 + 7;
const ll INF = 1e9;
int dist(int x1,int y1,int x2,int y2){
    return abs(x2 - x1) + abs(y2 - y1);
}
map<ll,bool> used;
void construct_network(int H, int W, int K) {
    vector<int> g;
    int id = H * W;
	for(int i = 0;i < H; i += 2){
        for(int j = i % 2;j < W; j += 2){
            vector<int> Ns;
            for(int add = 0;add <= K; ++add){
                for(int x=-1;x <=1;x +=2)
                for(int y=-1;y <=1;y +=2){
                int i1 = i + x * add,j1 = j + y * (K - add);
                if(i1 >= H)continue;
                if(i1 < 0)continue;
                if(j1 >= W)continue;
                if(j1 < 0)continue;
                if(used.find((i * W + j) * INF + (i1 * W + j1)) != used.end())continue;
                if(used.find((i1 * W + j1) * INF + (i * W + j)) != used.end())continue;
                if(dist(i,j,i1,j1) == K){
                    used[(i * W + j) * INF + (i1 * W + j1)] = true;
                    Ns.pb(i1 * W + j1);
                }
                }
            }
            if(Ns.empty())continue;
            add_or(Ns);
            add_and({i * W + j,id});
            ++id;
            g.pb(id);
            ++id;
        }
	}
	add_or(g);
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Incorrect 5 ms 248 KB on inputs (0, 1), (1, 1), expected 1, but computed 0
6 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Incorrect 5 ms 248 KB on inputs (0, 1), (1, 1), expected 1, but computed 0
6 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Incorrect 5 ms 248 KB on inputs (0, 1), (1, 1), expected 1, but computed 0
6 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Incorrect 5 ms 248 KB on inputs (0, 1), (1, 1), expected 1, but computed 0
6 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Incorrect 5 ms 376 KB on inputs (0, 1), (0, 101), expected 1, but computed 0
4 Halted 0 ms 0 KB -

Subtask #6
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 368 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 8 ms 632 KB Output is correct
4 Correct 20 ms 2936 KB Output is correct
5 Correct 12 ms 1532 KB Output is correct
6 Correct 10 ms 888 KB Output is correct
7 Correct 7 ms 256 KB Output is correct
8 Correct 9 ms 888 KB Output is correct
9 Correct 57 ms 7928 KB Output is correct
10 Correct 35 ms 4856 KB Output is correct
11 Correct 14 ms 1656 KB Output is correct
12 Correct 8 ms 248 KB Output is correct
13 Correct 5 ms 372 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 380 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 5 ms 376 KB Output is correct
18 Correct 5 ms 376 KB Output is correct
19 Correct 5 ms 256 KB Output is correct
20 Incorrect 11 ms 2292 KB WA in grader: Too many instructions
21 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 2164 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 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 256 KB Output is correct
3 Correct 5 ms 256 KB Output is correct
4 Correct 5 ms 256 KB Output is correct
5 Incorrect 5 ms 248 KB on inputs (0, 1), (1, 1), expected 1, but computed 0
6 Halted 0 ms 0 KB -