제출 #629996

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
629996		Do_you_copy	Restore Array (RMI19_restore)	C++17	100 / 100	116 ms	3248 KiB

restore

#include <bits/stdc++.h>
//#define int long long
#define fi first
#define se second
#define pb push_back
#define faster ios_base::sync_with_stdio(0); cin.tie(0);
using namespace std;
using ll = long long;
using ull = unsigned ll;
using ld = long double;
using pii = pair <int, int>;
using pil = pair <int, ll>;
using pli = pair <ll, int>;
using pll = pair <ll, ll>;
mt19937 Rand(chrono::steady_clock::now().time_since_epoch().count());

ll min(const ll &a, const ll &b){
    return (a < b) ? a : b;
}

ll max(const ll &a, const ll &b){
    return (a > b) ? a : b;
}

//const ll Mod = 1000000007;
//const ll Mod2 = 999999999989;
//only use when required
const int maxN = 1e5 + 1;
const ll inf = 0x3f3f3f3f3f3f3f3f;
int n, m;

ll d[maxN];
vector <pii> adj[maxN];
bool onstack[maxN];
int cnt[maxN];

bool SPFA(int s){
    fill(d, d + n + 2, inf);
    queue <int> Q;
    Q.push(s);
    onstack[s] = 1;
    d[s] = 0;
    while (!Q.empty()){
        int u = Q.front(); Q.pop();
        onstack[u] = 0;
        for (auto &i: adj[u]){
            if (d[u] + i.se < d[i.fi]){
                d[i.fi] = d[u] + i.se;
                cnt[i.fi] = cnt[u] + 1;
                if (cnt[i.fi] == n + 1 || d[i.fi] < 0){
                    //negative cycle
                    return 0;
                }
                if (!onstack[i.fi]){
                    onstack[i.fi] = 1;
                    Q.push(i.fi);
                }
            }
        }
    }
    return 1;
}

void Init(){
    cin >> n >> m;
    for (int i = 1; i <= m; ++i){
        int l, r, k, val;
        cin >> l >> r >> k >> val;
        ++l; ++r;
        if (val){
            adj[r].pb({l - 1, -(r - l + 1) + k - 1});
        }
        else adj[l - 1].pb({r, (r - l + 1) - k});
    }
    for (int i = 1; i <= n; ++i){
        adj[i - 1].pb({i, 1});
        adj[i].pb({i - 1, 0});
    }
    if (!SPFA(0)){
        cout << -1; exit(0);
    };
    for (int i = 1; i <= n; ++i){
        cout << d[i] - d[i - 1] << " ";
    }
    cout << "\n";
}

#define debu
#define taskname "test"
signed main(){
    if (fopen(taskname".inp", "r")){
        freopen(taskname".inp", "r", stdin);
        #ifdef debug
        freopen(taskname".out", "w", stdout);
        #endif
    }
    faster;
    ll tt = 1;
    //cin >> tt;
    while (tt--){
        Init();
    }
    if (fopen("timeout.txt", "r")){
        ofstream timeout("timeout.txt");
        timeout << 1000 * double(clock()) / CLOCKS_PER_SEC;
        #ifndef debug
        cerr << "\nTime elapsed: " << 1000 * double(clock()) / CLOCKS_PER_SEC << "ms\n";
        #endif
    }
}

컴파일 시 표준 에러 (stderr) 메시지

restore.cpp: In function 'int main()':
restore.cpp:92:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   92 |         freopen(taskname".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 7 / 7
• Subtask 2: 13 / 13
• Subtask 3: 25 / 25
• Subtask 4: 55 / 55