oj.uz

Submission #449902

# Submission time Handle Problem Language Result Execution time Memory
449902 2021-08-02T09:23:15 Z Khizri Tracks in the Snow (BOI13_tracks) C++17
5.52083 / 100
 338 ms 16048 KB 
#include <bits/stdc++.h>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll long long
#define pb push_back		 
#define F first																 
#define S second 															 
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
	if(a>b) swap(a,b);
	if(a==0) return a+b;
	return gcd(b%a,a);
}
ll lcm(ll a,ll b){
	return a/gcd(a,b)*b;
}
bool is_prime(ll n){
	ll k=sqrt(n);
	if(n==2) return true;
	if(n<2||n%2==0||k*k==n) return false;
	for(int i=3;i<=k;i+=2){
		if(n%i==0){
			return false;
		}
	}
	return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=4000+5;
int t=1,n,m,a,b;
char arr[mxn][mxn];
void solve(){
	cin>>n>>m;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			cin>>arr[i][j];
			if(arr[i][j]=='R'){
				a=1;
			}
			else if(arr[i][j]!='.'){
				b=1;
			}
		}
	}
	cout<<5<<endl;
}
int main(){
	IOS;
	//cin>>t;
	while(t--){
		solve();
	}
	return 0;
}

Subtask #1
3.33333333333 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 2124 KB Output isn't correct
2 Incorrect 0 ms 332 KB Output isn't correct
3 Incorrect 1 ms 460 KB Output isn't correct
4 Correct 7 ms 2124 KB Output is correct
5 Incorrect 3 ms 1356 KB Output isn't correct
6 Incorrect 1 ms 332 KB Output isn't correct
7 Incorrect 1 ms 460 KB Output isn't correct
8 Incorrect 1 ms 460 KB Output isn't correct
9 Incorrect 1 ms 588 KB Output isn't correct
10 Incorrect 3 ms 1228 KB Output isn't correct
11 Incorrect 1 ms 1100 KB Output isn't correct
12 Incorrect 3 ms 1356 KB Output isn't correct
13 Incorrect 3 ms 1356 KB Output isn't correct
14 Incorrect 2 ms 1356 KB Output isn't correct
15 Incorrect 7 ms 2252 KB Output isn't correct
16 Incorrect 7 ms 2124 KB Output isn't correct
17 Incorrect 6 ms 2124 KB Output isn't correct
18 Correct 4 ms 2124 KB Output is correct

Subtask #2
2.1875 / 70.0

# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 15180 KB Output isn't correct
2 Incorrect 33 ms 5092 KB Output isn't correct
3 Incorrect 288 ms 16008 KB Output isn't correct
4 Incorrect 70 ms 7616 KB Output isn't correct
5 Incorrect 146 ms 12052 KB Output isn't correct
6 Incorrect 330 ms 15908 KB Output isn't correct
7 Incorrect 8 ms 15948 KB Output isn't correct
8 Incorrect 7 ms 15180 KB Output isn't correct
9 Incorrect 2 ms 332 KB Output isn't correct
10 Incorrect 1 ms 332 KB Output isn't correct
11 Incorrect 8 ms 15564 KB Output isn't correct
12 Incorrect 1 ms 844 KB Output isn't correct
13 Incorrect 35 ms 5156 KB Output isn't correct
14 Incorrect 20 ms 3788 KB Output isn't correct
15 Incorrect 22 ms 4172 KB Output isn't correct
16 Incorrect 14 ms 1868 KB Output isn't correct
17 Incorrect 78 ms 8176 KB Output isn't correct
18 Incorrect 84 ms 8044 KB Output isn't correct
19 Incorrect 69 ms 7620 KB Output isn't correct
20 Incorrect 62 ms 7140 KB Output isn't correct
21 Incorrect 164 ms 12448 KB Output isn't correct
22 Incorrect 144 ms 11972 KB Output isn't correct
23 Incorrect 150 ms 10060 KB Output isn't correct
24 Incorrect 167 ms 12500 KB Output isn't correct
25 Incorrect 338 ms 15924 KB Output isn't correct
26 Incorrect 195 ms 14020 KB Output isn't correct
27 Correct 257 ms 15988 KB Output is correct
28 Incorrect 297 ms 16048 KB Output isn't correct
29 Incorrect 296 ms 15944 KB Output isn't correct
30 Incorrect 323 ms 15648 KB Output isn't correct
31 Incorrect 278 ms 12948 KB Output isn't correct
32 Incorrect 255 ms 15956 KB Output isn't correct