Submission #791887


Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
typedef long long ll;
#define ITR(i,c) for(auto i=begin(c);i!=end(c);i++)
#define FOR(i,a,n) for(int i=a;i<(int)(n);i++)
#define FORR(x,arr) for(auto& x:arr)
#define REP(i,n) FOR(i,0,n)
#define ALL(c) begin(c),end(c)
#define PB push_back
#define MP make_pair
const int DX[4]={0,1,0,-1}, DY[4]={-1,0,1,0};
const int INF = 1e9;

int main(int argc, char const *argv[]) {
    string a;
    cin >> a;
    if(a=="a") cout << -1 << endl;
    else cout << "a" << endl;
    return 0;
}

Submission Info

Submission Time
Task B - 辞書式順序
User algon
Language C++ (G++ 4.6.4)
Score 100
Code Size 571 Byte
Status AC
Exec Time 28 ms
Memory 928 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 4
AC × 19
Set Name Test Cases
Sample subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt, subtask0_sample04.txt
All subtask0_sample01.txt, subtask0_sample02.txt, subtask0_sample03.txt, subtask0_sample04.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt
Case Name Status Exec Time Memory
subtask0_sample01.txt AC 28 ms 796 KB
subtask0_sample02.txt AC 25 ms 804 KB
subtask0_sample03.txt AC 27 ms 800 KB
subtask0_sample04.txt AC 28 ms 796 KB
subtask1_01.txt AC 27 ms 672 KB
subtask1_02.txt AC 27 ms 672 KB
subtask1_03.txt AC 26 ms 920 KB
subtask1_04.txt AC 27 ms 924 KB
subtask1_05.txt AC 27 ms 924 KB
subtask1_06.txt AC 27 ms 928 KB
subtask1_07.txt AC 26 ms 796 KB
subtask1_08.txt AC 27 ms 920 KB
subtask1_09.txt AC 27 ms 920 KB
subtask1_10.txt AC 26 ms 800 KB
subtask1_11.txt AC 27 ms 672 KB
subtask1_12.txt AC 27 ms 804 KB
subtask1_13.txt AC 27 ms 672 KB
subtask1_14.txt AC 27 ms 792 KB
subtask1_15.txt AC 27 ms 804 KB