/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 2ms 328.0 KiB
#2 Accepted 2ms 528.0 KiB
#3 Accepted 2ms 540.0 KiB
#4 Accepted 2ms 328.0 KiB
#5 Accepted 2ms 332.0 KiB
#6 Accepted 2ms 532.0 KiB
#7 Accepted 2ms 328.0 KiB
#8 Accepted 2ms 332.0 KiB
#9 Accepted 2ms 336.0 KiB
#10 Accepted 2ms 332.0 KiB
#11 Accepted 2ms 328.0 KiB

Code

#include<bits/stdc++.h>
using namespace std;
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define dbg(a,b,c,d) cerr<<a<<"  "<<b<<"  "<<c<<"  "<<d<<endl;
#define kill(a) {cout<<a<<endl;continue;}
#define KILL(a) {cout<<a<<endl;return 0;}
#define debug cerr<<"Error Found"<<endl;
#define mem(a,b) memset(a,b,sizeof(a))
#define lcm(a, b) (a/__gcd(a,b))*b
#define w(t) cin>>t;while(t--)
#define pi  2 * acos(0.0)
#define endl "\n"
int t, cs = 0;
const int mxn = 1e5 + 3, mod = 1e9 + 7;

int32_t main()
{


   string s = "leadinguniversity";
   sort(s.begin(), s.end());
   string ss;
   cin >> ss;
   sort(ss.begin(), ss.end());
   int sz = ss.size();
   int j = 0;
   for(int i = 0; i < sz; i++)if(ss[i] == s[j])j++;
   cout << (j == s.size() ? "Leading University" : "Impossible") << endl;

}

Information

Submit By
Type
Submission
Problem
P1024 Rearrange Character
Language
C++17 (G++ 13.2.0)
Submit At
2024-11-06 11:15:32
Judged At
2024-11-11 02:25:14
Judged By
Score
100
Total Time
2ms
Peak Memory
540.0 KiB