QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#849863#1370. Magic TrickLaVuna47#AC ✓1ms3804kbC++201.5kb2025-01-09 18:49:152025-01-09 18:49:28

Judging History

你现在查看的是最新测评结果

  • [2025-01-09 18:49:28]
  • 评测
  • 测评结果:AC
  • 用时:1ms
  • 内存:3804kb
  • [2025-01-09 18:49:15]
  • 提交

answer

/** gnu specific **/
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
/** contains everything I need in std **/
#include <bits/stdc++.h>

#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(S) ((int)S.size())
#define FOR(i, st_, n) for(int i = st_; i < n; ++i)
#define RFOR(i, n, end_) for(int i = (n)-1; i >= end_; --i)
#define x first
#define y second
#define pb push_back
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef unsigned long long ull;
typedef long double LD;
typedef pair<ull, ull> pull;
using namespace __gnu_pbds;
typedef tree<ll, null_type, less<>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
using namespace std;
#ifdef ONPC
mt19937 rnd(228);
#else
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
#endif


int solve()
{
	string s;
	if(!(cin>>s))return 1;
	set<char> ss;
	for(auto item: s) ss.insert(item);
	cout<<(sz(s)==sz(ss) ? "1" : "0")<<'\n';
    return 0;
}

int32_t main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int TET = 1e9;
    //cin >> TET;
    for (int i = 1; i <= TET; i++)
    {
        if (solve())
        {
            break;
        }
#ifdef ONPC
        cout << "__________________________" << endl;
#endif
    }
#ifdef ONPC
    cerr << endl << "finished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec" << endl;
#endif
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3584kb

input:

abcdefghijklmnopqrstuvwxyz

output:

1

result:

ok single line: '1'

Test #2:

score: 0
Accepted
time: 1ms
memory: 3632kb

input:

gymbcsilhojwkaxqtfndrupvze

output:

1

result:

ok single line: '1'

Test #3:

score: 0
Accepted
time: 0ms
memory: 3804kb

input:

nmewlgurxopshiczqaftbdkyvj

output:

1

result:

ok single line: '1'

Test #4:

score: 0
Accepted
time: 0ms
memory: 3576kb

input:

yfchrgwdontqasvpelzkimxbuj

output:

1

result:

ok single line: '1'

Test #5:

score: 0
Accepted
time: 0ms
memory: 3636kb

input:

epitvmqlxuabrngsjyohzkwdfc

output:

1

result:

ok single line: '1'

Test #6:

score: 0
Accepted
time: 1ms
memory: 3708kb

input:

lurabvxewhjmzyqcgkpisdntfo

output:

1

result:

ok single line: '1'

Test #7:

score: 0
Accepted
time: 0ms
memory: 3696kb

input:

xrqbwhweiizvagfingxdhwpbrbjkjbypuoujdexdwpykstayfd

output:

0

result:

ok single line: '0'

Test #8:

score: 0
Accepted
time: 0ms
memory: 3628kb

input:

zmwuryuwejlldowvinnelaqfeqpchwmrgxhzapltgjuvxfpwob

output:

0

result:

ok single line: '0'

Test #9:

score: 0
Accepted
time: 0ms
memory: 3632kb

input:

lsrcrbprrfjczubqfhoolwlhxswrbzgbinbwxjzzjfqpievczn

output:

0

result:

ok single line: '0'

Test #10:

score: 0
Accepted
time: 0ms
memory: 3632kb

input:

aamfvnbkcyessudcxbincuwebympnuohybylzxxitxyuezshdm

output:

0

result:

ok single line: '0'

Test #11:

score: 0
Accepted
time: 0ms
memory: 3604kb

input:

ysrkrvblbnjejcayhxbttljsicfcaiwjpxxpltwqcyfntxcbdn

output:

0

result:

ok single line: '0'

Test #12:

score: 0
Accepted
time: 0ms
memory: 3604kb

input:

rknoehxqyzocgxvyauatqnnlrmceqmqqwuyhbtkkmyjfyao

output:

0

result:

ok single line: '0'

Test #13:

score: 0
Accepted
time: 0ms
memory: 3628kb

input:

emjkinmdupsiajsbso

output:

0

result:

ok single line: '0'

Test #14:

score: 0
Accepted
time: 0ms
memory: 3800kb

input:

jewgtfkshsdvjyecluiwnuolobsljlvoeiimztrhkcobanbdm

output:

0

result:

ok single line: '0'

Test #15:

score: 0
Accepted
time: 0ms
memory: 3572kb

input:

qipifdsvkxmvzbtjtukvyprjntscio

output:

0

result:

ok single line: '0'

Test #16:

score: 0
Accepted
time: 0ms
memory: 3672kb

input:

xlqfbvaswvnrlobymjnnpdxievgqe

output:

0

result:

ok single line: '0'

Test #17:

score: 0
Accepted
time: 0ms
memory: 3568kb

input:

x

output:

1

result:

ok single line: '1'