oj.uz

Submission #710902

# Submission time Handle Problem Language Result Execution time Memory
710902 2023-03-16T04:21:08 Z Nursik Restore Array (RMI19_restore) C++14
20 / 100
 144 ms 684 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 = 5e3 + 1, maxm = 1e4 + 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[maxm], r[maxm], k[maxm], value[maxm], ans[maxn];
int pref[maxn];
int subtask1 = 1;
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];
        subtask1 &= (k[i] == 1);
    }
    if (n <= 18){
    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;
    exit(0);
    }
    if (subtask1){
        for (int i = 1; i <= m; ++i){
            if (value[i] == 1){
                for (int j = l[i]; j <= r[i]; ++j){
                    ans[j] = 1;
                }
            }
        }
        for (int i = 1; i <= m; ++i){
            if (value[i] == 0){
                int ok = 0;
                for (int j = l[i]; j <= r[i]; ++j){
                    if (ans[j] == 0){
                        ok = 1;
                    }
                }
                if (!ok){
                    cout << -1;
                    exit(0);
                }
            }
        }
        for (int i = 0; i < n; ++i){
            cout << ans[i] << " ";
        }
        exit(0);
    }
}
/*


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

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 33 ms 212 KB Output is correct
4 Correct 35 ms 340 KB Output is correct
5 Correct 137 ms 320 KB Output is correct
6 Correct 78 ms 340 KB Output is correct
7 Correct 27 ms 340 KB Output is correct
8 Correct 27 ms 348 KB Output is correct
9 Correct 144 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 484 KB Output is correct
2 Correct 12 ms 684 KB Output is correct
3 Correct 13 ms 596 KB Output is correct
4 Correct 10 ms 604 KB Output is correct
5 Correct 5 ms 596 KB Output is correct
6 Correct 5 ms 596 KB Output is correct

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 484 KB Output is correct
2 Correct 12 ms 684 KB Output is correct
3 Correct 13 ms 596 KB Output is correct
4 Correct 10 ms 604 KB Output is correct
5 Correct 5 ms 596 KB Output is correct
6 Correct 5 ms 596 KB Output is correct
7 Incorrect 3 ms 596 KB Unexpected end of file - int32 expected
8 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 33 ms 212 KB Output is correct
4 Correct 35 ms 340 KB Output is correct
5 Correct 137 ms 320 KB Output is correct
6 Correct 78 ms 340 KB Output is correct
7 Correct 27 ms 340 KB Output is correct
8 Correct 27 ms 348 KB Output is correct
9 Correct 144 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 10 ms 484 KB Output is correct
12 Correct 12 ms 684 KB Output is correct
13 Correct 13 ms 596 KB Output is correct
14 Correct 10 ms 604 KB Output is correct
15 Correct 5 ms 596 KB Output is correct
16 Correct 5 ms 596 KB Output is correct
17 Incorrect 3 ms 596 KB Unexpected end of file - int32 expected
18 Halted 0 ms 0 KB -