oj.uz

Submission #798528

# Submission time Handle Problem Language Result Execution time Memory
798528 2023-07-30T19:42:28 Z Joshi503 RMQ (NOI17_rmq) C++17
23 / 100
 1000 ms 340 KB 
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
#define int ll
using db = long double;
using str = string;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using pd = pair<db, db>;
#define f first
#define s second

#define tcT template<class T
#define tcTU tcT, class U
tcT> using V = vector<T>;
tcT, size_t SZ > using AR = array<T, SZ>;
using vi = V<int>;
using vb = V<bool>;
using vl = V<ll>;
using vd = V<db>;
using vs = V<str>;
using vpi = V<pi>;
using vpl = V<pl>;

#define sz(x) int((x).size())
#define bg(x) begin(x)
#define all(x) bg(x), end(x)
#define rall(x) x.rbegin(), x.rend() 
#define sor(x) sort(all(x)) 
#define pb push_back
#define yes cout << "Y" << "e" << "s\n";
#define no cout << "N" << "o\n";

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = ((b)-1); i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define rep(a) F0R(_,a)
#define each(a,x) for (auto& a: x)

const int MOD = 1e9+7;
const int MOD98 = 998244353;
const int MX = 1e9;
// const int INF = 1e18;
const db PI = acos((db)-1);
// const int dx[] = { 1,0,-1,0 };
// const int dy[] = { 0,1,0,-1 };
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
template<class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
void setIO(string name = "") {
    ios_base::sync_with_stdio(0); cin.tie(0);
    if ((ll)(name.size())) {
        freopen((name + ".in").c_str(), "r", stdin);
        freopen((name + ".out").c_str(), "w", stdout);
    }
}
template<class T> bool ckmin(T& a, const T& b) {
    return b < a ? a = b, 1 : 0; 
} 
template<class T> bool ckmax(T& a, const T& b) {
    return a < b ? a = b, 1 : 0; 
}
void _print(char i) { cerr << i; }
void _print(string i) { cerr << i; }
void _print(float i) { cerr << i; }
void _print(int i) { cerr << i; }
void _print(double i) { cerr << i; }
void _print() { cerr << "\n"; };
template<typename x, typename y> void _print(pair<x, y>& t) { cerr << "{";_print(t.first);cerr << ", ";_print(t.second);cerr << "},"; }
template<typename x> void _print(x& t) { cerr << "{"; for (int i = 0;i < (int)t.size();i++) { _print(t[i]); if (i < (int)t.size() - 1) cerr << ", "; } cerr << "}"; }
template<typename x, typename... y> void _print(x a, y... b) { _print(a);if (sizeof...(b)) cerr << ", ";_print(b...); }
#define dbg(x...) cerr<<"["<<#x<<"] = [";_print(x);cerr<<"]\n";
int test;

/*
3 * 10^6  


*/

struct Range{
    int l, r, m;
};

void solve(){

    int n; cin >> n;
    vi a(n);
    iota(all(a), 0);
    int q; cin >> q;
    vector<Range> range(q);
    F0R(i, q){
        int l, r, m; cin >> l >> r >> m;
        range[i] = {l, r, m};
    }
    do{
        bool can = 1; int ok = 0;
        F0R(i, q){
            for(int j = range[i].l; j <= range[i].r; j++){
                if(a[j] < range[i].m) can = 0;
                if(a[j] == range[i].m) ok++;
            }
        }
        if(can && ok == q){
            each(x, a) cout << x << " ";
            return;
        }
        

    } while(next_permutation(all(a)));

    F0R(i, n) cout << "-1 ";

}

signed main() {
    setIO("");
    int T = 1;
    // cin >> T;
    for (test = 1; test <= T; test++) {
        // cout << "Case #" << test << ": " << a.f << " " << a.s << "\n";
        solve();
    }
}

Compilation message

rmq.cpp: In function 'void setIO(std::string)':
rmq.cpp:54:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   54 |         freopen((name + ".in").c_str(), "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
rmq.cpp:55:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   55 |         freopen((name + ".out").c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 28 ms 324 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 219 ms 304 KB Output is correct
7 Correct 23 ms 212 KB Output is correct
8 Correct 247 ms 304 KB Output is correct
9 Correct 22 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct

Subtask #2
0.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 28 ms 324 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 219 ms 304 KB Output is correct
7 Correct 23 ms 212 KB Output is correct
8 Correct 247 ms 304 KB Output is correct
9 Correct 22 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Execution timed out 1083 ms 340 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #3
0.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 28 ms 324 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 219 ms 304 KB Output is correct
7 Correct 23 ms 212 KB Output is correct
8 Correct 247 ms 304 KB Output is correct
9 Correct 22 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Execution timed out 1083 ms 340 KB Time limit exceeded
13 Halted 0 ms 0 KB -