oj.uz

답안 #591323

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
591323 2022-07-07T09:28:26 Z imObscure Tracks in the Snow (BOI13_tracks) C++17
100 / 100
 955 ms 222124 KB 
#include <bits/stdc++.h> 
using namespace std;


using vi = vector<int>;
#define pb push_back
#define all(x) begin(x), end(x)
#define sz(x) (int) (x).size()

using pi = pair<int,int>;
#define f first
#define s second
#define mp make_pair

#define re(i,n) for(int i=0;i<n;i++)
#define reb(i,n) for(int i=n-1;i>=0;i--)
#define test int t;cin>>t;while(t--)


void setIO(string name = "") {
	cin.tie(0)->sync_with_stdio(0); 
	if (sz(name)) {
		freopen((name + ".in").c_str(), "r", stdin); 
		freopen((name + ".out").c_str(), "w", stdout);
	}
}

signed main(){
	setIO();
	
	int n,m; cin>>n>>m;
	
	vector<string> grid(n);
	vector<vi> vis(n,vi(m));
	re(i,n)cin>>grid[i];
	
	deque<pair<int,pair<int,int>>> q;
	q.pb({1,{0,0}});
	
	int r[4]={1,-1,0,0};
	int c[4]={0,0,-1,1};
	int ans=0;
	
	while(sz(q)){
		
		pair<int,pair<int,int>> cur=q.front(); q.pop_front();
		
		
			ans=max(ans,cur.f);
			
		
		vis[cur.s.f][cur.s.s]=1;
		
		for(int i=0;i<4;i++){
			
			int x=cur.s.f+r[i],y=cur.s.s+c[i];
			
			if(x>=0 && x<n && y>=0 && y<m && !vis[x][y] && grid[x][y]!='.'){
				if(grid[x][y]!=grid[cur.s.f][cur.s.s]){
					q.push_back({cur.f+1,{x,y}});
				}
				else q.push_front({cur.f,{x,y}});
			}
		}
		
	}
	cout<<ans;
	
}

Compilation message

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

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 2004 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 10 ms 1876 KB Output is correct
5 Correct 3 ms 724 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 320 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 2 ms 716 KB Output is correct
11 Correct 3 ms 724 KB Output is correct
12 Correct 7 ms 980 KB Output is correct
13 Correct 3 ms 724 KB Output is correct
14 Correct 2 ms 756 KB Output is correct
15 Correct 16 ms 1876 KB Output is correct
16 Correct 19 ms 2004 KB Output is correct
17 Correct 10 ms 1748 KB Output is correct
18 Correct 9 ms 1864 KB Output is correct

Subtask #2
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 712 KB Output is correct
2 Correct 51 ms 9700 KB Output is correct
3 Correct 248 ms 96516 KB Output is correct
4 Correct 62 ms 22728 KB Output is correct
5 Correct 154 ms 54240 KB Output is correct
6 Correct 955 ms 145296 KB Output is correct
7 Correct 2 ms 724 KB Output is correct
8 Correct 2 ms 724 KB Output is correct
9 Correct 3 ms 724 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 2 ms 724 KB Output is correct
12 Correct 2 ms 468 KB Output is correct
13 Correct 57 ms 9716 KB Output is correct
14 Correct 29 ms 5716 KB Output is correct
15 Correct 14 ms 6224 KB Output is correct
16 Correct 27 ms 4180 KB Output is correct
17 Correct 130 ms 24624 KB Output is correct
18 Correct 64 ms 24240 KB Output is correct
19 Correct 61 ms 22744 KB Output is correct
20 Correct 58 ms 20840 KB Output is correct
21 Correct 141 ms 56100 KB Output is correct
22 Correct 151 ms 54212 KB Output is correct
23 Correct 276 ms 46828 KB Output is correct
24 Correct 111 ms 54664 KB Output is correct
25 Correct 323 ms 96504 KB Output is correct
26 Correct 548 ms 222124 KB Output is correct
27 Correct 681 ms 162572 KB Output is correct
28 Correct 952 ms 145464 KB Output is correct
29 Correct 921 ms 143096 KB Output is correct
30 Correct 849 ms 155404 KB Output is correct
31 Correct 950 ms 63432 KB Output is correct
32 Correct 613 ms 137120 KB Output is correct