# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
858087 | 2023-10-07T11:55:29 Z | iulia_morariu | Brperm (RMI20_brperm) | C++14 | 3000 ms | 2044 KB |
#include <bits/stdc++.h> #include <brperm.h> using namespace std; string v; void init ( int n, const char s[] ){ for(int i = 0; i < n; i++) v.push_back( s[i] ); } int transform(int nr, int k){ vector <int> b; while(nr > 0){ b.push_back(nr % 2); nr /= 2; } while(b.size() < k) b.push_back(0); int n1 = 0; int p = 1; for(int j = b.size() - 1; j >= 0; j--){ n1 += p * b[j]; p *= 2; } return n1; } int query ( int it , int k ){ int p = 1; for(int i = 0; i < k; i++) p *= 2; for(int i = it; i < it + p; i++){ int x = transform( i - it, k ); //cout << "i = " << i << " x = " << x << endl; if( v[x] != v[i] ) return 0; } return 1; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 604 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 604 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3061 ms | 2044 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 604 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |