| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 949528 |
2024-03-19T10:19:51 Z |
pcc |
Lamps (JOI19_lamps) |
C++17 |
|
7 ms |
4612 KB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll,ll>
#define pii pair<int,int>
#define fs first
#define sc second
#define tlll tuple<ll,ll,ll>
int N;
string s;
ll ans = 1e9;
int dist[1<<20];
queue<int> q;
void S1(){
memset(dist,-1,sizeof(dist));
cin>>s;
int a = 0,b = 0;
for(int i = 0;i<N;i++){
if(s[i] == '1')a |= 1<<i;
}
cin>>s;
for(int i = 0;i<N;i++){
if(s[i] == '1')b |= 1<<i;
}
dist[a] = 0;
q.push(a);
while(!q.empty()){
auto now = q.front();
q.pop();
for(int l = 0;l<N;l++){
int ta = now,tb = now,tc = now;
for(int r = l;r<N;r++){
ta |= 1<<r;
if(tb&(1<<r))tb ^= (1<<r);
tc ^= 1<<r;
if(dist[ta] == -1){
dist[ta] = dist[now]+1;
q.push(ta);
}
if(dist[tb] == -1){
dist[tb] = dist[now]+1;
q.push(tb);
}
if(dist[tc] == -1){
dist[tc] = dist[now]+1;
q.push(tc);
}
}
}
}
cout<<dist[b];
}
void S3(){
string a,b;
cin>>a>>b;
char pre = '0';
int ans = 0;
for(auto &i:b){
if(i == '1'&&pre == '0')ans++;
pre = i;
}
cout<<ans;
}
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin>>N;
if(N<=8)S1();
else S3();
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 2 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 3 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 4 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 5 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 6 |
Correct |
1 ms |
4440 KB |
Output is correct |
| 7 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
1 ms |
600 KB |
Output is correct |
| 10 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 11 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 2 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 3 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 4 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 5 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 6 |
Correct |
1 ms |
4440 KB |
Output is correct |
| 7 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
1 ms |
600 KB |
Output is correct |
| 10 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 11 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 2 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 3 |
Correct |
2 ms |
4444 KB |
Output is correct |
| 4 |
Correct |
2 ms |
4440 KB |
Output is correct |
| 5 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 6 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 7 |
Correct |
5 ms |
4052 KB |
Output is correct |
| 8 |
Correct |
7 ms |
4340 KB |
Output is correct |
| 9 |
Correct |
5 ms |
4528 KB |
Output is correct |
| 10 |
Correct |
4 ms |
4528 KB |
Output is correct |
| 11 |
Correct |
7 ms |
4612 KB |
Output is correct |
| 12 |
Correct |
4 ms |
4344 KB |
Output is correct |
| 13 |
Correct |
4 ms |
4408 KB |
Output is correct |
| 14 |
Correct |
7 ms |
4340 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 2 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 3 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 4 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 5 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 6 |
Correct |
1 ms |
4440 KB |
Output is correct |
| 7 |
Correct |
1 ms |
4444 KB |
Output is correct |
| 8 |
Correct |
0 ms |
348 KB |
Output is correct |
| 9 |
Correct |
1 ms |
600 KB |
Output is correct |
| 10 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 11 |
Halted |
0 ms |
0 KB |
- |
