oj.uz

답안 #154372

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
154372 2019-09-21T12:03:39 Z PedroBigMan Usmjeri (COCI17_usmjeri) C++14
28 / 140
 204 ms 16264 KB 
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define REP(i,a,b) for(ll i=a; i<b; i++)
#define pb push_back
#define mp make_pair
#define pl pair<ll,ll>
#define ff first
#define ss second
#define INF ((ll) pow(2,63) -1)
#define si signed
ll insig;
#define In(vecBRO, LENBRO) REP(IBRO,0,LENBRO) {cin>>insig; vecBRO.pb(insig);}
void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}
ll mod = 1000000007;

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    ll N,M; cin>>N>>M; ll cur1,cur2; REP(i,0,N-1) {cin>>cur1>>cur2;}
    vector<pl> in; REP(i,0,M) {cin>>cur1>>cur2; cur1--; cur2--; in.pb(mp(min(cur1,cur2),max(cur1,cur2)));} 
    sort(in.begin(),in.end()); 
    vector<pl> fin; ll beg,end; beg=in[0].ff; end=in[0].ss;
    REP(i,0,M)
    {
        if(in[i].ff<end) 
        {
            end=max(end,in[i].ss);
            if(i==M-1) {fin.pb(mp(beg,end));}
        }
        else 
        {
            fin.pb(mp(beg,end));
            if(i<M-1) {beg=in[i+1].ff; end=in[i+1].ss;}
            else {break;}
        }
    }
    ll left=N-1;
    REP(i,0,fin.size())
    {
        left-=(fin[i].ss-fin[i].ff);
    }
    ll ans=1;
    REP(i,0,fin.size()+left) {ans*=2; ans%=mod;}
    cout<<ans<<endl;
    return 0;
}

Compilation message

usmjeri.cpp: In function 'void Out(std::vector<long long int>)':
usmjeri.cpp:10:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define REP(i,a,b) for(ll i=a; i<b; i++)
usmjeri.cpp:20:29:
 void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}
                             ~~~~~~~~~~~~
usmjeri.cpp:20:25: note: in expansion of macro 'REP'
 void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}
                         ^~~
usmjeri.cpp: In function 'int main()':
usmjeri.cpp:10:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define REP(i,a,b) for(ll i=a; i<b; i++)
usmjeri.cpp:46:9:
     REP(i,0,fin.size())
         ~~~~~~~~~~~~~~           
usmjeri.cpp:46:5: note: in expansion of macro 'REP'
     REP(i,0,fin.size())
     ^~~
usmjeri.cpp:10:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
 #define REP(i,a,b) for(ll i=a; i<b; i++)
usmjeri.cpp:51:9:
     REP(i,0,fin.size()+left) {ans*=2; ans%=mod;}
         ~~~~~~~~~~~~~~~~         
usmjeri.cpp:51:5: note: in expansion of macro 'REP'
     REP(i,0,fin.size()+left) {ans*=2; ans%=mod;}
     ^~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 77 ms 7528 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 157 ms 15540 KB Output is correct

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 632 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 632 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 183 ms 16096 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 183 ms 16052 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 181 ms 16100 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 204 ms 16264 KB Output isn't correct
2 Halted 0 ms 0 KB -