Submission #777461

Source Code Expand

#include<iostream>
#include<vector>
#include<algorithm>
#include<string>

using namespace std;

#define REP(i,n) for(int i=0;i<(n);i++)

int main(void){
	string s;int T;cin>>s>>T;
	int n=s.size();
	int x=0;int y=0;
	int k=0;
		REP(i,n){
			if(s[i]=='R') x++;
			if(s[i]=='L') x--;
			if(s[i]=='U') y++;
			if(s[i]=='D') y--;
			if(s[i]=='?') k++;
		}

	if(T==1){
		cout<<abs(x)+abs(y)+k<<endl;
	}else{
		if(abs(x)+abs(y)>=k) cout<<abs(x)+abs(y)-k<<endl;
		else{
			cout<< ((k-abs(x)-abs(y))&1) <<endl;
		}
	}
	
	return 0;
}

Submission Info

Submission Time
Task B - ドローン
User ish_774
Language C++14 (GCC 5.4.1)
Score 101
Code Size 559 Byte
Status AC
Exec Time 11 ms
Memory 512 KiB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 100 / 100 1 / 1
Status
AC × 4
AC × 19
AC × 39
Set Name Test Cases
Sample 00_example_01.txt, 00_example_02.txt, 00_example_03.txt, 00_example_04.txt
Subtask1 00_example_01.txt, 00_example_02.txt, 00_example_03.txt, 10_rand_01.txt, 10_rand_02.txt, 10_rand_03.txt, 10_rand_04.txt, 20_no_question_01.txt, 20_no_question_02.txt, 20_no_question_03.txt, 20_no_question_04.txt, 30_max_01.txt, 30_max_02.txt, 30_max_03.txt, 30_max_04.txt, 40_corner_01.txt, 40_corner_02.txt, 40_corner_03.txt, 40_corner_04.txt
All 00_example_01.txt, 00_example_02.txt, 00_example_03.txt, 00_example_04.txt, 10_rand_01.txt, 10_rand_02.txt, 10_rand_03.txt, 10_rand_04.txt, 20_no_question_01.txt, 20_no_question_02.txt, 20_no_question_03.txt, 20_no_question_04.txt, 30_max_01.txt, 30_max_02.txt, 30_max_03.txt, 30_max_04.txt, 40_corner_01.txt, 40_corner_02.txt, 40_corner_03.txt, 40_corner_04.txt, 50_hand_01.txt, 50_hand_02.txt, 50_hand_03.txt, 60_rand_01.txt, 60_rand_02.txt, 60_rand_03.txt, 60_rand_04.txt, 70_no_ques_01.txt, 70_no_ques_02.txt, 70_no_ques_03.txt, 70_no_ques_04.txt, 80_max_01.txt, 80_max_02.txt, 80_max_03.txt, 80_max_04.txt, 90_corner_01.txt, 90_corner_02.txt, 90_corner_03.txt, 90_corner_04.txt
Case Name Status Exec Time Memory
00_example_01.txt AC 4 ms 256 KiB
00_example_02.txt AC 4 ms 256 KiB
00_example_03.txt AC 4 ms 256 KiB
00_example_04.txt AC 4 ms 256 KiB
10_rand_01.txt AC 5 ms 256 KiB
10_rand_02.txt AC 4 ms 256 KiB
10_rand_03.txt AC 4 ms 256 KiB
10_rand_04.txt AC 4 ms 256 KiB
20_no_question_01.txt AC 5 ms 256 KiB
20_no_question_02.txt AC 4 ms 256 KiB
20_no_question_03.txt AC 4 ms 256 KiB
20_no_question_04.txt AC 5 ms 256 KiB
30_max_01.txt AC 11 ms 512 KiB
30_max_02.txt AC 11 ms 512 KiB
30_max_03.txt AC 11 ms 512 KiB
30_max_04.txt AC 11 ms 512 KiB
40_corner_01.txt AC 11 ms 512 KiB
40_corner_02.txt AC 10 ms 512 KiB
40_corner_03.txt AC 10 ms 512 KiB
40_corner_04.txt AC 10 ms 512 KiB
50_hand_01.txt AC 4 ms 256 KiB
50_hand_02.txt AC 4 ms 256 KiB
50_hand_03.txt AC 4 ms 256 KiB
60_rand_01.txt AC 5 ms 256 KiB
60_rand_02.txt AC 4 ms 256 KiB
60_rand_03.txt AC 4 ms 256 KiB
60_rand_04.txt AC 4 ms 256 KiB
70_no_ques_01.txt AC 5 ms 256 KiB
70_no_ques_02.txt AC 4 ms 256 KiB
70_no_ques_03.txt AC 4 ms 256 KiB
70_no_ques_04.txt AC 4 ms 256 KiB
80_max_01.txt AC 11 ms 512 KiB
80_max_02.txt AC 11 ms 512 KiB
80_max_03.txt AC 11 ms 512 KiB
80_max_04.txt AC 11 ms 512 KiB
90_corner_01.txt AC 10 ms 512 KiB
90_corner_02.txt AC 10 ms 512 KiB
90_corner_03.txt AC 11 ms 512 KiB
90_corner_04.txt AC 11 ms 512 KiB