# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
156923 | 2019-10-08T10:02:36 Z | AKaan37 | Elder (COCI19_elder) | C++17 | 2 ms | 376 KB |
//Sani buyuk Osman Pasa Plevneden cikmam diyor. //FatihSultanMehmedHan //Abdulhamid Han //Bismillahirrahmanirrahim //█▀█─█──█──█▀█─█─█ //█▄█─█──█──█▄█─█▄█ //█─█─█▄─█▄─█─█─█─█ #pragma GCC optimize ("O3") #pragma GCC target ("sse4") #include <bits/stdc++.h> using namespace std; typedef long long lo; typedef pair< lo,lo > PII; #define fi first #define se second #define mp make_pair #define pb push_back #define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL) #define FOR for(int i=1;i<=n;i++) #define mid ((start+end)/2) #define ort ((bas+son)/2) const lo MAX = -1000000000000000000; const lo MIN = 1000000000000000000; const lo inf = 1000000000; const lo KOK = 100000; const lo LOG = 30; const lo li = 500005; const lo mod = 1000000007; int n,m,b[li],a[li],k,flag,t,vis[100]; int cev; string s; char c; vector<int> v; int main(void){ scanf(" %c %d",&c,&n); char asa=c; vis[asa-'A']=1; FOR{ char c1,c2; scanf(" %c %c",&c1,&c2); if(asa==c2 && vis[c1-'A']==0){asa=c1;cev++;vis[c2-'A']=1;} else if(asa==c2){asa=c1;} } printf("%c\n%d\n",asa,++cev); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Partially correct | 2 ms | 376 KB | Output is partially correct |
4 | Partially correct | 2 ms | 376 KB | Output is partially correct |
5 | Correct | 2 ms | 252 KB | Output is correct |
6 | Correct | 2 ms | 256 KB | Output is correct |
7 | Partially correct | 2 ms | 256 KB | Output is partially correct |
8 | Correct | 2 ms | 376 KB | Output is correct |
9 | Correct | 2 ms | 376 KB | Output is correct |
10 | Partially correct | 2 ms | 376 KB | Output is partially correct |