Submission #1349672

---

Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>

#include <functional>
#include <cassert>

typedef long long ll;
using namespace std;

#define debug(x) cerr << #x << " = " << (x) << endl;


#define mod 1000000007 //1e9+7(prime number)
#define INF 1000000000 //1e9
#define LLINF 2000000000000000000LL //2e18
#define SIZE 1000010

int dx[8] = {0,0,1,-1,1,1,-1,-1};
int dy[8] = {1,-1,0,0,1,-1,1,-1};

struct PLACE{
  PLACE *p[4];
  int x;
  int y;
  bool visited;

  PLACE(int x, int y):x(x), y(y), visited(false){
    for(int i=0;i<4;i++) p[i] = NULL;
  }
};


unordered_map<ll, PLACE*> ss;

PLACE* add_place(int x, int y){
  auto it = ss.find((x+SIZE)*INF+(y+SIZE));
  PLACE *r;
  if(it == ss.end()){
    r = new PLACE(x,y);
    ss[(x+SIZE)*INF+(y+SIZE)] = r;

    for(int i=0;i<4;i++){
      auto it2 = ss.find((x+dx[i]+SIZE)*INF+(y+dy[i]+SIZE));
      if(it2 != ss.end()){
        r->p[i] = it2->second;

        if(r->p[i]->visited)
          r->p[i]->p[i/2*2+(1-i%2)] = r;
        
        if(r->p[i]->visited && r->p[i]->p[i] != NULL)
          r->p[i] = r->p[i]->p[i];
      }

      if(r->visited && r->p[0] != NULL && r->p[1] != NULL){
        r->p[0]->p[1] = r->p[1];
        r->p[1]->p[0] = r->p[0];
      }
      if(r->visited && r->p[2] != NULL && r->p[3] != NULL){
        r->p[2]->p[3] = r->p[3];
        r->p[3]->p[2] = r->p[2];
      }
    }
  }else{
    r = it->second;

    if(r->visited && r->p[0] != NULL && r->p[1] != NULL){
        r->p[0]->p[1] = r->p[1];
        r->p[1]->p[0] = r->p[0];
      }
    if(r->visited && r->p[2] != NULL && r->p[3] != NULL){
      r->p[2]->p[3] = r->p[3];
      r->p[3]->p[2] = r->p[2];
    }
  }

  return r;
}

int main(){
  int n;
  char s[SIZE];
  
  scanf("%d%s",&n,s);

  
  PLACE *now = add_place(0,0);
  
  for(int i=0;i<n;i++){
    now->visited = true;
    int g;

    if(s[i] == 'R') g = 2;
    if(s[i] == 'L') g = 3;
    if(s[i] == 'U') g = 0;
    if(s[i] == 'D') g = 1;
    
    while(now->visited){
      add_place(now->x+dx[g],now->y+dy[g]);
      now = now->p[g];
    }
  }

  printf("%d %d\n",now->x, now->y);
  
  return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:96:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%s",&n,s);
                     ^

Judge Result