A game on a graph Alice and Bob play a game on a complete graph ${G}$ with $2014$ vertices. They take moves in turn with Alice beginning. At each move Alice directs one undirected edge of $G$. At each move Bob chooses a positive integer number $m,\: 1\leq   m \leq 1000$ and after that directs $m$ undirected edges of $G$. The game ends when all edges are directed. If there is some directed cycle in $G$ Alice wins. Determine whether Alice has a winning strategy.
This problem is from the Turkey JBMO TST 2014. Could someone help? I have not gone anywhere with it. Thanks a lot.

A sketch showing Alice can win.  Alice makes a directed chain, extending it by one step (or two if there is a stray edge she can use) at each turn.  When the chain has $n$ steps, Bob needs to have directed a total of $\frac 12(n)(n-1)$ edges or Alice can win the next time.  We therefore need $\frac 12(n)(n-1) \gt 1000n$, which happens at $n=2001$, so Alice can win by the $2004$th turn  
Added:  When Alice's chain is 2 edges long, there is only one edge that can complete a cycle.  Bob has to orient that one the wrong way to prevent Alice winning on the next move.  When her chain is $n=4$ edges long, there are $\frac 12(4-1)(4-2)=6$ edges that could win- three from the head end of the chain, to from the next point down, and one from the next to bottom, so Bob has to orient all $6$ of these by his third turn.  As Alice's chain gets longer, the number of edges Bob has to orient grows quadratically.  The number of edges Bob can orient only grows linearly, so eventually (unless she runs out of points) she will win.
