Submission #1173335


Source Code Expand

#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
using namespace std;

#define ll         long long
#define PI         acos(-1.0)
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)

int Z(int y, int x){
    return 30 * y + x;
}

int H,W,K,T;
bool cars[1000];
bool tmpcars[1000];

int main(){
    freopen("a.txt", "w", stdout);
    FOR(i, 0, W*H) cars[i] = tmpcars[i] = false;
    cin>>H>>W>>K>>T;
    int A[K],B[K],C[K],D[K];
    FOR(i, 0, K){
        cin>>A[i]>>B[i]>>C[i]>>D[i];
        cars[Z(B[i],A[i])] = tmpcars[Z(B[i],A[i])] = true;//車があればtrue

    }
    int L = 2;
    cout << L << endl;
    FOR(t, 0, L){
        FOR(i, 0, W*H){
            if(!cars[i]) continue;
            int y = i / 30;
            int x = i % 30;
            if(D[i]-y>0 && !cars[Z(y+1, x)] && !tmpcars[Z(y+1, x)]){
                cout << 'D';
                tmpcars[i] = false;
                tmpcars[Z(y+1, x)] = true;
                continue;
            }
            if(D[i]-y<0 && !cars[Z(y-1, x)] && !tmpcars[Z(y-1, x)]){
                cout << 'U';
                tmpcars[i] = false;
                tmpcars[Z(y-1, x)] = true;
                continue;
            }
            if(C[i]-x>0 && !cars[Z(y, x+1)] && !tmpcars[Z(y, x+1)]){
                cout << 'R';
                tmpcars[i] = false;
                tmpcars[Z(y, x+1)] = true;
                continue;
            }
            if(C[i]-x<0 && !cars[Z(y, x-1)] && !tmpcars[Z(y, x-1)]){
                cout << 'L';
                tmpcars[i] = false;
                tmpcars[Z(y, x-1)] = true;
                continue;
            }
            cout << '-';
        }
        FOR(i, 0, W*H) cars[i] = tmpcars[i];
        cout << endl;
    }
}

Submission Info

Submission Time
Task B - 日本橋大渋滞
User nenuon
Language C++14 (GCC 5.4.1)
Score 3331
Code Size 1973 Byte
Status AC
Exec Time 3 ms
Memory 384 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:29:34: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
     freopen("a.txt", "w", stdout);
                                  ^

Judge Result

Set Name test_01 test_02 test_03 test_04 test_05 test_06 test_07 test_08 test_09 test_10 test_11 test_12 test_13 test_14 test_15 test_16 test_17 test_18 test_19 test_20 test_21 test_22 test_23 test_24 test_25 test_26 test_27 test_28 test_29 test_30
Score / Max Score 114 / 50000 111 / 50000 114 / 50000 116 / 50000 120 / 50000 112 / 50000 112 / 50000 116 / 50000 105 / 50000 109 / 50000 117 / 50000 109 / 50000 109 / 50000 111 / 50000 107 / 50000 115 / 50000 109 / 50000 110 / 50000 111 / 50000 110 / 50000 115 / 50000 110 / 50000 110 / 50000 108 / 50000 106 / 50000 110 / 50000 111 / 50000 104 / 50000 110 / 50000 110 / 50000
Status
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
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
test_11 subtask_01_11.txt
test_12 subtask_01_12.txt
test_13 subtask_01_13.txt
test_14 subtask_01_14.txt
test_15 subtask_01_15.txt
test_16 subtask_01_16.txt
test_17 subtask_01_17.txt
test_18 subtask_01_18.txt
test_19 subtask_01_19.txt
test_20 subtask_01_20.txt
test_21 subtask_01_21.txt
test_22 subtask_01_22.txt
test_23 subtask_01_23.txt
test_24 subtask_01_24.txt
test_25 subtask_01_25.txt
test_26 subtask_01_26.txt
test_27 subtask_01_27.txt
test_28 subtask_01_28.txt
test_29 subtask_01_29.txt
test_30 subtask_01_30.txt
Case Name Status Exec Time Memory
subtask_01_01.txt AC 3 ms 384 KB
subtask_01_02.txt AC 2 ms 256 KB
subtask_01_03.txt AC 2 ms 256 KB
subtask_01_04.txt AC 2 ms 256 KB
subtask_01_05.txt AC 2 ms 256 KB
subtask_01_06.txt AC 2 ms 256 KB
subtask_01_07.txt AC 2 ms 256 KB
subtask_01_08.txt AC 2 ms 256 KB
subtask_01_09.txt AC 2 ms 256 KB
subtask_01_10.txt AC 2 ms 256 KB
subtask_01_11.txt AC 2 ms 256 KB
subtask_01_12.txt AC 2 ms 256 KB
subtask_01_13.txt AC 2 ms 256 KB
subtask_01_14.txt AC 2 ms 256 KB
subtask_01_15.txt AC 2 ms 256 KB
subtask_01_16.txt AC 2 ms 256 KB
subtask_01_17.txt AC 2 ms 256 KB
subtask_01_18.txt AC 2 ms 256 KB
subtask_01_19.txt AC 2 ms 256 KB
subtask_01_20.txt AC 2 ms 256 KB
subtask_01_21.txt AC 2 ms 256 KB
subtask_01_22.txt AC 2 ms 256 KB
subtask_01_23.txt AC 2 ms 256 KB
subtask_01_24.txt AC 2 ms 256 KB
subtask_01_25.txt AC 2 ms 256 KB
subtask_01_26.txt AC 2 ms 256 KB
subtask_01_27.txt AC 2 ms 256 KB
subtask_01_28.txt AC 2 ms 256 KB
subtask_01_29.txt AC 2 ms 256 KB
subtask_01_30.txt AC 2 ms 256 KB