oj.uz

Submission #937679

# Submission time Handle Problem Language Result Execution time Memory
937679 2024-03-04T10:32:45 Z wojciech_domin2 Lamps (JOI19_lamps) C++14
4 / 100
 73 ms 4084 KB 
#include <bits/stdc++.h>
#define pb push_back
#define ins insert
#define fi first
#define se second
#define debug(x) cout<<#x<<" = "<<x<<"\n";

using namespace std;
using ll = long long;
using ld = long double;

template <typename H, typename T> 
ostream& operator<<(ostream& os, pair<H, T> m){
	return os <<"("<< m.fi<<", "<<m.se<<")";
}
 
template <typename H> 
ostream& operator<<(ostream& os, vector<H> V){
	os<<"{";
	for(int i=0; i<V.size(); i++){
		if(i)os<<" ";
		os<<V[i];
	}
	os<<"}";
	return os;
}

const int MAX_N = 1000020;
char A[MAX_N];
char B[MAX_N];
char D[MAX_N];

bitset<MAX_N> a,b,c;

int main(){
    int N;
    cin>>N;
    for(int i = 1; i <= N; i++){
        cin>>A[i];
    }
    for(int i = 1; i <= N; i++){
        cin>>B[i];
    }
 
    a[1] = int(A[1]^'0');
    b[1] = int(B[1]^'0');
    int lic = 2;
    for(int i = 2; i <= N; i++){
        if(A[i-1] == A[i] && B[i-1] == B[i]){
            //pomiń
        }else{
            a[lic] = int(A[i]^'0');
            b[lic] = int(B[i]^'0');
            lic++;
        }
    }
    c=a^b;
    //cout<<c<<"\n";
    for(int i = 0; i < MAX_N; i++){
         D[i]='*';
    }
    for(int i = 1; i < MAX_N-1; i++){
        if(c[i] && D[i] == '*') D[i] = 'x';
        if(c[i] && !c[i-1] && !c[i+1] && (D[i] == 'x' || D[i] == '*')){
            int j = i;
            while(j >= 1){
                if(b[j] == b[i]){
                    D[j] = char('0'^b[i]);
                }else{
                    break;
                }
                j--;
            }
            j=i;
            while(j <= N){
                if(b[j] == b[i]){
                    D[j] = char('0'^b[i]);
                }else{
                    break;
                }
                j++;
            }
        }
    }

    int odp = 0;
    int ixow = 0;
    int cnt = 0;
    char lit = '*';
    for(int i =1; i <= 7; i++){
      // cout<<D[i];
    }
    //cout<<endl;
    for(int i = 1; i < MAX_N; i++){
        if(D[i] != lit){
            if(D[i] == '*'){
                odp+=(cnt+2-ixow)/2;
                cnt = 0;
                ixow = 0;
            }
            if(D[i] == 'x'){
                ixow++;
                odp++;
                odp+=(cnt+2-ixow)/2;
                cnt = 0;
                ixow = 1;
            }
            if(D[i] == '0'){
                cnt++;
            }
            if(D[i] == '1'){
                cnt++;
            }
            lit = D[i];
        }
    }

    cout<<odp<<"\n";


    return 0;
}

Subtask #1
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2648 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 2 ms 2652 KB Output is correct
4 Correct 2 ms 2648 KB Output is correct
5 Correct 2 ms 2648 KB Output is correct
6 Correct 2 ms 2652 KB Output is correct
7 Correct 2 ms 2736 KB Output is correct
8 Correct 2 ms 2652 KB Output is correct
9 Correct 2 ms 2652 KB Output is correct
10 Correct 2 ms 2648 KB Output is correct
11 Correct 2 ms 2652 KB Output is correct
12 Correct 2 ms 2652 KB Output is correct
13 Correct 2 ms 2652 KB Output is correct
14 Correct 2 ms 2652 KB Output is correct
15 Correct 2 ms 2652 KB Output is correct
16 Correct 2 ms 2652 KB Output is correct
17 Correct 2 ms 2652 KB Output is correct
18 Correct 2 ms 2712 KB Output is correct
19 Correct 2 ms 2652 KB Output is correct
20 Correct 2 ms 2908 KB Output is correct
21 Correct 2 ms 2652 KB Output is correct
22 Correct 2 ms 2652 KB Output is correct
23 Correct 2 ms 2652 KB Output is correct
24 Correct 2 ms 2652 KB Output is correct
25 Correct 2 ms 2652 KB Output is correct
26 Incorrect 2 ms 2652 KB Output isn't correct
27 Halted 0 ms 0 KB -

Subtask #2
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2648 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 2 ms 2652 KB Output is correct
4 Correct 2 ms 2648 KB Output is correct
5 Correct 2 ms 2648 KB Output is correct
6 Correct 2 ms 2652 KB Output is correct
7 Correct 2 ms 2736 KB Output is correct
8 Correct 2 ms 2652 KB Output is correct
9 Correct 2 ms 2652 KB Output is correct
10 Correct 2 ms 2648 KB Output is correct
11 Correct 2 ms 2652 KB Output is correct
12 Correct 2 ms 2652 KB Output is correct
13 Correct 2 ms 2652 KB Output is correct
14 Correct 2 ms 2652 KB Output is correct
15 Correct 2 ms 2652 KB Output is correct
16 Correct 2 ms 2652 KB Output is correct
17 Correct 2 ms 2652 KB Output is correct
18 Correct 2 ms 2712 KB Output is correct
19 Correct 2 ms 2652 KB Output is correct
20 Correct 2 ms 2908 KB Output is correct
21 Correct 2 ms 2652 KB Output is correct
22 Correct 2 ms 2652 KB Output is correct
23 Correct 2 ms 2652 KB Output is correct
24 Correct 2 ms 2652 KB Output is correct
25 Correct 2 ms 2652 KB Output is correct
26 Incorrect 2 ms 2652 KB Output isn't correct
27 Halted 0 ms 0 KB -

Subtask #3
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 2648 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 2 ms 2652 KB Output is correct
4 Correct 2 ms 2652 KB Output is correct
5 Correct 2 ms 2652 KB Output is correct
6 Correct 2 ms 2652 KB Output is correct
7 Correct 65 ms 3564 KB Output is correct
8 Correct 73 ms 4084 KB Output is correct
9 Correct 69 ms 3820 KB Output is correct
10 Correct 71 ms 3816 KB Output is correct
11 Correct 69 ms 3660 KB Output is correct
12 Correct 65 ms 3668 KB Output is correct
13 Correct 65 ms 3708 KB Output is correct
14 Correct 64 ms 3668 KB Output is correct

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2648 KB Output is correct
2 Correct 2 ms 2652 KB Output is correct
3 Correct 2 ms 2652 KB Output is correct
4 Correct 2 ms 2648 KB Output is correct
5 Correct 2 ms 2648 KB Output is correct
6 Correct 2 ms 2652 KB Output is correct
7 Correct 2 ms 2736 KB Output is correct
8 Correct 2 ms 2652 KB Output is correct
9 Correct 2 ms 2652 KB Output is correct
10 Correct 2 ms 2648 KB Output is correct
11 Correct 2 ms 2652 KB Output is correct
12 Correct 2 ms 2652 KB Output is correct
13 Correct 2 ms 2652 KB Output is correct
14 Correct 2 ms 2652 KB Output is correct
15 Correct 2 ms 2652 KB Output is correct
16 Correct 2 ms 2652 KB Output is correct
17 Correct 2 ms 2652 KB Output is correct
18 Correct 2 ms 2712 KB Output is correct
19 Correct 2 ms 2652 KB Output is correct
20 Correct 2 ms 2908 KB Output is correct
21 Correct 2 ms 2652 KB Output is correct
22 Correct 2 ms 2652 KB Output is correct
23 Correct 2 ms 2652 KB Output is correct
24 Correct 2 ms 2652 KB Output is correct
25 Correct 2 ms 2652 KB Output is correct
26 Incorrect 2 ms 2652 KB Output isn't correct
27 Halted 0 ms 0 KB -