oj.uz

답안 #1099867

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1099867 2024-10-12T05:39:45 Z model_code 상형문자열 (IOI24_hieroglyphs) C++17
0 / 100
 1000 ms 2004 KB 
// incorrect/author-bruteforce.cpp

#include<bits/stdc++.h>
#include "hieroglyphs.h"

using namespace std;

using vi = vector<int>;

bool is_subsequence(const vi& a, const vi& b) {
    int j = 0;
    for (int x : a) {
        if (j < (int)b.size() && b[j] == x) {
            j++;
        }
    }
    return j == (int)b.size();
}

vector<int> ucs(vector<int> a, vector<int> b) {
    if (a.size() < b.size()) swap(a, b);
    //int n = a.size();
    int m = b.size();
    vector<vi> subs;
    vi max_sub;
    for (int mask=0; mask < (1<<m); ++mask) {
        vi cs;
        for (int j=0; j < m; ++j) {
            if (mask&(1<<j)) cs.push_back(b[j]);
        }
        if (is_subsequence(a, cs))  {
            subs.push_back(cs);
            if (cs.size() > max_sub.size()) max_sub = cs;
        }
    }
    for (vi s : subs) {
        if (!is_subsequence(max_sub, s)) {
            return vector<int>({-1});
        }
    }
    return max_sub;
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct

Subtask #1
0.0 / 3.0

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

Subtask #2
0.0 / 15.0

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

Subtask #3
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 12 ms 2004 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 12 ms 2004 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 412 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Execution timed out 1099 ms 348 KB Time limit exceeded
11 Halted 0 ms 0 KB -

Subtask #6
0.0 / 42.0

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