oj.uz

답안 #277706

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
277706 2020-08-21T06:55:04 Z khangal Vision Program (IOI19_vision) C++14
33 / 100
 1000 ms 30076 KB 
#include<bits/stdc++.h>
#include "vision.h"
 
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<ll,ll> pl;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define po pop_back
#define pb push_back
#define mk make_pair
#define mt make_tuple
#define lw lower_bound
#define up upper_bound
#define ff first
#define ss second
#define BOOST ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0);
#define MOD 1000000007
#define MAX 1e18
#define MIN -1e18
#define rep(i,a,b) for(ll i=a;i<=b;i++)
#define per(i,a,b) for(ll i=b;i>=a;i--)
#define con continue
#define freopen freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define PI 3.14159265358979323846264338327950288419716939937510582097494459230781640628
#define read(x) scanf("%lld",&x);
#define print(x) printf("%lld ",x);
#define endl '\n';
// typedef tree<ll , null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
// template< typename T>
// using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
ll n,m,ans,mid,mn,mx,cnt,T,sum,h1,h2,e[1234567],b[1234567],c[1234567],d[1<<20],k,i,j,l,r,h,a[1234567],w,x,y,z;
bool used[1234567];
vector<int> v[1234567],vec,vv1,vv2;
string s1,s;
int sz[1234567],par[1234567];
int tr[5234567];
ll dx[4]={-1,1,0,0},dy[4]={0,0,-1,1},c1[123][123];
void construct_network(int H, int W, int K) {
    for(int i=0;i<H*W;i++){
        for(int j=i+1;j<H*W;j++){
            if(abs(i/W-j/W) + abs(i%W-j%W)==K){
                cnt++;
                vector<int> vec;
                vec.pb(i);
                vec.pb(j);
                add_and(vec);
            }
        }
    }
    vector<int> vec;
    for(int i=H*W;i<H*W+cnt;i++)vec.pb(i);
    add_or(vec);
    // std::vector<int> Ns;
    // Ns = {0, 1};
    // int a = add_and(Ns);
    // Ns = {0, a};
    // int b = add_or(Ns);
    // Ns = {0, 1, b};
    // int c = add_xor(Ns);
    // add_not(c);
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 29312 KB Output is correct
2 Correct 22 ms 29312 KB Output is correct
3 Correct 20 ms 29312 KB Output is correct
4 Correct 20 ms 29312 KB Output is correct
5 Correct 23 ms 29308 KB Output is correct
6 Correct 20 ms 29304 KB Output is correct
7 Correct 20 ms 29312 KB Output is correct
8 Correct 22 ms 29312 KB Output is correct
9 Correct 22 ms 29440 KB Output is correct
10 Correct 20 ms 29312 KB Output is correct
11 Correct 20 ms 29312 KB Output is correct
12 Correct 21 ms 29312 KB Output is correct
13 Correct 20 ms 29440 KB Output is correct
14 Correct 22 ms 29312 KB Output is correct
15 Correct 24 ms 29312 KB Output is correct
16 Correct 24 ms 29312 KB Output is correct
17 Correct 21 ms 29312 KB Output is correct
18 Correct 20 ms 29304 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 29312 KB Output is correct
2 Correct 22 ms 29312 KB Output is correct
3 Correct 20 ms 29312 KB Output is correct
4 Correct 20 ms 29312 KB Output is correct
5 Correct 23 ms 29308 KB Output is correct
6 Correct 20 ms 29304 KB Output is correct
7 Correct 20 ms 29312 KB Output is correct
8 Correct 22 ms 29312 KB Output is correct
9 Correct 22 ms 29440 KB Output is correct
10 Correct 20 ms 29312 KB Output is correct
11 Correct 20 ms 29312 KB Output is correct
12 Correct 21 ms 29312 KB Output is correct
13 Correct 20 ms 29440 KB Output is correct
14 Correct 22 ms 29312 KB Output is correct
15 Correct 24 ms 29312 KB Output is correct
16 Correct 24 ms 29312 KB Output is correct
17 Correct 21 ms 29312 KB Output is correct
18 Correct 20 ms 29304 KB Output is correct
19 Correct 20 ms 29312 KB Output is correct
20 Correct 20 ms 29312 KB Output is correct
21 Correct 20 ms 29440 KB Output is correct
22 Correct 20 ms 29312 KB Output is correct
23 Correct 20 ms 29312 KB Output is correct
24 Correct 21 ms 29312 KB Output is correct
25 Correct 20 ms 29312 KB Output is correct
26 Correct 22 ms 29312 KB Output is correct
27 Correct 20 ms 29304 KB Output is correct

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 29312 KB Output is correct
2 Correct 22 ms 29312 KB Output is correct
3 Correct 20 ms 29312 KB Output is correct
4 Correct 20 ms 29312 KB Output is correct
5 Correct 23 ms 29308 KB Output is correct
6 Correct 20 ms 29304 KB Output is correct
7 Correct 20 ms 29312 KB Output is correct
8 Correct 22 ms 29312 KB Output is correct
9 Correct 22 ms 29440 KB Output is correct
10 Correct 20 ms 29312 KB Output is correct
11 Correct 20 ms 29312 KB Output is correct
12 Correct 21 ms 29312 KB Output is correct
13 Correct 20 ms 29440 KB Output is correct
14 Correct 22 ms 29312 KB Output is correct
15 Correct 24 ms 29312 KB Output is correct
16 Correct 24 ms 29312 KB Output is correct
17 Correct 21 ms 29312 KB Output is correct
18 Correct 20 ms 29304 KB Output is correct
19 Correct 20 ms 29312 KB Output is correct
20 Correct 20 ms 29312 KB Output is correct
21 Correct 20 ms 29440 KB Output is correct
22 Correct 20 ms 29312 KB Output is correct
23 Correct 20 ms 29312 KB Output is correct
24 Correct 21 ms 29312 KB Output is correct
25 Correct 20 ms 29312 KB Output is correct
26 Correct 22 ms 29312 KB Output is correct
27 Correct 20 ms 29304 KB Output is correct
28 Incorrect 26 ms 30076 KB WA in grader: Too many instructions
29 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 29312 KB Output is correct
2 Correct 22 ms 29312 KB Output is correct
3 Correct 20 ms 29312 KB Output is correct
4 Correct 20 ms 29312 KB Output is correct
5 Correct 23 ms 29308 KB Output is correct
6 Correct 20 ms 29304 KB Output is correct
7 Correct 20 ms 29312 KB Output is correct
8 Correct 22 ms 29312 KB Output is correct
9 Correct 22 ms 29440 KB Output is correct
10 Correct 20 ms 29312 KB Output is correct
11 Correct 20 ms 29312 KB Output is correct
12 Correct 21 ms 29312 KB Output is correct
13 Correct 20 ms 29440 KB Output is correct
14 Correct 22 ms 29312 KB Output is correct
15 Correct 24 ms 29312 KB Output is correct
16 Correct 24 ms 29312 KB Output is correct
17 Correct 21 ms 29312 KB Output is correct
18 Correct 20 ms 29304 KB Output is correct
19 Correct 20 ms 29312 KB Output is correct
20 Correct 20 ms 29312 KB Output is correct
21 Correct 20 ms 29440 KB Output is correct
22 Correct 20 ms 29312 KB Output is correct
23 Correct 20 ms 29312 KB Output is correct
24 Correct 21 ms 29312 KB Output is correct
25 Correct 20 ms 29312 KB Output is correct
26 Correct 22 ms 29312 KB Output is correct
27 Correct 20 ms 29304 KB Output is correct
28 Incorrect 26 ms 30076 KB WA in grader: Too many instructions
29 Halted 0 ms 0 KB -

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 29312 KB Output is correct
2 Correct 22 ms 29312 KB Output is correct
3 Correct 20 ms 29312 KB Output is correct
4 Correct 21 ms 29312 KB Output is correct
5 Correct 21 ms 29312 KB Output is correct
6 Correct 20 ms 29312 KB Output is correct
7 Correct 21 ms 29312 KB Output is correct
8 Correct 20 ms 29312 KB Output is correct
9 Correct 20 ms 29312 KB Output is correct
10 Correct 20 ms 29312 KB Output is correct
11 Correct 20 ms 29312 KB Output is correct
12 Correct 21 ms 29312 KB Output is correct
13 Correct 21 ms 29312 KB Output is correct
14 Correct 20 ms 29312 KB Output is correct
15 Correct 20 ms 29312 KB Output is correct
16 Correct 21 ms 29312 KB Output is correct
17 Correct 21 ms 29312 KB Output is correct
18 Correct 20 ms 29312 KB Output is correct
19 Correct 20 ms 29312 KB Output is correct
20 Correct 21 ms 29312 KB Output is correct
21 Correct 20 ms 29312 KB Output is correct
22 Correct 20 ms 29344 KB Output is correct

Subtask #6
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 29312 KB Output is correct
2 Correct 20 ms 29312 KB Output is correct
3 Correct 78 ms 29940 KB Output is correct
4 Incorrect 35 ms 30076 KB WA in grader: Too many instructions
5 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1095 ms 29820 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #8
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 20 ms 29312 KB Output is correct
2 Correct 22 ms 29312 KB Output is correct
3 Correct 20 ms 29312 KB Output is correct
4 Correct 20 ms 29312 KB Output is correct
5 Correct 23 ms 29308 KB Output is correct
6 Correct 20 ms 29304 KB Output is correct
7 Correct 20 ms 29312 KB Output is correct
8 Correct 22 ms 29312 KB Output is correct
9 Correct 22 ms 29440 KB Output is correct
10 Correct 20 ms 29312 KB Output is correct
11 Correct 20 ms 29312 KB Output is correct
12 Correct 21 ms 29312 KB Output is correct
13 Correct 20 ms 29440 KB Output is correct
14 Correct 22 ms 29312 KB Output is correct
15 Correct 24 ms 29312 KB Output is correct
16 Correct 24 ms 29312 KB Output is correct
17 Correct 21 ms 29312 KB Output is correct
18 Correct 20 ms 29304 KB Output is correct
19 Correct 20 ms 29312 KB Output is correct
20 Correct 20 ms 29312 KB Output is correct
21 Correct 20 ms 29440 KB Output is correct
22 Correct 20 ms 29312 KB Output is correct
23 Correct 20 ms 29312 KB Output is correct
24 Correct 21 ms 29312 KB Output is correct
25 Correct 20 ms 29312 KB Output is correct
26 Correct 22 ms 29312 KB Output is correct
27 Correct 20 ms 29304 KB Output is correct
28 Incorrect 26 ms 30076 KB WA in grader: Too many instructions
29 Halted 0 ms 0 KB -