# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
661281 | 2022-11-25T07:45:03 Z | Kenpar | Crtanje (COCI20_crtanje) | C++17 | 1 ms | 356 KB |
#include "bits/stdc++.h" using namespace std; #define ll long long #define endl '\n' const ll MOD = 1e9+7; const ll INF = 1e16; const ll MAX = 2 * 1e5; void solve(){ int n; cin>>n; string s;cin>>s; vector<vector<char>> arr(n, vector<char>(n*3+1, '.')); int cur = n+1; for(int i = 0; i < n; i++){ if(s[i] == '='){ arr[i][cur] = '_'; }else if(s[i] == '+'){ arr[i][cur] = '/'; cur++; }else{ cur--; arr[i][cur] = '\\'; } } for(int i = n*3-1; i >= 0; i--){ string temp; bool check = false; for(int j = 0; j < n; j++){ temp += arr[j][i]; check = check || arr[j][i] != '.'; } if(check) cout<<temp<<endl; } } int main() { cin.tie(NULL); ios::sync_with_stdio(NULL); int t = 1; //cin>>t; int temp = t; while(t--){ //cout<<"Case #"<<temp - t<<" > "<<endl; solve(); cout<<endl; } cout.flush(); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 356 KB | Output is correct |
2 | Correct | 1 ms | 340 KB | Output is correct |
3 | Correct | 1 ms | 320 KB | Output is correct |
4 | Correct | 1 ms | 316 KB | Output is correct |
5 | Correct | 1 ms | 340 KB | Output is correct |