제출 #99334

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
99334	2019-03-02 16:41:49	karma	동굴 (IOI13_cave)	C++11	100 / 100	794 ms	640 KiB

cave

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<bits/stdc++.h>
#include "cave.h"
using namespace std;
const int maxN = 5007;
const int MAX_CALLS = 70000;
int n, s[maxN], d[maxN], vis[maxN];
//int realS[maxN], realD[maxN], inv[maxN];
//int num_calls;
//
//void answer(int S[], int D[]) {
//    int i;
//    bool correct = 1;
//    for (i = 0; i < n; ++i)
//        if (S[i] != realS[i] || D[i] != realD[i]) {
//            correct = 0;
//            break;
//        }
//    if (correct) cout << "CORRECT\n";
//    else {
//        cout << "INCORRECT\n";
//        for(int i = 0; i < n; ++i) {
//            cout << realS[i] << ' ';
//        }
//        cout << '\n';
//        for(int i = 0; i < n; ++i) {
//            cout << realD[i] << ' ';
//        }
//    }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 12 / 12
• Subtask 2: 13 / 13
• Subtask 3: 21 / 21
• Subtask 4: 30 / 30
• Subtask 5: 24 / 24