# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
83952 | nikolapesic2802 | Clickbait (COCI18_clickbait) | C++14 | 52 ms | 41212 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
const int N=1005;
vector<vector<pair<int,int> > > pipes(N*N);
int n,m;
vector<string> mat;
vector<vector<pair<int,pair<int,int> > > > container(N,vector<pair<int,pair<int,int> > >(N));
vector<vector<int> > pipe(N,vector<int>(N));
bool inside(int x,int y)
{
return x>=0&&x<n&&y>=0&&y<m;
}
void find_containers()
{
for(int i=0;i<n;i++)
{
for(int j=0;j<m;j++)
{
if(mat[i][j]=='+')
{
int x=i,y=j;
int rx,ry;
y++;
while(inside(x,y)&&mat[x][y]=='-')
y++;
if(!inside(x,y)||mat[x][y]!='+')
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |