oj.uz

답안 #496431

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
496431 2021-12-21T07:56:40 Z xynex Meteors (POI11_met) C++17
61 / 100
 6000 ms 6760 KB 
/*
* Author: xynex
* Created: 21.12.2021 09:47
* Why am I so stupid? :c
* Slishkom slab
*/

#include <bits/stdc++.h>

 #pragma GCC optimize("inline")
 #pragma GCC optimize("-fgcse,-fgcse-lm")
 #pragma GCC optimize("-ftree-pre,-ftree-vrp")
 #pragma GCC optimize("-ffast-math")
 #pragma GCC optimize("-fipa-sra")
 #pragma GCC optimize("-fpeephole2")
 #pragma GCC optimize("-fsched-spec")
 #pragma GCC optimize("Ofast,no-stack-protector")
 #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
 #pragma GCC optimize("unroll-loops")

using namespace std;

#define ll long long
#define dl double long
#define ull unsigned long long
#define pr pair
#define vt vector
#define ff first
#define ss second
#define mp make_pair
#define sz(a) (int)a.size()
#define pb push_back
#define pf push_front
#define popB pop_back
#define popF pop_front
#define bit_count __builtin_popcount
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sp(x) fixed << setprecision(x)

template<typename T> T get_rand(T l, T r) {
    random_device rd;
    mt19937 gen(rd());
    return uniform_int_distribution<T>(l, r)(gen);
}

template<typename T> T lcm(T a, T b) { return a * (b / __gcd(a, b)); }

template<class A> void read(vt<A>& v);
template<class A, size_t S> void read(array<A, S>& a);
template<class T> void read(T& x) { cin >> x; }
void read(double& d) { string t; read(t); d = stod(t); }
void read(long double& d) { string t; read(t); d = stold(t); }
template<class H, class... T> void read(H& h, T&... t) { read(h); read(t...); }
template<class A> void read(vt<A>& x) { for (auto& a : x) read(a); }
template<class A, size_t S> void read(array<A, S>& x) { for (auto& a : x) read(a); }

string to_string(char c) { return string(1, c); }
string to_string(bool b) { return b ? "true" : "false"; }
string to_string(const char* s) { return string(s); }
string to_string(string s) { return s; }
string to_string(vt<bool> v) { string res; for (int i = 0; i < sz(v); ++i) res += char('0' + v[i]); return res; }
template<size_t S> string to_string(bitset<S> b) { string res; for (int i = 0; i < S; ++i) res += char('0' + b[i]); return res; }
template<class T> string to_string(T v) { bool f = 1; string res; for (auto x : v) { if (!f) res += ' '; f = 0; res += to_string(x); } return res; }

template<class A> void write(A x) { cout << to_string(x); }
template<class H, class... T> void write(const H& h, const T&... t) { write(h); write(t...); }

void print() { write("\n"); }
template<class H, class... T> void print(const H& h, const T&... t) { write(h); if (sizeof...(t)) write(' '); print(t...); }

void freop(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}

const int MOD = 1e9 + 7;
const int N = 3e6 + 5;
const ll INF = 9e18;
const int M = 3e3 + 5;
const dl pi = acos(-1);
const dl eps = 1e-12;
const int sq = 700;

int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
/* ll vs int*/

void precalc() {

}

ll a[N], need[N];
ll l[N], r[N], ind[N];
bool ok[N];
ll ans[N];
pr<int, int> ord[N];
void solve() {
    int n, m; read(n, m);
    vt<ll> cnt(m + 2);
    for(int i = 1; i <= m; ++i) {
        read(a[i]);
    }
    for(int i = 1; i <= n; ++i) {
        read(need[i]);
        ord[i] = {-1, -1};
    }
    int k; read(k);
    for(int i = 1; i <= k; ++i) {
        read(l[i], r[i], ind[i]);
        if(l[i] > r[i]) {
            for(int j = l[i]; j <= m; ++j) {
                if(need[a[j]] > 0 && need[a[j]] <= ind[i]) {
                    need[a[j]] -= ind[i];
                    ans[a[j]] = i;
                }
                else need[a[j]] -= ind[i];
            }
            for(int j = 1; j <= r[i]; ++j) {
                if(need[a[j]] > 0 && need[a[j]] <= ind[i]) {
                    need[a[j]] -= ind[i];
                    ans[a[j]] = i;
                }
                else need[a[j]] -= ind[i];
            }
        }
        else {
            for(int j = l[i]; j <= r[i]; ++j) {
                if(need[a[j]] > 0 && need[a[j]] <= ind[i]) {
                    need[a[j]] -= ind[i];
                    ans[a[j]] = i;
                }
                else need[a[j]] -= ind[i];
            }
        }
    }
    for(int i = 1; i <= n; ++i) {
        if(ans[i] == 0) print("NIE");
        else print(ans[i]);
    }
}

int main() {
    //freop("");
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    //read(t);
    precalc();
    for (int i = 1; i <= t; ++i) {
        //write("Case #" + to_string(i) + ": ");
        solve();
    }
    return 0;
}

Compilation message

met.cpp: In function 'void freop(std::string)':
met.cpp:73:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   73 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
met.cpp:74:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   74 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 3 ms 332 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 3 ms 332 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1751 ms 2324 KB Output is correct
2 Correct 5168 ms 2812 KB Output is correct
3 Correct 3334 ms 2636 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1947 ms 2560 KB Output is correct
2 Correct 2562 ms 2608 KB Output is correct
3 Correct 4820 ms 2868 KB Output is correct
4 Correct 11 ms 1612 KB Output is correct

Subtask #5
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3416 ms 2464 KB Output is correct
2 Correct 4352 ms 3120 KB Output is correct
3 Correct 46 ms 1476 KB Output is correct
4 Correct 2359 ms 2808 KB Output is correct

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5499 ms 2280 KB Output is correct
2 Execution timed out 6031 ms 2216 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #7
0 / 13.0

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

Subtask #8
0 / 13.0

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