Submission #741845

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
741845	2023-05-15 01:48:40	Dulguun88	Maja (COCI18_maja)	C++14	0 / 110	30 ms	17872 KiB

maja

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<bits/stdc++.h>
using namespace std;
struct T{
  int x,y;
};
T mov[4]={{0,1},{1,0},{-1,0},{0,-1}};
int main(){
  int n,m,a,b,c,mx=0;
  cin>>n>>m>>a>>b>>c;
  vector<vector<int>>v(n+2,vector<int>(m+2,-1000));
  for(int i=1;i<=n;i++){
    for(int j=1;j<=m;j++){
      cin>>v[i][j];
    }
  }
  queue<T>q;
  q.push({a,b});
  c=c/2;
    while(!q.empty()){
      if(c>0){
        if(c==1){
          T aa=q.front();
                q.pop();
              for(auto a:mov){
             v[aa.x+a.x][aa.y+a.y]=v[aa.x+a.x][aa.y+a.y]+v[aa.x][aa.y];
            mx=max(mx,v[aa.x+a.x][aa.y+a.y]);
            q.push({aa.x+a.x,aa.y+a.y});
              }
        }
        else{
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 0 / 11
• Subtask 2: 0 / 11
• Subtask 3: 0 / 11
• Subtask 4: 0 / 11
• Subtask 5: 0 / 11
• Subtask 6: 0 / 11
• Subtask 7: 0 / 11
• Subtask 8: 0 / 11
• Subtask 9: 0 / 11
• Subtask 10: 0 / 11