Submission #983765
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define each(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); ++itr)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define fi first
#define se second
typedef pair<int,int> pi;
typedef vector<pi> v;
map<pi,v> mp;
inline v make(pi p)
{
int x=p.fi, y=p.se;
v t(4);
t[0]=pi(x,y+1);
t[1]=pi(x+1,y);
t[2]=pi(x,y-1);
t[3]=pi(x-1,y);
return t;
}
int main()
{
int K;
char s[200001];
scanf(" %d %s", &K, s);
pi now(0,0);
mp[now] = make(now);
// 近傍生成
for(const auto &nb: mp[now]) mp[nb] = make(nb);
map<char,int> move;
move['U']=0;
move['R']=1;
move['D']=2;
move['L']=3;
rep(i,K)
{
// 今いる地点を訪問済みにする
v a=mp[now];
rep(j,4) mp[a[j]][(j^2)]=a[(j^2)];
// 移動
now = mp[now][move[s[i]]];
// 近傍生成
for(const auto &nb: mp[now])
{
if(mp.find(nb) == mp.end()) mp[nb] = make(nb);
}
}
printf("%d %d\n", now.fi, now.se);
return 0;
}
Submission Info
Submission Time |
|
Task |
C - 幼稚園児高橋君 |
User |
imulan |
Language |
C++11 (GCC 4.9.2) |
Score |
100 |
Code Size |
1252 Byte |
Status |
AC |
Exec Time |
938 ms |
Memory |
75944 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:33:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf(" %d %s", &K, s);
^
Judge Result
Set Name |
Sample |
Subtask1 |
Score / Max Score |
0 / 0 |
100 / 100 |
Status |
|
|
Set Name |
Test Cases |
Sample |
subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt |
Subtask1 |
subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt |
Case Name |
Status |
Exec Time |
Memory |
subtask0_sample_01.txt |
AC |
17 ms |
800 KB |
subtask0_sample_02.txt |
AC |
16 ms |
800 KB |
subtask0_sample_03.txt |
AC |
18 ms |
924 KB |
subtask1_01.txt |
AC |
16 ms |
928 KB |
subtask1_02.txt |
AC |
19 ms |
796 KB |
subtask1_03.txt |
AC |
18 ms |
800 KB |
subtask1_04.txt |
AC |
18 ms |
800 KB |
subtask1_05.txt |
AC |
18 ms |
800 KB |
subtask1_06.txt |
AC |
18 ms |
800 KB |
subtask1_07.txt |
AC |
331 ms |
30624 KB |
subtask1_08.txt |
AC |
338 ms |
30628 KB |
subtask1_09.txt |
AC |
335 ms |
29736 KB |
subtask1_10.txt |
AC |
331 ms |
31600 KB |
subtask1_11.txt |
AC |
331 ms |
30112 KB |
subtask1_12.txt |
AC |
339 ms |
29724 KB |
subtask1_13.txt |
AC |
341 ms |
30324 KB |
subtask1_14.txt |
AC |
938 ms |
75936 KB |
subtask1_15.txt |
AC |
806 ms |
75936 KB |
subtask1_16.txt |
AC |
550 ms |
38388 KB |
subtask1_17.txt |
AC |
391 ms |
75944 KB |
subtask1_18.txt |
AC |
835 ms |
75932 KB |
subtask1_19.txt |
AC |
637 ms |
53404 KB |
subtask1_20.txt |
AC |
600 ms |
52132 KB |
subtask1_21.txt |
AC |
832 ms |
50980 KB |