oj.uz

답안 #933414

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
933414 2024-02-25T15:59:12 Z pan Selotejp (COCI20_selotejp) C++17
110 / 110
 24 ms 600 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#include "bits_stdc++.h"
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define input(x) scanf("%lld", &x);
#define input2(x, y) scanf("%lld%lld", &x, &y);
#define input3(x, y, z) scanf("%lld%lld%lld", &x, &y, &z);
#define input4(x, y, z, a) scanf("%lld%lld%lld%lld", &x, &y, &z, &a);
#define print(x, y) printf("%lld%c", x, y);
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define discretize(x) sort(x.begin(), x.end()); x.erase(unique(x.begin(), x.end()), x.end());
using namespace std;
//using namespace __gnu_pbds;
//#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
//#define ordered_multiset tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>
typedef long long ll;
typedef long double ld;
typedef pair<ld, ll> pd;
typedef pair<string, ll> psl;
typedef pair<ll, ll> pi;
typedef pair<ll, pi> pii;
ll const INF = 1e13;
 
int main()
{
	ll n, m;
	ll ans = 0;
	input2(n, m);
	vector<string> graph(n);
	for (ll i=0; i<n; ++i) cin >> graph[i];
	vector<ll> prevv((1LL<<m), INF);
	prevv[0] = 0;
	for (ll r=0; r<n; ++r)
	{
		for (ll c=0; c<m; ++c)
		{
			if (graph[r][c]=='.') continue;
			ans = INF;
			vector<ll> dp(1LL<<m, INF);
			for (ll mask =0; mask<(1LL<<m); ++mask)
			{
				if (mask&(1<<c)) // vertical
				{
					if (r>0 && graph[r-1][c]=='#') {dp[mask] = prevv[mask];}
					dp[mask] = min(dp[mask], min(prevv[mask], prevv[mask^(1LL<<c)]) + 1);
				}
				else// horizontal
				{
					if (c>0 && graph[r][c-1]=='#' && (mask&(1LL<<(c-1)))==0) {dp[mask] = min(prevv[mask], prevv[mask^(1LL<<c)]);}
					dp[mask] =  min(dp[mask], min(prevv[mask], prevv[mask^(1LL<<c)]) + 1);
				}
				ans = min(ans, dp[mask]);
				
				
			}
			swap(dp, prevv);
		}
	}
	print(ans, '\n');
	return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:12:27: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 | #define input2(x, y) scanf("%lld%lld", &x, &y);
      |                      ~~~~~^~~~~~~~~~~~~~~~~~~~
Main.cpp:36:2: note: in expansion of macro 'input2'
   36 |  input2(n, m);
      |  ^~~~~~

Subtask #1
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 5 ms 600 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 3 ms 348 KB Output is correct
5 Correct 7 ms 348 KB Output is correct
6 Correct 8 ms 348 KB Output is correct
7 Correct 9 ms 344 KB Output is correct
8 Correct 4 ms 348 KB Output is correct
9 Correct 9 ms 348 KB Output is correct
10 Correct 12 ms 348 KB Output is correct

Subtask #2
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 5 ms 600 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 3 ms 348 KB Output is correct
5 Correct 7 ms 348 KB Output is correct
6 Correct 8 ms 348 KB Output is correct
7 Correct 9 ms 344 KB Output is correct
8 Correct 4 ms 348 KB Output is correct
9 Correct 9 ms 348 KB Output is correct
10 Correct 12 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 3 ms 484 KB Output is correct
21 Correct 6 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 3 ms 348 KB Output is correct
24 Correct 6 ms 484 KB Output is correct
25 Correct 12 ms 344 KB Output is correct
26 Correct 17 ms 348 KB Output is correct
27 Correct 21 ms 348 KB Output is correct
28 Correct 24 ms 348 KB Output is correct