# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
477637 |
2021-10-02T23:13:04 Z |
urosk |
Mecho (IOI09_mecho) |
C++14 |
|
317 ms |
16076 KB |
// __builtin_popcount(x) broj bitova
// __builtin_popcountll(x) long long
#define here cerr<<"---------------------------\n"
#include "bits/stdc++.h"
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#define ld double
#define ll long long
#define ull unsigned long long
#define llinf 100000000000000000LL // 10^17
#define iinf 2000000000 // 2*10^9
#define pb push_back
#define popb pop_back
#define fi first
#define sc second
#define endl '\n'
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pld pair<ld,ld>
#define sz(a) int(a.size())
#define all(a) a.begin(),a.end()
#define rall(a) a.begin(),a.end(),greater<int>()
#define getunique(v) {sort(all(v)); v.erase(unique(all(v)), v.end());}
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
void setIO(string inoutname)
{
freopen((inoutname+".in").c_str(),"r",stdin);
freopen((inoutname+".out").c_str(),"w",stdout);
}
#define mod 1
ll gcd(ll a, ll b)
{
if(b==0) return a;
if(a==0) return b;
if(a>=b) return gcd(a%b,b);
return gcd(a,b%a);
}
ll lcm(ll a,ll b){
return (a/gcd(a,b))*b;
}
ll add(ll a,ll b){
a+=b;
a+=mod;
if(a>=mod) a%=mod;
return a;
}
ll mul(ll a,ll b){return(a*b)%mod;}
#define maxn 805
ll n,s;
ll a[maxn][maxn];
ll dm[maxn][maxn];
ll dh[maxn][maxn];
ll conv(char c){
if(c=='T') return 0;
if(c=='G') return 1;
if(c=='M') return 2;
if(c=='D') return 3;
if(c=='H') return 4;
}
vector<ll> dx = {0,0,-1,1};
vector<ll> dy = {1,-1,0,0};
vector<pll> hive;
ll sx,sy,ex,ey;
bool valid(ll x,ll y){return x>=1&&x<=n&&y>=1&&y<=n;}
bool moe(ll t){
if(t*s>=dh[sx][sy]) return 0;
for(ll i = 1;i<=n;i++) for(ll j = 1;j<=n;j++) dm[i][j] = llinf;
dm[sx][sy] = t*s;
queue<pll> q;
q.push({sx,sy});
while(!q.empty()){
pll p = q.front();
q.pop();
ll x = p.fi,y = p.sc;
if(a[x][y]==3) return 1;
for(ll i = 0;i<4;i++){
ll x1 = x + dx[i];
ll y1 = y + dy[i];
if(!valid(x1,y1)||dm[x1][y1]!=llinf||dh[x1][y1]<=dm[x][y]+1||a[x][y]==0) continue;
dm[x1][y1] = dm[x][y]+1;
q.push({x1,y1});
}
}
return 0;
}
ll bs(){
ll l = 0,r = 2*n*n,mid,rez = 0;
while(l<=r){
mid = (l+r)/2;
if(moe(mid)){
rez = mid;
l = mid+1;
}else r = mid-1;
}
return rez;
}
void tc(){
ios_base::sync_with_stdio(false);cerr.tie(0);cout.tie(0);cin.tie(0);
cin >> n >> s;
for(ll i = 1;i<=n;i++){
string s1; cin >> s1;
for(ll j = 1;j<=n;j++){
a[i][j] = conv(s1[j-1]);
if(a[i][j]==2){
sx = i;
sy = j;
a[i][j] = 1;
}
if(a[i][j]==3){
ex = i;
ey = j;
}
if(a[i][j]==4){
hive.pb({i,j});
}
}
}
for(ll i = 1;i<=n;i++) for(ll j = 1;j<=n;j++) dh[i][j] = llinf;
queue<pll> q;
for(pll p : hive){
dh[p.fi][p.sc] = 0;
q.push(p);
}
while(!q.empty()){
pll p = q.front();
q.pop();
ll x = p.fi,y = p.sc;
for(ll i = 0;i<4;i++){
ll x1 = x + dx[i];
ll y1 = y + dy[i];
if(!valid(x1,y1)||a[x1][y1]!=1||dh[x1][y1]!=llinf) continue;
dh[x1][y1] = dh[x][y]+s;
q.push({x1,y1});
}
}
dh[ex][ey] = llinf;
cout<<bs()<<endl;
}
int main(){
ios_base::sync_with_stdio(false);cerr.tie(0);cout.tie(0);cin.tie(0);
//setIO("lol");
int t; t = 1;
while(t--){
tc();
}
return 0;
}
Compilation message
mecho.cpp: In function 'void setIO(std::string)':
mecho.cpp:32:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
32 | freopen((inoutname+".in").c_str(),"r",stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mecho.cpp:33:13: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
33 | freopen((inoutname+".out").c_str(),"w",stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mecho.cpp: In function 'long long int conv(char)':
mecho.cpp:64:1: warning: control reaches end of non-void function [-Wreturn-type]
64 | }
| ^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
332 KB |
Output is correct |
2 |
Correct |
0 ms |
332 KB |
Output is correct |
3 |
Correct |
1 ms |
332 KB |
Output is correct |
4 |
Correct |
0 ms |
332 KB |
Output is correct |
5 |
Correct |
0 ms |
332 KB |
Output is correct |
6 |
Correct |
1 ms |
332 KB |
Output is correct |
7 |
Correct |
94 ms |
15708 KB |
Output is correct |
8 |
Incorrect |
1 ms |
460 KB |
Output isn't correct |
9 |
Correct |
0 ms |
460 KB |
Output is correct |
10 |
Correct |
1 ms |
460 KB |
Output is correct |
11 |
Correct |
0 ms |
460 KB |
Output is correct |
12 |
Correct |
1 ms |
1100 KB |
Output is correct |
13 |
Correct |
1 ms |
972 KB |
Output is correct |
14 |
Incorrect |
1 ms |
1100 KB |
Output isn't correct |
15 |
Correct |
0 ms |
460 KB |
Output is correct |
16 |
Correct |
0 ms |
460 KB |
Output is correct |
17 |
Correct |
1 ms |
588 KB |
Output is correct |
18 |
Correct |
1 ms |
588 KB |
Output is correct |
19 |
Correct |
1 ms |
588 KB |
Output is correct |
20 |
Correct |
1 ms |
716 KB |
Output is correct |
21 |
Correct |
1 ms |
844 KB |
Output is correct |
22 |
Correct |
1 ms |
844 KB |
Output is correct |
23 |
Correct |
1 ms |
972 KB |
Output is correct |
24 |
Correct |
1 ms |
972 KB |
Output is correct |
25 |
Correct |
1 ms |
1100 KB |
Output is correct |
26 |
Correct |
1 ms |
1100 KB |
Output is correct |
27 |
Correct |
1 ms |
1100 KB |
Output is correct |
28 |
Correct |
1 ms |
1100 KB |
Output is correct |
29 |
Correct |
2 ms |
1228 KB |
Output is correct |
30 |
Correct |
1 ms |
1184 KB |
Output is correct |
31 |
Correct |
1 ms |
1356 KB |
Output is correct |
32 |
Correct |
1 ms |
1356 KB |
Output is correct |
33 |
Correct |
5 ms |
6860 KB |
Output is correct |
34 |
Correct |
6 ms |
6880 KB |
Output is correct |
35 |
Correct |
27 ms |
6960 KB |
Output is correct |
36 |
Correct |
6 ms |
7884 KB |
Output is correct |
37 |
Correct |
8 ms |
7884 KB |
Output is correct |
38 |
Correct |
43 ms |
7820 KB |
Output is correct |
39 |
Correct |
8 ms |
8780 KB |
Output is correct |
40 |
Correct |
13 ms |
8780 KB |
Output is correct |
41 |
Correct |
50 ms |
8860 KB |
Output is correct |
42 |
Correct |
9 ms |
9804 KB |
Output is correct |
43 |
Correct |
13 ms |
9804 KB |
Output is correct |
44 |
Correct |
64 ms |
9804 KB |
Output is correct |
45 |
Correct |
11 ms |
10756 KB |
Output is correct |
46 |
Correct |
11 ms |
10700 KB |
Output is correct |
47 |
Correct |
71 ms |
10752 KB |
Output is correct |
48 |
Correct |
12 ms |
11596 KB |
Output is correct |
49 |
Correct |
13 ms |
11596 KB |
Output is correct |
50 |
Correct |
86 ms |
11636 KB |
Output is correct |
51 |
Correct |
14 ms |
12648 KB |
Output is correct |
52 |
Correct |
20 ms |
12772 KB |
Output is correct |
53 |
Correct |
116 ms |
12652 KB |
Output is correct |
54 |
Correct |
16 ms |
13588 KB |
Output is correct |
55 |
Correct |
16 ms |
13516 KB |
Output is correct |
56 |
Correct |
128 ms |
13544 KB |
Output is correct |
57 |
Correct |
19 ms |
14540 KB |
Output is correct |
58 |
Correct |
19 ms |
14428 KB |
Output is correct |
59 |
Correct |
185 ms |
14560 KB |
Output is correct |
60 |
Correct |
20 ms |
15436 KB |
Output is correct |
61 |
Correct |
22 ms |
15436 KB |
Output is correct |
62 |
Correct |
171 ms |
15476 KB |
Output is correct |
63 |
Correct |
188 ms |
15440 KB |
Output is correct |
64 |
Correct |
317 ms |
15476 KB |
Output is correct |
65 |
Correct |
234 ms |
15484 KB |
Output is correct |
66 |
Correct |
185 ms |
15484 KB |
Output is correct |
67 |
Incorrect |
182 ms |
15572 KB |
Output isn't correct |
68 |
Correct |
72 ms |
15432 KB |
Output is correct |
69 |
Correct |
70 ms |
15428 KB |
Output is correct |
70 |
Correct |
49 ms |
15452 KB |
Output is correct |
71 |
Correct |
59 ms |
15456 KB |
Output is correct |
72 |
Correct |
39 ms |
15436 KB |
Output is correct |
73 |
Correct |
39 ms |
15968 KB |
Output is correct |
74 |
Correct |
87 ms |
16012 KB |
Output is correct |
75 |
Correct |
89 ms |
16024 KB |
Output is correct |
76 |
Correct |
82 ms |
16076 KB |
Output is correct |
77 |
Correct |
67 ms |
16028 KB |
Output is correct |
78 |
Incorrect |
113 ms |
15944 KB |
Output isn't correct |
79 |
Correct |
54 ms |
15992 KB |
Output is correct |
80 |
Correct |
75 ms |
15996 KB |
Output is correct |
81 |
Correct |
81 ms |
16012 KB |
Output is correct |
82 |
Correct |
86 ms |
15956 KB |
Output is correct |
83 |
Correct |
119 ms |
15872 KB |
Output is correct |
84 |
Correct |
81 ms |
15812 KB |
Output is correct |
85 |
Correct |
90 ms |
15812 KB |
Output is correct |
86 |
Correct |
77 ms |
15816 KB |
Output is correct |
87 |
Correct |
94 ms |
15828 KB |
Output is correct |
88 |
Correct |
83 ms |
15820 KB |
Output is correct |
89 |
Correct |
80 ms |
15764 KB |
Output is correct |
90 |
Correct |
85 ms |
15772 KB |
Output is correct |
91 |
Correct |
86 ms |
15772 KB |
Output is correct |
92 |
Correct |
108 ms |
15892 KB |
Output is correct |