fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define ll long long
  4. #define err cout<<"error"<<endl;
  5.  
  6. int main() {
  7. ll n,m,x,y;
  8. cin >> n >> m;
  9.  
  10. int a[n][m];
  11. for(int i=0; i<n; i++) {
  12. for(int j=0; j<m; j++) {
  13. cin >> a[i][j];
  14. }
  15. }
  16. cin >> x >> y;
  17. cout << x << " " << y << endl;
  18. /*
  19.   bool visited[n][m];
  20.   memset(visited,0,sizeof(visited));
  21.  
  22.   queue<pair<int,pair<int,int>>>q; // distance i j
  23.   q.push(make_pair(1,make_pair(x-1,y-1)));
  24.  
  25.   while(q.size()) {
  26.   err
  27.   int dist=q.front().first;
  28.   pair<int,int>cur=q.front().second;
  29.   q.pop();
  30.  
  31.   int fi=cur.first;
  32.   int se=cur.second;
  33.  
  34.   if(visited[fi][se]) continue;
  35.   visited[fi][se]=true;
  36.  
  37.   cout << fi << " " << se << endl;
  38.  
  39.   if(fi==0 or fi==n-1 or se==0 or se==m-1) cout << dist;
  40.   // atas
  41.   ++dist;
  42.   if(a[fi-1][se]==0) q.push({dist,{fi-1,se}});
  43.   // bawah
  44.   if(a[fi+1][se]==0) q.push({dist,{fi+1,se}});
  45.   // kanan
  46.   if(a[fi][se+1]==0) q.push({dist,{fi,se+1}});
  47.   // kiri
  48.   if(a[fi][se-1]==0) q.push({dist,{fi,se-1}});
  49.   }
  50.   */
  51. }
Success #stdin #stdout 0.01s 5280KB
stdin
8 10
-1 0 -1 -1 -1 -1 -1 -1 -1 -1
-1 0 0 0 0 0 -1 0 0 0
-1 0 0 -1 -1 0 0 0 -1 -1
-1 -1 0 0 -1 -1 -1 0 0 -1
-1 0 0 0 -1 0 -1 -1 -1 -1
-1 0 -1 0 -1 0 -1 0 0 0
0 0 -1 0 0 0 0 0 -1 -1
-1 -1 -1 -1 -1 -1 -1 -1 -1 -1
7 5
-1 -1 -1 -1 -1 -1 -1 -1 -1 -1
7 5
stdout
7 5