oj.uz

Submission #430001

# Submission time Handle Problem Language Result Execution time Memory
430001 2021-06-16T10:56:27 Z Blistering_Barnacles Vision Program (IOI19_vision) C++14
8 / 100
 11 ms 13344 KB 
#include "vision.h"
//apig's property
//Happiness can be found, even in the darkest of times, if one only remembers to turn on the light
//El Pueblo Unido Jamas Sera Vencido
//The saddest thing about betrayal? is that it never comes from your enemies
//Do or do not... there is no try
//Billions of bilious blue blistering barnacles in a thundering typhoon!
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0)
#define F first
#define S second
#define pb push_back
#define vll vector< ll >
#define vi vector< int >
#define pll pair< ll , ll >
#define pi pair< int , int >
#define all(s) s.begin() , s.end()
#define sz(s) s.size()
#define str string
#define md ((s + e) / 2)
#define mid ((l + r) / 2)
#define msdp(dp) memset(dp , -1 , sizeof dp)
#define mscl(dp) memset(dp , 0 , sizeof dp)
#define C continue
#define R return
#define B break
#define lx node * 2
#define rx node * 2 + 1
#define br(o) o ; break
#define co(o) o ; continue
using namespace std;
typedef int ll;
ll q, dp[105][100005], a[555555] , b[555555], k, l, m, n, o, p;
map < ll , ll > mp;
vll adj[555555];
const ll mod = 1e9+7;
str s;
void construct_network(int H, int W, int K) {
    p = 0 ;
    ll i1 = 0 , j1 = 0 ;
    for(ll i2 = 0 ; i2 < H ; i2++){
        for(ll j2 = 0 ; j2 < W ; j2++){
            if(abs(i1 - i2) + abs(j1 - j2) == K){
                ll i = i1 * W + j1 , j = i2 * W + j2 ;
                vll v ;
                v.pb(i) ;
                //cout << i1 << " " << j1 << " " << i2 << " " << j2 << " " << i << " " << j << endl ;
                v.pb(j) ;
                add_and(v) ;
                p++;
            }
        }
    }
    vll ret ;
    for(ll i = H * W ; i < H * W + p ; i++){
        ret.pb(i) ;
    }
    add_or(ret) ;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 13260 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #2
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 13260 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 13260 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 13260 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 13280 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #6
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 13340 KB Output is correct
2 Correct 9 ms 13260 KB Output is correct
3 Correct 9 ms 13260 KB Output is correct
4 Correct 10 ms 13260 KB Output is correct
5 Correct 9 ms 13300 KB Output is correct
6 Correct 10 ms 13260 KB Output is correct
7 Correct 10 ms 13260 KB Output is correct
8 Correct 10 ms 13260 KB Output is correct
9 Correct 10 ms 13260 KB Output is correct
10 Correct 11 ms 13260 KB Output is correct
11 Correct 10 ms 13248 KB Output is correct
12 Correct 11 ms 13260 KB Output is correct
13 Correct 11 ms 13300 KB Output is correct
14 Correct 11 ms 13260 KB Output is correct
15 Correct 11 ms 13312 KB Output is correct
16 Correct 11 ms 13260 KB Output is correct
17 Correct 9 ms 13260 KB Output is correct
18 Correct 11 ms 13260 KB Output is correct
19 Correct 10 ms 13232 KB Output is correct
20 Correct 10 ms 13260 KB Output is correct
21 Correct 9 ms 13260 KB Output is correct
22 Correct 10 ms 13260 KB Output is correct
23 Correct 11 ms 13260 KB Output is correct
24 Correct 9 ms 13260 KB Output is correct
25 Correct 10 ms 13260 KB Output is correct
26 Correct 10 ms 13288 KB Output is correct
27 Correct 10 ms 13276 KB Output is correct
28 Correct 9 ms 13260 KB Output is correct
29 Correct 9 ms 13260 KB Output is correct
30 Correct 9 ms 13260 KB Output is correct
31 Correct 9 ms 13260 KB Output is correct
32 Correct 8 ms 13260 KB Output is correct
33 Correct 9 ms 13260 KB Output is correct

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 13344 KB on inputs (80, 199), (81, 199), expected 1, but computed 0
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 13260 KB on inputs (0, 1), (0, 2), expected 1, but computed 0
2 Halted 0 ms 0 KB -