Where is PCP(1,1) located?
$PCP\left(O(1),O(1)\right)=P$.

Suppose you are allowed to toss at most $r$ coins, and that the proof length is bounded by $l\in\mathbb{N}$. Given input $x$, you can compute the acceptance probability of the verifier relative to any proof in $\{0,1\}^{\le l}$. To do this, for every proof $\pi\in\{0,1\}^{\le l}$ and every possible outcome of the random coins $w\in\{0,1\}^r$, simulate $V^{\pi}(x,w)$ and count the number of $w$'s who caused $V^\pi$ to accept. Note that this requires only polynomial time in $|x|$. Now, accept $x$ iff during this process you have found a proof $\pi$ which causes $V$ to accept $x$ with probability $1$.

Note that the constant bound on the proof length does not immediately follow from the definition (in the above you only have a constant bound on the number of queries), but follows from the fact that if $L\in PCP(r(n),q(n))$, then $L$ has proofs of length $\le 2^{r(n)}q(n)$. See this question for details.