Submission #993076

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
993076	2024-06-05 09:52:13	Yazan_SA	Cave (IOI13_cave)	C++17	0 / 100	75 ms	604 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 "cave.h"
#include<bits/stdc++.h>
using namespace std;
// int n=1,tot;
// int S[]={0};
// int D[]={0};
// int F[]={0};
// int tryCombination(int s[]){
//     for(int i=0; i<n; i++){
//         F[D[i]]=i;
//     }
//     tot++;
//     int ac=0;
//     for(int i=0; i<n; i++){
//         if(s[F[i]]==S[F[i]])ac++;
//         else break;
//     }
//     return ac;
// }
// void answer(int s[], int d[]){
//     cout<<"try: \n";
//     for(int i=0; i<n; i++)cout<<s[i]<<' ';cout<<'\n';
//     for(int i=0; i<n; i++)cout<<S[i]<<' ';cout<<'\n';
//     cout<<endl;
//     cout<<"try: \n";
//     for(int i=0; i<n; i++)cout<<d[i]<<' ';cout<<'\n';
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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