제출 #82577

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
82577		Leonardo_Paes	Usmjeri (COCI17_usmjeri)	C++11	28 / 140	638 ms	40604 KiB

usmjeri

#include <bits/stdc++.h>

using namespace std;

const int mod = 1e9 + 7;

typedef pair<int,int> pii;

#define MAXN 300100

int vet[MAXN], pre[MAXN];

int main(){

    int n, m;

    cin >> n >> m;

    // inutil pro caso 20%

    for(int i=1; i<n; i++){
        int a, b;
        cin >> a >> b;
    }

    vector<pii> v;

    for(int i=1; i<=m; i++){
        int x, y;

        cin >> x >> y;

        if(x>y)swap(x,y);

        vet[x]=y;
        pre[x]++;
        pre[y+1]--;
    }
    long long ans=1;
    for(int i=1; i<=n; i++){
        pre[i]+=pre[i-1];
        if(pre[i]==0){
            ans=(ans*2)%mod;
        }
    }

    int ini=0, fim=0;
    for(int i=1; i<=n; i++){
        if(i>=fim and fim!=0){
            v.push_back({ini,fim});
            ini=0;
            fim=0;
        }
        if(vet[i]!=0){
            if(ini==0){
                ini=i;
            }
            fim=vet[i];
        }
    }
    for(int i=0; i<v.size(); i++){
        ans = (ans*2)%mod;
    }
    cout << ans << endl;
}

컴파일 시 표준 에러 (stderr) 메시지

usmjeri.cpp: In function 'int main()':
usmjeri.cpp:61:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<v.size(); i++){
                  ~^~~~~~~~~

• Subtask 1: 14 / 14
• Subtask 2: 14 / 14
• Subtask 3: 0 / 14
• Subtask 4: 0 / 14
• Subtask 5: 0 / 14
• Subtask 6: 0 / 14
• Subtask 7: 0 / 14
• Subtask 8: 0 / 14
• Subtask 9: 0 / 14
• Subtask 10: 0 / 14