# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
202340 | 2020-02-15T14:34:18 Z | vanic | Nekameleoni (COCI15_nekameleoni) | C++14 | 6 ms | 376 KB |
#include <cstdio> #include <algorithm> #include <string.h> using namespace std; const int maxn=100; int l[maxn]; int br[maxn]; int main(){ int n, m, k; scanf("%d%d%d", &n, &k, &m); int x; for(int i=0; i<n; i++){ scanf("%d", &x); x--; l[i]=x; } int y, z; int sol; bool h; for(int i=0; i<m; i++){ scanf("%d", &x); if(x==1){ scanf("%d%d", &y, &z); y--; z--; l[y]=z; } else{ sol=1e9; for(int j=0; j<n; j++){ for(int o=j; o<n; o++){ for(int p=j; p<=o; p++){ br[l[p]]++; } h=1; for(int p=0; p<k; p++){ if(!br[p]){ h=0; break; } } if(h){ sol=min(sol, o-j+1); } memset(br, 0, sizeof(br)); } } if(sol!=1e9){ printf("%d\n", sol); } else{ printf("-1\n"); } } } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 6 ms | 256 KB | Time limit exceeded (wall clock) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 5 ms | 256 KB | Time limit exceeded (wall clock) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 5 ms | 256 KB | Time limit exceeded (wall clock) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 5 ms | 256 KB | Time limit exceeded (wall clock) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 5 ms | 256 KB | Time limit exceeded (wall clock) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 5 ms | 256 KB | Time limit exceeded (wall clock) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 5 ms | 256 KB | Time limit exceeded (wall clock) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 5 ms | 376 KB | Time limit exceeded (wall clock) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 5 ms | 256 KB | Time limit exceeded (wall clock) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 5 ms | 256 KB | Time limit exceeded (wall clock) |
2 | Halted | 0 ms | 0 KB | - |