oj.uz

Submission #305591

# Submission time Handle Problem Language Result Execution time Memory
305591 2020-09-23T15:53:05 Z AmineWeslati Painting Walls (APIO20_paint) C++14
15 / 100
 1500 ms 11896 KB 
//Never stop trying
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef string str;
typedef long long ll;
typedef double db;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef vector<str> vs;
typedef vector<ld> vd;
#define pb push_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 F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)

const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 1e5 + 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))

#define dbg(x) cerr << " - " << #x << " : " << x << endl;
#define dbgs(x,y) cerr << " - " << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << " - " << #v << " : " << endl << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;

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

int N,M,K;
vi c(MX);
set <int> s[MX];

vi f(MX,0);

bool pos[MX]={false};


bool check(deque<int> v){
	assert(sz(v)==M);
	FOR(i,0,M){
		int j=0;
		bool y=true;
		while(1){
			if(s[(i+j)%M].count(v[j])==0) y=false;
			j++;
			if(j==M) break;
		}
		if(y) return true;
	}
	return false;
}

int minimumInstructions(int NN, int MM, int KK, vi CC, vi AA, V<vi>B){
	N=NN; M=MM; K=KK;
	FOR(i,0,N) c[i]=CC[i];

	FOR(i,0,M){
		FOR(j,0,AA[i]) s[i].insert(B[i][j]),f[B[i][j]]++;
	}


	if(0){ //Sub1
		return 0;
	}
	else{
		deque<int> cur;
		FOR(i,0,N){
			cur.pb(c[i]);
			if(i<M-1) continue;
			if(check(cur)) pos[i-M+1]=true;
			cur.pop_front();
		}
		if(!pos[0]) return -1;

		int ans=0;
		for(int i=0; i<N; ){
			if(pos[i]){
				i+=M;
				ans++;
				continue;
			}

			int j=i; bool y=false;
			while(j>i-M){
				if(pos[j]){y=true; break;}
				j--;
			}
			if(!y) return -1;
			ans++;
			i=j+M;
		}

		return ans;

	}
}

/*
8 3 5 
3 3 1 3 4 4 2 2
3 2 2 
0 1 2	
2 3
3 4

3
*/


/*
5 4 4 
1 0 1 2 2
2 1 1 1 
0 1
1 
2 
3

*/

/* Careful!!!
	.Array bounds
	.Infinite loops
	.Uninitialized variables / empty containers
	.Order of input

   Some insights:
	.Binary search
	.Graph representation
	.Write brute force code
	.Change your approach
*/

Compilation message

paint.cpp:3: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    3 | #pragma GCC optimization ("O3")
      | 
paint.cpp:4: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    4 | #pragma GCC optimization ("unroll-loops")
      | 
paint.cpp: In function 'void IO()':
paint.cpp:49:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   49 |  freopen("input.txt", "r", stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
paint.cpp:50:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   50 |  freopen("output.txt", "w", stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5760 KB Output is correct
2 Correct 4 ms 5760 KB Output is correct
3 Correct 5 ms 5760 KB Output is correct
4 Correct 4 ms 5760 KB Output is correct
5 Correct 5 ms 5760 KB Output is correct
6 Correct 4 ms 5760 KB Output is correct
7 Correct 5 ms 5760 KB Output is correct
8 Correct 5 ms 5760 KB Output is correct
9 Correct 5 ms 5760 KB Output is correct
10 Correct 5 ms 5760 KB Output is correct
11 Correct 5 ms 5760 KB Output is correct
12 Correct 5 ms 5760 KB Output is correct
13 Correct 104 ms 5916 KB Output is correct
14 Correct 107 ms 5888 KB Output is correct
15 Correct 112 ms 6008 KB Output is correct
16 Correct 110 ms 5888 KB Output is correct
17 Correct 112 ms 5888 KB Output is correct
18 Correct 114 ms 5888 KB Output is correct
19 Correct 336 ms 6008 KB Output is correct
20 Correct 333 ms 5948 KB Output is correct
21 Correct 350 ms 6008 KB Output is correct
22 Execution timed out 1588 ms 11896 KB Time limit exceeded
23 Halted 0 ms 0 KB -

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5760 KB Output is correct
2 Correct 4 ms 5760 KB Output is correct
3 Correct 4 ms 5760 KB Output is correct
4 Correct 4 ms 5760 KB Output is correct
5 Correct 5 ms 5760 KB Output is correct
6 Correct 4 ms 5760 KB Output is correct
7 Correct 5 ms 5760 KB Output is correct
8 Correct 4 ms 5760 KB Output is correct
9 Correct 5 ms 5760 KB Output is correct
10 Correct 5 ms 5760 KB Output is correct
11 Correct 5 ms 5760 KB Output is correct
12 Correct 5 ms 5760 KB Output is correct
13 Correct 5 ms 5760 KB Output is correct
14 Correct 5 ms 5760 KB Output is correct
15 Correct 104 ms 5916 KB Output is correct
16 Correct 107 ms 5888 KB Output is correct
17 Correct 112 ms 6008 KB Output is correct
18 Correct 110 ms 5888 KB Output is correct
19 Correct 112 ms 5888 KB Output is correct
20 Correct 114 ms 5888 KB Output is correct
21 Correct 336 ms 6008 KB Output is correct
22 Correct 333 ms 5948 KB Output is correct
23 Correct 350 ms 6008 KB Output is correct
24 Correct 5 ms 5760 KB Output is correct
25 Correct 5 ms 5760 KB Output is correct
26 Correct 5 ms 5760 KB Output is correct
27 Correct 5 ms 5760 KB Output is correct
28 Correct 5 ms 5760 KB Output is correct
29 Correct 7 ms 5760 KB Output is correct
30 Correct 8 ms 5760 KB Output is correct
31 Correct 5 ms 5760 KB Output is correct
32 Correct 14 ms 5760 KB Output is correct
33 Correct 50 ms 5888 KB Output is correct
34 Correct 62 ms 5912 KB Output is correct
35 Correct 25 ms 5888 KB Output is correct
36 Correct 49 ms 5888 KB Output is correct
37 Correct 40 ms 5888 KB Output is correct
38 Correct 5 ms 5888 KB Output is correct
39 Correct 5 ms 5888 KB Output is correct
40 Correct 122 ms 5888 KB Output is correct
41 Correct 36 ms 5888 KB Output is correct
42 Correct 77 ms 5888 KB Output is correct
43 Correct 19 ms 5888 KB Output is correct
44 Correct 5 ms 5760 KB Output is correct
45 Correct 5 ms 5760 KB Output is correct
46 Correct 14 ms 5760 KB Output is correct
47 Correct 18 ms 5760 KB Output is correct
48 Correct 21 ms 5760 KB Output is correct
49 Correct 25 ms 5888 KB Output is correct
50 Correct 120 ms 5888 KB Output is correct
51 Correct 98 ms 5888 KB Output is correct
52 Correct 97 ms 5888 KB Output is correct
53 Correct 117 ms 5888 KB Output is correct
54 Correct 103 ms 5888 KB Output is correct
55 Correct 101 ms 5888 KB Output is correct
56 Correct 345 ms 6076 KB Output is correct
57 Correct 92 ms 5888 KB Output is correct
58 Correct 335 ms 6008 KB Output is correct
59 Correct 108 ms 5888 KB Output is correct
60 Correct 338 ms 6008 KB Output is correct
61 Correct 118 ms 5888 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5760 KB Output is correct
2 Correct 4 ms 5760 KB Output is correct
3 Correct 4 ms 5760 KB Output is correct
4 Correct 4 ms 5760 KB Output is correct
5 Correct 5 ms 5760 KB Output is correct
6 Correct 4 ms 5760 KB Output is correct
7 Correct 5 ms 5760 KB Output is correct
8 Correct 4 ms 5760 KB Output is correct
9 Correct 5 ms 5760 KB Output is correct
10 Correct 5 ms 5760 KB Output is correct
11 Correct 5 ms 5760 KB Output is correct
12 Correct 5 ms 5760 KB Output is correct
13 Correct 5 ms 5760 KB Output is correct
14 Correct 5 ms 5760 KB Output is correct
15 Correct 104 ms 5916 KB Output is correct
16 Correct 107 ms 5888 KB Output is correct
17 Correct 112 ms 6008 KB Output is correct
18 Correct 110 ms 5888 KB Output is correct
19 Correct 112 ms 5888 KB Output is correct
20 Correct 114 ms 5888 KB Output is correct
21 Correct 336 ms 6008 KB Output is correct
22 Correct 333 ms 5948 KB Output is correct
23 Correct 350 ms 6008 KB Output is correct
24 Execution timed out 1588 ms 11896 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5760 KB Output is correct
2 Correct 4 ms 5760 KB Output is correct
3 Correct 4 ms 5760 KB Output is correct
4 Correct 4 ms 5760 KB Output is correct
5 Correct 5 ms 5760 KB Output is correct
6 Correct 4 ms 5760 KB Output is correct
7 Correct 5 ms 5760 KB Output is correct
8 Correct 4 ms 5760 KB Output is correct
9 Correct 5 ms 5760 KB Output is correct
10 Correct 5 ms 5760 KB Output is correct
11 Correct 5 ms 5760 KB Output is correct
12 Correct 5 ms 5760 KB Output is correct
13 Correct 5 ms 5760 KB Output is correct
14 Correct 5 ms 5760 KB Output is correct
15 Correct 104 ms 5916 KB Output is correct
16 Correct 107 ms 5888 KB Output is correct
17 Correct 112 ms 6008 KB Output is correct
18 Correct 110 ms 5888 KB Output is correct
19 Correct 112 ms 5888 KB Output is correct
20 Correct 114 ms 5888 KB Output is correct
21 Correct 336 ms 6008 KB Output is correct
22 Correct 333 ms 5948 KB Output is correct
23 Correct 350 ms 6008 KB Output is correct
24 Execution timed out 1588 ms 11896 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 5760 KB Output is correct
2 Correct 4 ms 5760 KB Output is correct
3 Correct 4 ms 5760 KB Output is correct
4 Correct 4 ms 5760 KB Output is correct
5 Correct 5 ms 5760 KB Output is correct
6 Correct 4 ms 5760 KB Output is correct
7 Correct 5 ms 5760 KB Output is correct
8 Correct 4 ms 5760 KB Output is correct
9 Correct 5 ms 5760 KB Output is correct
10 Correct 5 ms 5760 KB Output is correct
11 Correct 5 ms 5760 KB Output is correct
12 Correct 5 ms 5760 KB Output is correct
13 Correct 5 ms 5760 KB Output is correct
14 Correct 5 ms 5760 KB Output is correct
15 Correct 104 ms 5916 KB Output is correct
16 Correct 107 ms 5888 KB Output is correct
17 Correct 112 ms 6008 KB Output is correct
18 Correct 110 ms 5888 KB Output is correct
19 Correct 112 ms 5888 KB Output is correct
20 Correct 114 ms 5888 KB Output is correct
21 Correct 336 ms 6008 KB Output is correct
22 Correct 333 ms 5948 KB Output is correct
23 Correct 350 ms 6008 KB Output is correct
24 Execution timed out 1588 ms 11896 KB Time limit exceeded
25 Halted 0 ms 0 KB -