Submission #98186

# Submission time Handle Problem Language Result Execution time Memory
98186 2019-02-21T10:23:30 Z easrui 복사 붙여넣기 2 (JOI15_copypaste2) C++14
10 / 100
9 ms 512 KB
#include <bits/stdc++.h>
using namespace std;

int K,M,N;
char S[2010],T[2010];
int main()
{
    cin >> K >> M >> S >> N;
    for(int i=0; i<N; i++){
        int A,B,C;
        cin >> A >> B >> C;
        for(int j=A; j<B; j++) T[j-A] = S[j];
        for(int j=M-B+A-1; j>=C; j--){
            S[j+B-A] = S[j];
        }
        for(int j=C; j<min(M,C+B-A); j++) S[j] = T[j-C];
    }
    for(int i=0; i<K; i++) cout << S[i];
}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 7 ms 384 KB Output is correct
3 Correct 9 ms 384 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 9 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 7 ms 384 KB Output is correct
8 Correct 9 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 7 ms 384 KB Output is correct
3 Correct 9 ms 384 KB Output is correct
4 Correct 6 ms 384 KB Output is correct
5 Correct 9 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 7 ms 384 KB Output is correct
8 Correct 9 ms 384 KB Output is correct
9 Runtime error 3 ms 512 KB Execution killed with signal 11 (could be triggered by violating memory limits)
10 Halted 0 ms 0 KB -