oj.uz

답안 #474681

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
474681 2021-09-19T11:26:28 Z HossamHero7 Sateliti (COCI20_satellti) C++14
50 / 110
 3000 ms 2660 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
#define endl '\n'
void solve(){
    int n,m;
    cin>>n>>m;
    vector <string> v(n);
    map <string,int> mp;
    for(auto &i:v) cin>>i;
    vector <string> ans;
    for(int i=0;i<n;i++){
        int mn = 0;
        string ans="";
        for(int shifJ=0;shifJ<=m*2;shifJ++){
            string temp = v[i];
            for(int j=0;j<m;j++){
                temp[(j+shifJ)%m] = v[i][j];
            }
            if(ans.size() == 0 || temp<ans){
                ans = temp;
                mn = shifJ;
            }
        }
        mp[v[i]] = mn;
    }

    for(int shifI=0;shifI<=n*2;shifI++){
        vector <string> v2;
        v2 = v;
        for(int i=0;i<n;i++){
            v2[(i+shifI)%n] = v[i];
        }
        int shifJ = mp[v2[0]];
        for(int i=0;i<n;i++){
            bool b = 0;
            for(int j=0;j<m;j++){
                if(v2[i][j] != v2[i][0]) b = 1;
            }
            if(b) {
                shifJ = mp[v2[i]];
                break;
            }
        }
        for(int i=0;i<n;i++){
            string temp = v[i];
            for(int j=0;j<m;j++){
                temp[(j+shifJ)%m] = v2[i][j];
            }
            v2[i] = temp;
        }
        if(ans.size() == 0 || v2<ans) ans = v2;
    }
    for(auto i : ans){
        cout<<i<<endl;
    }
}
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);      cout.tie(0);
    int t=1;
    // cin>>t;
    while(t--){
        solve();
    }
    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 332 KB Output is correct
2 Correct 4 ms 332 KB Output is correct
3 Correct 4 ms 332 KB Output is correct
4 Correct 4 ms 204 KB Output is correct
5 Correct 5 ms 460 KB Output is correct
6 Correct 5 ms 332 KB Output is correct
7 Correct 5 ms 332 KB Output is correct

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 332 KB Output is correct
2 Correct 4 ms 332 KB Output is correct
3 Correct 4 ms 332 KB Output is correct
4 Correct 4 ms 204 KB Output is correct
5 Correct 5 ms 460 KB Output is correct
6 Correct 5 ms 332 KB Output is correct
7 Correct 5 ms 332 KB Output is correct
8 Correct 724 ms 928 KB Output is correct
9 Correct 13 ms 332 KB Output is correct
10 Correct 10 ms 332 KB Output is correct
11 Correct 718 ms 740 KB Output is correct
12 Correct 723 ms 744 KB Output is correct
13 Correct 768 ms 772 KB Output is correct
14 Correct 752 ms 756 KB Output is correct
15 Correct 765 ms 816 KB Output is correct
16 Correct 754 ms 788 KB Output is correct
17 Correct 780 ms 752 KB Output is correct

Subtask #3
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 332 KB Output is correct
2 Correct 4 ms 332 KB Output is correct
3 Correct 4 ms 332 KB Output is correct
4 Correct 4 ms 204 KB Output is correct
5 Correct 5 ms 460 KB Output is correct
6 Correct 5 ms 332 KB Output is correct
7 Correct 5 ms 332 KB Output is correct
8 Correct 724 ms 928 KB Output is correct
9 Correct 13 ms 332 KB Output is correct
10 Correct 10 ms 332 KB Output is correct
11 Correct 718 ms 740 KB Output is correct
12 Correct 723 ms 744 KB Output is correct
13 Correct 768 ms 772 KB Output is correct
14 Correct 752 ms 756 KB Output is correct
15 Correct 765 ms 816 KB Output is correct
16 Correct 754 ms 788 KB Output is correct
17 Correct 780 ms 752 KB Output is correct
18 Execution timed out 3069 ms 2660 KB Time limit exceeded
19 Halted 0 ms 0 KB -