Archives
Trending
Support
Login
clear text
XML
Django
JavaScript
MATLAB
C
C++
C#
Python
SQL
Shell
Bash
Markdown
YAML
JSON
HTML
CSS
PHP
Java
Ruby
Go
Rust
Swift
Kotlin
Arduino
TypeScript
Perl
Autohotkey
Lua
SQF
R
Scala
Haskell
Groovy
Dart
Clojure
VB.NET
Objective-C
PowerShell
Bash
CoffeeScript
Verilog
#include <iostream> #include <vector> #include <queue> using namespace std; int main() { int L, W; cin >> L >> W; int N; cin >> N; int b; cin >> b; vector<pair<int, int> > v; for(int i = 0; i < b; i++) { int a, c; cin >> a >> c; v.push_back(make_pair(a, c)); } queue<vector<pair<int, int> > > q; q.push(v); int barokni = 0; while(!q.empty()) { vector<pair<int, int> > c = q.front(); q.pop(); barokni += c.size(); if(barokni >= N) { break; } for(int k = 0; k < 4; k++) { int ti = c[k].first + di[k]; int tj = c[k].second + dj[k]; } } return 0; } /* */
Mark as private (unlisted)
for 30 minutes
for 6 hours
for 1 day
for 1 week
for 1 month
for 1 year
everlasting (like CCCP)
