分析
#include <bits/stdc++.h>
using namespace std;
class MyFile {
public:
string name;
long long size;
MyFile(string _name, long long _size){
name = _name;
size = _size;
}
};
class MyMenu {
public:
string name;
bool check;
long long LD;
long long RD;
map<string,MyFile> files;
MyMenu(string _name) {
name = _name;
check = false;
}
bool contains(string name) {
return files.find(name) != files.end();
}
};
// 创建根目录
MyMenu root = MyMenu("");
vector<string> mySplit(string dir){
vector<string> res;
int i = 0;
int j;
while (i < dir.length()){
if (dir[i] == '/') {
j = i+1;
while (j < dir.length() && dir[j] != '/'){
j++;
}
res.push_back(dir.substr(i+1, j-i-1));
i = j;
}
else{
i++;
}
}
return res;
}
char operateC(string dir, long long size){
vector<string> strings = mySplit(dir);
//首先
return 'Y';
}
char operateR(string dir, long long size){
return 'Y';
}
char operateQ(string dir, long long LD, long long LR){
return 'Y';
}
/*
int main() {
int n;
cin >> n;
int i;
char op;
string dir;
long long value0;
long long value1;
for (i = 0; i < n; i++){
cin >> op;
if (op == 'C'){
cin >> dir;
cin >> value0;
cout << operateC(dir,value0) << endl;
}
else if (op == 'R'){
cin >> dir;
cin >> value0;
cout << operateR(dir,value0) << endl;
}
else {
cin >> dir;
cin >> value0;
cin >> value1;
cout << operateQ(dir,value0,value1) << endl;
}
}
return 0;
}
*/
int main() {
map<string,string> map1;
map1.insert(pair<string,string>("a","b"));
cout << (map1.find("b") != map1.end()) << endl;
}