Submission #1113733

# Submission time Handle Problem Language Result Execution time Memory
1113733 2024-11-17T09:01:01 Z thelegendary08 Fire (BOI24_fire) C++17
31 / 100
2000 ms 6240 KB
#include<bits/stdc++.h>
#define pb push_back
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<'\n'
#define dout(a) cout<<a<<' '<<#a<<'\n'
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<'\n'
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	//ifstream cin(".in");
	//ofstream cout(".out");
	in2(n,m);
	vpii v;
	f0r(i,n){
		in2(a,b);
		v.pb({a,b});
	}
	sort(all(v));
	int ans = 4e18;
	f0r(i,n){
		vpii w;
		int st = v[i].first;
		f0r(j, n){
			int a = v[j].first;
			int b = v[j].second;
			if(v[j].first > v[j].second)b += m;
			if(a < st){
				a += m;
				b += m;
			}
			w.pb({a,b});
		}
		f0r(j,n){
			//cout<<w[j].first<<' '<<w[j].second<<'\n';
		}
		vvi adj(n);
		f0r(j, n){
			FOR(k, j+1, n){
				pii a = w[j];
				pii b = w[k];
				if(a.first > b.first)swap(a, b);
				if(a.second >= b.first){
					adj[j].pb(k);
					adj[k].pb(j);
				}
			}
		}
		queue<int>q;
		q.push(i);
		vi dist(n, 4e18);
		dist[i] = 1;
		while(!q.empty()){
			int node = q.front();
			q.pop();
			for(auto u : adj[node]){
				if(dist[u] > dist[node] + 1){
					dist[u] = dist[node] + 1;
					q.push(u);
				}
			}
		}
		//vout(dist);
		int mn = 4e18;
		f0r(j, n){
			if(w[j].second >= st + m){
				mn = min(mn, dist[j]);
			}
		}
		ans = min(ans, mn);
		//out("");
	}
	if(ans == 4e18)out(-1);
	else out(ans);
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 508 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 456 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 508 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 456 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 2 ms 336 KB Output is correct
25 Correct 38 ms 336 KB Output is correct
26 Correct 25 ms 336 KB Output is correct
27 Correct 29 ms 516 KB Output is correct
28 Correct 30 ms 336 KB Output is correct
29 Correct 44 ms 600 KB Output is correct
30 Correct 39 ms 572 KB Output is correct
31 Correct 82 ms 840 KB Output is correct
32 Correct 38 ms 336 KB Output is correct
33 Correct 25 ms 336 KB Output is correct
34 Correct 26 ms 592 KB Output is correct
35 Correct 25 ms 336 KB Output is correct
36 Correct 26 ms 336 KB Output is correct
37 Correct 27 ms 336 KB Output is correct
38 Correct 31 ms 336 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 508 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 456 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 2 ms 336 KB Output is correct
25 Correct 38 ms 336 KB Output is correct
26 Correct 25 ms 336 KB Output is correct
27 Correct 29 ms 516 KB Output is correct
28 Correct 30 ms 336 KB Output is correct
29 Correct 44 ms 600 KB Output is correct
30 Correct 39 ms 572 KB Output is correct
31 Correct 82 ms 840 KB Output is correct
32 Correct 38 ms 336 KB Output is correct
33 Correct 25 ms 336 KB Output is correct
34 Correct 26 ms 592 KB Output is correct
35 Correct 25 ms 336 KB Output is correct
36 Correct 26 ms 336 KB Output is correct
37 Correct 27 ms 336 KB Output is correct
38 Correct 31 ms 336 KB Output is correct
39 Execution timed out 2041 ms 3864 KB Time limit exceeded
40 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 504 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 504 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 25 ms 336 KB Output is correct
10 Correct 43 ms 608 KB Output is correct
11 Correct 49 ms 336 KB Output is correct
12 Correct 69 ms 836 KB Output is correct
13 Correct 26 ms 336 KB Output is correct
14 Correct 25 ms 336 KB Output is correct
15 Execution timed out 2068 ms 6240 KB Time limit exceeded
16 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 460 KB Output is correct
8 Correct 26 ms 336 KB Output is correct
9 Correct 26 ms 508 KB Output is correct
10 Correct 44 ms 592 KB Output is correct
11 Correct 34 ms 508 KB Output is correct
12 Execution timed out 2065 ms 6148 KB Time limit exceeded
13 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 1 ms 336 KB Output is correct
10 Correct 1 ms 336 KB Output is correct
11 Correct 1 ms 336 KB Output is correct
12 Correct 1 ms 336 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 508 KB Output is correct
16 Correct 1 ms 336 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 336 KB Output is correct
19 Correct 1 ms 456 KB Output is correct
20 Correct 1 ms 336 KB Output is correct
21 Correct 1 ms 336 KB Output is correct
22 Correct 1 ms 336 KB Output is correct
23 Correct 1 ms 336 KB Output is correct
24 Correct 2 ms 336 KB Output is correct
25 Correct 38 ms 336 KB Output is correct
26 Correct 25 ms 336 KB Output is correct
27 Correct 29 ms 516 KB Output is correct
28 Correct 30 ms 336 KB Output is correct
29 Correct 44 ms 600 KB Output is correct
30 Correct 39 ms 572 KB Output is correct
31 Correct 82 ms 840 KB Output is correct
32 Correct 38 ms 336 KB Output is correct
33 Correct 25 ms 336 KB Output is correct
34 Correct 26 ms 592 KB Output is correct
35 Correct 25 ms 336 KB Output is correct
36 Correct 26 ms 336 KB Output is correct
37 Correct 27 ms 336 KB Output is correct
38 Correct 31 ms 336 KB Output is correct
39 Execution timed out 2041 ms 3864 KB Time limit exceeded
40 Halted 0 ms 0 KB -