oj.uz

답안 #528440

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
528440 2022-02-20T09:57:53 Z N1NT3NDO Magneti (COCI21_magneti) C++14
0 / 110
 1 ms 332 KB 
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define sz(x) (int)x.size()
#define fi first
#define sd second
#define all(x) x.begin(), x.end()
//#pragma GCC target ("avx2")
//#pragma GCC optimization ("O3")
//#pragma GCC optimization ("unroll-loops")

using namespace std;
//using namespace __gnu_pbds;

//typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

int n, L, R[55], ans, who[55];
bool used[55];

void Rec(int skok)
{
    if (skok == n + 1)
    {
        ans++;
        return;
    }

    for(int i = 1; i <= L; i++)
    {
        if (used[i]) continue;
        bool bad = 0;
        for(int j = 1; j <= L && !bad; j++)
        {
            if (used[j] && (abs(j - i) < R[skok] || abs(j - i) < R[who[j]])) bad = 1;
        }

        if (!bad)
        {
            used[i] = 1;
            who[i] = skok;
            Rec(skok + 1);
            used[i] = 0;
            who[i] = 0;
        }
    }
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> L;
    for(int i = 1; i <= n; i++) cin >> R[i];
    //sort(R + 1, R + n + 1, greater<>());
    Rec(1);
    cout << ans;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 332 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 332 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 332 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 332 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -