제출 #1069160

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1069160		mindiyak	Fire (BOI24_fire)	C++14	14 / 100	2081 ms	828 KiB

Main

#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")
#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cmath>
#include <numeric>
#include <stack>
#include <queue>
#include <set>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<pi>> vvpi;
typedef vector<ld> vd;
typedef vector<long long> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (ll i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define nl endl
#define S second
#define lb lower_bound
#define ub upper_bound
#define aint(x) x.begin(), x.end()
#define raint(x) x.rbegin(), x.rend()
#define ins insert
const int M = 1e9+7;
void init(string name)
{
    freopen((name + ".in").c_str(), "r", stdin);
    freopen((name + ".out").c_str(), "w", stdout);
}
void fastIO()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
}

int n,m;
vpi arr;
int ans = -1;

void dfs(int pos,int covered,int start,int s,int e,vi visit,int cnt){
    if(visit[pos])return;
    visit[pos] = 1;
    cnt += 1;
    if(ans != -1 && cnt > ans)return;
    if(covered == m){
        if(ans > cnt || ans == -1)ans = cnt;
        return;
    }
    FOR(i,0,n){
        if(visit[i])continue;
        if(arr[i].F <= e && s <= arr[i].F){
            int temp = 0;
            if(arr[i].S < arr[i].F){
                temp += m-e;
                temp += min(arr[i].S,start);
            }else{
                temp += arr[i].S-e;
            }
            if(temp > 0)dfs(i,covered + temp,start,arr[i].F,arr[i].S,visit,cnt);
        }
    }
}

int cov(pi a){
    if(a.F < a.S)return a.S-a.F;
    return a.S + (m-a.F);
}

void solve()
{   
    cin >> n >> m;
    arr = vpi(n);
    FOR(i,0,n)cin >> arr[i].F >> arr[i].S;

    vi visited(n,0);

    FOR(i,0,n){
        dfs(i,cov(arr[i]),arr[i].F,arr[i].F,arr[i].S,visited,0);
    }

    cout << ans << endl;
}   
 
 
int main()
{
    fastIO();
    // init("test");
    int t = 1;
    // cin >> t;
    while (t--)
        solve();
    return 0;
}

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

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

• Subtask 1: 14 / 14
• Subtask 2: 0 / 17
• Subtask 3: 0 / 9
• Subtask 4: 0 / 13
• Subtask 5: 0 / 21
• Subtask 6: 0 / 26