Submission #46002567


Source Code Expand

#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <complex>
#include <queue>
#include <set>
#include <unordered_set>
#include <list>
#include <chrono>
#include <random>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <map>
#include <unordered_map>
#include <stack>
#include <iomanip>
#include <fstream>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int,int> p32;
typedef pair<ll,ll> p64;
typedef pair<double,double> pdd;
typedef vector<ll> v64;
typedef vector<int> v32;
typedef vector<vector<int> > vv32;
typedef vector<vector<ll> > vv64;
typedef vector<vector<p64> > vvp64;
typedef vector<p64> vp64;
typedef vector<p32> vp32;
ll MOD = 998244353;
double eps = 1e-12;
#define forn(i,e) for(ll i = 0; i < e; i++)
#define forsn(i,s,e) for(ll i = s; i < e; i++)
#define rforn(i,s) for(ll i = s; i >= 0; i--)
#define rforsn(i,s,e) for(ll i = s; i >= e; i--)
#define ln "\n"
#define dbg(x) cout<<#x<<" = "<<x<<ln
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define INF 2e18
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())


void solve(){
    string s; cin >> s;
	for(int i=1;i<s.size();i++){
		if(s[i] >= s[i-1]){
			cout << "No" << endl;
			return;
		}
	}cout << "Yes" << endl;
}

int main()
{
	fast_cin();
	ll t = 1;
	// cin >> t;
	for(int it=1;it<=t;it++) {
		// cout << "Case #" << it << ": ";
			solve();
	}
	
	return 0;
}

Submission Info

Submission Time
Task A - 321-like Checker
User Turin
Language C++ 20 (gcc 12.2)
Score 100
Code Size 1752 Byte
Status AC
Exec Time 1 ms
Memory 3640 KiB

Compile Error

Main.cpp: In function ‘void solve()’:
Main.cpp:57:22: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   57 |         for(int i=1;i<s.size();i++){
      |                     ~^~~~~~~~~

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 4
AC × 31
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt
All hand_01.txt, hand_02.txt, sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt
Case Name Status Exec Time Memory
hand_01.txt AC 1 ms 3432 KiB
hand_02.txt AC 1 ms 3516 KiB
sample_01.txt AC 1 ms 3512 KiB
sample_02.txt AC 1 ms 3428 KiB
sample_03.txt AC 1 ms 3476 KiB
sample_04.txt AC 1 ms 3480 KiB
test_01.txt AC 1 ms 3516 KiB
test_02.txt AC 1 ms 3364 KiB
test_03.txt AC 1 ms 3484 KiB
test_04.txt AC 1 ms 3568 KiB
test_05.txt AC 1 ms 3516 KiB
test_06.txt AC 1 ms 3480 KiB
test_07.txt AC 1 ms 3516 KiB
test_08.txt AC 1 ms 3436 KiB
test_09.txt AC 1 ms 3448 KiB
test_10.txt AC 1 ms 3408 KiB
test_11.txt AC 1 ms 3516 KiB
test_12.txt AC 1 ms 3432 KiB
test_13.txt AC 1 ms 3496 KiB
test_14.txt AC 1 ms 3516 KiB
test_15.txt AC 1 ms 3576 KiB
test_16.txt AC 1 ms 3640 KiB
test_17.txt AC 1 ms 3496 KiB
test_18.txt AC 1 ms 3636 KiB
test_19.txt AC 1 ms 3576 KiB
test_20.txt AC 1 ms 3476 KiB
test_21.txt AC 1 ms 3500 KiB
test_22.txt AC 1 ms 3408 KiB
test_23.txt AC 1 ms 3452 KiB
test_24.txt AC 1 ms 3444 KiB
test_25.txt AC 1 ms 3416 KiB