oj.uz

Submission #322066

# Submission time Handle Problem Language Result Execution time Memory
322066 2020-11-14T01:56:32 Z zaneyu Vision Program (IOI19_vision) C++14
33 / 100
 28 ms 25452 KB 
/*input
200 200 199
0 0 199 198
-1
*/
#include "vision.h"
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("unroll-loops,no-stack-protector")
//order_of_key #of elements less than x
// find_by_order kth element
typedef long long int ll;
#define ld double
#define pii pair<int,int>
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
const ll maxn=1e6+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=(1e9+7);
const ll MOD2=1000002173;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())
ll mult(ll a,ll b){
    return ((a%MOD)*(b%MOD))%MOD;
}
ll mypow(ll a,ll b,ll MOD){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=(res*a)%MOD;
        a=(a*a)%MOD;
        b>>=1;
    }
    return res;
}
int h,w;
bool isin(int a,int b){
	if(a<0 or a>=h or b<0 or b>=w) return false;
	return true;
}
int dx[4]={1,-1,-1,1};
int dy[4]={1,1,-1,-1};
int to(int x,int y){
	return x*w+y;
}
vector<int> at[maxn];
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void construct_network(int H,int W, int k) {
	h=H,w=W;
	set<pii> v;
	map<pii,bool> vis;
	bool ok=0;
	int cnt=0;
	while(!ok and cnt<(h*w)){
		int i=rng()%h,j=rng()%w;
		while(vis[{i,j}]) i=rng()%h,j=rng()%w;
		vis[{i,j}]=1;
		REP(z,k+1){
			REP(d,4){
				int a=i+z*dx[d],b=j+(k-z)*dy[d];
				if(isin(a,b)){
					//cout<<i<<' '<<j<<' '<<a<<' '<<b<<'\n';
					if(to(a,b)>to(i,j)){
						v.insert({to(i,j),to(a,b)});
						if(sz(v)==10000){
							z=k+1;
							ok=1;
							break;
						}
					}
					else{
						v.insert({to(a,b),to(i,j)});
						if(sz(v)==10000){
							z=k+1;
							ok=1;
							break;
						}
					}
				}
			}
		}
		++cnt;
	}
	vector<int> qs;
	for(auto x:v){
		at[x.f].pb(x.s);
	}
	REP(i,h){
		REP(j,w){
			vector<int> ns=at[to(i,j)];
			if(!sz(ns)) continue;
			qs.pb(add_and({add_or(ns),to(i,j)}));
		}
	}
	add_or(qs);
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23788 KB Output is correct
2 Correct 15 ms 23788 KB Output is correct
3 Correct 15 ms 23788 KB Output is correct
4 Correct 15 ms 23788 KB Output is correct
5 Correct 15 ms 23788 KB Output is correct
6 Correct 15 ms 23788 KB Output is correct
7 Correct 15 ms 23788 KB Output is correct
8 Correct 15 ms 23788 KB Output is correct
9 Correct 15 ms 23772 KB Output is correct
10 Correct 15 ms 23788 KB Output is correct
11 Correct 15 ms 23788 KB Output is correct
12 Correct 15 ms 23788 KB Output is correct
13 Correct 15 ms 23788 KB Output is correct
14 Correct 15 ms 23788 KB Output is correct
15 Correct 15 ms 23788 KB Output is correct
16 Correct 16 ms 23788 KB Output is correct
17 Correct 16 ms 23788 KB Output is correct
18 Correct 15 ms 23788 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23788 KB Output is correct
2 Correct 15 ms 23788 KB Output is correct
3 Correct 15 ms 23788 KB Output is correct
4 Correct 15 ms 23788 KB Output is correct
5 Correct 15 ms 23788 KB Output is correct
6 Correct 15 ms 23788 KB Output is correct
7 Correct 15 ms 23788 KB Output is correct
8 Correct 15 ms 23788 KB Output is correct
9 Correct 15 ms 23772 KB Output is correct
10 Correct 15 ms 23788 KB Output is correct
11 Correct 15 ms 23788 KB Output is correct
12 Correct 15 ms 23788 KB Output is correct
13 Correct 15 ms 23788 KB Output is correct
14 Correct 15 ms 23788 KB Output is correct
15 Correct 15 ms 23788 KB Output is correct
16 Correct 16 ms 23788 KB Output is correct
17 Correct 16 ms 23788 KB Output is correct
18 Correct 15 ms 23788 KB Output is correct
19 Correct 15 ms 23788 KB Output is correct
20 Correct 15 ms 23788 KB Output is correct
21 Correct 15 ms 23788 KB Output is correct
22 Correct 15 ms 23788 KB Output is correct
23 Correct 22 ms 23788 KB Output is correct
24 Correct 17 ms 23788 KB Output is correct
25 Correct 16 ms 23788 KB Output is correct
26 Correct 15 ms 23788 KB Output is correct
27 Correct 16 ms 23916 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23788 KB Output is correct
2 Correct 15 ms 23788 KB Output is correct
3 Correct 15 ms 23788 KB Output is correct
4 Correct 15 ms 23788 KB Output is correct
5 Correct 15 ms 23788 KB Output is correct
6 Correct 15 ms 23788 KB Output is correct
7 Correct 15 ms 23788 KB Output is correct
8 Correct 15 ms 23788 KB Output is correct
9 Correct 15 ms 23772 KB Output is correct
10 Correct 15 ms 23788 KB Output is correct
11 Correct 15 ms 23788 KB Output is correct
12 Correct 15 ms 23788 KB Output is correct
13 Correct 15 ms 23788 KB Output is correct
14 Correct 15 ms 23788 KB Output is correct
15 Correct 15 ms 23788 KB Output is correct
16 Correct 16 ms 23788 KB Output is correct
17 Correct 16 ms 23788 KB Output is correct
18 Correct 15 ms 23788 KB Output is correct
19 Correct 15 ms 23788 KB Output is correct
20 Correct 15 ms 23788 KB Output is correct
21 Correct 15 ms 23788 KB Output is correct
22 Correct 15 ms 23788 KB Output is correct
23 Correct 22 ms 23788 KB Output is correct
24 Correct 17 ms 23788 KB Output is correct
25 Correct 16 ms 23788 KB Output is correct
26 Correct 15 ms 23788 KB Output is correct
27 Correct 16 ms 23916 KB Output is correct
28 Incorrect 21 ms 24556 KB on inputs (21, 18), (26, 28), expected 1, but computed 0
29 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23788 KB Output is correct
2 Correct 15 ms 23788 KB Output is correct
3 Correct 15 ms 23788 KB Output is correct
4 Correct 15 ms 23788 KB Output is correct
5 Correct 15 ms 23788 KB Output is correct
6 Correct 15 ms 23788 KB Output is correct
7 Correct 15 ms 23788 KB Output is correct
8 Correct 15 ms 23788 KB Output is correct
9 Correct 15 ms 23772 KB Output is correct
10 Correct 15 ms 23788 KB Output is correct
11 Correct 15 ms 23788 KB Output is correct
12 Correct 15 ms 23788 KB Output is correct
13 Correct 15 ms 23788 KB Output is correct
14 Correct 15 ms 23788 KB Output is correct
15 Correct 15 ms 23788 KB Output is correct
16 Correct 16 ms 23788 KB Output is correct
17 Correct 16 ms 23788 KB Output is correct
18 Correct 15 ms 23788 KB Output is correct
19 Correct 15 ms 23788 KB Output is correct
20 Correct 15 ms 23788 KB Output is correct
21 Correct 15 ms 23788 KB Output is correct
22 Correct 15 ms 23788 KB Output is correct
23 Correct 22 ms 23788 KB Output is correct
24 Correct 17 ms 23788 KB Output is correct
25 Correct 16 ms 23788 KB Output is correct
26 Correct 15 ms 23788 KB Output is correct
27 Correct 16 ms 23916 KB Output is correct
28 Incorrect 21 ms 24556 KB on inputs (21, 18), (26, 28), expected 1, but computed 0
29 Halted 0 ms 0 KB -

Subtask #5
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23916 KB Output is correct
2 Correct 16 ms 23788 KB Output is correct
3 Correct 16 ms 23788 KB Output is correct
4 Correct 15 ms 23788 KB Output is correct
5 Correct 15 ms 23916 KB Output is correct
6 Correct 15 ms 23788 KB Output is correct
7 Correct 15 ms 23788 KB Output is correct
8 Correct 15 ms 23788 KB Output is correct
9 Correct 16 ms 23916 KB Output is correct
10 Correct 16 ms 23788 KB Output is correct
11 Correct 16 ms 23788 KB Output is correct
12 Correct 17 ms 23788 KB Output is correct
13 Correct 15 ms 23788 KB Output is correct
14 Correct 15 ms 23788 KB Output is correct
15 Correct 16 ms 23916 KB Output is correct
16 Correct 16 ms 23788 KB Output is correct
17 Correct 16 ms 23788 KB Output is correct
18 Correct 15 ms 23788 KB Output is correct
19 Correct 15 ms 23788 KB Output is correct
20 Correct 16 ms 23788 KB Output is correct
21 Correct 15 ms 23916 KB Output is correct
22 Correct 16 ms 23788 KB Output is correct

Subtask #6
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23788 KB Output is correct
2 Correct 15 ms 23788 KB Output is correct
3 Correct 28 ms 24808 KB Output is correct
4 Incorrect 23 ms 24812 KB on inputs (0, 0), (3, 28), expected 1, but computed 0
5 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 23 ms 25452 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 15 ms 23788 KB Output is correct
2 Correct 15 ms 23788 KB Output is correct
3 Correct 15 ms 23788 KB Output is correct
4 Correct 15 ms 23788 KB Output is correct
5 Correct 15 ms 23788 KB Output is correct
6 Correct 15 ms 23788 KB Output is correct
7 Correct 15 ms 23788 KB Output is correct
8 Correct 15 ms 23788 KB Output is correct
9 Correct 15 ms 23772 KB Output is correct
10 Correct 15 ms 23788 KB Output is correct
11 Correct 15 ms 23788 KB Output is correct
12 Correct 15 ms 23788 KB Output is correct
13 Correct 15 ms 23788 KB Output is correct
14 Correct 15 ms 23788 KB Output is correct
15 Correct 15 ms 23788 KB Output is correct
16 Correct 16 ms 23788 KB Output is correct
17 Correct 16 ms 23788 KB Output is correct
18 Correct 15 ms 23788 KB Output is correct
19 Correct 15 ms 23788 KB Output is correct
20 Correct 15 ms 23788 KB Output is correct
21 Correct 15 ms 23788 KB Output is correct
22 Correct 15 ms 23788 KB Output is correct
23 Correct 22 ms 23788 KB Output is correct
24 Correct 17 ms 23788 KB Output is correct
25 Correct 16 ms 23788 KB Output is correct
26 Correct 15 ms 23788 KB Output is correct
27 Correct 16 ms 23916 KB Output is correct
28 Incorrect 21 ms 24556 KB on inputs (21, 18), (26, 28), expected 1, but computed 0
29 Halted 0 ms 0 KB -