# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
147632 | 2019-08-30T10:34:26 Z | xDWaffle | Ljetopica (COI19_ljetopica) | C++11 | 2 ms | 376 KB |
#include <bits/stdc++.h> #define ff(j, a, b) for(int j=a;j<b;j++) #define pb push_back; using namespace std; typedef long long ll; ll n, k; ll a, b, path; ll check_pathing(ll x) { return (x<=b && x>=a) ? x : 0; } void load_path() { path=pow(2, n-1); ff(j, 0, n-1) { char tmp; cin >> tmp; if(tmp=='R') { path+=pow(2, n-2-j); } } } ll bin_string_to_ll(string s) { ll res=1; ff(j, 1, s.size()) { res=res*2; if(s[j]=='1') { res++; } } return res; } ll ena_je_budala_neopjevana(ll switches, ll pos, ll curr) { if(switches==0) { return check_pathing(curr); } } int main() { cin >> n >> k; load_path(); string tmpstrng; cin >> tmpstrng; a=bin_string_to_ll(tmpstrng); cin >> tmpstrng; b=bin_string_to_ll(tmpstrng); ///zavrseno ucitavanje!! /// XOR <=> ^ ll altpath= ((1 << (n-1))-1) ^ path; cout << check_pathing(path) + check_pathing(altpath) << endl; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 376 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |