Submission #1141337


Source Code Expand

#include <iostream> 
#include <string> 
#include <vector> 
#include <cmath> 
#include <algorithm> 
#include <cstdlib> 
#include <ctime> 
#include <cstdio> 
#include <functional> 
#include <set> 
#include <sstream> 
#include <cctype>
#include <stack>
#include <queue>
#include <cstring>
#include <map>
#include <list>
#include <chrono>

using namespace std;

chrono::system_clock::time_point  start;
inline double get_time(void){
	return chrono::duration_cast<chrono::milliseconds>(chrono::system_clock::now()-start).count();
}


const int N=10;
const double END=9500.00;

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

int main(){

	srand(time(NULL));
	for(int i=0;i<2500;i++) cout<<"UDLR"[rand()%4];
	cout<<endl;

}

Submission Info

Submission Time
Task B - Food Collector
User lay20114
Language C++14 (GCC 5.4.1)
Score 447
Code Size 767 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name test_01 test_02 test_03 test_04 test_05 test_06 test_07 test_08 test_09 test_10
Score / Max Score 127 / 20000 0 / 20000 0 / 20000 0 / 20000 0 / 20000 31 / 20000 149 / 20000 80 / 20000 60 / 20000 0 / 20000
Status
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
Set Name Test Cases
test_01 subtask_01_01.txt
test_02 subtask_01_02.txt
test_03 subtask_01_03.txt
test_04 subtask_01_04.txt
test_05 subtask_01_05.txt
test_06 subtask_01_06.txt
test_07 subtask_01_07.txt
test_08 subtask_01_08.txt
test_09 subtask_01_09.txt
test_10 subtask_01_10.txt
Case Name Status Exec Time Memory
subtask_01_01.txt AC 1 ms 256 KB
subtask_01_02.txt AC 1 ms 256 KB
subtask_01_03.txt AC 1 ms 256 KB
subtask_01_04.txt AC 1 ms 256 KB
subtask_01_05.txt AC 1 ms 256 KB
subtask_01_06.txt AC 1 ms 256 KB
subtask_01_07.txt AC 1 ms 256 KB
subtask_01_08.txt AC 1 ms 256 KB
subtask_01_09.txt AC 1 ms 256 KB
subtask_01_10.txt AC 1 ms 256 KB