oj.uz

Submission #573107

# Submission time Handle Problem Language Result Execution time Memory
573107 2022-06-05T19:32:18 Z StrawHatWess Uplifting Excursion (BOI22_vault) C++17
0 / 100
 5000 ms 5276 KB 
#include <bits/stdc++.h>
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
 
typedef vector<int>vi; 
#define pb push_back
#define all(x) begin(x), end(x)
#define sz(x) (int)x.size()

typedef pair<int,int>pi;
typedef vector<pi>vpi; 
#define fi first
#define se second
 
#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--)
 
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; }
 
const int INF=2e9;
 
 
 
void IO() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin); 
    freopen("output.txt", "w", stdout);
#endif
}
/////////////////////////ONLY CLEAN CODES ALLOWED/////////////////////////


const int MX=2e5+10; 
vi mp(MX*3,-1); 

int main(){
	IO(); boost; 


	int M,L; cin>>M>>L; 
	 
	FOR(i,-M,M+1){
		int n; cin>>n; 
		while(n--){
			vpi vec; 
			FOR(x,0,MX*2) if(mp[x]!=-1){
				vec.pb({x+i, mp[x]+1}); 
			}

			for(auto it: vec){
				int k=it.fi, x=it.se; 
				ckmax(mp[k],x); 
			}

			ckmax(mp[i+MX],1); 
		}
	}


	if(!(L+MX>=0 && L+MX<sz(mp)) || mp[L+MX]==-1) cout << "impossible" << endl; 
	else cout << mp[L+MX] << endl;

	


}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2644 KB Output is correct
2 Correct 3 ms 2644 KB Output is correct
3 Correct 3 ms 2644 KB Output is correct
4 Correct 18 ms 2676 KB Output is correct
5 Runtime error 1224 ms 5276 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2644 KB Output is correct
2 Correct 3 ms 2644 KB Output is correct
3 Correct 3 ms 2644 KB Output is correct
4 Correct 18 ms 2676 KB Output is correct
5 Runtime error 1224 ms 5276 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #3-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 2644 KB Output is correct
2 Execution timed out 5045 ms 3124 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 2644 KB Output is correct
2 Execution timed out 5045 ms 3124 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 2644 KB Output is correct
2 Execution timed out 5045 ms 3124 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2644 KB Output is correct
2 Correct 3 ms 2644 KB Output is correct
3 Correct 3 ms 2644 KB Output is correct
4 Correct 18 ms 2676 KB Output is correct
5 Runtime error 1224 ms 5276 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #5-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 2644 KB Output is correct
2 Execution timed out 5045 ms 3124 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2644 KB Output is correct
2 Correct 3 ms 2644 KB Output is correct
3 Correct 3 ms 2644 KB Output is correct
4 Correct 18 ms 2676 KB Output is correct
5 Runtime error 1224 ms 5276 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -

Subtask #6-1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 2644 KB Output is correct
2 Execution timed out 5045 ms 3124 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6-2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 2644 KB Output is correct
2 Correct 3 ms 2644 KB Output is correct
3 Correct 3 ms 2644 KB Output is correct
4 Correct 18 ms 2676 KB Output is correct
5 Runtime error 1224 ms 5276 KB Execution killed with signal 11
6 Halted 0 ms 0 KB -