Submission #32374959

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;

void printArr(vector<int>arr){
    for(auto i : arr){
        cout << i << " ";
    }
        cout << endl;
}
void printArrPair(vector<pair<int,int>>arr){
    for(auto i : arr){
        cout << i.first << " " << i.second << " ";
    }
        cout << endl;
}

int ans;
void dfs(vector<vector<int>>&g,int cur,bool sg,int f,int deph,int n){
  if(g[cur].size() == 1){
    ans = max(ans,n - deph * 2 + 2 - !sg);
  }
  if(sg){
    ans = max(ans,n - deph - deph + 2);
  }
  for(int i : g[cur]){
    if(i != f){
      bool nsg = cur != 0 && g[cur].size() == 2;
      dfs(g,i,nsg,cur,deph + 1,n);
    }
  }
}
void solve(){
   int x,y;
   cin >> x >> y;
   x--;
   y--;
   vector<vector<int>>arr(2,vector<int>(2));
   for(int i = 0;i < 2;i++){
    for(int j = 0;j < 2;j++){
      cin >> arr[i][j];
    }
   }
   cout << arr[x][y] << endl;
}


int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    #ifndef ONLINE_JUDGE
    freopen("data", "r", stdin);
    #endif
    int n = 1;
  //  cin >> n;
    while(n--)
        solve();
    return 0;
}

Submission Info

Judge Result