oj.uz

답안 #374543

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
374543 2021-03-07T12:06:16 Z AmineWeslati Vision Program (IOI19_vision) C++14
14 / 100
 28 ms 2796 KB 
//Never stop trying
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;
typedef string str;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 2e5 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
ll random(ll a, ll b){
    return a + rng() % (b - a + 1);
}
#ifndef LOCAL  
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl; 
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;

void IO() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin); 
    freopen("output.txt", "w", stdout);
#endif
}

#ifndef LOCAL
#include "vision.h"
#endif

/////////////////////////ONLY CLEAN CODES ALLOWED/////////////////////////

int H,W;

int dist(int x, int y, int xx, int yy){
	return abs(x-xx)+abs(y-yy);
}
int f(int x, int y){
	return x*W+y;
}

#ifdef LOCAL
int add_or(vi v){return 1;}
int add_xor(vi v){return 1;}
int add_and(vi v){return 1;}
int add_not(int x){return 1;}
#endif

void construct_network(int H, int W, int K){
	::H=H; ::W=W;

	//1&2&5
	/*vi vec;
	FOR(i,0,H) FOR(j,0,W) FOR(k,0,H) FOR(l,0,W) if(dist(i,j,k,l)==K){
		vec.pb(add_and(vi{f(i,j),f(k,l)}));
	}
	int ans=add_or(vec);*/

	//6
	/*vi vec;
	FOR(i,0,H) FOR(j,0,W) if(i+j==K){
		vec.pb(add_and(vi{f(0,0),f(i,j)}));
	}
	int ans=add_or(vec);*/

	//3
	/*vi vec;
	FOR(i,0,H) FOR(j,0,W){
		vi cur;
		FOR(k,i,H) FOR(l,0,W) if(dist(i,j,k,l)==K){
			cur.pb(f(k,l));
		}
		if(!sz(cur)) continue;
		int nw=add_or(cur);
		vec.pb(add_and(vi{f(i,j),nw}));
	}
	int ans=add_or(vec);*/

	//7 
	vi r(H),c(W),rr(H-1),cc(W-1);
	FOR(i,0,H){
		vi cur;
		FOR(j,0,W) cur.pb(f(i,j));
		r[i]=add_xor(cur);
	}
	FOR(j,0,W){
		vi cur;
		FOR(i,0,H) cur.pb(f(i,j));
		c[j]=add_xor(cur);
	}

	FOR(i,0,H-1){
		vi vec,cur;
		FOR(j,0,W) cur.pb(f(i,j));
		vec.pb(add_or(cur));

		cur.clear();
		FOR(j,0,W) cur.pb(f(i+1,j));
		vec.pb(add_or(cur));

		rr[i]=add_and(vec);
	}
	FOR(j,0,W-1){
		vi vec,cur;
		FOR(i,0,H) cur.pb(f(i,j));
		vec.pb(add_or(cur));

		cur.clear();
		FOR(i,0,H) cur.pb(f(i,j+1));
		vec.pb(add_or(cur));

		cc[j]=add_and(vec);
	}

	vi R(2,0),C(2,0);

	vi cur;
	FOR(i,0,H) cur.pb(r[i]);
	R[0]=add_not(add_or(cur));

	cur.clear();
	FOR(i,0,W) cur.pb(c[i]);
	C[0]=add_not(add_or(cur));

	cur.clear();
	FOR(i,0,H-1) cur.pb(rr[i]);
	if(sz(cur)) R[1]=add_or(cur);

	cur.clear();
	FOR(i,0,W-1) cur.pb(cc[i]);
	if(sz(cur)) C[1]=add_or(cur);

	if(H==1){
		int ans=add_and(vi{R[0],C[1]});
	}
	else if(W==1){
		int ans=add_and(vi{R[1],C[0]});
	}
	else{
		vi vec={add_and(vi{R[0],C[1]}),add_and(vi{R[1],C[0]})};
		int ans=add_or(vi{vec[0],vec[1]});
	}
}


/*int main() {
    boost; IO();
    

    return 0;
}*/
//Change your approach

Compilation message

vision.cpp: In function 'void construct_network(int, int, int)':
vision.cpp:161:7: warning: unused variable 'ans' [-Wunused-variable]
  161 |   int ans=add_and(vi{R[0],C[1]});
      |       ^~~
vision.cpp:164:7: warning: unused variable 'ans' [-Wunused-variable]
  164 |   int ans=add_and(vi{R[1],C[0]});
      |       ^~~
vision.cpp:168:7: warning: unused variable 'ans' [-Wunused-variable]
  168 |   int ans=add_or(vi{vec[0],vec[1]});
      |       ^~~

Subtask #1
0 / 10.0

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

Subtask #2
0 / 11.0

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

Subtask #3
0 / 11.0

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

Subtask #4
0 / 15.0

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

Subtask #5
0 / 12.0

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

Subtask #6
0 / 8.0

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

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 2796 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 3 ms 492 KB Output is correct
4 Correct 5 ms 748 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 14 ms 1516 KB Output is correct
8 Correct 14 ms 1516 KB Output is correct
9 Correct 28 ms 2796 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct

Subtask #8
0 / 19.0

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