結果

問題 No.8051 cracked
コンテスト
ユーザー nebukuro09
提出日時 2019-04-02 00:13:28
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 2,747 bytes
コンパイル時間 1,677 ms
コンパイル使用メモリ 168,084 KB
実行使用メモリ 25,616 KB
最終ジャッジ日時 2024-07-16 17:06:09
合計ジャッジ時間 37,918 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other TLE * 24
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
//#include <bits/stdc++.h>
//#include <bits/stdc++.h>
using namespace std;
//using namespace std;
//using namespace std;
void ans(int p,char a,char b) {
//void ans(int p,char a,char b) {
//void ans(int p,char a,char b) {
cout << p << endl << "\"" << a << "\"" << endl << "\"" << b << "\"" << endl;
//cout << p << endl << "\"" << a << "\"" << endl << "\"" << b << "\"" << endl;
//cout << p << endl << "\"" << a << "\"" << endl << "\"" << b << "\"" << endl;
}
//}
//}
int main() {
//int main() {
//int main() {
int p = 0;
//int p = 0;
//int p = 0;
string s1, s2, s3;
//string s1, s2, s3;
//string s1, s2, s3;
for (int j = 0; j < 38; ++j) {
//for (int j = 0; j < 38; ++j) {
//for (int j = 0; j < 38; ++j) {
getline(cin, s1);
//getline(cin, s1);
//getline(cin, s1);
getline(cin, s2);
//getline(cin, s2);
//getline(cin, s2);
getline(cin, s3);
//getline(cin, s3);
//getline(cin, s3);
int n = s1.size() + 1;
//int n = s1.size() + 1;
//int n = s1.size() + 1;
if (s2[0] != '/') {
//if (s2[0] != '/') {
//if (s2[0] != '/') {
ans(p + n, '/', s2[0]);
//ans(p + n, '/', s2[0]);
//ans(p + n, '/', s2[0]);
}
//}
//}
if (s2[1] != '/') {
//if (s2[1] != '/') {
//if (s2[1] != '/') {
ans(p + n + 1, '/', s2[1]);
//ans(p + n + 1, '/', s2[1]);
//ans(p + n + 1, '/', s2[1]);
}
//}
//}
if (s3[0] != '/') {
//if (s3[0] != '/') {
//if (s3[0] != '/') {
ans(p + n + 2 + n, '/', s3[0]);
//ans(p + n + 2 + n, '/', s3[0]);
//ans(p + n + 2 + n, '/', s3[0]);
}
//}
//}
if (s3[1] != '/') {
//if (s3[1] != '/') {
//if (s3[1] != '/') {
ans(p + n + 2 + n + 1, '/', s3[1]);
//ans(p + n + 2 + n + 1, '/', s3[1]);
//ans(p + n + 2 + n + 1, '/', s3[1]);
}
//}
//}
for (int i = 0; i < (int)s1.size(); ++i) {
//for (int i = 0; i < (int)s1.size(); ++i) {
//for (int i = 0; i < (int)s1.size(); ++i) {
if (s1[i] == s2[i+2] && s1[i] != s3[i+2]) {
//if (s1[i] == s2[i+2] && s1[i] != s3[i+2]) {
//if (s1[i] == s2[i+2] && s1[i] != s3[i+2]) {
ans(p + n + 2 + n + 2 + i, s1[i], s3[i+2]);
//ans(p + n + 2 + n + 2 + i, s1[i], s3[i+2]);
//ans(p + n + 2 + n + 2 + i, s1[i], s3[i+2]);
} else if (s1[i] == s3[i+2] && s1[i] != s2[i+2]) {
//} else if (s1[i] == s3[i+2] && s1[i] != s2[i+2]) {
//} else if (s1[i] == s3[i+2] && s1[i] != s2[i+2]) {
ans(p + n + 2 + i, s1[i], s2[i+2]);
//ans(p + n + 2 + i, s1[i], s2[i+2]);
//ans(p + n + 2 + i, s1[i], s2[i+2]);
} else if (s2[i+2] == s3[i+2] && s1[i] != s2[i+2]) {
//} else if (s2[i+2] == s3[i+2] && s1[i] != s2[i+2]) {
//} else if (s2[i+2] == s3[i+2] && s1[i] != s2[i+2]) {
ans(p + i, s2[i+2], s1[i]);
//ans(p + i, s2[i+2], s1[i]);
//ans(p + i, s2[i+2], s1[i]);
}
//}
//}
}
//}
//}
p += n + 2 + n + 2 + n;
//p += n + 2 + n + 2 + n;
//p += n + 2 + n + 2 + n;
}
//}
//}
getline(cin, s1);
//getline(cin, s1);
//getline(cin, s1);
}
//}
//}
0