oj.uz

답안 #628382

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
628382 2022-08-13T11:04:51 Z MohamedFaresNebili Monochrome Points (JOI20_monochrome) C++14
0 / 100
 1 ms 212 KB 
#include <bits/stdc++.h>

            using namespace std;

            using ll = long long;
            using ld = long double;
            using pi = pair<pair<int, int>, pair<int, int>>;

            #define ff first
            #define ss second
            #define pb push_back
            #define all(x) (x).begin(), (x).end()
            #define lb lower_bound
            #define int ll

            int N, P[305];
            vector<int> A, B;
            string S;

            int32_t main() {
                ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
                cin >> N >> S; N *= 2; int res = 0;
                for(int l = 0; l < N; l++) P[l] = l;
                for(int l = 0; l < N / 2; l++) {
                    if(P[l] != l) continue;
                    int i = N / 2, j = N / 2;
                    for(; i < N; i++) {
                        if(S[l] == S[i] || P[i] != i)
                            continue;
                        break;
                    }
                    for(; j > l; j--) {
                        if(S[l] == S[j] || P[j] != j)
                            continue;
                        break;
                    }
                    int A = 0, B = 0;
                    for(int k = min(l, i); k <= max(l, i); k++)
                        A += (P[k] < min(i, l) || P[k] > max(i, l));
                    for(int k = min(l, j); k <= max(l, j); k++)
                        B += (P[k] < min(j, l) || P[k] > max(j, l));
                    if(i != N && A >= B) {
                        res += A; P[l] = i, P[i] = l;
                        continue;
                    }
                    res += B; P[l] = j, P[j] = l;
                }
                cout << res << "\n";
                return 0;
            }

Subtask #1
0.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Incorrect 1 ms 212 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Incorrect 1 ms 212 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Incorrect 1 ms 212 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #4
0.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Incorrect 1 ms 212 KB Output isn't correct
6 Halted 0 ms 0 KB -