oj.uz

Submission #555545

# Submission time Handle Problem Language Result Execution time Memory
555545 2022-05-01T07:33:52 Z fuad27 Nekameleoni (COCI15_nekameleoni) C++17
28 / 140
 3000 ms 6108 KB 
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 5010;
const int MAXK = 50;
long long k;
vector<long long> pref[50];
bool check(int l, int r) {
	bool c = true;
	for(int i = 0;i<k;i++) {
		if(!(pref[i][r+1] - pref[i][l]))c = false;
	}	
	return c;
}
int main () {
	long long n, m;
	cin >> n >> k >> m;
	for(int i = 0;i<50;i++) {
		pref[i].resize(MAXN);
	}
	long long arr[n];
	for(int i = 0;i<n;i++){
		cin >> arr[i];
		arr[i]--;
	}
	for(int i = 0;i<50;i++) {
		pref[i][0] = 0;
		for(int j = 1;j<=n;j++) {
			if(arr[j-1] == i) {
				pref[i][j] = pref[i][j-1]+1;
			}
			else pref[i][j] = pref[i][j-1];
		}
	}
	while(m--) {
		int type;
		cin >> type;
		if(type == 1) {
			int p, v;
			cin >> p >> v;
			v--;p--;
			arr[p] = v;
			for(int i = 0;i<50;i++) {
				pref[i][0] = 0;
				for(int j = 1;j<=n;j++) {
					if(arr[j-1] == i) {
						pref[i][j] = pref[i][j-1]+1;
					}
					else pref[i][j] = pref[i][j-1];
				}
			}
		}
		else {
	 			int p1 = 0, p2 = 0;
    			long long ans = 1e9;
    			while(p2 < n) {
    				if(check(p1, p2)) {
    					ans = min(ans, (long long)p2-p1+1);
    					p1++;
    				}
    				else {
    					p2++;
    				}
    			}
    			if(ans == 1e9)ans = -1;
    			cout << ans << "\n";
		}
	}
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 922 ms 2260 KB Output is correct
2 Correct 1125 ms 2260 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1698 ms 2260 KB Output is correct
2 Correct 1946 ms 2260 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2822 ms 2280 KB Output is correct
2 Execution timed out 3038 ms 2236 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 17 ms 4948 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 22 ms 5492 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 19 ms 5264 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 31 ms 5560 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #8
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 22 ms 5500 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #9
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 35 ms 6084 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 31 ms 6108 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -