Submission #1347136
Source Code Expand
#include <bits/stdc++.h> using namespace std; #define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++) #define rep(i,n) repl(i,0,n) #define mp(a,b) make_pair((a),(b)) #define pb(a) push_back((a)) #define all(x) (x).begin(),(x).end() #define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x)) #define fi first #define se second #define dbg(x) cout<<#x" = "<<((x))<<endl template<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<"("<<p.fi<<","<<p.se<<")";return o;} template<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<"[";for(T t:v){o<<t<<",";}o<<"]";return o;} #define INF 2147483600 #define long long long // for codeforces int main(){ int n; cin>>n; rep(_,n){ string s; cin>>s; int cnt=0; rep(i,10) repl(j,i+1,10) if(s[i]<s[j]) cnt++; // dbg(cnt); cout << cnt%2 << endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - チェックディジット |
User | tossy |
Language | C++14 (GCC 5.4.1) |
Score | 200 |
Code Size | 900 Byte |
Status | AC |
Exec Time | 257 ms |
Memory | 384 KB |
Judge Result
Set Name | Subtask00 | Subtask01 | Subtask02 | Subtask03 | Subtask04 | Subtask05 | Subtask06 | Subtask07 | ||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 25 / 25 | 25 / 25 | 25 / 25 | 25 / 25 | 25 / 25 | 25 / 25 | 25 / 25 | 25 / 25 | ||||||||||||||||
Status |
|
|
|
|
|
|
|
|
Set Name | Test Cases |
---|---|
Subtask00 | 00_n_3e1 |
Subtask01 | 01_n_1e2 |
Subtask02 | 02_n_3e2 |
Subtask03 | 03_n_1e3 |
Subtask04 | 04_n_3e3 |
Subtask05 | 05_n_1e4 |
Subtask06 | 06_n_3e4 |
Subtask07 | 07_n_1e5 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_n_3e1 | AC | 1 ms | 256 KB |
01_n_1e2 | AC | 1 ms | 256 KB |
02_n_3e2 | AC | 2 ms | 256 KB |
03_n_1e3 | AC | 4 ms | 256 KB |
04_n_3e3 | AC | 9 ms | 256 KB |
05_n_1e4 | AC | 26 ms | 256 KB |
06_n_3e4 | AC | 77 ms | 256 KB |
07_n_1e5 | AC | 257 ms | 384 KB |
sample | AC | 1 ms | 256 KB |