oj.uz

Submission #536688

# Submission time Handle Problem Language Result Execution time Memory
536688 2022-03-13T21:10:45 Z ali22413836 Jetpack (COCI16_jetpack) C++14
80 / 80
 28 ms 7104 KB 
#include <bits/stdc++.h>
#define  endl "\n"
using namespace std ;
typedef long long ll;
typedef long double ld ;
const int N=2e7;
const ll inf=1e18 ;
const ll mod = 1e9 + 7 ;
ll mypower(ll x, ll y){
    if(y == 0) return 1 ;
    if(y == 1) return x ;
    ll ret = mypower(x , y / 2);
    ret = (ret * ret) % mod;
    if(y % 2) ret = ( ret * x ) % mod ;
    return ret ;
}
ll n ;
char a[20][100009] ;
vector < ll > ans ;
ll la ;
bool sol(ll i , ll j){
    if(a[i][j] == 'X'){
        return 0 ;
    }
    a[i][j] = 'X' ;
    if(j == n){
        return 1 ;
    }
    if(sol(max(i - 1 , 1ll) , j + 1)){
        ans.push_back(j - 1) ;
        return 1 ;
    }
    if(sol(min(i + 1 , 10ll) , j + 1)){
        return 1 ;
    }
    return 0 ;
}
int main(){
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n ;
    for(int j = 1 ; j <= 10 ; j++){
        for(int i = 1 ; i <= n ; i++){
            cin >> a[j][i] ;
        }
    }
    sol(10 , 1) ;
    cout << ans.size() << endl ;
    reverse(ans.begin() , ans.end()) ;
    for(auto p : ans){
        cout << p << " " << 1 << endl ;
    }
//    for(int i = 0 ; i < 10 ;i++){
//        for(int j = 0 ; j< n ;j++){
//            cout << a[i][j] ;
//        }
//        cout << endl ;
//    }
//    cout << a[9][0] << endl ;
    return 0 ;
}

Subtask #1
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 2 ms 728 KB Output is correct
6 Correct 3 ms 980 KB Output is correct
7 Correct 8 ms 2004 KB Output is correct
8 Correct 18 ms 4312 KB Output is correct
9 Correct 19 ms 6104 KB Output is correct
10 Correct 28 ms 7104 KB Output is correct