Submission #449900

# Submission time Handle Problem Language Result Execution time Memory
449900 2021-08-02T09:22:39 Z Khizri Tracks in the Snow (BOI13_tracks) C++17
2.1875 / 100
363 ms 15976 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<<1<<endl;
}
int main(){
	IOS;
	//cin>>t;
	while(t--){
		solve();
	}
	return 0;
}
# Verdict Execution time Memory Grader output
1 Incorrect 7 ms 2128 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 Incorrect 4 ms 2124 KB Output isn't correct
5 Incorrect 3 ms 1356 KB Output isn't correct
6 Incorrect 0 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 716 KB Output isn't correct
10 Incorrect 2 ms 1228 KB Output isn't correct
11 Incorrect 2 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 3 ms 1440 KB Output isn't correct
15 Incorrect 7 ms 2212 KB Output isn't correct
16 Incorrect 7 ms 2124 KB Output isn't correct
17 Incorrect 8 ms 2076 KB Output isn't correct
18 Incorrect 4 ms 2124 KB Output isn't correct
# Verdict Execution time Memory Grader output
1 Incorrect 10 ms 15180 KB Output isn't correct
2 Incorrect 32 ms 5100 KB Output isn't correct
3 Incorrect 327 ms 15896 KB Output isn't correct
4 Incorrect 71 ms 7756 KB Output isn't correct
5 Incorrect 147 ms 12060 KB Output isn't correct
6 Incorrect 296 ms 15968 KB Output isn't correct
7 Incorrect 7 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 7 ms 15692 KB Output isn't correct
12 Incorrect 1 ms 844 KB Output isn't correct
13 Incorrect 34 ms 5132 KB Output isn't correct
14 Incorrect 19 ms 3844 KB Output isn't correct
15 Incorrect 22 ms 4172 KB Output isn't correct
16 Incorrect 14 ms 1856 KB Output isn't correct
17 Incorrect 79 ms 8124 KB Output isn't correct
18 Incorrect 85 ms 8080 KB Output isn't correct
19 Incorrect 71 ms 7604 KB Output isn't correct
20 Incorrect 62 ms 7064 KB Output isn't correct
21 Incorrect 168 ms 12448 KB Output isn't correct
22 Incorrect 143 ms 12000 KB Output isn't correct
23 Incorrect 171 ms 10060 KB Output isn't correct
24 Incorrect 177 ms 12428 KB Output isn't correct
25 Incorrect 363 ms 15976 KB Output isn't correct
26 Correct 239 ms 14024 KB Output is correct
27 Incorrect 289 ms 15876 KB Output isn't correct
28 Incorrect 300 ms 15860 KB Output isn't correct
29 Incorrect 286 ms 15880 KB Output isn't correct
30 Incorrect 283 ms 15584 KB Output isn't correct
31 Incorrect 254 ms 12860 KB Output isn't correct
32 Incorrect 302 ms 15888 KB Output isn't correct