oj.uz

답안 #1107405

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1107405 2024-11-01T07:42:40 Z vjudge1 Kpart (eJOI21_kpart) C++17
10 / 100
 2000 ms 848 KB 
#include <bits/stdc++.h>

#define ll long long
#define fi first
#define se second
#define iosBASE ios::sync_with_stdio(false);cin.tie(0);cout.tie (0);

void Freopen () {
    #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #endif
}

const ll INF = (ll)1e18 + 7;
const ll mod = (ll)1e9 + 7;
const ll N = 1e5 + 5;

using namespace std;

int n, a[N], cnt[N], ok[N];

void ma1n () {
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        cnt[i] = 0;
    }
    vector <int> ans;
    ok[0] = 1;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= 1e5; j++) ok[j] = 0;
        int sum = 0;
        for (int j = i; j <= n; j++) {
            for (int k = 1e5; k >= 0; k--) {
                if (ok[k]) ok[k + a[j]] = 1;
            }
            sum += a[j];
            if (sum % 2 == 0 && ok[sum / 2]) {
                cnt[j - i + 1]++;
                if (cnt[j - i + 1] == n - j + i) {
                    ans.push_back (j - i + 1);
                }
            }
        }
    }
    sort (ans.begin (), ans.end ());
    cout << ans.size () << " ";
    for (auto to : ans) {
        cout << to << " ";
    }
    cout << "\n";
}

int main () {
    int t = 1;
    cin >> t;
    for (int i = 1; i <= t; i++) {
        ma1n ();
    }
    return 0;
}

Compilation message

Main.cpp: In function 'void Freopen()':
Main.cpp:10:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |     freopen("input.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:11:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |     freopen("output.txt", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 360 ms 848 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2071 ms 592 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2077 ms 592 KB Time limit exceeded
2 Halted 0 ms 0 KB -