Submission #1176369

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1176369	2025-03-30 18:12:21	achinhchin	Job Scheduling (CEOI12_jobs)	C++20	0 / 100	1097 ms	33064 KiB

jobs

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <climits>
#include <cstring>
#include<iostream>
#include<utility>
#include<vector>
#include<queue>
using namespace std;
typedef long long l;
using pl=pair<l,l>;
#define f first
#define s second
l n,m,i,j,md,ll,r=INT_MAX,T[900][900],B[900][900],w[][2]={{0,1},{0,-1},{1,0},{-1,0}};
vector<pl> G[900][900];
queue<pl> D;
char M[900][900];
pl a,b,t;
char ti;
bool C(l tm) {
  memset(T,0,900*900*8),T[a.f][a.s]=tm*m+1,D.push(a);
  while(!D.empty()){
    t=D.front(),D.pop();
    for(auto i:G[t.f][t.s])if(!T[i.f][i.s]&&(T[t.f][t.s]-1)/m<B[i.f][i.s])
      D.push(make_pair(i.f,i.s)),T[i.f][i.s]=T[t.f][t.s]+1;
  }return T[b.f][b.s];
}
int main(){
  //cin.tie(nullptr)->sync_with_stdio(false);
  cin>>n>>m;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 100