Comments (1)
n이 1이상이고, 모든 deliveries, pickups 값이 0인 경우, while문을 빠져나오지 못해 시간초과가 나는 것 같습니다.
if(i==0 && deliveries[i]==0 && pickups[i]==0) return answer;
if(pick==0 && deliver==0) break;
나머지 코드는 잘 구현하신 것 같아요 ^^
from ps.
Related Issues (9)
- programmers - 석유시추 HOT 1
- boj - 탈출 3055 HOT 4
- programmers - 프로세스 HOT 6
- boj - N과 M(4) HOT 4
- programmers - 예상 대진표 HOT 1
- boj - 게임 1072 HOT 4
- 백준 관련 크롬 확장 프로그램 추천 HOT 2
- boj - 농장 관리 HOT 3
Recommend Projects
-
React
A declarative, efficient, and flexible JavaScript library for building user interfaces.
-
Vue.js
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
-
Typescript
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
-
TensorFlow
An Open Source Machine Learning Framework for Everyone
-
Django
The Web framework for perfectionists with deadlines.
-
Laravel
A PHP framework for web artisans
-
D3
Bring data to life with SVG, Canvas and HTML. 📊📈🎉
-
Recommend Topics
-
javascript
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
-
web
Some thing interesting about web. New door for the world.
-
server
A server is a program made to process requests and deliver data to clients.
-
Machine learning
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
-
Visualization
Some thing interesting about visualization, use data art
-
Game
Some thing interesting about game, make everyone happy.
Recommend Org
-
Facebook
We are working to build community through open source technology. NB: members must have two-factor auth.
-
Microsoft
Open source projects and samples from Microsoft.
-
Google
Google ❤️ Open Source for everyone.
-
Alibaba
Alibaba Open Source for everyone
-
D3
Data-Driven Documents codes.
-
Tencent
China tencent open source team.
from ps.