oj.uz

답안 #710894

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
710894 2023-03-16T04:10:40 Z Nursik Restore Array (RMI19_restore) C++14
7 / 100
 151 ms 468 KB 
#include <iostream>
#include <fstream>
#include <iomanip>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <ctime>
#include <algorithm>
#include <sstream>
#include <list>
#include <queue>
#include <deque>
#include <stack>
#include <cstdlib>
#include <cstdio>
#include <iterator>
#include <functional>
#include <unordered_set>
#include <unordered_map>
#include <stdio.h>
#include <bitset>
#include <cstdint>
#include <cassert>
#include <functional>
#include <complex>
#include <random>
 
using namespace std;
 
#define ll long long
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define ld long double
 
const ll maxn = 1e6 + 1, maxm = 8e2 + 1;
const ll mod = 1e9 + 7, cmod = 998244353, inf = 1e9, block = 5000, p2 = 31, bit = 30;
const ld eps = 1e-9;

int n, m;
int l[maxn], r[maxn], k[maxn], value[maxn];
int pref[maxn];
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0); 
    cout.tie(0);
    cin >> n >> m;
    for (int i = 1; i <= m; ++i){
        cin >> l[i] >> r[i] >> k[i] >> value[i];
    }
    for (int i = 0; i < (1 << n); ++i){
        for (int j = 0; j < n; ++j){
            if ((1 << j) & i){
                pref[j] += 1;
            }
            if (j){
                pref[j] += pref[j - 1];
            }
        }
        int bad = 0;
        for (int j = 1; j <= m; ++j){
            int dig = pref[r[j]] - (l[j] - 1 >= 0 ? pref[l[j] - 1] : 0);
            int len = r[j] - l[j] + 1;
            if (len - dig + 1 <= k[j]){
                if (value[j] == 0){
                    bad = 1;
                }
            }
            else{
                if (value[j] == 1){
                    bad = 1;
                }
            }
        }
        if (!bad){
            for (int j = 0; j < n; ++j){
                cout << (((1 << j) & i) > 0) << " ";
            }
            exit(0);
        }
        for (int j = 0; j < n; ++j){
            pref[j] = 0;
        }
    }
    cout << -1;
}
/*


ajj, ajj, ajj, ajj, aj, aj, aj, aj, aj, aj, ak, ak, ak, ak, ak, ai, ai, ai
 */

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 46 ms 340 KB Output is correct
4 Correct 40 ms 352 KB Output is correct
5 Correct 144 ms 340 KB Output is correct
6 Correct 85 ms 348 KB Output is correct
7 Correct 27 ms 340 KB Output is correct
8 Correct 26 ms 368 KB Output is correct
9 Correct 151 ms 348 KB Output is correct
10 Correct 1 ms 340 KB Output is correct

Subtask #2
0 / 13.0

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

Subtask #3
0 / 25.0

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

Subtask #4
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 46 ms 340 KB Output is correct
4 Correct 40 ms 352 KB Output is correct
5 Correct 144 ms 340 KB Output is correct
6 Correct 85 ms 348 KB Output is correct
7 Correct 27 ms 340 KB Output is correct
8 Correct 26 ms 368 KB Output is correct
9 Correct 151 ms 348 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Incorrect 2 ms 468 KB Output isn't correct
12 Halted 0 ms 0 KB -