/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 540.0 KiB
#2 Accepted 1ms 340.0 KiB
#3 Accepted 1ms 480.0 KiB
#4 Accepted 1ms 332.0 KiB
#5 Accepted 1ms 540.0 KiB
#6 Accepted 1ms 396.0 KiB
#7 Accepted 1ms 540.0 KiB
#8 Accepted 1ms 444.0 KiB
#9 Accepted 1ms 492.0 KiB
#10 Accepted 1ms 348.0 KiB
#11 Accepted 1ms 540.0 KiB

Code

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;
int main() {
    string s;
    cin>>s;
    map<char,int>mp,mp1;
    for(int i=0;i<int(s.size());i++)
    {
        mp[s[i]]++;
    }
    string s1="leadinguniversity";
    for(int i=0;i<int(s1.size());i++)
    {
        mp1[s1[i]]++;
    }
    if(mp==mp1)
    {
        cout<<"Leading University"<<endl;
    }
    else
    {
        cout<<"Impossible"<<endl;
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1024 Rearrange Character
Language
C++20 (G++ 13.2.0)
Submit At
2024-01-02 18:02:45
Judged At
2024-01-07 13:59:18
Judged By
Score
100
Total Time
1ms
Peak Memory
540.0 KiB